IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v189y2011i1p167-18510.1007-s10479-009-0608-2.html
   My bibliography  Save this article

A combined splitting—cross entropy method for rare-event probability estimation of queueing networks

Author

Listed:
  • M. Garvels

Abstract

We present a fast algorithm for the efficient estimation of rare-event (buffer overflow) probabilities in queueing networks. Our algorithm presents a combined version of two well known methods: the splitting and the cross-entropy (CE) method. We call the new method SPLITCE. In this method, the optimal change of measure (importance sampling) is determined adaptively by using the CE method. Simulation results for a single queue and queueing networks of the ATM-type are presented. Our numerical results demonstrate higher efficiency of the proposed method as compared to the original splitting and CE methods. In particular, for a single server queue example we demonstrate numerically that both the splitting and the SPLITCE methods can handle our buffer overflow example problems with both light and heavy tails efficiently. Further research must show the full potential of the proposed method. Copyright Springer Science+Business Media, LLC 2011

Suggested Citation

  • M. Garvels, 2011. "A combined splitting—cross entropy method for rare-event probability estimation of queueing networks," Annals of Operations Research, Springer, vol. 189(1), pages 167-185, September.
    • Handle: RePEc:spr:annopr:v:189:y:2011:i:1:p:167-185:10.1007/s10479-009-0608-2
    DOI: 10.1007/s10479-009-0608-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-009-0608-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-009-0608-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Reuven Rubinstein, 1999. "The Cross-Entropy Method for Combinatorial and Continuous Optimization," Methodology and Computing in Applied Probability, Springer, vol. 1(2), pages 127-190, September.
    2. Reuven Rubinstein, 2009. "The Gibbs Cloner for Combinatorial Optimization, Counting and Sampling," Methodology and Computing in Applied Probability, Springer, vol. 11(4), pages 491-549, December.
    3. Paul Glasserman & Philip Heidelberger & Perwez Shahabuddin & Tim Zajic, 1999. "Multilevel Splitting for Estimating Rare Event Probabilities," Operations Research, INFORMS, vol. 47(4), pages 585-600, August.
    4. P. T. de Boer & D. P. Kroese & R. Y. Rubinstein, 2004. "A Fast Cross-Entropy Method for Estimating Buffer Overflows in Queueing Networks," Management Science, INFORMS, vol. 50(7), pages 883-895, July.
    5. Peter W. Glynn & Ward Whitt, 1992. "The Asymptotic Efficiency of Simulation Estimators," Operations Research, INFORMS, vol. 40(3), pages 505-520, June.
    6. Zdravko I. Botev & Dirk P. Kroese, 2008. "An Efficient Algorithm for Rare-event Probability Estimation, Combinatorial Optimization, and Counting," Methodology and Computing in Applied Probability, Springer, vol. 10(4), pages 471-505, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Turati, Pietro & Pedroni, Nicola & Zio, Enrico, 2016. "Advanced RESTART method for the estimation of the probability of failure of highly reliable hybrid dynamic systems," Reliability Engineering and System Safety, Elsevier, vol. 154(C), pages 117-126.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Reuven Rubinstein, 2013. "Stochastic Enumeration Method for Counting NP-Hard Problems," Methodology and Computing in Applied Probability, Springer, vol. 15(2), pages 249-291, June.
    2. K.-P. Hui & N. Bean & M. Kraetzl & Dirk Kroese, 2005. "The Cross-Entropy Method for Network Reliability Estimation," Annals of Operations Research, Springer, vol. 134(1), pages 101-118, February.
    3. Kleijnen, Jack P.C. & Ridder, A.A.N. & Rubinstein, R.Y., 2010. "Variance Reduction Techniques in Monte Carlo Methods," Other publications TiSEM 87680d1a-53c1-4107-ada4-7, Tilburg University, School of Economics and Management.
    4. Kaynar, Bahar & Ridder, Ad, 2010. "The cross-entropy method with patching for rare-event simulation of large Markov chains," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1380-1397, December.
    5. Tito Homem-de-Mello, 2007. "A Study on the Cross-Entropy Method for Rare-Event Probability Estimation," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 381-394, August.
    6. Hao Ma & Henk A. P. Blom, 2022. "Random Assignment Versus Fixed Assignment in Multilevel Importance Splitting for Estimating Stochastic Reach Probabilities," Methodology and Computing in Applied Probability, Springer, vol. 24(4), pages 2313-2338, December.
    7. Ali Eshragh & Jerzy Filar & Michael Haythorpe, 2011. "A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem," Annals of Operations Research, Springer, vol. 189(1), pages 103-125, September.
    8. Ali Kadhem, Athraa & Abdul Wahab, Noor Izzri & Aris, Ishak & Jasni, Jasronita & Abdalla, Ahmed N., 2017. "Computational techniques for assessing the reliability and sustainability of electrical power systems: A review," Renewable and Sustainable Energy Reviews, Elsevier, vol. 80(C), pages 1175-1186.
    9. Radislav Vaisman & Dirk P. Kroese, 2017. "Stochastic Enumeration Method for Counting Trees," Methodology and Computing in Applied Probability, Springer, vol. 19(1), pages 31-73, March.
    10. Youngjun Choe & Henry Lam & Eunshin Byon, 2018. "Uncertainty Quantification of Stochastic Simulation for Black-box Computer Experiments," Methodology and Computing in Applied Probability, Springer, vol. 20(4), pages 1155-1172, December.
    11. Reuven Rubinstein, 2010. "Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms Do Not Work and How to Make them Work," Methodology and Computing in Applied Probability, Springer, vol. 12(1), pages 1-50, March.
    12. Fabian Dickmann & Nikolaus Schweizer, 2014. "Faster Comparison of Stopping Times by Nested Conditional Monte Carlo," Papers 1402.0243, arXiv.org.
    13. Fatma Başoğlu Kabran & Ali Devin Sezer, 2022. "Approximation of the exit probability of a stable Markov modulated constrained random walk," Annals of Operations Research, Springer, vol. 310(2), pages 431-475, March.
    14. Giesecke, K. & Schwenkler, G., 2019. "Simulated likelihood estimators for discretely observed jump–diffusions," Journal of Econometrics, Elsevier, vol. 213(2), pages 297-320.
    15. Catanzaro, Daniele & Pesenti, Raffaele & Ronco, Roberto, 2023. "Job scheduling under Time-of-Use energy tariffs for sustainable manufacturing: a survey," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1091-1109.
    16. Mattrand, C. & Bourinet, J.-M., 2014. "The cross-entropy method for reliability assessment of cracked structures subjected to random Markovian loads," Reliability Engineering and System Safety, Elsevier, vol. 123(C), pages 171-182.
    17. R. Y. Rubinstein, 2005. "A Stochastic Minimum Cross-Entropy Method for Combinatorial Optimization and Rare-event Estimation," Methodology and Computing in Applied Probability, Springer, vol. 7(1), pages 5-50, March.
    18. Guay, François & Schwenkler, Gustavo, 2021. "Efficient estimation and filtering for multivariate jump–diffusions," Journal of Econometrics, Elsevier, vol. 223(1), pages 251-275.
    19. András Lörincz & Zsolt Palotai & Gábor Szirtes, 2012. "Efficient Sparse Coding in Early Sensory Processing: Lessons from Signal Recovery," PLOS Computational Biology, Public Library of Science, vol. 8(3), pages 1-14, March.
    20. D.D. Riley & X. Koutsoukos, 2014. "Probabilistic verification of a biodiesel production system using statistical model checking," Mathematical and Computer Modelling of Dynamical Systems, Taylor & Francis Journals, vol. 20(5), pages 452-469, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:189:y:2011:i:1:p:167-185:10.1007/s10479-009-0608-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.