Reliability maximization in stochastic binary systems

A Stochastic Binary System (SBS) is a mathematical model of multi-component on-off systems subject to random failures. This model is an extension of network reliability models (where the components are either nodes or links). The reliability maximization is a major network design problem, where the goal is to find the network that maximizes the reliability subject to budget constraints. Even though the problem is computationally hard, the scientific literature offers uniformly most-reliable graphs for specific cases, and necessary criteria for optimality. The concept of uniformly most-reliable stochastic binary system is here introduced. We discuss some basic aspects which must be taken into account to develop a theory of reliability maximization in this setting: computational complexity, necessary conditions for reliability maximization and shared results with the classical theory for network design.

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

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

[3]  L. Schoppmann,et al.  Uniformly least reliable graphs , 1996, Networks.

[4]  C. R. Tripathy,et al.  Network reliability optimization problem of interconnection network under node-edge failure model , 2012, Appl. Soft Comput..

[5]  Appajosyula Satyanarayana,et al.  A survey of some network reliability analysis and synthesis results , 2009, Networks.

[6]  Béla Bollobás,et al.  Random Graphs , 1985 .

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

[8]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[9]  Pablo Romero,et al.  Building uniformly most-reliable networks by iterative augmentation , 2017, 2017 9th International Workshop on Resilient Networks Design and Modeling (RNDM).

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

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

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

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

[14]  Eduardo Alberto Canale,et al.  Recursive Variance Reduction method in stochastic monotone binary systems , 2015, 2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM).

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

[16]  Teresa Gomes,et al.  An effective algorithm for computing all‐terminal reliability bounds , 2015, Networks.

[17]  Clyde L. Monma,et al.  Minimum-weight two-connected spanning networks , 1990, Math. Program..

[18]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[19]  Pablo Romero,et al.  Duality in stochastic binary systems , 2016, 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM).

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

[21]  A. Rosenthal.  Computing the Reliability of Complex Networks , 1977 .

[22]  Michael O. Ball,et al.  Complexity of network reliability computations , 1980, Networks.

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

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