Estimation of Network Reliability Using Graph Evolution Models

IEEE Transactions on Reliability

Volumn 40, Issue 5, 1991, Pages 572-581

  Lomonosov, M ^a   Elperin, T ^a   Gertsbakh, I ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Graph evolution; Kruskal algorithm; Lifetime; method; Monte Carlo; simulation; Spanning tree; Terminal reliability

Indexed keywords

COMPUTER PERIPHERAL EQUIPMENT - TERMINALS; COMPUTER SIMULATION; MATHEMATICAL STATISTICS - MONTE CARLO METHODS; MATHEMATICAL TECHNIQUES - TREES; RELIABILITY THEORY;

GRAPH DESTRUCTION/CREATION PROCESSES; GRAPH EVOLUTION; KRUSKAL ALGORITHM; LIFETIME SIMULATION; SPANNING TREE; TERMINAL RELIABILITY;

COMPUTER NETWORKS;

EID: 0026370202     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/24.106780     Document Type: Article

References (22)

1. A. Agraval, R. E. Barlow, “A survey of network reliability and domination theory”, Operations Research, vol 32, 1984, pp 478-492.
2. R. E. Barlow, F. Proschan, Statistical Theory of Reliability and Life Testing, 1975; Holt, Rinehart & Winston.
3. C. J. Colbourn, The Combinatorics of Network Reliability, 1987; Oxford Univ. Press.
4. C. J. Colbourn, D. D. Harms, ' ‘' ‘Bounding all-terminal reliability in computer networks”, Networks, 1988, pp 1-12.
5. H. A. David, Order Statistics, 1981, ed; John Wiley & Sons.
6. M. C. Easton, C. K. Wong, ' ‘' ‘Sequential destruction method for Monte Carlo evaluation of system reliability”, IEEE Trans. Reliability, vol R-29, 1980 Apr, pp 27-32.
7. W. Feller, An Introduction to Probability Theory and Its Applications, vol II, 1966; John Wiley & Sons.
8. G. S. Fishman, ' ‘' ‘A Monte Carlo sampling plan for estimating network reliability”, Operations Research, vol 34, 1986, pp 581-592.
9. G. S. Fishman, ' ‘' ‘A comparison of four Monte Carlo methods for estimating the probability of s-t connectedness”, IEEE Trans. Reliability, vol R-35, 1986, pp 145-154.
10. G. S. Fishman, ' ‘' ‘A Monte Carlo sampling plan for estimating reliability parameters and related functions”, Networks, vol 17, 1987, pp 169-186.
11. G. S. Fishman, ' ‘' ‘Estimating the s-t reliability function using importance and stratified sampling”, Operations Research, vol 37, 1989, pp 462-473.
12. F. Harary, Graph Theory, 1969; Addison Wesley.
13. J. E. Hopcroft, J. D. Ullman, ' ‘' ‘Set merging algorithms”, SIAM J. Computing, vol 2, 1973, pp 296-303.
14. R. Karp, M. G. Luby, ' ‘' ‘A new Monte Carlo method for estimating the failure probability of an n-component system”, 1983; Computer Science Div., Univ. of California.
15. J. B. Kruskal, ' ‘' ‘On the shortest spanning tree of a graph and the travelling salesman problem”, Proc. Amer. Mathematical Soc., vol 7, 1956, pp 48-50.
16. H. Kumamoto, et al, “Dagger sampling Monte Carlo for system unavailability evaluation”, IEEE Trans. Reliability, vol R-29, 1980 Jun, pp 122-125.
17. H. Kumamoto, T. Kazuo, I. Koichi, E. J. Henley, “State transition Monte Carlo for evaluating large, repairable systems”, IEEE Trans. Reliability, vol R-29, 1980 Dec, pp 376-380.
18. M. V. Lomonosov, V. P. Polesskii, “On maximum of probability of connectivity”, Problems of Information Transmission, vol 8, num 4, 1972.
19. M. V. Lomonosov, “Bernoulli scheme with closure”, Problems of Information Transmission, vol 10, num 1, 1974.
20. M. V. Lomonosov, “Tender-spot of a reliable network”, Discrete Applied Mathematics, (to appear).
21. Lucia I. P. Resende, “Implementation of factoring algorithm for reliability evaluation of undirected networks”, IEEE Trans. Reliability, vol 37, 1988 Dec, pp 462-468.
22. A. Satanarayana, R. K. Wood, “A linear time algorithm for k-terminal reliability in series-parallel networks”, SIAM J. Computing, 1985, pp 818-832.