Skip to main content

Perfect sampling for infinite server and loss systems

  • Jose Blanchet (a1) and Jing Dong (a1)

We present the first class of perfect sampling (also known as exact simulation) algorithms for the steady-state distribution of non-Markovian loss systems. We use a variation of dominated coupling from the past. We first simulate a stationary infinite server system backwards in time and analyze the running time in heavy traffic. In particular, we are able to simulate stationary renewal marked point processes in unbounded regions. We then use the infinite server system as an upper bound process to simulate the loss system. The running time analysis of our perfect sampling algorithm for loss systems is performed in the quality-driven (QD) and the quality-and-efficiency-driven regimes. In both cases, we show that our algorithm achieves subexponential complexity as both the number of servers and the arrival rate increase. Moreover, in the QD regime, our algorithm achieves a nearly optimal rate of complexity.

Corresponding author
Postal address: Department of Industrial Engineering and Operations Research, Columbia University, New York, NY 10027, USA. Email address:
∗∗ Current address: Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL 60208, USA. Email address:
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Advances in Applied Probability
  • ISSN: 0001-8678
  • EISSN: 1475-6064
  • URL: /core/journals/advances-in-applied-probability
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


MSC classification


Full text views

Total number of HTML views: 0
Total number of PDF views: 18 *
Loading metrics...

Abstract views

Total abstract views: 105 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 17th August 2018. This data will be updated every 24 hours.