Hierarchical reliability evaluation of large networks

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.<<ETX>>

[1]  Kishor S. Trivedi,et al.  The hybrid automated reliability predictor , 1986 .

[2]  Kanad Ghose,et al.  The HCN: a versatile interconnection network based on cubes , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[3]  Salim Hariri,et al.  SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods , 1987, IEEE Transactions on Computers.

[4]  S. Hariri,et al.  A hierarchical modeling of availability in distributed systems , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[5]  Dharma P. Agrawal,et al.  A class of hierarchical networks for VLSI/WSI based multicomputers , 1991, [1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design.

[6]  J. M. Kontoleon,et al.  Overall reliability determination of computer networks with hierarchical routing strategies , 1987 .

[7]  Sivarama P. Dandamudi,et al.  Hierarchical Interconnection Networks for Multicomputer Systems , 1990, IEEE Trans. Computers.

[8]  Dharma P. Agrawal,et al.  On computer communication network reliability under program execution constraints , 1988, IEEE J. Sel. Areas Commun..

[9]  T. P. Ng,et al.  K-terminal reliability of hierarchical networks , 1991 .