DocumentCode :
3162240
Title :
Hierarchical reliability evaluation of large networks
Author :
Sharma, Nita ; Agrawal, Dharma P.
Author_Institution :
Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA
fYear :
1991
fDate :
2-5 Dec 1991
Firstpage :
444
Lastpage :
451
Abstract :
Introduces a hierarchical approach for computing the terminal reliability between any given source-destination pair in large networks. The main advantage of the proposed method is the possibility of breaking down the problem of terminal reliability to subproblems. The technique gives an exact reliability expression for a hierarchical network and an approximation for any large network. The usefulness of the strategy is demonstrated by several examples of large and hierarchical networks. The effect of partitioning a large network into a number of clusters, on the reliability figure and the execution time is also investigated
Keywords :
distributed algorithms; distributed processing; reliability theory; exact reliability expression; hierarchical network; hierarchical reliability; large networks; source-destination pair; terminal reliability; Clustering algorithms; Computer network reliability; Computer networks; Joining processes; LAN interconnection; Network topology; Routing; State-space methods; Telecommunication network reliability; Wide area networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-2310-1
Type :
conf
DOI :
10.1109/SPDP.1991.218207
Filename :
218207
Link To Document :
بازگشت