A survey of some network reliability analysis and synthesis results

The purpose of this article is to introduce several results concerning the analysis and synthesis of reliable or invulnerable networks. First, the notion of signed reliability domination of systems is described and some applications to reliability analysis are reviewed. Then the analysis problem is considered and a brief summary of the difficulty of calculating various reliability measures is presented. Some relevant concepts in the synthesis of a most reliable network are studied. The article concludes with an introduction to a non-probabilistic approach to evaluate the vulnerability of a network. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009

[1]  Appajosyula Satyanarayana,et al.  A reliability-improving graph transformation with applications to network reliability , 1992, Networks.

[2]  José Rodríguez,et al.  A new technique for the characterization of graphs with a maximum number of spanning trees , 2002, Discret. Math..

[3]  Jixiang Meng,et al.  On a kind of restricted edge connectivity of graphs , 2002, Discret. Appl. Math..

[4]  Klaus Sutner,et al.  The Complexity of the Residual Node Connectedness Reliability Problem , 1991, SIAM J. Comput..

[5]  A. Kelmans.  On graphs with randomly deleted edges , 1981 .

[6]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[7]  Guifang Wang.  A proof of Boesch's conjecture , 1994, Networks.

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

[9]  Wayne Goddard,et al.  Graphs with Maximum Edge-Integrity , 1997, Ars Comb..

[10]  Wendy Myrvold,et al.  Maximizing spanning trees in almost complete graphs , 1997 .

[11]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[12]  S. Louis Hakimi,et al.  On Computing a Conditional Edge-Connectivity of a Graph , 1988, Inf. Process. Lett..

[13]  Vasek Chvátal,et al.  Tough graphs and hamiltonian circuits , 1973, Discret. Math..

[14]  H. Whitney.  A logical expansion in mathematics , 1932 .

[15]  Ching-Shui Cheng,et al.  Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimum design theory , 1981, J. Comb. Theory B.

[16]  A. Satyanarayana,et al.  Efficient algorithms for reliability analysis of planar networks - a survey , 1986, IEEE Transactions on Reliability.

[17]  Wendy Myrvold,et al.  Uniformly-most reliable networks do not always exist , 1991, Networks.

[18]  Arne Bang Huseby.  Domination theory and the crapo β-invariant , 1989, Networks.

[19]  Douglas Bauer,et al.  Combinatorial optimization problems in the analysis and design of probabilistic networks , 1985, Networks.

[20]  D. R. Shier,et al.  Maximizing the number of spanning trees in a graph with n nodes and m edges , 1974 .

[21]  R. V. Slyke,et al.  On the validity of a reduction of reliable network design to a graph extremal problem , 1987 .

[22]  A. Satyanarayana,et al.  Some Alternate Characterizations of Reliability Domination , 1990, Probability in the Engineering and Informational Sciences.

[23]  John T. Saccoman,et al.  Uniformly optimally reliable graphs , 1998 .

[24]  F. Boesch.  Synthesis of reliable networks - a survey , 1986, IEEE Transactions on Reliability.

[25]  Xiaoming Li,et al.  On the existence of uniformly optimally reliable networks , 1991, Networks.

[26]  Charles L. Suffel,et al.  On the characterization of graphs with maximum number of spanning trees , 1998, Discret. Math..

[27]  Lynne L. Doty.  A large class of maximally tough graphs , 1991 .

[28]  J. Scott Provan,et al.  The Complexity of Reliability Computations in Planar and Acyclic Graphs , 1986, SIAM J. Comput..

[29]  A. Satyanarayana,et al.  Chromatic polynomials and network reliability , 1987, Discret. Math..

[30]  F. Harary.  THE MAXIMUM CONNECTIVITY OF A GRAPH. , 1962, Proceedings of the National Academy of Sciences of the United States of America.

[31]  Charles J. Colbourn,et al.  Computing Residual Connectedness Reliability for Restricted Networks , 1993, Discret. Appl. Math..

[32]  A. Kelmans,et al.  A certain polynomial of a graph and graphs with an extremal number of trees , 1974 .

[33]  A. Satyanarayana,et al.  A Unified Formula for Analysis of Some Network Reliability Problems , 1982, IEEE Transactions on Reliability.

[34]  C. Colbourn,et al.  Computing 2-terminal reliability for radio-broadcast networks , 1989 .

[35]  W. T. Tutte,et al.  A Contribution to the Theory of Chromatic Polynomials , 1954, Canadian Journal of Mathematics.

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

[37]  A. Satyanarayana,et al.  New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks , 1978 .

[38]  Edward F. Schmeichel,et al.  Toughness in Graphs – A Survey , 2006, Graphs Comb..

[39]  Alexander Kelmans.  On graphs with the maximum number of spanning trees , 1996 .