Skip to main content
Log in

The Cross-Entropy Method for Network Reliability Estimation

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Consider a network of unreliable links, modelling for example a communication network. Estimating the reliability of the network—expressed as the probability that certain nodes in the network are connected—is a computationally difficult task. In this paper we study how the Cross-Entropy method can be used to obtain more efficient network reliability estimation procedures. Three techniques of estimation are considered: Crude Monte Carlo and the more sophisticated Permutation Monte Carlo and Merge Process. We show that the Cross-Entropy method yields a speed-up over all three techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  • Alon, G., D.P. Kroese, T. Raviv, and R.Y. Rubinstein. (2005). “Application of the Cross-Entropy Method to the Buffer Allocation Problem in a Simulation-Based Environment. ” Annals of Operations Research 134, 137–151.

    Article  Google Scholar 

  • Barlow, R. and A. Marshall. (1964). “Bounds for Distributions with Monotone Hazard Rate, I and II. ” Ann. Maths. Statist. 35, 1234–1274.

    Google Scholar 

  • Barlow, R. and F. Proschan. (1975). Statistical Theory of Reliability and Life Testing. Holt, Rinehart & Wilson.

    Google Scholar 

  • Burtin, Y. and B. Pittel. (1972). “Asymptotic Estimates of the Reliability of a Complex System. ” Engrg. Cybern. 10(3), 445–451.

    Google Scholar 

  • Colbourn, C. (1987). The Combinatorics of Network Reliability. Oxford University Press.

  • Colbourn, C. and D. Harms. (1994). “Evaluating performability: Most probable states and bounds. ” Telecommunication Systems 2, 275–300.

    Article  Google Scholar 

  • de Boer, P., D. Kroese, S. Manor, and R.Y. Rubinstein. (2005). “A Tutorial on the Cross-Entropy Method. ” Annals of Operations Research 134, 19–67. http://www.cemethod.org.

    Article  Google Scholar 

  • de Boer, P.T. (2000). “Analysis and Efficient Simulation of Queueing Models of Telecommunication Systems. ” Ph.D. thesis, University of Twente.

  • de Boer, P.T. and V.F. Nicola. (2002). “Adaptive State-Dependent Importance Sampling Simulation of Markovian Queueing Networks. ” European Transactions on Telecommunications 13(4), 303–315.

    Article  Google Scholar 

  • de Boer, P.T., V.F. Nicola, and R.Y. Rubinstein. (2000). “Adaptive Importance Sampling Simulation of Queueing Networks. ” In Proceedings of the 2000 Winter Simulation Conference, Orlando, Florida, pp. 646–655.

  • de Boer, P. T., D.P. Kroese, and R.Y. Rubinstein. (2004). “A Fast Cross-Entropy Method for Estimating Buffer Overflows in Queueing Networks.” Management Science 50(7), 883–895.

    Article  Google Scholar 

  • de Mello, T.H. and R.Y. Rubinstein. (2002). “Rare Event Probability Estimation for Static Models Via Cross-Entropy and Importance Sampling. ” Submitted for publication.

  • Dubin, U. (2002). “The Cross-Entropy Method with Applications for Combinatorial Optimization. ” Master’s thesis, The Technion, Israel Institute of Technology, Haifa, Israel.

  • Easton, M. and C. Wong. (1980). “Sequential Destruction Method for Monte Carlo Evaluation of System Reliability. ” IEEE Transactions on Reliability R-29, 27–32.

    Article  Google Scholar 

  • Elperin, T., I.B. Gertsbakh, and M. Lomonosov. (1991). “Estimation of Network Reliability Using Graph Evolution Models. ” IEEE Transactions on Reliability 40(5), 572–581.

    Article  Google Scholar 

  • Elperin, T., I.B. Gertsbakh, and M. Lomonosov. (1992). “An Evolution Model for Monte Carlo Estimation of Equilibrium Network Renewal Parameters. ” Probability in the Engineering and Informational Sciences 6, 457–469.

    Article  Google Scholar 

  • Esary, J.D., F. Proschan, and D.W. Walkup. (1967). “Association of Random Variables, with Applications. ” Ann. math. Statist. 38, 1466–1474.

    Google Scholar 

  • Fishman, G. (1986). “A Monte Carlo Sampling Plan for Estimating Network Reliability. ” Operations Research 34(4), 581–594.

    Article  Google Scholar 

  • Gertsbakh, I.B. (2000). Reliability Theory with Application to Preventive Maintenance. Springer.

  • Helvik, B.E. and O. Wittner. (2001). “Using the Cross-Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks. ” In 3rd International Workshop on Mobile Agents for Telecommunication Applications - MATA’01.

  • Hui, K.-P., N. Bean, M. Kraetzl, and D.P. Kroese. (2003). “The Tree Cut and Merge Algorithm for Estimation of Network Reliability. ” Probability in the Engineering and Informational Sciences 17(1), 24–45.

    Article  Google Scholar 

  • Keith, J. and D.P. Kroese. (2002). “Sequence Alignment By Rare Event Simulation. ” In Proceedings of the 2002 Winter Simulation Conference, San Diego, pp. 320–327.

  • Kumamoto, H., K. Tanaka, K. Inoue, and E.J. Henley, (1980). “Dagger Sampling Monte Carlo for System Unavailability Evaluation. ” IEEE Transactions on Reliability R-29(2), 376–380.

    Article  Google Scholar 

  • Lieber, D. (1998). “Rare-Events Estimation Via Cross-Entropy and Importance Sampling. ” Ph.D. thesis, The Technion, Israel Institute of Technology, Haifa, Israel.

  • Lieber, D., R.Y. Rubinstein, and D. Elmakis. (1997). “Quick Estimation of Rare Events in Stochastic Networks. ” IEEE Transactions on Reliability 46, 254–265.

    Article  Google Scholar 

  • Lomonosov, M. (1994). “On Monte Carlo Estimates in Network Reliability. ” Probability in the Engineering and Informational Sciences 8, 245–264.

    Google Scholar 

  • Margolin, L. (2002). “Cross-Entropy Method for Combinatorial Optimization. ” Master’s thesis, The Technion, Israel Institute of Technology, Haifa, Israel.

  • Wittner O. and B.E. Helvik (2002). “Cross Entropy Guided Ant-like Agents Finding Dependable Primary/Backup Path Patterns in Networks. ” In Proceedings of Congress on Evolutionary Computation (CEC2002), Honolulu, Hawaii, IEEE.

    Google Scholar 

  • Provan, J. and M. Ball. (1982). “The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected. ” SIAM Journal of Computing 12, 777–787.

    Article  Google Scholar 

  • Rubinstein, R.Y. and D.P. Kroese. (2004). “The Cross-Entropy Method: A Unified Approach to Combinatorial Optimisation, Monte-Carlo simulation and Machine Learning. ” Springer.

  • Rubinstein, R.Y. and B. Melamed (1998). “Modern Simulation and Modeling. ” Wiley series in probability and Statistics.

  • Rubinstein, R.Y. (1997). “Optimization of Computer Simulation Models with Rare Events. ” European Journal of Operations Research 99, 89–112.

    Article  Google Scholar 

  • Rubinstein, R.Y. (1999). “The Cross-Entropy Method for Combinatorial and Continuous Optimization. ” Methodology and Computing in Applied Probability 2, 127–190.

    Article  Google Scholar 

  • Rubinstein, R.Y. (2001). “Combinatorial Optimization, Cross-Entropy, Ants and Rare Events. ” In S. Uryasev and P.M. Pardalos (eds.), Stochastic Optimization: Algorithms and Applications, Kluwer, pp. 304–358.

  • Rubinstein, R.Y. (2002). “The Cross-Entropy Method and Rare-Events for Maximal Cut and Bipartition Problems. ” ACM Transactions on Modelling and Computer Simulation 12(1), 303–315.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K.-P. Hui.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hui, KP., Bean, N., Kraetzl, M. et al. The Cross-Entropy Method for Network Reliability Estimation. Ann Oper Res 134, 101–118 (2005). https://doi.org/10.1007/s10479-005-5726-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-005-5726-x

Key words

Navigation