Asmussen, S. (2003). Applied Probability and Queues, 2nd edn.
Springer, New York.
Beskos, A. and Roberts, G. O. (2005). Exact simulation of diffusions. Ann. Appl. Prob.
Blanchet, J. and Dong, J. (2015). Perfect sampling for infinite server and loss systems. Adv. Appl. Prob.
Blanchet, J. and Wallwater, A. (2014). Exact sampling of stationary and time-reversed queues. Preprint. Available at http://arxiv.org/abs/1403.8117.
Borovkov, A. A. and Foss, S. G. (1992). Stochastically recursive sequences and their generalizations. Siberian Adv. Math.
Chen, X. and Blanchet, J. (2015). Steady-state simulation of reflected Brownian motion and related stochastic networks. To appear in Ann. Appl. Prob.
Connor, S. B. and Fort, G. (2009). State-dependent Foster–Lyapunov criteria for subgeometric convergence of Markov chains. Stoch. Proces. Appl.
Connor, S. B. and Kendall, W. S. (2007). Perfect simulation for a class of positive recurrent Markov chains. Ann. Appl. Prob.
17, 781–808, 1808–1810.
Ferrari, P. A., Fernández, R. and Garcia, N. L. (2002). Perfect simulation for interacting point processes, loss networks and Ising models. Stoch. Process. Appl.
Foss, S. and Korshunov, D. (2012). On large delays in multi-server queues with heavy tails. Math. Operat. Res.
Grimmett, G. (1995). The stochastic random-cluster process and the uniqueness of random-cluster measures. Ann. Prob.
Gupta, V., Harchol-Balter, M., Dai, J. G. and Zwart, B. (2010). On the inapproximability of M/G/K: why two moments of job size distribution are not enough. Queueing Systems
Hou, Z. and Liu, Y. (2004). Explicit criteria for several types of ergodicity of the embedded M/G/1 and GI/M/n queues. J. Appl. Prob.
Kendall, W. S. (1998). Perfect simulation for the area-interaction point process. In Probability Towards 2000, Springer, New York, pp. 218–234.
Kendall, W. S. (2004). Geometric ergodicity and perfect simulation. Electron. Commun. Prob.
Kendall, W. (2005). Notes on perfect simulation. In Markov Chain Monte Carlo, World Scientific, Hackensack, NJ, pp. 93–146.
Kendall, W. S. (2015). Coupling, local times, immersions. Bernoulli
Kendall, W. S. and M⊘ller, J. (2000). Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes. Adv. Appl. Prob.
Kiefer, J. and Wolfowitz, J. (1955). On the theory of queues with many servers. Trans. Amer. Math. Soc.
Loynes, R. M. (1962). The stability of a queue with non-independent interarrival and service times. Proc. Camb. Phil. Soc.
Meyn, S. and Tweedie, R. L. (2009). Markov Chains and Stochastic Stability, 2nd edn.
Cambridge University Press.
Mousavi, M. and Glynn, P. W. (2013). Exact simulation of non-stationary reflected Brownian motion. Preprint. Available at http://arxiv.org/abs/1312.6456.
Murdoch, D. J. and Takahara, G. (2006). Perfect sampling for queues and network models. ACM Trans. Model. Comput. Simul.
Propp, J. G. and Wilson, D. B. (1996). Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures Algorithms
Ross, S. M. (1996). Stochastic Processes, 2nd edn.
John Wiley, New York.
Shah, S. R. (2005). Perfection in conditioning and coverage. Doctoral thesis, Department of Statistics, University of Warwick.
Sigman, K. (2011). Exact simulation of the stationary distribution of the FIFO M/G/c queue. In New Frontiers in Applied Probability (J. Appl. Prob. Spec. Vol. 48A), Applied Probability Trust, Sheffield, pp. 209–213.
Sigman, K. (2012). Exact simulation of the stationary distribution of the FIFO M/G/c queue: the general case for ρ < c
. Queueing Systems
Wolff, R. W. (1977). An upper bound for multi-channel queues. J. Appl. Prob.
Wolff, R. W. (1987). Upper bounds on work in system for multichannel queues. J. Appl. Prob.