Title :
K-terminal reliability of hierarchical networks
Author_Institution :
Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
fDate :
6/1/1991 12:00:00 AM
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;
Journal_Title :
Reliability, IEEE Transactions on
