Analyzing network reliability with imperfect nodes using OBDD

Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC

Volumn 2002-January, Issue , 2002, Pages 89-96

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

^a CHUNG SHAN INSTITUTE OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Boolean functions; Computer networks; Councils; Data structures; Equations; Failure analysis; Merging; NP hard problem; Partitioning algorithms; Production

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; DATA STRUCTURES; FAILURE ANALYSIS; MERGING; PRODUCTION;

COUNCILS; DISJOINT PATHS; EDGE EXPANSION; EQUATIONS; IMPERFECT NODES; LARGE NETWORKS; NETWORK RELIABILITY; PARTITIONING ALGORITHMS;

ALGORITHMS;

EID: 34250374584     PISSN: 15410110     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PRDC.2002.1185623     Document Type: Conference Paper

References (16)

1. M. O. Ball, "Computational complexity of network reliability analysis: an overview, " IEEE Trans. Reliability, 35(3):230-239, Aug 1986
2. K. K. Aggarwal, J. S. Gupta, and K. B. Misra, "A simple method for evaluation of a communication system, " IEEE Trans. Communications, 23:563-566, May 1975
3. O. R. Theologou and J. G. Carlier, "Factoring & reductions for networks with imperfect vertices, " IEEE Trans. Reliability, 40(2):210-217, Aug 1991
4. D. Torrer, "Calculation of node-pair reliability in large networks with unreliable nodes, " IEEE Trans. Reliability, 43(3):375-377, Sep 1994
5. L. Fratta and U. G. Montanari, "A recursive method based on case analysis for computing network terminal reliability, " IEEE Trans. Communications, 27:1166-1177, Aug. 1978
6. W. P. Dotson, and J. O. Gobien, "A new analysis technique for probability graphs, " IEEE, Trans. Circuit & System, 26:855-865, Oct 1979
7. S. Rai, A. Kumar, and E. V. Prasad, "Computing terminal reliability of computer network", Reliability Engineering, 16:109-119, 1986
8. L. B. Page and J. E. Perry, "Reliability of directed networks using the factoring theorem, " IEEE Trans. Reliability, 38:556-562, Dec 1989
9. V. A. Netes and B. P. Fillin, "Consideration of node failures in network-reliability calculation, " IEEE Trans. Reliability, 45:127-128, Mar 1996
10. 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, 48(3):234-246, Sep 1999
11. F. M. Yeh, S. K. Lu and S. Y. Kuo, "OBDD-based Evaluation of K-terminal Network Reliability, " IEEE Trans. Reliability (accepted for publication)
12. R. E. Bryant, "Graph-based algorithms for Boolean function manipulation, " IEEE Trans. Computers, 35(8):677-691, Aug 1986
13. S. J. Friedman and K. J. Supowit, "Finding optimal variable ordering for binary decision diagrams, " IEEE Trans. Computers, 39(5):710-713, May 1990
14. K. S. Brace, R. L. Rudell, and R. E. Bryant, "Efficient implementation of an OBDD package, " Proceedings of 27th Design Automation Conf., pp. 40-45, Jun 1990
15. S.-I. Minato, N. Ishiura, and S. Yajima, "Shared Binary Decision Diagrams with Attribute Edges for Efficient Boolean Function Manipulation, " Proceedings of 27th Design Automation Conf., pp. 52-57, Jun 1990
16. F. M. Yeh and S. Y. Kuo, "OBDD-based network reliability calculation, " IEEE Electronics Letters, 33(9):759-760, Sep 1997