Estimating buffer overflows in three stages using cross-entropy

P.T. de Boer, D.P. Kroese, R.Y. Rubinstein

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

    18 Citations (Scopus)
    60 Downloads (Pure)

    Abstract

    In this paper we propose a fast adaptive Importance Sampling method for the efficient simulation of buffer overflow probabilities in queueing networks. The method comprises three stages. First we estimate the minimum Cross-Entropy tilting parameter for a small buffer level; next, we use this as a starting value for the estimation of the optimal tilting parameter for the actual (large) buffer level; finally, the tilting parameter just found is used to estimate the overflow probability of interest. We recognize three distinct properties of the method which together explain why the method works well; we conjecture that they hold for quite general queueing networks. Numerical results support this conjecture and demonstrate the high efficiency of the proposed algorithm.
    Original languageEnglish
    Title of host publicationProceedings of the 2002 Winter Simulation Conference (WSC 2002)
    EditorsE. Yücesan, C.-H. Chen, J.L. Snowdon, J.M. Charnes
    Place of PublicationPiscataway, NJ
    PublisherIEEE
    Pages301-309
    Number of pages9
    ISBN (Print)0-7803-7615-3, 0-7803-7614-5
    DOIs
    Publication statusPublished - Dec 2002
    Event2002 Winter Simulation Conference - San Diego, United States
    Duration: 8 Dec 200211 Dec 2002

    Conference

    Conference2002 Winter Simulation Conference
    Abbreviated titleWSC 2002
    Country/TerritoryUnited States
    CitySan Diego
    Period8/12/0211/12/02

    Keywords

    • 2023 OA procedure

    Fingerprint

    Dive into the research topics of 'Estimating buffer overflows in three stages using cross-entropy'. Together they form a unique fingerprint.

    Cite this