ESTIMATION OF NETWORK RELIABILITY USING GRAPH EVOLUTION MODELS

被引:95
作者
ELPERIN, T [1 ]
GERTSBAKH, I [1 ]
LOMONSOV, M [1 ]
机构
[1] BEN GURION UNIV NEGEV,DEPT MATH & COMP SCI,IL-84105 BEER SHEVA,ISRAEL
关键词
TERMINAL RELIABILITY; SPANNING TREE; LIFETIME SIMULATION; KRUSKAL ALGORITHM; GRAPH EVOLUTION; MONTE-CARLO METHOD;
D O I
10.1109/24.106780
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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 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.
引用
收藏
页码:572 / 581
页数:10
相关论文
共 22 条
[1]   A SURVEY OF NETWORK RELIABILITY AND DOMINATION THEORY [J].
AGRAWAL, A ;
BARLOW, RE .
OPERATIONS RESEARCH, 1984, 32 (03) :478-492
[2]  
BARLOW RE, 1975, STATISTICAL THEORY R
[3]  
Colbourn C., 1987, COMBINATORICS NETWOR
[4]  
COLBOURN CJ, 1988, NETWORKS, P1
[5]  
DAVID HA, 1981, ORDER STATISTICS
[6]  
EASTON MC, 1980, IEEE T RELIAB, V29, P27, DOI 10.1109/TR.1980.5220696
[7]  
Feller W., 1966, INTRO PROBABILITY TH, V2
[8]   A MONTE-CARLO SAMPLING PLAN FOR ESTIMATING RELIABILITY PARAMETERS AND RELATED FUNCTIONS [J].
FISHMAN, GS .
NETWORKS, 1987, 17 (02) :169-186
[9]   A MONTE-CARLO SAMPLING PLAN FOR ESTIMATING NETWORK RELIABILITY [J].
FISHMAN, GS .
OPERATIONS RESEARCH, 1986, 34 (04) :581-594