Network reliability evaluation by decomposition

Abstract The recursive method proposed in this paper for s − t network reliability evaluation uses the concept of subdividing the network structure into any number of desired subgraphs depending on the complexity of the entire network. A sum of products expression has been obtained by selection of keystone substructure/elements and successive application of the conditional probability theorem, giving the sum of minimal paths. Then the procedure for generating sums of disjoint products has been applied on the sum of products expression to obtain the network reliability.

[1]  S. H. Ahmad A Simple Technique for Computing Network Reliability , 1982, IEEE Transactions on Reliability.

[2]  Suresh Rai,et al.  Recursive Technique For Computing System Reliability , 1987, IEEE Transactions on Reliability.

[3]  J. deMercado,et al.  A Method for Calculation of Network Reliability , 1976, IEEE Transactions on Reliability.

[4]  Y.C. Chopra,et al.  Reliability Evaluation by Network Decomposition , 1982, IEEE Transactions on Reliability.

[5]  Brijendra Singh A procedure for generating sums of disjoint products , 1993 .

[6]  M. O. Locks A Minimizing Algorithm for Sum of Disjoint Products , 1987, IEEE Transactions on Reliability.

[8]  S. Rai,et al.  An Efficient Method for Reliability Evaluation of a General Network , 1978, IEEE Transactions on Reliability.

[9]  Ali M. Rushdi On Reliability Evaluation by Network Decomposition , 1984, IEEE Transactions on Reliability.