Estimation of network reliability using graph evolution models

Author

Elperin, T. ; Gertsbakh, I. ; Lomonosov, M.

Author_Institution

Ben-Gurion Univ. of the Negev, Beer Sheva, Israel

Volume

40

Issue

5

fYear

1991

fDate

12/1/1991 12:00:00 AM

Firstpage

572

Lastpage

581

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

Monte Carlo methods; failure analysis; graph theory; probability; reliability theory; Monte Carlo techniques; arbitrary probabilities; edges; failures; graph evolution; graph-theoretic machinery; network reliability; nodes; numerical results; reliability estimation; simulation; terminal connectivity; time-evolution processes; Analytical models; Computational modeling; Computer networks; Graph theory; Machinery; Monte Carlo methods; Numerical simulation; Reliability theory; Tree graphs; Upper bound;

fLanguage

English

Journal_Title

Reliability, IEEE Transactions on

Publisher

ieee

ISSN

0018-9529

Type

jour

DOI

10.1109/24.106780

Filename

106780