Reliability of Directed Networks using the Factoring Theorem

IEEE Transactions on Reliability

Volumn 38, Issue 5, 1989, Pages 556-562

  Page, Lavon B ^a   Perry, Jo Ellen ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

directed network; factoring theorem; network reduction; Network reliability

Indexed keywords

PROBABILITY;

DIRECTED NETWORKS RELIABILITY; FACTORING THEOREM; NETWORK REDUCTION;

COMPUTER NETWORKS;

EID: 0024913854     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/24.46479     Document Type: Article

References (19)

1. L.B. Page, J.E. Perry, “A practical implementation of the factoring theorem for network reliability,” IEEE Trans. Reliability, vol 37, 1988 Aug, pp. 259–267.
2. M.O. Ball, E.P. Cameron, “Experiments with network reliability analysis algorithms,” Modeling and Simulation: Proc. 17th Ann. Pittsburgh Conf., Vogt & Mickle (eds.), vol 17, pp. 1799–1803.
3. R.K. Wood, “Factoring algorithms for computing K-terminal network reliability,” IEEE Trans. Reliability, vol R-35, 1986 Aug, pp. 269–278.
4. A. Satyanarayana, M.K. Chang, “Network reliability and the factoring theorem,” Networks, vol 20, 1983, pp. 107–120.
5. R. Johnson, “Network reliability and acyclic orientations,” Networks, vol 14, 1984, pp. 489–505.
6. M.O. Ball, “The complexity of network reliability computations,” Networks, vol 10, 1979, pp. 153–165.
7. L. Fratta, U.G. Montanari, “A recursive method based on case analysis for computing network terminal reliability,” IEEE Trans. Communication, vol Com-26, 1978, pp. 1166–1177.
8. K.S. Park, B.C. Cho, “RAPID: Recursive algorithmic pivotal decomposition program for complex structural reliability analysis,” IEEE Trans. Reliability, vol 37, 1988 Apr, pp. 50–53.
9. L. Fratta, U.G. Montanari, “A boolean algebra method for computing the terminal reliability in a communication network,” IEEE Trans. Circuit Theory, vol CT-20, 1973 May, pp. 203–211.
10. Y.B. Yoo, Narsingh Deo, “A comparison of algorithms for terminal-pair reliability,” IEEE Trans. Reliability, vol 37, 1988 Jun, pp. 210–215.
11. A.C. Nelson, Jr., J.R. Batts, R.L. Beadles, “A computer program for approximating system reliability,” IEEE Trans. Reliability, vol R-19, 1970 Feb, pp. 61–65.
12. P.M. Lin, B.J. Leon, T. Ch. Huang, “A new algorithm for symbolic system reliability analysis,” IEEE Trans. Reliability, vol R-25, 1976 Apr, pp. 2–15.
13. M.L. Shooman, Probabilistic Reliability: An Engineering Approach, McGraw-Hill, 1968.
14. W.P. Dotson, J.O. Gobien, “A new analysis technique for probabilistic graphs,” IEEE Trans. Circuits and Systems, vol 26, 1979, pp. 855–865.
15. W.H. Debany, Jr., P.K. Varshney, C.R.P. Hartmann, “Network reliability evaluation using probability expressions,” IEEE Trans. Reliability, vol R-35, 1986 Jun, pp. 161–166.
16. M.O. Ball, “Computing network reliability,” Operations Research, vol 27, 1979, pp. 823–838.
17. M.P. Bailey, V.G. Kulkarni, “A recursive algorithm for computing exact reliability measures,” IEEE Trans., Reliability, vol R-35, 1986 Apr, pp. 36–40.
18. J.A. Buzacott, “A recursive algorithm for finding reliability measures related to the connection of nodes in a graph,” Networks, vol 10, 1980, pp. 311–327.
19. J.S. Provan, M. Ball, “Computing network reliability in time polynomial in the number of cuts,” Operations Research, vol 32, 1984, pp. 516–526.