A SURVEY OF EFFICIENT RELIABILITY COMPUTATION USING DISJOINT PRODUCTS APPROACH

被引:54
作者
RAI, S
VEERARAGHAVAN, M
TRIVEDI, KS
机构
[1] AT&T BELL LABS,HOLMDEL,NJ 07733
[2] DUKE UNIV,DURHAM,NC 27706
关键词
D O I
10.1002/net.3230250308
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Several algorithms have been developed to solve the reliability problem for nonseries-parallel networks using the sum of disjoint products (SDP) approach. This paper provides a general framework for most of these techniques. It reviews methods that help improve computer time and memory requirements in reliability computation. These parameters are generally used to compare SDP algorithms. We also overview three multiple variable inversion algorithms that result in sum of disjoint products expressions with fewer terms than that of algorithms that use only a single-variable inversion. One common network is solved for two-terminal network reliability using each of these algorithms. Finally, we have provided a comparison among these techniques. (C) 1995 John Wiley and Sons, Inc.
引用
收藏
页码:147 / 163
页数:17
相关论文
共 37 条
[1]   IMPROVED ALGORITHM FOR NETWORK RELIABILITY [J].
ABRAHAM, JA .
IEEE TRANSACTIONS ON RELIABILITY, 1979, 28 (01) :58-61
[2]   A SIMPLE TECHNIQUE FOR COMPUTING NETWORK RELIABILITY [J].
AHMAD, SH .
IEEE TRANSACTIONS ON RELIABILITY, 1982, 31 (01) :41-44
[3]  
Aho A. V., 1974, DESIGN ANAL COMPUTER
[4]   DISJOINT PRODUCTS AND EFFICIENT COMPUTATION OF RELIABILITY [J].
BALL, MO ;
PROVAN, JS .
OPERATIONS RESEARCH, 1988, 36 (05) :703-715
[5]  
BARLOW RE, 1975, STATISTICAL THEORY R
[6]   AN IMPROVED ABRAHAM-METHOD FOR GENERATING DISJOINT SUMS [J].
BEICHELT, F ;
SPROSS, L .
IEEE TRANSACTIONS ON RELIABILITY, 1987, 36 (01) :70-74
[7]  
BENNETTS RG, 1975, IEEE T RELIAB, V24, P194
[8]  
Boesch F.T., 1990, PROBAB ENG INFORM SC, V4, P257
[9]  
Colbourn C., 1987, COMBINATORICS NETWOR
[10]  
GRNAROV A, 1979, DEC P COMP NETW S