E. Altman, K. Avrachenkov, and U. Ayesta, A survey on discriminatory processor sharing, Queueing Systems, vol.53, issue.1-2, pp.53-63, 2006.

B. Avi-itzhak and S. Halfin, Expected response times in a non-symmetric time sharing queue with a limited number of service positions, Proceedings of ITC, vol.12, 1988.

K. Avrachenkov, U. Ayesta, P. Brown, and R. Núnez-queija, Discriminatory processor sharing revisited, Proceedings of IEEE INFOCOM 2005, 2005.
DOI : 10.1109/infcom.2005.1498310

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.

M. Haviv and J. Van, Waiting times in queues with relative priorities, Operations Research Letters, vol.35, issue.5, pp.591-594, 2007.

M. Haviv and J. Van, Mean sojourn times for phase-type discriminatory processor sharing systems, European Journal of Operational Research, vol.189, issue.2, pp.375-386, 2008.

L. Kleinrock, Time-shared systems: a theoretical treatment, Journal of ACM, vol.14, issue.2, pp.242-261, 1967.

S. Aalto, U. Ayesta, S. Borst, V. Misra, and R. Núñez-queija, Beyond Processor Sharing, ACM Sigmetrics Performance Evaluation Review, vol.34, pp.36-43, 2007.
DOI : 10.1145/1243401.1243409
URL : https://ir.cwi.nl/pub/12325/12325D.pdf

M. Haviv and J. Van, Equilibrium strategies for processor sharing and random queues with relative priorities, Probability in the Engineering and Informational Sciences, issue.4, pp.403-412, 1997.

M. Haviv and J. Van, Waiting times in queues with relative priorities, Operation Research Letters, vol.35, pp.591-594, 2007.

J. Kim and B. Kim, Sojourn time distribution in M/M/1 queue with discriminatory processor sharing, vol.58, pp.341-365, 2004.

J. Kim, J. Kim, and B. Kim, Analysis of M/G/1 queue with discriminatory random order service policy, Performance Evaluation, vol.68, pp.256-270, 2011.

A. K. Parekh and R. G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The single-node case, IEEE/ACM Transactions on Networking, vol.1, issue.3, pp.344-357, 1993.

Z. Zhang, D. Towsley, and J. Kurose, Statistical analysis of generalized processor sharing scheduling discipline, Proceedings of SIGCOMM, pp.68-77, 1994.

G. Fayolle, I. Mitrani, and R. Iasnogorodski, Sharing a processor among many job classes, Journal of ACM, vol.27, issue.3, pp.519-532, 1980.

A. Demers, Analysis and Simulation of a Fair Queueing Algorithm, Internetworking: Research and Experience, vol.1, pp.3-26, 1990.

A. Kumar, D. Manjunath, and J. Kuri, Communication Networking: An Analytical Approach, 2004.

G. Fayolle and R. Iasnogorodski, Two Coupled Processors: The reduction to a Riemann-Hilbert Problem, Wahrscheinlichkeitstheorie verw Gebiete, vol.47, pp.325-351, 1979.

J. Morrison, Head of the line processor sharing for many symmetric queues with finite capacity, Queueing Systems, vol.14, pp.215-237, 1993.

J. Zhang, J. G. Dai, and B. Zwart, Diffusion limits of limited processor sharing queues, The Annals of Applied Probability, vol.21, pp.745-799, 2011.

T. , Lectures on the coupling method, Courier Corporation, 2002.