Importance sampling algorithms for first passage time probabilities in the infinite server queue

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

This paper applies importance sampling simulation for estimating rare event probabilities of the first passage time in the infinite server queue with renewal arrivals and general service time distributions. We consider importance sampling algorithms which are based on large deviations results of the infinite server queue, and we consider an algorithm based on the cross-entropy method, where we allow light-tailed and heavy-tailed distributions for the interarrival times and the service times. Efficiency of the algorithms is discussed by simulation experiments. © 2008 Elsevier B.V. All rights reserved.
Original languageEnglish
Pages (from-to)176-186
JournalEuropean Journal of Operational Research
Volume199
DOIs
Publication statusPublished - 2009

Fingerprint

Dive into the research topics of 'Importance sampling algorithms for first passage time probabilities in the infinite server queue'. Together they form a unique fingerprint.

Cite this