A Recursive Variance-Reduction Algorithm For Estimating Communication-Network Reliability

IEEE Transactions on Reliability

Volumn 44, Issue 4, 1995, Pages 595-602

  Cancela, Héctor ^a   El Khadiri, Mohamed ^b  

^a UNIVERSITY OF URUGUAY   (Uruguay)

^b Saint Nazaire Institute of Technology ^*  (United States)

Author keywords

Monte Carlo method; Network reliability; variance reduction

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; ELECTRIC NETWORK TOPOLOGY; MONTE CARLO METHODS; PROBABILITY; RECURSIVE FUNCTIONS; RELIABILITY; SET THEORY;

RECURSIVE VARIANCE REDUCTION ALGORITHM;

TELECOMMUNICATION NETWORKS;

EID: 0029508949     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/24.475978     Document Type: Article

References (15)

1. M.O. Ball, “Computational complexity of network reliability analysis: An overview”, IEEE Trans. Reliability, vol R-35, 1986 Aug, pp 230–239.
2. C.J. Colbourn, The Combinatorics of Network Reliability, 1987; Oxford University Press.
3. M. El Khadiri, “Evaluation directe et par simulation d'indices de fiabilité de réseaux de communication: Algorithmes séquentiels et déiés à des architectures à mémoire distribuée (Direct evaluation and simulation of communication network reliability parameters: Sequential and memory distributed parallel algorithms)”, PhD Thesis, 1992 Dec; Rennes I, Campus de Beaulieu.
4. M. El Khadiri, R. Marie, G. Rubino, “Parallel estimation of 2-terminal network reliability by a crude Monte Carlo technique” (M. Baray, Bülent Özgüç, Ed), Proc. ISCIS VI, Sixth Int'l Symp. Computer and Information Sciences, 1991 Oct, pp 559–570; Elsevier.
5. M. El Khadiri, G. Rubino, A Monte-Carlo Method Based on Antithetic Variates for Network Reliability Computations, Technical Report 626, 1992; IRISA, Campus de Beaulieu, 35042 Rennes, France.
6. M. El Khadiri, G. Rubino, “Reliability evaluation of communication networks”, SAFECOMP'92, Int'l Conf. Safety, Security and Reliability of Computers, 1992 Oct, pp 279–283; Zurich.
7. T. Elperin, I. Gertsbakh, M. Lomonosov, “Estimation of network reliability using graph evolution models”, IEEE Trans. Reliability, vol 40, 1991 Dec, pp 572–581.
8. 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 Jun, pp 145–155.
9. M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, 1979; W.H. Freeman.
10. R.M. Karp, M. Luby, “Monte-Carlo algorithms for the planar multiterminal network reliability problem”, J. Complexity, vol 1, 1985, pp 45–64.
11. H. Kumamoto, K. Tanaka, K. Inoue, “Efficient evaluation of system reliability by Monte Carlo method”, IEEE Trans. Reliability, vol R-26, 1977 Dec, pp 311–315.
12. H. Kumamoto, K. Tanaka, K. Inoue, E.J. Henley, “Dagger-sampling Monte Carlo for system unavailability evaluation”, IEEE Trans. Reliability, vol R-29, 1980 Jun, pp 122–125.
13. Network Reliability % The State of the Art (M.O. Locks, A. Satyarayana, Eds), IEEE Trans. Reliability, vol R-35, 1986 Aug, Special Section.
14. J.S. Provan, “The complexity of reliability computations in planar and acyclic graphs”, SIAM J. Computing, vol 15, 1986 Aug.
15. K.S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications, 1982; Prentice-Hall.