An algorithm for computing all-terminal reliability bounds

The exact calculation of all-terminal reliability is not feasible in large networks. Hence estimation techniques and lower and upper bounds for all-terminal reliability have been utilized. We propose using an ordered subset of the mincuts and an ordered subset of minpaths to calculate an all-terminal reliability upper and lower bound, respectively. The advantage of the proposed approach results from the fact that it does not require the enumeration of all mincuts or all minpaths as required by other bounds. The performance of the algorithm is compared with the first two Bonferroni bounds, for networks where all mincuts could be calculated. The results show that the proposed approach is computationally feasible and reasonably accurate. Thus allowing one to obtain bounds when it not possible to enumerate all mincuts or all minpaths.

[1]  William H. Press,et al.  Numerical Recipes 3rd Edition: The Art of Scientific Computing , 2007 .

[2]  F. Beichelt,et al.  Comment on "An improved Abraham-method for generating disjoint sums , 1989 .

[3]  Chun-Chang Liu,et al.  An improved minimizing algorithm for sum of disjoint products by Shannon's expansion , 1992 .

[4]  George S. Fishman,et al.  A Monte Carlo Sampling Plan for Estimating Network Reliability , 1984, Oper. Res..

[5]  Mihalis Yannakakis,et al.  Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract) , 1992, ICALP.

[6]  Gerardo Rubino,et al.  Rare Event Simulation using Monte Carlo Methods , 2009 .

[7]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[8]  A. M. Shooman.  Algorithms for network reliability and connection availability analysis , 1995, Proceedings of Electro/International 1995.

[9]  Fred Moskowitz,et al.  The analysis of redundancy networks , 1958, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[10]  F. Proschan,et al.  A Reliability Bound for Systems of Maintained, Interdependent Components , 1970 .

[11]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

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

[13]  Fakhri Karray,et al.  A Greedy Algorithm for Faster Feasibility Evaluation of All-Terminal-Reliable Networks , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[14]  D. Shier.  Network Reliability and Algebraic Structures , 1991 .

[15]  Klaus D. Heidtmann,et al.  Smaller sums of disjoint products by subproduct inversion , 1989 .

[16]  Sanjiv Kapoor,et al.  Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs , 1995, SIAM J. Comput..

[17]  A. C. Nelson,et al.  A Computer Program for Approximating System Reliability , 1970 .

[18]  Mohcene Mezhoudi,et al.  Integrating optical transport quality, availability, and cost through reliability-based optical network design , 2006, Bell Labs Technical Journal.

[19]  Michael O. Ball,et al.  Computational Complexity of Network Reliability Analysis: An Overview , 1986, IEEE Transactions on Reliability.

[20]  Kishor S. Trivedi,et al.  Fast computation of bounds for two-terminal network reliability , 2014, Eur. J. Oper. Res..

[21]  Michal Pióro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010, Networks.

[22]  Miro Kraetzl,et al.  The Cross-Entropy Method for Network Reliability Estimation , 2005, Ann. Oper. Res..

[23]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[24]  Abdullah Konak,et al.  Estimation of all-terminal network reliability using an artificial neural network , 2002, Comput. Oper. Res..

[25]  J. Abraham.  An Improved Algorithm for Network Reliability , 1979, IEEE Transactions on Reliability.

[26]  A. Cayley.  A theorem on trees , 2009 .

[27]  Alice E. Smith,et al.  A General Neural Network Model for Estimating Telecommunications Network Reliability , 2009, IEEE Transactions on Reliability.

[28]  M. O. Locks,et al.  Note on disjoint products algorithms , 1992 .

[29]  Wei-Chang Yeh.  A simple algorithm to search for all MCs in networks , 2006, Eur. J. Oper. Res..

[30]  Lorenzo Traldi,et al.  Preprocessing minpaths for sum of disjoint products , 2003, IEEE Trans. Reliab..

[31]  F. Beichelt,et al.  An Improved Abraham-Method for Generating Disjoint Sums , 1987, IEEE Transactions on Reliability.