J. Abate and W. Whitt, Transient Behavior of the M/M/1 Queue: Starting at the Origin Queueing Syst, pp.41-65, 1987.

C. Alexopoulos and D. Goldsman, To batch or not to batch?, ACM Transactions on Modeling and Computer Simulation, vol.14, issue.1, pp.76-114, 2004.
DOI : 10.1145/974734.974738

S. Andradóttir and M. Hosseini-nasab, Efficiency of Time Segmentation Parallel Simulation of Finite Markovian Queueing Networks, Operations Research, vol.51, issue.2, pp.272-280, 2003.
DOI : 10.1287/opre.51.2.272.12778

J. Anselmi and B. Gaujal, On the efficiency of perfect simulation in monotone queueing networks, ACM SIGMETRICS Performance Evaluation Review, vol.39, issue.2, pp.56-58, 2011.
DOI : 10.1145/2034832.2034847

URL : https://hal.archives-ouvertes.fr/hal-00788800

S. Balsamo, V. De-nitto-personé, and R. Onvural, Analysis of queueing networks with blocking. International series in operations research and management science, 2001.

F. Baskett, K. M. Chandy, R. Muntz, and F. G. , Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, Journal of the ACM, vol.22, issue.2, pp.248-260, 1975.
DOI : 10.1145/321879.321887

U. and N. Bhat, An Introduction to Queueing Theory: Modeling and Analysis in Applications, 2008.

G. Bolch, S. Greiner, H. De-meer, and K. Trivedi, Queueing Networks and Markov Chains, 2005.

P. Bremaud, Markov Chains, Gibbs Fields, Monte Carlo Simulation and Queues, Texts in Applied Mathematics, 1999.

W. Chen and C. A. O-'cinneide, Towards a polynomial-time randomized algorithm for closed product-form networks, ACM Transactions on Modeling and Computer Simulation, vol.8, issue.3, pp.227-253, 1998.
DOI : 10.1145/290274.290277

J. Dopper, B. Gaujal, and J. Vincent, Bounds for the coupling time in queueing networks perfect simulation, Celebration of the 100th anniversary of Markov, pp.117-136, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00070197

J. R. Jackson, Jobshop-Like Queueing Systems, Management Science, vol.10, issue.1, p.131, 1963.
DOI : 10.1287/mnsc.10.1.131

F. Kelly, Reversibility and Stochastic Networks, 1979.

J. G. Kemeny and J. L. Snell, Finite Markov chains. VanNostrand, University series in undergraduate mathematics, 1969.

S. Kijima and T. Matsui, Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers, SIAM Journal on Computing, vol.38, issue.4, pp.1484-1503, 2008.
DOI : 10.1137/06064980X

S. Kijima and T. Matsui, Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers, Annals of Operations Research, vol.16, issue.2, pp.35-55, 2008.
DOI : 10.1007/s10479-008-0317-2

D. A. Levin, Y. Peres, and E. L. Wilmer, Markov Chains and Mixing Times, 2008.
DOI : 10.1090/mbk/058

W. A. Massey, An operator-analytic approach to the Jackson network, Journal of Applied Probability, vol.21, issue.02, pp.379-393, 1984.
DOI : 10.2307/1427230

A. Müller and D. Stoyan, Comparison methods for stochastic models and risks, 2002.

J. G. Propp and D. B. Wilson, Exact sampling with coupled Markov chains and applications to statistical mechanics, Random Structures and Algorithms, vol.9, issue.1-2, pp.223-252, 1996.
DOI : 10.1002/(SICI)1098-2418(199608/09)9:1/2<223::AID-RSA14>3.0.CO;2-O

J. Vincent, Perfect Generation, Monotonicity and Finite Queueing Networks, 2008 Fifth International Conference on Quantitative Evaluation of Systems, p.319, 2008.
DOI : 10.1109/QEST.2008.51

W. Whitt, The Efficiency of One Long Run Versus Independent Replications in Steady-State Simulation, Management Science, vol.37, issue.6, pp.645-666, 1991.
DOI : 10.1287/mnsc.37.6.645