K-terminal network reliability measures wth binary decision diagrams

IEEE Transactions on Reliability

Volumn 56, Issue 3, 2007, Pages 506-515

  Hardy, Gary ^a   Lucet, Corinne ^a   Limnios, Nikolaos ^b  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

^b UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

Binary decision diagram; Network reliability computation

Indexed keywords

ALGORITHMS; BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; COMPUTER NETWORKS; FAILURE ANALYSIS; SET THEORY; TELECOMMUNICATION NETWORKS;

NETWORK DECOMPOSITION METHOD; NETWORK LINK; NETWORK RELIABILITY;

RELIABILITY ANALYSIS;

EID: 34548614781     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/TR.2007.898572     Document Type: Article

References (29)

1. Institute of Electrical and Electronics Engineers, "IEEE Standard Computer Dictionary: A Compilation of IEEE Standard Computer Glossaries," New York, NY, 1990.
2. B. Akers, "Binary decision diagrams," IEEE Trans. Computers, vol. C-27, pp. 509-516, Jun. 1978.
3. R. E. Bryant, "Symbolic Boolean manipulation with ordered binary-decision diagrams," ACM Computing Surveys, vol. 24, no. 3, pp. 293-318, 1992.
4. M. O. Ball, "Complexity of network reliability computations," Networks, vol. 10, pp. 153-165, 1980.
5. M. O. Ball, "Computational complexity of network reliability analysis: An overview," IEEE Trans. Reliability, vol. R-35, no. 3, pp. 230-239, Aug. 1986.
6. H. Andersen, "An introduction to binary decision diagrams," Oct. 1997, Lecture Notes for 49285 Advanced Algorithm E97.
7. A. Rauzy, "New algorithms for fault tolerant trees analysis," Reliability Engineering and System Safety, vol. 5, no. 59, pp. 203-211, 1993.
8. O. Coudert and J. C. Madre, "Implicit and incremental computation of primes and essential primes of Boolean functions," in Proc. of the 29th ACM/IEEE Design Automation Conference, 1992, pp. 36-39, IEEE Computer Society Press.
9. O. Coudert and J. C. Madre, "A new method to compute prime and essential prime implicants of Boolean functions," in Proc. of MIT VLSI Conference, March 1992.
10. S. J. Friedman and K. J. Supowit, "Finding an optimal variable ordering for binary decision diagrams," IEEE Trans. Computers, vol. C-39, no. 5, pp. 710-713, 1990.
11. J. S. Provan, "The complexity of reliability computations on planar and acyclic graphs," SIAM J. Computing, vol. 15, no. 3, pp. 694-702, 1986.
12. G. Hardy, C. Lucet, and N. Limnios, "Computing all-terminal reliability of stochastic networks with binary decision diagrams," Proc. 11th International Symposium on Applied Stochastic Models and Data Analysis May 2005.
13. H. Imai, K. Sekine, and K. Imai, "Computational investigations of all-terminal network reliability via BDDs," IEICE Transactions on Fundamentals, vol. E82-A, no. 5, pp. 714-721, May 1999.
14. S. H. Ahmad, "Simple enumeration of minimal cutsets of acyclic directed graph," IEEE Trans. Reliability, vol. R-27, no. 5, pp. 484-487, Dec. 1988.
15. M. O. Locks, "A minimizing algorithm for sum of disjoint products," IEEE Trans. Reliability, vol. R-36, no. 4, pp. 436-445, Oct. 1987.
16. S. Hariri and C. S. Raghavendra, "SYREL: A symbolic reliability algorithm based on path and cutset methods," IEEE Trans. Computers vol. C-36, no. 10, pp. 1224-1232, Oct. 1987.
17. R. K. Wood, "A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability," Networks, vol. 15, pp. 173-190, 1985.
18. A. Satyanarayana and M. K. Chang, "Network reliability and the factoring theorem," Networks, vol. 13, pp. 107-120, 1983.
19. O. Theologou and J. Carlier, "Factoring and reductions for networks with imperfect vertices," IEEE Trans. Reliability, vol. R-40, pp. 210-217, 1991.
20. J. Carlier and C. Lucet, "A decomposition algorithm for network reliability evaluation," Discrete Applied Mathematics, vol. 65, pp. 141-156, 1996.
21. F.-M. Yeh, S.-K. Lu, and S.-Y. Kuo, "OBDD-based evaluation of k-terminal network reliability," IEEE Trans. Reliability, vol. R-51, no. 4, 2002.
22. S. J. Friedman and K. J. Supowit, "Finding the optimal variable ordering for binary decision diagrams," in Proc. 24th ACM/IEEE Conference on Design Automation, 1987, pp. 348-356.
23. M. S. Choi and C. H. Jun, "Some variant of polygon-to-chain reductions in evaluating reliability of undirected network," Microelectron. Reliab., vol. 35, no. 1, pp. 1-11, 1995.
24. J. P. Gadani, "System effectiveness evaluation using star and delta transformations," IEEE Trans. Reliability, vol. R-30, no. 1, pp. 43-47.
25. X. Zang, H. Sun, and K. Trivedi, "A BDD-based algorithm for reliability evaluation of phased mission systems," IEEE Trans. Reliability, vol. R-48, no. 1, pp. 50-60, 1999.
26. K. Odeh, "New Algorithms for Probabilistic and Logic Analysis of Fault Trees," (in in French) PhD-thesis, Université de Technologie de Compiègne, French, 1995.
27. C. Lucet and J.-F. Manouvrier, "Exact methods to compute network reliability," in Statistical and Probabilistic Models in Reliability D. C. Ionescu and N. Limnios, Eds. Birkhauser Boston:, 1999, pp. 279-294.
28. H. Bodlaender and D. Thilikos, Computing Small Search Numbers in Linear Time Dept. of Computer Science, Utrecht University, Technical Report No. UU-CS-1998-05, 1998.
29. A. Rauzy, "A new methodology to handle Boolean models with loops," IEEE Trans. Reliability, vol. R-52, no. 1, pp. 96-105, 2003.