Monte Carlo estimation of diameter-constrained network reliability conditioned by pathsets and cutsets

The d-diameter-constrained K-reliability (DCR) problem in networks is an extension of the classical problem of computing the K-reliability (CLR) where the subnetwork resulting from the failure of some edges is operational if and only if all nodes in a set of ''terminal nodes''K have pairwise distances not greater than a certain integer d. Computing the CLR is NP-hard, which has motivated the development of simulation schemes, among which a family of Monte Carlo sampling plans that make use of upper and lower reliability bounds to reduce the variance attained after drawing a given number of samples. The DCR is receiving increasing attention in contexts like video-conferencing and peer-to-peer networks; since it is an extension of the CLR computing it is also NP-hard. This paper extends the mentioned family of Monte Carlo sampling plans from the context of the CLR to that of the DCR. The plans are described in detail focusing on their requirements and limitations. The implications that the diameter constraints have on the topological components employed for computing the bounds (pathsets and cutsets) are discussed. Test cases on sparse and dense topologies are presented to illustrate how the presence of a diameter constraint, its value and the size of the set of terminal nodes affect the performance of the methods. It is also illustrated that the performance improvements achieved over the crude Monte Carlo method tend to be higher in the context of the DCR when compared to the CLR.

[1]  Francesco Maffioli,et al.  Fishman's sampling plan for computing network reliability , 2001, IEEE Trans. Reliab..

[2]  I. L. Belfore.  An O(n/spl middot/(log/sub 2/(n))/sup 2/) algorithm for computing the reliability of k-out-of-n:G and k-to-l-out-of-n:G systems , 1995 .

[3]  Héctor Cancela,et al.  On the characterization of the domination of a diameter-constrained network reliability model , 2006, Discret. Appl. Math..

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

[5]  Christian Tanguy,et al.  Exact solutions for the two- and all-terminal reliabilities of a simple ladder network , 2006, ArXiv.

[6]  L. Petingi.  A diameter-constrained network reliability model to determine the probability that a communication network meets delay constraints , 2008 .

[7]  George S. Fishman,et al.  A Monte Carlo Sampling Plan for Estimating Network Reliability , 1984, Oper. Res..

[8]  R. E. Barlow,et al.  Computing k-out-of-n System Reliability , 1984, IEEE Transactions on Reliability.

[9]  G. Arulmozhi.  Direct method for reliability computation of k-out-of-n: G systems , 2003, Appl. Math. Comput..

[10]  Pierre L'Ecuyer,et al.  Analysis and Improvements of Path-based Methods for Monte Carlo Reliability Evaluation of Static Models , 2010 .

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

[12]  Héctor Cancela,et al.  Reliability of communication networks with delay constraints: computational complexity and complete topologies , 2004, Int. J. Math. Math. Sci..

[13]  Christian Tanguy.  Exact two-terminal reliability of some directed networks , 2007, 2007 6th International Workshop on Design and Reliable Communication Networks.

[14]  Gerardo Rubino,et al.  Static Network Reliability Estimation via Generalized Splitting , 2013, INFORMS J. Comput..

[15]  Héctor Cancela,et al.  Properties of a generalized source-to-all-terminal network reliability model with diameter constraints , 2007 .

[16]  Petr A. Golovach,et al.  Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms , 2009, IWPEC.

[17]  Hiromitsu Kumamoto,et al.  Efficient Evaluation of System Reliability by Monte Carlo Method , 1977, IEEE Transactions on Reliability.

[18]  Gerardo Rubino,et al.  Combination of conditional Monte Carlo and approximate zero-variance importance sampling for network reliability estimation , 2010, Proceedings of the 2010 Winter Simulation Conference.

[19]  Héctor Cancela,et al.  Polynomial-Time Topological Reductions That Preserve the Diameter Constrained Reliability of a Communication Network , 2011, IEEE Transactions on Reliability.

[20]  Gerardo Rubino,et al.  Approximate Zero-Variance Importance Sampling for Static Network Reliability Estimation , 2011, IEEE Transactions on Reliability.

[21]  Michael O. Ball.  Computing Network Reliability , 1979, Oper. Res..

[22]  Marco Laumanns,et al.  High‐confidence estimation of small s‐t reliabilities in directed acyclic networks , 2011, Networks.

[23]  H. Cancela,et al.  Diameter constrained network reliability :exact evaluation by factorization and bounds , 2001 .

[24]  George S. Fishman.  A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness , 1986, IEEE Transactions on Reliability.

[25]  Charles L. Suffel,et al.  A survey of some network reliability analysis and synthesis results , 2009 .

[26]  Gerardo Rubino,et al.  Rare Event Analysis by Monte Carlo Techniques in Static Models , 2009, Rare Event Simulation using Monte Carlo Methods.