Recursive Technique for Computing System Reliability

IEEE Transactions on Reliability

Volumn R-36, Issue 1, 1987, Pages 38-44

  Rai, Suresh ^a   Kumar, Arun ^b  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY ROORKEE   (India)

Author keywords

Graph; Logic signal; Minimal cutset; Network congestion; Reliability evaluation

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES - PASCAL; MATHEMATICAL TECHNIQUES - GRAPH THEORY; TELECOMMUNICATION SYSTEMS - RELIABILITY;

BLOCKING PROBABILITIES; CIRCUIT-SWITCHED NETWORKS; RECURSIVE TECHNIQUES; SOURCE-TO-SINK CONGESTION;

RELIABILITY THEORY;

EID: 0023329476     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/TR.1987.5222290     Document Type: Article

References (17)

1. P.M. Lin, B.J. Leon, T.C. Huang, “Analysis of circuit-switched networks employing originated office control with spill forward”, IEEE Trans. Communication, vol. COM-26, 1978 Jun, pp. 754–765.
2. M.D. Gaudreau, “Recursive formulas for the calculation of pointto-point congestion”, IEEE Trans. Communication, vol. COM-28, 1980 Mar, pp. 313–316.
3. C.Y. Lee, “Analysis of switching networks”, Bell Syst. Tech J., vol. 34, 1955 Nov, pp. 1287–1315.
4. N. Deo, Graph Theory with Application to Engineering and Computer Science, Prentice-Hall, 1974.
5. P.M. Lin, B.J. Leon, T.C. Huang, “A new algorithm for symbolic system reliability analysis”, IEEE Trans. Reliability, vol. R-25, 1976 Apr, pp. 2–15.
6. 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 Mar, pp. 203–211.
7. K.K. Aggarwal, S. Rai, “Symbolic reliability evaluation using logical signal relations”, IEEE Trans. Reliability, vol. R-27, 1978 Aug, pp. 202–205.
8. S. Rai, K.K. Aggarwal, “An efficient method for reliability evaluation of a general network”, IEEE Trans. Reliability, vol. R-27, 1978 Aug, pp. 206–211.
9. L. Fratta, U.G. Montanari, “A recursive method based on case analysis for computing terminal reliability”, IEEE Trans. Communication, vol. COM-26, 1978 Aug, pp. 1166–1177.
10. O. D'Antona, M. Di Pietro, “Boolean algorithms in terminal reliability evalutation”, Dipartimento Di Informatica E Sistemistica, RIDIS-1–83, 1983 (supplied through Editor).
11. H. Nakazawa, “Bayesian decomposition method for computing the reliability of an oriented network”, IEEE Trans. Reliability, vol. R-25, 1976 Apr, pp. 77–80.
12. M.O. Ball, “Computing network reliability”, Operations Research, vol. 27, 1979 Jul-Aug, pp. 823–837.
13. A. Agrawal, R.E. Barlow, “A survey of network reliability and domination theory”, Operations Research, vol. 32, 1984 May-Jun, pp. 478–492.
14. J.S. Provan, M.O. Ball, “Computing network reliability in time polynomial in the number of cuts”, Operations Research, vol. 32, 1984 May-Jun, pp. 516–526.
15. A. Satyanarayana, A. Prabhakar, “New topological formula and rapid algorithm for reliability analysis of complex networks”, IEEE Trans. Reliability, vol. R-27, 1978 Jun, pp. 82–100.
16. E. Hansler, G.K. McAuliffe, R.S. Wilkov, “Exact calculation of computer network reliability”, Networks, 4, 1974, pp. 95–112.
17. Suresh Rai, Arun Kumar, E.V. Prasad, “Computing terminal reliability of computer network”, Reliability Engineering, vol. 16, 1986, pp. 109–119.