Find out how to access previewonly content
A survey on discriminatory processor sharing
 Eitan Altman,
 Konstantin Avrachenkov,
 Urtzi Ayesta
 … show all 3 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
The Discriminatory Processor Sharing (DPS) model is a multiclass generalization of the egalitarian Processor Sharing model. In the DPS model all jobs present in the system are served simultaneously at rates controlled by a vector of weights {g _{ k } > 0; k = 1,..., K }. If there are N _{ k } jobs of class k present in the system, k = 1,..., K, each classk job is served at rate \(g_k/\sum_{j=1}^K{g_j}{N_j}\) . The present article provides an overview of the analytical results for the DPS model. In particular, we focus on response times and numbers of jobs in the system.
This work is part of a FrenchDutch Van Gogh research project funded by NWO (The Netherlands Organization for Scientific Research) and EGIDE under grant VGP 61520. We also acknowledge the support of EuroNGI Network of Excellence. This work was done while U. Ayesta was an ERCIM Postdoc fellow at CWI.
 E. Altman, T. Jimenez, and D. Kofman, DPS queues with stationary ergodic service times and the performance of TCP in overload, in: Proceedings of IEEE INFOCOM (2004).
 K.E. Avrachenkov, U. Ayesta, P. Brown, and R. NúñezQueija, Discriminatory processor sharing revisited, in: Proceedings of IEEE INFOCOM (2005).
 K.E. Avrachenkov, U. Ayesta, P. Brown, and R. NúñezQueija, Discriminatory processor sharing revisited (2006), Extended version submitted for publication.
 F. Baccelli and P. Brémaud, Elements of Queuing Theory: Palm Martingale Calculus and Stochastic Recurrences (Springer, 2003).
 M.J. Bach, The Design of the UNIX Operating System (PrenticeHall, 1986).
 T. Bonald and L. Massoulié, Impact of fairness on Internet performance, in: Proceedings of ACM SIGMETRICS/Performance (2001) pp. 82–91.
 Bonald, T., Proutière, A. (2003) Insensitive bandwidth sharing in data networks. Queueing Systems 44: pp. 69100 CrossRef
 Bonald, T., Proutière, A. (2004) On stochastic bounds for monotonic processor sharing networks. Queueing Systems 47: pp. 81106 CrossRef
 S.C. Borst, R. NúñezQueija, and A.P. Zwart, Sojourn time asymptotics in processor sharing queues, (2006), in this special issue.
 Borst, S.C., Ooteghem, D.T.M.B., Zwart, A.P. (2005) Tail asymptotics for discriminatory processor sharing queues with heavytailed service requirements. Performance Evaluation 61: pp. 281298 CrossRef
 O.J. Boxma, N. Hegde, and R. NúñezQueija, Exact and approximate analysis of sojourn times in finite discriminatory processor sharing queues, AEU International Journal on Electronic Communication (2006) (to appear).
 T. Bu and D. Towsley, Fixed point approximation for TCP behaviour in an AQM network, in: Proceedings of ACM SIGMETRICS/Performance (2001) pp. 216–225.
 Cheung, S.K., Berg, J.L., Boucherie, R.J. (2005) Decomposing the queue length distribution of processor sharing models into queue lengths of permanent customer queues. Performance Evaluation 62: pp. 100116
 S.K. Cheung, J.L. van den Berg, R.J. Boucherie, R. Litjens, and F. Roijers, An analytical packet/flowlevel modelling approach for wireless LANs with qualityofservice support, in: Proceedings of ITC19 (2005).
 Coffman, E.G., Mitrani, I. (1980) A characterization of waiting time performance realizable by singleserver queues. Operations Research 28: pp. 810821
 Fayolle, G., Mitrani, I., Iasnogorodski, R. (1980) Sharing a processor among many job classes. Journal of the ACM 27: pp. 519532 CrossRef
 Feng, H., Misra, V. (2003) Mixed scheduling disciplines for network flows. Performance Evaluation Review 31: pp. 3639
 Green, T.C., Stidham, S. (2000) Samplepath conservation laws, with application to scheduling queues and fluid systems. Queueing Systems 36: pp. 175199 CrossRef
 Grishechkin, S. (1992) On a relationship between processor sharing queues and CrumpModeJagers branching processes. Adv. Appl. Prob. 24: pp. 653698 CrossRef
 L. Guo and I. Matta, Scheduling flows with unknown sizes: Approximate analysis, in: Proceedings of ACM SIGMETRICS (Extended Abstract) (2002) 276–277. Extended version available as a Boston University Technical Report BUCS2002009.
 Hassin, R., Haviv, M. (2006) Who should be given priority in a queue. Operations Research Letters 34: pp. 191198 CrossRef
 Hassin, R., Haviv, M. (2003) To Queue or not to Queue: Equilibrium Behavior in Queueing Systems. Kluwer Academic Publishers, Boston
 Haviv, M., Wal, J. (1997) Equilibrium strategies for processor sharing and random queues with relative priorities. Probability in the Engineering and Informational Sciences 11: pp. 403412
 M. Haviv and J. van der Wal, Waiting times in discriminatory processor sharing (2005), Submitted for publication.
 Y. Hayel and B. Tuffin, Pricing for heterogeneous services at a discriminatory processor sharing queue, in: Proceedings of Networking (2005).
 JeanMarie, A., Robert, P. (1994) On the transient behavior of the processor sharing queue. Queueing Systems 17: pp. 129136 CrossRef
 Kelly, F. (1979) Stochastic Networks and Reversibility. Wiley, Chichester
 Kim, J., Kim, B. (2004) Sojourn time distribution in the M/M/1 queue with discriminatory processor sharing. Performance Evaluation 58: pp. 341365 CrossRef
 Kingman, J.F.C. (1962) On queues in heavy traffic. Journal of the Royal Statistical Society. Series B Methodological 24: pp. 383392
 Kleinrock, L. (1965) A conservation law for a wide class of queueing disciplines. Naval Research Logistics Quarterly 12: pp. 181192
 Kleinrock, L. (1967) Timeshared systems: A theoretical treatment. Journal of the ACM 14: pp. 242261 CrossRef
 L. Kleinrock, Queueing Systems, vol. 2 (John Wiley and Sons, 1976).
 Kleinrock, L., Muntz, R.R., Rodemich, E. (1971) The processor sharing queueing model for timeshared systems with bulk arrivals. Networks Journal 1: pp. 113
 Massoulié, L., Roberts, J. (2000) Bandwidth sharing and admission control for elastic traffic. Telecommunication Systems 15: pp. 185201 CrossRef
 Mitra, D., Weiss, A. (1989) A closed network with a discriminatory processor sharing server. Performance Evaluation Review 17: pp. 200208
 I. Mitrani and J.H. Hine, Complete parameterized families of job scheduling strategies, Acta Informatica (8) (1977) 61–73.
 I. Mitrani and T.M. O'Donovan, Private communications.
 Morrison, J.A. (1991) Asymptotic analysis of a large closed queueing network with discriminatory processor sharing. Queueing Systems 9: pp. 191214 CrossRef
 O'Donovan, T.M. (1974) Direct solutions of M/G/1 processor sharing models. Operations Research 22: pp. 12321235
 Parekh, A.K., Gallager, R.G. (1993) A generalized processor sharing approach to flow control in integrated services networks: The singlenode case. IEEE/ACM Transactions on Networking 1: pp. 344357 CrossRef
 Rege, K.M., Sengupta, B. (1994) A decomposition theorem and related results for the discriminatory processor sharing queue. Queueing Systems 18: pp. 333351 CrossRef
 Rege, K.M., Sengupta, B. (1996) Queue length distribution for the discriminatory processor sharing queue. Operations Research 44: pp. 653657
 Righter, R., Shanthikumar, J.G. (1989) Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures. Probability in the Engineering and Informational Sciences 3: pp. 323334 CrossRef
 Schrage, L.E. (1967) The queue M/G/1 with feedback to lower priority queues. Management Science 13: pp. 466471
 Shanthikumar, J., Yao, D. (1992) Multiclass queueing systems: Polymatroidal structure and optimal scheduling control. Operations Research 40: pp. 293299 CrossRef
 Shreedhar, M., Varghese, G. (1996) Efficient fair queuing using Deficit RoundRobin. IEEE/ACM Transactions on Networking 4: pp. 375385 CrossRef
 A. Silberschatz, P. Galvin, and G. Gagne, Applied Operating System Concepts (John Wiley and Sons, 2000).
 Kessel, G., NúñezQueija, R., Borst, S.C. (2004) Asymptotic regimes and approximations for discriminatory processor sharing. Performance Evaluation Review 32: pp. 4446
 G. van Kessel, R. NúñezQueija, and S.C. Borst, Differentiated bandwidth sharing with disparate flow sizes, in: Proceedings of IEEE INFOCOM (2005).
 M.J.G. van Uitert, Generalized Processor Sharing Queues, PhD thesis, Eindhoven University of Technology (2003).
 Yashkov, S.F. (1987) Processor sharing queues: Some progress in analysis. Queueing Systems 2: pp. 117 CrossRef
 Yashkov, S.F. (1992) Mathematical problems in the theory of processor sharing queueing systems. Journal of Soviet Mathematics 58: pp. 101147 CrossRef
 Zwart, A.P., Boxma, O.J. (2000) Sojourn time asymptotics in the M/G/1 processor sharing queue. Queueing Systems 35: pp. 141166 CrossRef
 Title
 A survey on discriminatory processor sharing
 Journal

Queueing Systems
Volume 53, Issue 12 , pp 5363
 Cover Date
 20060601
 DOI
 10.1007/s1113400675868
 Print ISSN
 02570130
 Online ISSN
 15729443
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 Discriminatory Processor Sharing
 Asymptotic Analysis
 M/G/1
 Conservation Law
 Industry Sectors
 Authors

 Eitan Altman ^{(1)}
 Konstantin Avrachenkov ^{(1)}
 Urtzi Ayesta ^{(2)}
 Author Affiliations

 1. INRIA Sophia Antipolis, France
 2. CWI, The Netherlands