Abstract
This paper describes a new algorithm based on the Binary Decision Diagrams (BDDs) to solve the reliable communication network design problem (RCND). In this NP-hard problem, a subset of communication links must be chosen such that the network cost is minimized given a network reliability constraint. This problem is closely related to the network reliability computation problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bryant, R.: Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Computing Surveys 24(3), 293–318 (1992)
Akers, B.: Binary Decision Diagrams. IEEE Trans. On Computers C-27, 509–516 (1978)
Boorstyn, R., Frank, H.: Large-scale network topological optimization. IEEE Trans. on Reliability 25, 29–37 (1977)
Garey, M., Johnson, D.: Computers and Intractibility: A guide to the Theory of NP-Completness. W. H. Freeman and Company, San Francisco (1979)
Ying, L.: Analysis method of survivability of probabilistic networks. Military Communication Technology Magazine 48 (1993)
Dengiz, B., Altiparmak, F., Smith, A.: Local search genetic algorithm for optimal design of reliable networks. IEEE Trans. on Evolutionary Computation 1(3), 179–188 (1997)
Cheng, S.-T.: Topological optimization of reliable communication network. IEEE Trans. on Reliability 47(3), 225–233 (1998)
Hardy, G., Lucet, C., Limnios, N.: Computing all-terminal reliability of stochastic networks with Binary Decision Diagrams. In: Proc. 11th International Symposium on Applied Stochastic Models and Data Analysis (May 2005)
Jan, R.-H., Hwang, F.-J., Chen, S.-T.: Topological optimization of a communication network subject to a reliability constraint. IEEE Trans. on Reliability 42, 63–70 (1993)
Aggarwal, K., Chopra, Y., Bajwa, J.: Topological layout of links for optimising the overall reliability in a computer system. Microelectronics and Reliability 22, 347–351 (1982)
Venetsanopoulos, A., Singh, I.: Topological optimization of communication networks subject to reliability constraints. Problem of Control and Information Theory 15, 63–78 (1986)
Bryant, R.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. on Computers C-35(8), 677–691 (1986)
Akers, S.: Binary Decision Diagrams. IEEE Trans. on Computers C-27(6), 509–516 (1978)
Birnbaum, Z.: On the importance of different components in a multicomponent system. In: Krishnaiah, P.R. (ed.) Multivariate Analysis-II, pp. 581–592. Academic Press, New York (1998)
Bodlaender, H., Thilikos, D.: Computing small search numbers in linear time. Technical Report Technical Report No. UU-CS-1998-05, Dept. of Computer Science (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hardy, G., Lucet, C., Limnios, N. (2006). A BDD-Based Heuristic Algorithm for Design of Reliable Networks with Minimal Cost. In: Cao, J., Stojmenovic, I., Jia, X., Das, S.K. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2006. Lecture Notes in Computer Science, vol 4325. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11943952_21
Download citation
DOI: https://doi.org/10.1007/11943952_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49932-9
Online ISBN: 978-3-540-49933-6
eBook Packages: Computer ScienceComputer Science (R0)