A Cutsets-Based Unified Framework to Evaluate Network Reliability Measures

This paper presents a minimal cutsets-based unified framework to evaluate some commonly used reliability measures: g-terminal, 2-terminal, and k-terminal reliability. In doing so, the paper proposes a single algorithm, which generates the network node sets. From these node sets, depending on the reliability measure(s), only those node sets are kept, which contains at least one node from the specified node set. These selected node sets form link-minimal cutsets. These minimal cutsets are used as an input to multi-variable inversion-based sum-of-disjoint product approach to obtain the unreliability expression thereafter. By solving several network examples of varied complexities, the comparison with the existing approach is provided.

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

[2]  J. Carlier,et al.  Factoring and reductions for networks with imperfect vertices , 1991 .

[3]  Rajesh Mishra,et al.  Comments on "An improved algorithm for connectivity analysis of distribution networks" [Reliab Eng Syst Saf 2007;92(10): 1295-302] , 2009, Reliab. Eng. Syst. Saf..

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

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

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

[7]  Neeraj Kumar Goyal,et al.  SNEM: a new approach to evaluate terminal pair reliability of communication networks , 2005 .

[8]  Sy-Yen Kuo,et al.  Efficient and Exact Reliability Evaluation for Networks With Imperfect Vertices , 2007, IEEE Transactions on Reliability.

[9]  Shyue-Kung Lu,et al.  OBDD-based evaluation of k-terminal network reliability , 2002, IEEE Trans. Reliab..

[10]  Suresh Rai,et al.  CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks , 1991, IEEE Trans. Parallel Distributed Syst..

[11]  Lavon B. Page,et al.  Reliability of directed networks using the factoring theorem , 1989 .

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

[13]  Mitthan Lal Kansal,et al.  An improved algorithm for connectivity analysis of distribution networks , 2007, Reliab. Eng. Syst. Saf..

[14]  Lavon B. Page,et al.  A practical implementation of the factoring theorem for network reliability , 1988 .

[15]  Mark K. Chang,et al.  Network reliability and the factoring theorem , 1983, Networks.

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

[17]  V. C. Prasad,et al.  Generation of K-Trees of undirected graphs , 1997 .

[18]  David W. Coit,et al.  Composite importance measures for multi-state systems with multi-state components , 2005, IEEE Transactions on Reliability.

[19]  S. Chaturvedi.  Irredundant Subset Cut Generation to Compute Capacity Related Reliability , 2007 .

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

[21]  L. C. Monticone.  An implementation of the Buzacott algorithm for network global-reliability , 1993 .

[22]  Suresh Rai,et al.  Experimental results on preprocessing of path/cut terms in sum of disjoint products technique , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

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

[24]  K. Misra,et al.  AN EFFICIENT MULTI-VARIABLE INVERSION ALGORITHM FOR RELIABILITY EVALUATION OF COMPLEX SYSTEMS USING PATH SETS , 2002 .

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

[26]  R. Kevin Wood.  Factoring Algorithms for Computing K-Terminal Network Reliability , 1986, IEEE Transactions on Reliability.

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

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

[29]  N.R. Malik,et al.  Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.

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

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

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

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

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

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