Fast algorithm for computing the reliability of a communication network

This paper presents a fast algorithm for computing the reliability of a communication network when each link has the same probability of success. The computational complexity of existing algorithms increases exponentially as the number of links increases. Our algorithm is based on combinatorics and we conclude, for the case when links have the same survival probabilities, that the computational complexity grows subexponentially as the number of links increases. Furthermore, the algorithm is mostly algebraic in nature.

[1]  K. Grace,et al.  Probabilistic Reliability: An Engineering Approach , 1968 .

[2]  Edward M. Reingold,et al.  Efficient generation of the binary reflected gray code and its applications , 1976, CACM.

[3]  B. J. Leon,et al.  A New Algorithm for Symbolic System Reliability Analysis , 1976, IEEE Transactions on Reliability.

[4]  Hiromitsu Kumamoto,et al.  Efficient Evaluation of System Reliability by Monte Carlo Method , 1977, IEEE Transactions on Reliability.

[5]  A. Satyanarayana,et al.  New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks , 1978 .

[6]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[7]  Frank A. Tillman,et al.  System-Reliability Evaluation Techniques for Complex/Large SystemsߞA Review , 1981, IEEE Transactions on Reliability.

[8]  M. O. Locks.  Recursive Disjoint Products: A Review of Three Algorithms , 1982, IEEE Transactions on Reliability.

[9]  R.G. Bennetts.  Analysis of Reliability Block Diagrams by Boolean Techniques , 1982, IEEE Transactions on Reliability.

[10]  A. Satyanarayana,et al.  A Unified Formula for Analysis of Some Network Reliability Problems , 1982, IEEE Transactions on Reliability.

[11]  Roy Billinton,et al.  Reliability Evaluation of Engineering Systems , 1983 .

[12]  John A. Silvester,et al.  Performance Analysis of Networks with Unreliable Components , 1984, IEEE Trans. Commun..

[13]  J. Scott Provan,et al.  Computing Network Reliability in Time Polynomial in the Number of Cuts , 1984, Oper. Res..

[14]  John E. Hershey,et al.  Data Transportation and Protection , 1986 .

[15]  Salim Hariri,et al.  SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods , 1987, IEEE Transactions on Computers.