Abstract
The reliability of networks is defined as the probability that a system will perform its intended function without failure over a given period of time. Computing the reliability of networks is an NP-hard problem, which need efficient techniques to be evaluated. This paper presents a network reliability evaluation algorithm using Binary Decision Diagrams (BDD). The solution considers the 2-terminal reliability measure and proceeds first by enumerating the minimal paths set from which a BDD is generated. The algorithm has been implemented in Java and MatLab and experienced using a real radio telecommunication network. The results of such application have testified that the program didn’t need large memory size and big time requirement.
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
Abraham, J.A.: An Improved Algorithm for Network Reliability. IEEE Transaction on Reliability, 58–61 (1979)
Akers, S.B.: Binary Decision Diagrams. IEEE Transactions on Computers C-27, 509–516 (1978)
Andersen, H.R.: An Introduction to Binary Decision Diagrams, Lecture Notes. IT University of Copenhagen (1999)
Bollig, B., Ingo, W.: Improving the Variable Ordering of OBDDs Is NP-Complete. IEEE Transactions on Computers 45, 993–1002 (1996)
Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers C-35, 677–691 (1986)
Bryant, R.E.: Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams. ACM Computing Surveys 24, 293–318 (1992)
Dotson, W.P., Gobien, J.O.: A new analysis technique for probabilistic graphs. IEEE Trans. Circuits and Systems Cas-26(10), 855–865 (1979)
Hardy, G., Lucet, C., Limnios, N.: K-Terminal Network Reliability Measures With Binary Decision Diagrams. IEEE Trans. on Reliability 56(3), 506–515 (2007)
Heidtmann, K.D.: Smaller Sums of Disjoint Products by Subproduct Inversion. IEEE Transaction on Reliability 38, 305–311 (1991)
Institute of Electrical and Electronics Engineers, IEEE Standard Computer Dictionary: A Compilation of IEEE Standard Computer Glossaries, New York, NY (1990)
Jasmon, G.B., Kai, O.S.: A New Technique in Minimal Path and Cutset Evaluation. Reprinted from IEEE Transactions on Reliability R-34, 136–143 (1985)
Lee, C.Y.: Representation of Switching Circuits by Binary-Decision Programs. Bell Systems Technical Journal 38, 985–999 (1959)
Lin, H.Y., Kuo, S.Y., Yeh, F.M.: Minimal cutset enumeration and network reliability evaluation by recursive merge and BDD. In: Proceedings of the Eighth IEEE International Symposium on Computers and Communication, pp. 1341–1346 (2003)
Liu, H.H., Yang, W.T., Liu, C.C.: An improved minimizing algorithm for the summation of disjoint products by Shannon’s expansion. Microelectronic Reliability 33, 599–613 (1993)
Locks, M.O., Wilson, J.M.: Note on disjoint products algorithms. IEEE Transactions on Reliability 41, 81–84 (1992)
Coudert, O., Madre, J.C.: Implicit and incremental computation of primes and essential primes of Boolean functions. In: Proc. of the 29th ACM/IEEE Design Automation Conference, pp. 36–39. IEEE Computer Society Press (1992)
Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Proceedings of the IEEE/ACM Conference on Computer-Aided Design, pp. 42–47 (1993)
Shier, D.R., Whited, D.E.: Algorithms for generating minimal cutsets by inversion. IEEE Transaction on Reliability R-34, 314–319 (1985)
Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal of Computing 1, 146–160 (1972)
Theolougou, R., Carlier, J.G.: Factoring & Reduction for networks with imperfect vertices. IEEE Transaction on Reliability 40, 210–217 (1991)
Valian, L.G.: The Complexity of enumerating and reliability problems. SIAM Journal of Computing 8, 410–421 (1979)
Wood, R.K.: Factoring algorithms for computing K-terminal network reliability. IEEE Transaction on Reliability R-35, 269–278 (1986)
Fishman, G.S.: A Comparison of four Monte Carlo methods for estimating the probability of s-t connectedness. IEEE Transaction on Reliability R-35, 145–154 (1986)
Rauzy, A.: New Algorithms for fault tree analysis. Reliability Eng. and Systems Safety 40, 203–210 (1993)
Ait-kadi, D., Rebaiaia, M.L., Merlano, A.: Modèle d’évaluation des performances du réseau national intégré de radiocommunications (RENIR). Laval University, RP, Canada (2009)
Yan, L., Taha, H., Landers, L.L.: A recursive Approach for Enumerating Minimal Cutsets in a Network. IEEE Transactions on Reliability 43, 383–388 (1994)
Hariri, S., Raghavendra: SYREL- A symbolic reliability algorithm based on path and cutest methods. IEEE Transactions on Reliability C-36, 1224–1232 (1987)
Ulmeanu, A.P.: Analytical Method to Determine Uncertainty Propagation in Fault Trees by Means of Binary Decision Diagrams. IEEE Transactions on Reliability 61(1), 84–94 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rebaiaia, ML., Ait-Kadi, D., Page, D. (2012). A Practical Method for Evaluating the Reliability of Telecommunication Network. In: Benlamri, R. (eds) Networked Digital Technologies. NDT 2012. Communications in Computer and Information Science, vol 293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30507-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-30507-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30506-1
Online ISBN: 978-3-642-30507-8
eBook Packages: Computer ScienceComputer Science (R0)