Estimation of network reliability using graph evolution models

1 December 1991

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability

Vol. 40 (5) , 572-581
https://doi.org/10.1109/24.106780

Abstract

Monte Carlo techniques for estimating various network reliability characteristics, including terminal connectivity, are developed by assuming that edges are subject to failures with arbitrary probabilities and nodes are absolutely reliable. The core of the approach is introducing network time-evolution processes and using certain graph-theoretic machinery, resulting in a considerable increase in accuracy for Monte Carlo estimates, especially for highly reliable networks. Simulation strategies and numerical results are presented and discussed.

Keywords

This publication has 14 references indexed in Scilit:

Estimating the s − t Reliability Function Using Importance and Stratified Sampling
Operations Research, 1989
Bounding all-terminal reliability in computer networks
Networks, 1988
A monte carlo sampling plan for estimating reliability parameters and related functions
Networks, 1987
A Monte Carlo Sampling Plan for Estimating Network Reliability
Operations Research, 1986
State-Transition Monte Carlo for Evaluating Large, Repairable Systems
IEEE Transactions on Reliability, 1980
Dagger-Sampling Monte Carlo For System Unavailability Evaluation
IEEE Transactions on Reliability, 1980
Sequential Destruction Method for Monte Carlo Evaluation of System Reliability
IEEE Transactions on Reliability, 1980
Set Merging Algorithms
SIAM Journal on Computing, 1973
GRAPH THEORY
Published by Defense Technical Information Center (DTIC) ,1969
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
Proceedings of the American Mathematical Society, 1956