A practical implementation of the factoring theorem for network reliability

The factoring theorem is a simple tool for determining the K-terminal reliability of a network, i.e. the probability that a given set K of terminals in the network are connected to each other by a path of working edges. An implementation of an algorithm which uses the factoring theorem, in conjunction with degree-1 and degree-2 vertex reductions, to determine the reliability of a network is presented. Networks treated have completely reliable nodes and have edges which fail statistically and independently with known probabilities. The reliability problem is to determine the probability that all nodes in a designated set of nodes can communicate with each other. Such an implementation of the factoring theorem can be incorporated in a small, stand-alone program of about 500 lines of code. A program of this type requires little computer memory and is ideally suited for microcomputer use. >

[1]  M. P. Bailey,et al.  A Recursive Algorithm for Computing Exact Reliability Measures , 1986, IEEE Transactions on Reliability.

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

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

[4]  George S. Fishman.  A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness , 1986, IEEE Transactions on Reliability.

[5]  R. Johnson,et al.  Network reliability and acyclic orientations , 1984, Networks.

[6]  U. Montanari,et al.  A Boolean algebra method for computing the terminal reliability in a communication network , 1973 .

[7]  John A. Buzacott,et al.  A recursive algorithm for directed-graph reliability , 1983, Networks.

[8]  R. Kevin Wood.  Factoring Algorithms for Computing K-Terminal Network Reliability , 1986, IEEE Transactions on Reliability.

[9]  K. K. Aggarwal,et al.  Overall reliability evaluation for large computer communication networks: An MHC approach , 1985 .

[10]  P. K. Varshney,et al.  Network Reliability Evaluation Using Probability Expressions , 1986, IEEE Transactions on Reliability.

[11]  John A. Buzacott,et al.  A recursive algorithm for finding reliability measures related to the connection of nodes in a graph , 1980, Networks.

[12]  Fred Moskowitz,et al.  The analysis of redundancy networks , 1958, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[13]  Antoni Zabludowski.  A recursive method for network reliability measures evaluation , 1984 .