Abstract
Monte Carlo techniques for estimating various net- work 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 our 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.
Original language | English |
---|---|
Pages (from-to) | 572-581 |
Number of pages | 10 |
Journal | IEEE Transactions on Reliability |
Volume | 40 |
Issue number | 5 |
DOIs | |
State | Published - 1 Jan 1991 |
Keywords
- Graph evolution
- Kruskal algorithm
- Lifetime
- Monte Carlo
- Spanning tree
- Terminal reliability
- method
- simulation
ASJC Scopus subject areas
- Safety, Risk, Reliability and Quality
- Electrical and Electronic Engineering