DocumentCode
1743375
Title
k-terminal reliability of communication networks
Author
Ayoub, Jamil N. ; Saafin, Wael H. ; Kahhaleh, Bassam Z.
Author_Institution
Dept. of Electr. Eng., Jordan Univ., Amman, Jordan
Volume
1
fYear
2000
fDate
2000
Firstpage
374
Abstract
The general k-terminal reliability problem for undirected graph models is considered. An algorithm, named MBA, is developed that uses the approximation approach. It utilizes Monte Carlo simulation, together with breadth-first search, to find the reliability. After a sufficient number of simulations, an accurate reliability estimate is found in feasible and practical time
Keywords
Monte Carlo methods; graph theory; reliability theory; search problems; telecommunication network reliability; MBA algorithm; Monte Carlo simulation; approximation approach; breadth-first search; communication networks; k-terminal reliability; reliability estimation; undirected graph models; Approximation algorithms; Communication networks; Computational modeling; Counting circuits; Network topology; Telecommunication network reliability;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronics, Circuits and Systems, 2000. ICECS 2000. The 7th IEEE International Conference on
Conference_Location
Jounieh
Print_ISBN
0-7803-6542-9
Type
conf
DOI
10.1109/ICECS.2000.911559
Filename
911559
Link To Document