COMPUTING NETWORK RELIABILITY

被引:74
作者
BALL, MO
机构
关键词
D O I
10.1287/opre.27.4.823
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
An algorithm is presented to compute reliability measures on a stochastic network in which both nodes and links can fail. The measures considered are the probability that nodes s and t can communicate for all node pairs s and t, the probability that all operative node pairs can communicate, and the expected number of node pairs communicating. It also computes the latter two measures when all communication must proceed through a root. node. A specialized version of the algorithm is given for networks in which only nodes can fail.
引用
收藏
页码:823 / 838
页数:16
相关论文
共 25 条
[21]  
SEGAL M, 1965, 4TH INT TEL C LOND
[22]  
Tarjan R., 1972, SIAM Journal on Computing, V1, P146, DOI 10.1137/0201010
[23]  
VALIANT LG, 1977, CSR1577 U ED DEP COM
[24]  
Van Slyke R., 1971, NETWORKS 1, V1, P279
[25]  
VANSLYKE R, 1975, RELIABILITY FAULT TR, P619