S. Asmussen, Applied Probability and Queues, 2003.

U. Ayesta, A. Izagirre, and I. M. Verloop, Heavy-traffic analysis of the discriminatory randomorder-of-service discipline, Performance Evaluation Review, vol.32, issue.2, pp.41-43, 2011.

A. Banerjea and S. Keshav, Queueing delays in rate controlled ATM networks, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings, pp.547-556, 1993.
DOI : 10.1109/INFCOM.1993.253319

P. Billingsley, Convergence of Probability Measures, 1999.
DOI : 10.1002/9780470316962

S. C. Borst, O. J. Boxma, J. A. Morrison, and R. Núñez-queija, The equivalence between processor sharing and service in random order, Operations Research Letters, vol.31, issue.4, pp.254-262, 2003.
DOI : 10.1016/S0167-6377(03)00006-3

O. J. Boxma, D. Denteneer, and J. A. Resing, Some Models for Contention Resolution in Cable Networks, Lecture Notes in Computer Science, vol.2345, pp.117-128, 2002.
DOI : 10.1007/3-540-47906-6_9

O. J. Boxma, S. G. Foss, J. Lasgouttes, and R. Núñez-queija, Waiting Time Asymptotics in the Single Server Queue with Service in Random Order, Queueing Systems, vol.46, issue.1/2, pp.35-73, 2004.
DOI : 10.1023/B:QUES.0000021141.02821.6d
URL : https://hal.archives-ouvertes.fr/hal-00719016

M. Bramson and J. G. Dai, Heavy Traffic Limits for Some Queueing Networks, The Annals of Applied Probability, vol.11, issue.1, pp.49-90, 2001.
DOI : 10.1214/aoap/998926987

W. Feller, An Introduction to Probability Theory and Its Applications, 1971.

E. Gelenbe and I. Mitrani, Analysis and Synthesis of Computer Systems, 2010.
DOI : 10.1142/p643

M. Haviv and J. Van, Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities, Probability in the Engineering and Informational Sciences, pp.403-412, 1997.
DOI : 10.1016/0167-6377(86)90030-1

M. Haviv and J. Van, Waiting times in queues with relative priorities, Operations Research Letters, vol.35, issue.5, pp.591-594, 2007.
DOI : 10.1016/j.orl.2006.10.003

J. Kim, QUEUE LENGTH DISTRIBUTION IN A QUEUE WITH RELATIVE PRIORITIES, Bulletin of the Korean Mathematical Society, vol.46, issue.1, pp.107-116, 2009.
DOI : 10.4134/BKMS.2009.46.1.107

J. Kim, J. Kim, and B. Kim, Analysis of the M/G/1 queue with discriminatory random order service policy, Performance Evaluation, vol.68, issue.3, pp.256-270, 2011.
DOI : 10.1016/j.peva.2010.12.001

J. F. Kingman, The single server queue in heavy traffic, Proc. Cambridge Philos. Soc, pp.902-904, 1961.
DOI : 10.1017/S0305004100036094

J. F. Kingman, On queues in which customers are served in random order, Proc. Cambridge Philos. Soc, pp.79-91, 1962.
DOI : 10.1017/S0305004100036239

J. F. Kingman, Queue Disciplines in Heavy Traffic, Mathematics of Operations Research, vol.7, issue.2, pp.262-271, 1982.
DOI : 10.1287/moor.7.2.262

W. H. Mather, N. A. Cookson, J. Hasty, L. S. Tsimring, and R. J. Williams, Correlation Resonance Generated by Coupled Enzymatic Processing, Biophysical Journal, vol.99, issue.10, pp.3172-3181, 2010.
DOI : 10.1016/j.bpj.2010.09.057

C. Palm, Waiting times with random served queue. Tele1 (English edition, pp.1-107, 1938.

I. M. Verloop, U. Ayesta, and R. Núñez-queija, Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing, Operations Research, vol.59, issue.3, pp.648-660, 2011.
DOI : 10.1287/opre.1110.0914

A. P. Zwart, Heavy-traffic asymptotics for the single-server queue with random order of service, Operations Research Letters, vol.33, issue.5, pp.511-518, 2005.
DOI : 10.1016/j.orl.2004.09.006