DocumentCode
1387405
Title
K -terminal reliability of hierarchical networks
Author
Ng, Tony P.
Author_Institution
Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
Volume
40
Issue
2
fYear
1991
fDate
6/1/1991 12:00:00 AM
Firstpage
218
Lastpage
225
Abstract
A class of networks called hierarchical networks is described, and it is shown how reliability can be computed efficiently in a hierarchical network. In particular, an algorithm for the K -terminal problem is described for computing the probability that a set of k nodes (k >1) can communicate through the network. The algorithm complexity is polynomial with a small degree. The exact degree depends on the distribution of the nodes that desire to communicate and the external gateways
Keywords
hierarchical systems; polynomials; probability; reliability theory; K-terminal reliability; algorithm complexity; external gateways; hierarchical networks; polynomial algorithm; probability; Broadcasting; Computer networks; Ink; Multiprocessor interconnection networks; Partitioning algorithms; Polynomials; Reliability theory; Telecommunication network reliability; Tree graphs;
fLanguage
English
Journal_Title
Reliability, IEEE Transactions on
Publisher
ieee
ISSN
0018-9529
Type
jour
DOI
10.1109/24.87132
Filename
87132
Link To Document