Statistical methods for diameter constrained reliability estimation in rare event scenarios

The object under study is a metric associated to each graph, called diameter constrained reliability. The exact evaluation of the diameter constrained reliability belongs to the class of NP-Hard problems, and becomes prohibitive in large graphs. In the literature, several estimation methods have been developed, inspired in statistics, combinatorics, algebra and other branches of knowledge. We are focused on the statistical evaluation of the diameter constrained reliability under rare event scenarios. Under these assumptions (highly reliable networks), Crude Monte Carlo method is not accurate. More sophisticated methods meet both accuracy and bounded relative error. We compare the performance of two variance reduction methods, to know, Approximate Zero Variance Importance Sampling (AZVIS) and Recursive Variance Reduction (RVR). These methods are compared to Crude Monte Carlo in terms of accuracy and computational effort. Numerical comparisons show the improvement in the global performance of these alternative statistical methods. The paper is closed with a discussion of novel hybrid methods to address network reliability analysis in robust networks, when failures represent a rare event.

[1]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[2]  Ronald L. Wasserstein,et al.  Monte Carlo: Concepts, Algorithms, and Applications , 1997 .

[3]  Ali Ridha Mahjoub,et al.  Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation , 2010, Math. Program..

[4]  Héctor Cancela,et al.  The recursive variance-reduction simulation algorithm for network reliability evaluation , 2003, IEEE Trans. Reliab..

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

[6]  Gerardo Rubino Network reliability evaluation , 1999 .

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

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

[9]  Gerardo Rubino,et al.  A new simulation method based on the RVR principle for the rare event network reliability problem , 2012, Ann. Oper. Res..

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

[11]  Gerardo Rubino,et al.  On computing the 2-diameter -constrained K -reliability of networks , 2013, Int. Trans. Oper. Res..

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

[13]  Eduardo Alberto Canale,et al.  Monte Carlo methods in diameter-constrained reliability , 2014, Opt. Switch. Netw..

[14]  Gerardo Rubino,et al.  Rare Event Simulation using Monte Carlo Methods , 2009 .