Perfect sampling for infinite server and loss systems

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.

[1]  R. Adler.  An introduction to continuity, extrema, and related topics for general Gaussian processes , 1990 .

[2]  R. Tweedie,et al.  Perfect sampling of ergodic Harris chains , 2001 .

[3]  Avishai Mandelbaum,et al.  Statistical Analysis of a Telephone Call Center , 2005 .

[4]  Jing Dong,et al.  Sampling point processes on stable unbounded regions and exact simulation of queues , 2012, Proceedings Title: Proceedings of the 2012 Winter Simulation Conference (WSC).

[5]  Wilfrid S. Kendall,et al.  Perfect Simulation for the Area-Interaction Point Process , 1998 .

[6]  W. Kendall.  Geometric ergodicity and perfect simulation , 2004, math/0410012.

[7]  Karl Sigman,et al.  Exact simulation of the stationary distribution of the FIFO M/G/c queue , 2011, Journal of Applied Probability.

[8]  Henry Lam,et al.  Rare-Event Simulation for Many-Server Queues , 2012, Math. Oper. Res..

[9]  J. Blanchet,et al.  On exact sampling of stochastic perpetuities , 2011, Journal of Applied Probability.

[10]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.

[11]  R. Tweedie,et al.  Perfect simulation and backward coupling , 1998 .

[12]  James Allen Fill,et al.  Perfect Simulation of Vervaat Perpetuities , 2009 .

[13]  Karl Sigman,et al.  Exact simulation of the stationary distribution of the FIFO M/G/c queue: the general case for ρ , 2011, Queueing Systems.

[14]  P. Glynn,et al.  Simulating the maximum of a random walk , 2000 .

[15]  W. Kendall,et al.  Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes , 2000, Advances in Applied Probability.

[16]  Ana Busic,et al.  Perfect Sampling of Networks with Finite and Infinite Capacity Queues , 2012, ASMTA.

[17]  Michel Mandjes,et al.  Rare Event Simulation for Queues , 2009, Rare Event Simulation using Monte Carlo Methods.

[18]  S. Asmussen,et al.  Applied Probability and Queues , 1989 .

[19]  Stephen B. Connor,et al.  Correction. Perfect simulation for a class of positive recurrent Markov chains , 2007, 0711.0804.

[20]  J. Blanchet,et al.  Two-parameter Sample Path Large Deviations for Infinite-Server Queues , 2012 .

[21]  Glen Takahara,et al.  Perfect sampling for queues and network models , 2006, TOMC.

[22]  Sلأren Asmussen,et al.  Applied Probability and Queues , 1989 .

[23]  P. Ferrari,et al.  Perfect simulation for interacting point processes, loss networks and Ising models , 1999, math/9911162.

[24]  Guodong Pang,et al.  Two-parameter heavy-traffic limits for infinite-server queues , 2008, Queueing Syst. Theory Appl..

[25]  J. Propp,et al.  Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996 .