An improved algorithm for searching all minimal cuts in modified networks

A modified network is an updated network after inserting a branch string (a special path) between two nodes in the original network. Modifications are common for network expansion or reinforcement evaluation and planning. The problem of searching all minimal cuts (MCs) in a modified network is discussed and solved in this study. The existing best-known methods for solving this problem either needed extensive comparison and verification or failed to solve some special but important cases. Therefore, a more efficient, intuitive and generalized method for searching all MCs without an extensive research procedure is proposed. In this study, we first develop an intuitive algorithm based upon the reformation of all MCs in the original network to search for all MCs in a modified network. Next, the correctness of the proposed algorithm will be analyzed and proven. The computational complexity of the proposed algorithm is analyzed and compared with the existing best-known methods. Finally, two examples illustrate how all MCs are generated in a modified network using the information of all of the MCs in the corresponding original network.

[1]  Wei-Chang Yeh,et al.  A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network , 1998 .

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

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

[4]  Wei-Chang Yeh.  A simple algorithm to search for all d-MPs with unreliable nodes , 2001, Reliab. Eng. Syst. Saf..

[5]  Wei-Chang Yeh.  Multistate-node acyclic networks reliability evaluation based on MC , 2003, Reliab. Eng. Syst. Saf..

[6]  Weiwe-Chang Yeh.  A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes , 2004, Reliab. Eng. Syst. Saf..

[7]  J. M. Nahman.  Enumeration of minimal cuts of modified networks , 1994 .

[8]  M. Samad,et al.  An efficient algorithm for simultaneously deducing minimal paths as well as cuts of a communication network , 1987 .

[9]  Wei-Chang Yen.  A Simple Heuristic Algorithm for Generating All Minimal Paths , 2007, IEEE Transactions on Reliability.

[10]  Amjed M. Al-Ghanim,et al.  A heuristic technique for generating minimal path and cutsets of a general network , 1999 .

[11]  Terje Aven,et al.  Availability evaluation of oil/gas production and transportation systems , 1987 .

[12]  Sheng-De Wang,et al.  Reliability evaluation for distributed computing networks with imperfect nodes , 1997 .

[13]  John Yuan,et al.  Reliability evaluation of a limited-flow network in terms of minimal cutsets , 1993 .

[14]  Terje Aven,et al.  Some considerations on reliability theory and its applications , 1988 .

[15]  Ming Jian Zuo,et al.  Dominant multi-state systems , 2004, IEEE Transactions on Reliability.

[16]  Wei-Chang Yeh.  A simple approach to search for all d-MCs of a limited-flow network , 2001, Reliab. Eng. Syst. Saf..

[17]  Zhibin Tan.  Minimal cut sets of s-t networks with k-out-of-n nodes , 2003, Reliab. Eng. Syst. Saf..

[18]  Wei-Chang Yeh.  Search for MC in modified networks , 2001, Comput. Oper. Res..

[19]  Peter Kubat,et al.  Estimation of reliability for communication/computer networks simulation/analytic approach , 1989, IEEE Trans. Commun..

[20]  Sieteng Soh,et al.  A computer approach for reliability evaluation of telecommunication networks with heterogeneous link-capacities , 1991 .

[21]  Wei-Chang Yeh.  Search for minimal paths in modified networks , 2002, Reliab. Eng. Syst. Saf..

[22]  Yi-Kuei Lin,et al.  Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs , 2002, Reliab. Eng. Syst. Saf..

[23]  Tongdan Jin,et al.  Approximating network reliability estimates using linear and quadratic unreliability of minimal cuts , 2003, Reliab. Eng. Syst. Saf..

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