Enumeration of Minimal Cutsets for Directed Networks with Comparative Reliability Study for Paths or Cuts

An active research field is the evaluation of the reliability of a complex network. The most popular methods for such evaluation often use Minimal Paths (MP) or Minimal Cuts (MC) of the network. This paper proposes an algorithmic approach to enumerate MC of the directed network's reliability measures. Another attempt has been made in this paper to provide an answer to the question as to when MP or MC are suitable for evaluating reliability measures. An exhaustive study has been conducted to provide some guidelines in this respect. Copyright © 2015 John Wiley & Sons, Ltd.

[1]  Avinash Agrawal,et al.  A Survey of Network Reliability and Domination Theory , 1984, Oper. Res..

[2]  G. Jasmon,et al.  A Method for Evaluating All the Minimal Cuts of a Graph , 1987, IEEE Transactions on Reliability.

[3]  Rajesh Mishra,et al.  A Cutsets-Based Unified Framework to Evaluate Network Reliability Measures , 2009, IEEE Transactions on Reliability.

[4]  S.-P. Chan,et al.  A method of reliability evaluation for computer-communication networks , 1990, IEEE International Symposium on Circuits and Systems.

[5]  A. Satyanarayana,et al.  An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks , 1984, Oper. Res..

[6]  K. B. Misra,et al.  A hybrid method to evaluate reliability of complex networks , 2002 .

[7]  On formulation of a reliable cost allocation strategy in centralized computer networks , 1980 .

[8]  Maria C. Yuang,et al.  A cut-based method for terminal-pair reliability , 1996, IEEE Trans. Reliab..

[9]  E. V. Krishnamurthy,et al.  Computer-Aided Reliability Analysis of Complicated Networks , 1972 .

[10]  J. Scott Provan,et al.  Computing Network Reliability in Time Polynomial in the Number of Cuts , 1984, Oper. Res..

[11]  W. J. Rueger.  Reliability Analysis of Networks with Capacity-Constraints and Failures at Branches & Nodes , 1986, IEEE Transactions on Reliability.

[12]  Suresh Rai,et al.  Comments On "Inverting and Minimalizing Path sets and Cut sets , 1979 .

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

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

[15]  M. Samad,et al.  Reduction of computations in enumeration of terminal and multiterminal pathsets by the method of indexing , 1992 .

[16]  S. Rai,et al.  Experimental results on preprocessing of path/cut terms in sim of disjoint products technique , 1993 .

[17]  U. Montanari,et al.  A Vertex Elimination Algorithm for Enumerating all Simple Paths in a Graph , 1975, Networks.

[18]  M. Samad,et al.  An efficient method for terminal and multiterminal pathset enumeration , 1987 .

[19]  Roy Billinton,et al.  A novel approach to determine minimal tie-sets of complex network , 2004, IEEE Transactions on Reliability.

[20]  Kenneth E. Case,et al.  A Method for Computing Complex System Reliability , 1972 .

[21]  Debaraj Rath,et al.  A simple method for generating K-trees of a network , 1993 .

[22]  Narsingh Deo,et al.  Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.

[23]  K. B. Misra,et al.  An Algorithm for the Reliability Evaluation of Redundant Networks , 1970 .

[24]  Nikolaos Limnios,et al.  K-Terminal Network Reliability Measures With Binary Decision Diagrams , 2007, IEEE Transactions on Reliability.

[25]  Y. B. Yoo,et al.  A comparison of algorithms for terminal-pair reliability , 1988 .

[26]  S. Jain,et al.  An efficient algorithm for computing global reliability of a network , 1988 .

[27]  Jose Emmanuel Ramirez-Marquez,et al.  Element substitution algorithm for general two-terminal network reliability analyses , 2007 .

[28]  K. Misra.  Reliability Analysis and Prediction: A Methodology Oriented Treatment , 1992 .

[29]  K. K. Aggarwal,et al.  Modification of cutsets for reliability evaluation of communication systems , 1982 .

[30]  Yuanlong Shen,et al.  A new simple algorithm for enumerating all minimal paths and cuts of a graph , 1995 .

[31]  S. Kuo,et al.  Determining terminal-pair reliability based on edge expansion diagrams using OBDD , 1999 .

[32]  G. Danielson,et al.  On finding the simple paths and circuits in a graph , 1968 .