Sixty Years of Network Reliability

The study of network reliability started in 1956 with a groundbreaking paper by E.F. Moore and C.E. Shannon. They introduced a probabilistic model of network reliability, where the nodes of the network were considered to be perfectly reliable, and the links or edges could fail independently with a certain probability. The problem is to determine the probability that the network remains connected under these conditions. If all the edges have the same probability of failing, this leads to the so-called reliability polynomial of the network. Sixty years later, a lot of research has accumulated on this topic, and many variants of the original problem have been investigated. We review the basic concepts and results, as well as some recent developments in this area, and we outline some important research directions.

[1]  M. Kraetzl,et al.  Network Reliability: Experiments with a Symbolic Algebra Environment , 1995 .

[2]  Daryl D. Harms,et al.  Reliability polynomials can cross twice , 1993 .

[3]  Charles J. Colbourn,et al.  Lower bounds on two-terminal network reliability , 1988, Discret. Appl. Math..

[4]  Ilya Gertsbakh,et al.  Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo , 2009 .

[5]  Richard M. Van Slyke,et al.  Network reliability analysis: Part I , 1971, Networks.

[6]  Yoseph Shpungin,et al.  Network Reliability and Resilience , 2011, Springer Briefs in Electrical and Computer Engineering.

[7]  Indra Gunawan,et al.  Fundamentals of Reliability Engineering: Applications in Multistage Interconnection Networks , 2014 .

[8]  Jun-Ming Xu,et al.  On reliability of the folded hypercubes , 2007, Inf. Sci..

[9]  Derek H. Smith.  Optimally Reliable Graphs for Both Vertex and Edge Failures , 1993, Comb. Probab. Comput..

[10]  Juan Manuel Burgos,et al.  Factorization of network reliability with perfect nodes II: Connectivity matrix , 2016, Discret. Appl. Math..

[11]  Xiao-Dong Hu,et al.  Reliabilities of chordal rings , 1992, Networks.

[12]  Jason I. Brown,et al.  Uniformly optimal digraphs for strongly connected reliability , 2007, Networks.

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

[14]  Richard Ehrenborg,et al.  The average reliability of a graph , 2014, Discret. Appl. Math..

[15]  F. K. Hwang,et al.  Most reliable double loop networks in survival reliability , 1993, Networks.

[16]  Lynne L. Doty,et al.  On the construction of optimally reliable graphs , 1990, Networks.

[17]  Gil Zussman,et al.  The Resilience of WDM Networks to Probabilistic Geographical Failures , 2011, IEEE/ACM Transactions on Networking.

[18]  F. K. Hwang,et al.  Survival reliabilities of double loop networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[19]  Peter J. Slater,et al.  On the nonexistence of uniformly optimal graphs for pair-connected reliability , 1991, Networks.

[20]  Yoseph Shpungin,et al.  Ternary Networks - Reliability and Monte Carlo , 2014, Springer Briefs in Electrical and Computer Engineering.

[21]  Yinong Chen,et al.  Bounds on the reliability of distributed systems with unreliable nodes & links , 2004, IEEE Trans. Reliab..

[22]  Wolfgang Gaul,et al.  On reliability in stochastic graphs , 1982, Networks.

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

[24]  Yoseph Shpungin.  Networks with Unreliable Nodes and Edges: Monte Carlo Lifetime Estimation , 2007 .

[25]  J. S. Provan,et al.  Bounds on the reliability polynomial for shellable independence systems , 1982 .

[26]  Dirk L. Vertigan,et al.  The Computational Complexity of Tutte Invariants for Planar Graphs , 2005, SIAM J. Comput..

[27]  Lynne L. Doty.  Extremal connectivity and vulnerability in graphs , 1989, Networks.

[28]  F. T. Boesch.  On the synthesis of optimally reliable networks having unreliable nodes but reliable edges , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[29]  Jerry L. Trahan,et al.  Improved Lower Bounds on the Reliability of Hypercube Architectures , 1994, IEEE Trans. Parallel Distributed Syst..

[30]  Patrick Jaillet,et al.  On reliability of graphs with node failures , 1994, Networks.

[31]  P. Katerinis.  Toughness of graphs and the existence of factors , 1990, Discret. Math..

[33]  Appajosyula Satyanarayana,et al.  A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks , 1985, SIAM J. Comput..

[35]  Xiaofeng Guo,et al.  Fault tolerance of hypercubes and folded hypercubes , 2013, The Journal of Supercomputing.

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

[37]  Frank K. Hwang,et al.  Survival Reliability of Some Double-Loop Networks and Chordal Rings , 1995, IEEE Trans. Computers.

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

[39]  J.B. Dugan,et al.  A lower bound on the reliability of an n-dimensional hypercube , 1990, Proceedings Ninth Symposium on Reliable Distributed Systems.

[40]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[41]  Derek H. Smith.  Optimally reliable networks , 1991, Ann. Oper. Res..

[42]  A. Satyanarayana,et al.  Efficient Algorithms for the Evaluation of Planar Network Reliability , 1993 .

[43]  Stasys Jukna,et al.  Extremal Combinatorics - With Applications in Computer Science , 2001, Texts in Theoretical Computer Science. An EATCS Series.

[44]  Bernard Elspas,et al.  Topological constraints on interconnection-limited logic , 1964, SWCT.

[45]  Josep Domingo-Ferrer,et al.  On reliability indices of communication networks , 2009, Comput. Math. Appl..

[46]  Michael R. Dugas,et al.  On optimal system designs in reliability‐economics frameworks , 2007 .

[47]  A. T. Amin,et al.  On uniformly optimally reliable graphs for pair-connected reliability with vertex failures , 1993, Networks.

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

[49]  Héctor Cancela,et al.  Topological optimization of reliable networks under dependent failures , 2015, Oper. Res. Lett..

[50]  G. Kirchhoff.  Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .

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

[52]  J. Scott Provan,et al.  Calculating bounds on reachability and connectedness in stochastic networks , 1983, Networks.

[53]  Charles L. Suffel,et al.  Spanning Tree Results For Graphs And Multigraphs: A Matrix-Theoretic Approach , 2014 .

[54]  Rabi N. Mahapatra,et al.  Reliability analysis of hypercube multicomputers , 1997 .

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

[56]  Frank K. Hwang,et al.  A survey on multi-loop networks , 2003, Theor. Comput. Sci..

[57]  F. Spieksma,et al.  Effective graph resistance , 2011 .

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

[59]  Franco Robledo,et al.  On the Factorization of Network Reliability with Perfect Nodes , 2013 .

[60]  Pablo Romero,et al.  Full complexity analysis of the diameter-constrained reliability , 2015, Int. Trans. Oper. Res..

[61]  Emilia A. Monakhova,et al.  A Survey on Undirected circulant Graphs , 2012, Discret. Math. Algorithms Appl..

[62]  Charles J. Colbourn,et al.  Network resilience , 1987 .

[63]  Eduardo Alberto Canale,et al.  Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior , 2015, Networks.

[64]  Richard M. Karp,et al.  Monte-Carlo algorithms for the planar multiterminal network reliability problem , 1985, J. Complex..

[65]  Claudine Peyrat.  Diameter vulnerability of graphs , 1984, Discret. Appl. Math..

[66]  Wendy Myrvold.  Reliable Network Synthesis: Some Recent Developments , 1996 .

[67]  Jason Brown,et al.  On the roots of the node reliability polynomial , 2016, Networks.

[68]  I. Anderson.  Combinatorics of Finite Sets , 1987 .

[69]  Xiao-Dong Hu,et al.  Exact reliabilities of most reliable double-loop networks , 1997, Networks.

[70]  J. Dugan,et al.  Network s-t reliability bounds using a 2-dimensional reliability polynomial , 1994 .

[71]  David Tipper,et al.  Measuring the survivability of networks to geographic correlated failures , 2014, Opt. Switch. Netw..

[72]  N. Abreu.  Old and new results on algebraic connectivity of graphs , 2007 .

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

[74]  A. Satyanarayana,et al.  A linear-time algorithm to compute the reliability of planar cube-free networks , 1990 .

[75]  R. K. Wood,et al.  Note on "A Linear-Time Algorithm for Computing K-Terminal Reliability in a Series-Parallel Network" , 1996, SIAM J. Comput..

[76]  Kam-Hoi Cheng,et al.  Network reliability with node failures , 2000, Networks.

[77]  Aaron D. Wyner,et al.  Reliable Circuits Using Less Reliable Relays , 1993 .

[78]  Derek Smith,et al.  Optimally reliable graphs for both edge and vertex failures , 1986, Networks.

[79]  Francisco J. Samaniego,et al.  System Signatures and Their Applications in Engineering Reliability , 2007 .

[80]  Frank K. Hwang,et al.  Reliabilities of Double-Loop Networks , 1991, Probability in the Engineering and Informational Sciences.

[81]  F. Samaniego,et al.  On Uniformly Optimal Networks: A Reversal of Fortune? , 2014 .

[82]  Huajun Meng,et al.  Uniformly optimal graphs in some classes of graphs with node failures , 2010, Discret. Math..

[83]  Danielle Cox,et al.  On Network Reliability , 2013 .

[84]  Charles J. Colbourn,et al.  Edge-packing of graphs and network reliability , 1988, Discret. Math..

[85]  Shuguang Cui,et al.  Network Robustness under Large-Scale Attacks , 2013, SpringerBriefs in Computer Science.