Efficient and exact reliability evaluation for networks with imperfect vertices

IEEE Transactions on Reliability

Volumn 56, Issue 2, 2007, Pages 288-300

  Kuo, Sy Yen ^a,b   Yeh, Fu Min ^a,c   Lin, Hung Yau ^a,d  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^c Gemtek Technology Company Ltd   (Taiwan)

^d Advantech Co Ltd   (Taiwan)

Author keywords

BDD (Binary Decision Diagrams); Boolean formula; Exact algorithm; Network reliability

Indexed keywords

ALGORITHMS; BINARY DECISION DIAGRAMS; BOOLEAN ALGEBRA; PERSONAL COMPUTERS; RELIABILITY; TELECOMMUNICATION LINKS;

EXACT ALGORTIHM; NETWORK RELIABILITY; VERTEX;

COMPUTER NETWORKS;

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

References (36)

1. R. E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Trans. Computers, vol. 35, no. 8, pp. 677-691, Aug. 1986.
2. R. E. Barlow and F. Proschan, Mathematical Theory of Reliability. : J. Wiley & Sons, 1965, (Reprinted 1996).
3. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. : W. H. Freeman, 1979.
4. M. O. Ball, "Computational complexity of network reliability analysis an overview," IEEE Trans. Reliability, vol. 35, no. 3, pp. 230-239, Aug. 1986.
5. F. Moskowitz, "The analysis of redundancy networks," AIEE Trans. Communications and Electronics, vol. 39, pp. 627-632, 1958.
6. P. A. Jensen and M. Bellmore, "An algorithm to determine the reliability of a complex system," IEEE Trans. Reliability, vol. 18, no. 4, pp. 169-174, Nov. 1969.
7. L. Fratta and U. G. Montanari, "A Boolean algebra method for computing the terminal reliability in a communication network," IEEE Trans. Circuit Theory, vol. 20, no. 3, pp. 203-211, May 1973.
8. L. Fratta and U. G. Montanari, "A recursive method based on case analysis for computing network terminal reliability," IEEE Trans. Communications, vol. 26, no. 8, pp. 1166-1177, Aug. 1978.
9. M. Resende, "A program for reliability evaluation of undirected networks via polygon-to-chain reductions," IEEE Trans. Reliability vol. 35, no. 1, pp. 24-29, Apr. 1986.
10. A. Satyanarayana and M. K. Chang, "Network reliability and the factoring theorem," Networks, vol. 13, pp. 107-120, 1983.
11. A. Satyanarayana and R. K. Wood, "A linear-time algorithm for computing K-terminal reliability in series-parallel networks," SIAM J. Computing, pp. 818-832, 1985.
12. L. Resende, "Implementation of a factoring algorithm for reliability evaluation of undirected networks," IEEE Trans. Reliability, vol. 37, no. 5, pp. 462-468, Dec. 1988.
13. L. B. Page and J. E. Perry, "Reliability of directed networks using the factoring theorem," IEEE Trans. Reliability, vol. 38, no. 5, pp. 556-562, Dec. 1989.
14. O. R. Theologou and J. G. Carlier, "Factoring & reductions for networks with imperfect vertices," IEEE Trans. Reliability, vol. 40, no. 2, pp. 210-217, Aug 1991.
15. J. A. Buzacott, "The ordering of terms in cut-based recursive disjoint products," IEEE Trans. Reliability, vol. 32, no. 5, pp. 472-474, Dec. 1983.
16. K. D. Heidtmann, "Smaller sums of disjoint products by subproduct inversion," IEEE Trans. Reliability, vol. 38, no. 3, pp. 305-311, Aug. 1989.
17. J. M. Wilson, "An improved minimizing algorithm for sum of disjoint products," IEEE Trans. Reliability, vol. 39, no. 1, pp. 42-45, Apr. 1990.
18. S. Soh and S. Rai, "Experimental results on preprocessing of path/cut terms in sum of disjoint products technique," IEEE Trans. Reliability, vol. 42, no. 1, pp. 24-33, Mar. 1993.
19. K. K. Aggarwal, Y. C. Chopra, and J. S. Bajwa, "Modification of cutsets for reliability evaluation of communication systems," Microelectronics and Reliability, vol. 22, no. 3, pp. 337-340, 1982.
20. Y. G. Chen and M. C. Yuang, "A cut-based method for terminal-pair reliability," IEEE Trans. Reliability, vol. 45, no. 3, pp. 413-416, Sep. 1996.
21. K. K. Aggarwal, J. S. Gupta, and K. B. Misra, "A simple method for evaluation of a communication system," IEEE Trans. Communications vol. 23, pp. 563-566, May 1975.
22. W. J. Ke and S. D. Wang, "Reliability evaluation for distributed computing networks with imperfect nodes," IEEE Trans. Reliability vol. 46, no. 3, pp. 342-349, Sep. 1997.
23. D. Torrieri, "Calculation of node-pair reliability in large networks with unreliable nodes," IEEE Trans. Reliability, vol. 43, no. 3, pp. 375-377, Sep. 1994.
24. Y. Chen, A. Q. Hu, K. W. Yip, X. Hu, and Z. G. Zhong, "A modified combined method for computing terminal-pair reliability in networks with unreliable nodes," in Proceedings of the 2nd Int'l Conference on Machine Learning and Cybernetics, Nov. 2003, pp. 2426-2429.
25. V. A. Netes and B. P. Filin, "Consideration of node failures in network-reliability calculation," IEEE Trans. Reliability, vol. 45, no. 1, pp. 127-128, Mar. 1996.
26. F.-M. Yeh and S.-Y. Kuo, "OBDD-based network reliability calculation," Electronics Letters, vol. 33, no. 9, pp. 759-760, Apr. 1997.
27. S. Y. Kuo, S. K. Lu, and F. M. Yeh, "Determining terminal-pair network reliability based on edge expansion diagrams using OBDD," IEEE Trans. Reliability, vol. 48, no. 3, pp. 234-246, Sep. 1999.
28. F. M. Yeh, S. K. Lu, and S. Y. Kuo, "OBDD-based evaluation of K-terminal network reliability," IEEE Trans. Reliability, vol. 51, no. 4, pp. 443-451, Dec. 2002.
29. F. M. Yeh, H. Y. Lin, and S. Y. Kuo, "Analyzing network reliability with imperfect nodes using OBDD," in Proceedings of the 2002 Pacific Rim Int'l Symposium on Dependable Computing (PRDC 2002), 2002, pp. 89-96.
30. H.-Y. Lin, S.-Y. Kuo, and F.-M. Yeh, "Minimal cutset enumeration and network reliability evaluation by recursive merge and BDD," in Proceedings of the 8th IEEE Int'l Symposium on Computers and Communication (ISCC 2003), 2003, pp. 1341-1346.
31. K. S. Brace, R. L. Rudell, and R. E. Bryant, "Efficient implementation of an OBDD package," in Proceedings of the 27th Design Automation Conference, Jun 1990, pp. 40-45.
32. W. S. Jung, S. H. Han, and J. Ha, "A fast BDD algorithm for large coherent fault trees analysis," Reliability Engineering & System Safety, vol. 83, no. 3, pp. 369-374, Mar. 2004.
33. S. I. Minato, N. Ishiura, and S. Yajima, "Shared binary decision diagrams with attributed edges for efficient Boolean function manipulation," in Proceedings of the 27th Design Automation Conference, Jun. 1990, pp. 52-57.
34. S. J. Friedman and K. J. Supowit, "Finding optimal variable ordering for binary decision diagrams," IEEE Trans. Computers, vol. 39, no. 5, pp. 710-713, May 1990.
35. B. Bollig and I. Wegener, "Improving the variable ordering of OBDDs is NP-complete," IEEE Trans. Computers, vol. 45, no. 9, pp. 993-1002, Sep. 1996.
36. The BDD Library [Online]. Available: http://www-2.cs.cmu.edu/afs/cs/ project/modck/pub/www/bdd.html