An adaptive zero-variance importance sampling approximation for static network dependability evaluation

We propose an adaptive parameterized method to approximate the zero-variance change of measure for the evaluation of static network reliability models, with links subject to failures. The method uses two rough approximations of the unreliability function, conditional on the states of any subset of links being fixed. One of these approximations, based on mincuts, under-estimates the true unknown unreliability, whereas the other one, based on minpaths, over-estimates it. Our proposed change of measure takes a convex linear combination of the two, estimates the optimal (graph-dependent) coefficient in this combination from pilot runs, and uses the resulting conditional unreliability approximation at each step of a dynamic importance sampling algorithm. This new scheme is more general and more flexible than a previously proposed zero-variance approximation scheme, based on mincuts only, and which was shown to be robust asymptotically when unreliabilities of individual links decrease toward zero. Our numerical examples show that the new scheme is often more efficient when low unreliability comes from a large number of possible paths connecting the considered nodes rather than from small failure probabilities of the links.

[1]  Reuven Y. Rubinstein,et al.  Cross-entropy and rare events for maximal cut and partition problems , 2002, TOMC.

[2]  Dirk P. Kroese,et al.  The Cross Entropy Method: A Unified Approach To Combinatorial Optimization, Monte-carlo Simulation (Information Science and Statistics) , 2004 .

[3]  P. Glynn,et al.  Stochastic optimization by simulation: numerical experiments with the M / M /1 queue in steady-state , 1994 .

[4]  Brian D. Ripley,et al.  Stochastic Simulation , 2005 .

[5]  Tim Hesterberg,et al.  Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control , 2004, Technometrics.

[6]  Pierre L'Ecuyer,et al.  On the Convergence Rates of IPA and FDC Derivative Estimators , 1990, Oper. Res..

[7]  S. Juneja,et al.  Rare-event Simulation Techniques : An Introduction and Recent Advances , 2006 .

[8]  Richard E. Barlow,et al.  Statistical Theory of Reliability and Life Testing: Probability Models , 1976 .

[9]  Bruno Tuffin,et al.  Approximating zero-variance importance sampling in a reliability setting , 2011, Ann. Oper. Res..

[10]  PasupathyRaghu,et al.  The stochastic root-finding problem , 2011 .

[11]  Lih-Yuan Deng,et al.  The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning , 2006, Technometrics.

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

[13]  Henry Lam,et al.  Rare event simulation techniques , 2011, Proceedings of the 2011 Winter Simulation Conference (WSC).

[14]  Carlos S. Kubrusly,et al.  Stochastic approximation algorithms and applications , 1973, CDC 1973.

[15]  B. K. Ghosh,et al.  Handbook of sequential analysis , 1991 .

[16]  P. L’Ecuyer,et al.  A Unified View of the IPA, SF, and LR Gradient Estimation Techniques , 1990 .

[17]  P. Shahabuddin,et al.  Chapter 11 Rare-Event Simulation Techniques: An Introduction and Recent Advances , 2006, Simulation.

[18]  Gang George Yin,et al.  Budget-Dependent Convergence Rate of Stochastic Approximation , 1995, SIAM J. Optim..

[19]  Bruno Tuffin,et al.  Approximate zero-variance simulation , 2008, 2008 Winter Simulation Conference.

[20]  Peter W. Glynn,et al.  Asymptotic robustness of estimators in rare-event simulation , 2007, TOMC.

[21]  James C. Spall,et al.  Introduction to stochastic search and optimization - estimation, simulation, and control , 2003, Wiley-Interscience series in discrete mathematics and optimization.

[22]  Dirk P. Kroese,et al.  Handbook of Monte Carlo Methods , 2011 .

[23]  Gerardo Rubino,et al.  Monte Carlo estimation of diameter-constrained network reliability conditioned by pathsets and cutsets , 2013, Comput. Commun..

[24]  Dennis D. Cox,et al.  Adaptive importance sampling on discrete Markov chains , 1999 .

[25]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[26]  James C. Spall,et al.  Introduction to Stochastic Search and Optimization. Estimation, Simulation, and Control (Spall, J.C. , 2007 .

[27]  Sujin Kim,et al.  The stochastic root-finding problem: Overview, solutions, and open questions , 2011, TOMC.

[28]  Boris Polyak,et al.  Acceleration of stochastic approximation by averaging , 1992 .

[29]  Pierre L'Ecuyer,et al.  Importance Sampling in Rare Event Simulation , 2009, Rare Event Simulation using Monte Carlo Methods.

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

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