V. Anantharam, Probabilistic proof of the interchangeability of ./M/1 queues in series, Queueing Systems, vol.16, issue.4, pp.387-392, 1987.
DOI : 10.1007/BF01150050

Y. Baryshnikov, GUEs and queues, Probability Theory and Related Fields, vol.119, issue.2, pp.256-274, 2001.
DOI : 10.1007/PL00008760

A. Bedekar and M. Azizo?gluazizo?glu, The information-theoretic capacity of discrete-time queues, IEEE Transactions on Information Theory, vol.44, issue.2, pp.446-461, 1998.
DOI : 10.1109/18.661496

P. Brémaud, Point Processes and Queues-Martingale Dynamics, 1981.

P. Burke, The Output of a Queuing System, Operations Research, vol.4, issue.6, pp.699-704, 1956.
DOI : 10.1287/opre.4.6.699

D. Daley, D. Vere, and -. , An Introduction to the Theory of Point Processes, 1988.

P. Glynn and W. Whitt, Departures from Many Queues in Series, The Annals of Applied Probability, vol.1, issue.4, pp.546-572, 1991.
DOI : 10.1214/aoap/1177005838

B. Hambly, J. Martin, and N. O. Connell, Pitman's $2M-X$ Theorem for Skip-Free Random Walks with Markovian Increments, Electronic Communications in Probability, vol.6, issue.0, pp.73-77, 2001.
DOI : 10.1214/ECP.v6-1036

J. Harrison and R. Williams, On the Quasireversibility of a Multiclass Brownian Service Station, The Annals of Probability, vol.18, issue.3, pp.1249-1268, 1990.
DOI : 10.1214/aop/1176990745

F. P. Kelly, Reversibility and Stochastic Networks, 1979.

D. Knuth, Permutations, matrices, and generalized Young tableaux, Pacific Journal of Mathematics, vol.34, issue.3, pp.709-727, 1970.
DOI : 10.2140/pjm.1970.34.709
URL : http://projecteuclid.org/download/pdf_1/euclid.pjm/1102971948

W. König, N. O. Connell, and S. Roch, Non-Colliding Random Walks, Tandem Queues, and Discrete Orthogonal Polynomial Ensembles, Electronic Journal of Probability, vol.7, issue.0, pp.1-24, 2002.
DOI : 10.1214/EJP.v7-104

E. Muth, The Reversibility Property of Production Lines, Management Science, vol.25, issue.2, pp.152-158, 1979.
DOI : 10.1287/mnsc.25.2.152

N. O. Connell, Conditioned random walks and the RSK correspondence, Journal of Physics A: Mathematical and General, vol.36, issue.12, pp.3049-3066, 2003.
DOI : 10.1088/0305-4470/36/12/312

N. O. Connell, A path-transformation for random walks and the Robinson-Schensted correspondence, Transactions of the American Mathematical Society, vol.355, issue.09, pp.3669-3697, 2003.
DOI : 10.1090/S0002-9947-03-03226-4
URL : https://hal.archives-ouvertes.fr/hal-00136429

N. O. Connell and M. Yor, Brownian analogues of Burke's theorem, Stochastic Processes and their Applications, vol.96, issue.2, pp.285-304, 2001.
DOI : 10.1016/S0304-4149(01)00119-3

N. O. Connell and M. Yor, A Representation for Non-Colliding Random Walks, Electronic Communications in Probability, vol.7, issue.0, pp.1-12, 2002.
DOI : 10.1214/ECP.v7-1042

B. Prabhakar and R. Gallager, Entropy and the timing of discrete queues, IEEE Transactions on Information Theory, 2003.

E. Reich, Waiting Times When Queues are in Tandem, The Annals of Mathematical Statistics, vol.28, issue.3, pp.527-530, 1957.
DOI : 10.1214/aoms/1177706889

P. Robert, Réseaux et files d'attente: méthodes probabilistes, Number 35 in Mathématiques & Applications, 2000.

B. Sagan, The symmetric group. Representations, combinatorial algorithms, and symmetric functions . Number 203 in Graduate Texts in Mathematics, 2001.

R. Stanley, Number 62 in Cambridge Studies in Advanced Mathematics, Enumerative Combinatorics, vol.2, 1999.

S. Tembe and R. Wolff, The Optimal Order of Service in Tandem Queues, Operations Research, vol.22, issue.4, pp.824-832, 1974.
DOI : 10.1287/opre.22.4.824

R. Weber, The interchangeability of ??/M/1 queues in series, Journal of Applied Probability, vol.16, issue.03, pp.690-695, 1979.
DOI : 10.1287/opre.13.1.121