DocumentCode :
757150
Title :
A comparison of algorithms for terminal-pair reliability
Author :
Yoo, Y.B. ; Deo, Narsingh
Author_Institution :
Dept. of Comput. Sci., Montana State Univ., Bozeman, MT, USA
Volume :
37
Issue :
2
fYear :
1988
fDate :
6/1/1988 12:00:00 AM
Firstpage :
210
Lastpage :
215
Abstract :
Four algorithms for the terminal-pair-reliability problem are compared. Nelson (1970), Lin (1976), Shooman (1968), and Dotson (1979) algorithms are used in this study. It is shown that the Dotson algorithm is the fastest among the terminal-pair reliability algorithms analyzed. The Dotson algorithm is suited not only for numerical reliability, but for obtaining symbolic expression for the terminal-pair reliability with no additional effort. By modifying the Dotson algorithm the efficiency can be further improved. The modifications to this algorithm are listed and the reliability of the modified Dotson algorithm is computed
Keywords :
reliability theory; Dotson algorithm; network reliability; numerical reliability; terminal-pair reliability; Algorithm design and analysis; Boolean algebra; Computational efficiency; Computer network reliability; Computer networks; Digital signal processing; Telecommunication network reliability; Testing;
fLanguage :
English
Journal_Title :
Reliability, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9529
Type :
jour
DOI :
10.1109/24.3743
Filename :
3743
Link To Document :
بازگشت