DocumentCode
3000759
Title
A new algorithm for computing the overall network reliability
Author
Liu, Chen ; Mingde Dai ; Wu, Xin-Yu ; Chen, Wai-Kai
Author_Institution
Inst. of Neural Networks & Syst. Optimization, Nanjing Univ. of Posts & Telecommun., China
Volume
6
fYear
1999
fDate
36342
Firstpage
149
Abstract
The paper proposes an algorithm for computing the overall network reliability based on elementary tree transformations. It can directly find out the set of disjoint trees in a network graph without additional tree-disjointing operations. Such a derived set of disjoint trees contains the same number of trees as does the network graph and therefore is of the simplest and optimal form. This algorithm is effective in computer implementation
Keywords
reliability theory; trees (mathematics); computer implementation; disjoint trees; elementary tree transformations; network graph; overall network reliability; tree-disjointing operations; Communication networks; Computer network reliability; Computer networks; Computer science; Mathematics; Neural networks; Reliability theory; Telecommunication computing; Telecommunication network reliability; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1999. ISCAS '99. Proceedings of the 1999 IEEE International Symposium on
Conference_Location
Orlando, FL
Print_ISBN
0-7803-5471-0
Type
conf
DOI
10.1109/ISCAS.1999.780117
Filename
780117
Link To Document