Efficient simulation of tail probabilities in a queueing model with heterogeneous servers

Open Access
Authors
Publication date 2018
Journal Stochastic Models
Volume | Issue number 34 | 2
Pages (from-to) 239-267
Organisations
  • Faculty of Science (FNWI) - Korteweg-de Vries Institute for Mathematics (KdVI)
Abstract This paper considers a multi-server queue with Markov-modulated Poisson input and server-dependent phase-type service times. We develop an efficient rare-event simulation technique to estimate the probability that the number of customers in this system reaches a high value. Relying on explicit bounds on the probability under consideration as well as the associated likelihood ratio, we succeed in proving that the proposed estimator is of bounded relative error. Simulation experiments illustrate the significant speed-up that can be achieved by the proposed algorithm.
Document type Article
Language English
Published at https://doi.org/10.1080/15326349.2018.1458629
Other links https://www.scopus.com/pages/publications/85045730767
Downloads
Efficient simulation of tail probabilities (Final published version)
Permalink to this page
Back