Discriminatory Processor Sharing revisited

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2005, Pages 784-795

  Avrachenkov, K ^a   Ayesta, U ^a,b,c   Brown, P ^b   Nunez Queija R ^c,d  

^a INRIA   (France)

^b ORANGE LABS   (France)

^c CWI   (Netherlands)

^d EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

DPS WEIGHTS; PROCESSOR SHARING (PS); SERVICE REQUIREMENTS; STOCHASTIC COUPLING;

DIFFERENTIAL EQUATIONS; SCHEDULING; STOCHASTIC PROGRAMMING; TOOLS;

TELECOMMUNICATION;

EID: 24144484080     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. G. Fayolle, I. Mitrani, and R. Iasnogorodski, "Sharing a processor among many job classes," J. ACM, vol. 27, no. 3, pp. 519-532. 1980.
2. L. Kleinrock, "Time-shared systems: A theoretical treatment," J.ACM, vol. 14, no. 2, pp. 242-261, 1967.
3. E. Altman, T. Jimenez, and D. Kofman, "DPS queues with stationary ergodic service times and the performance of TCP in overload." in Proc. IEEE INFOCOM, 2004.
4. T. Bonald and L. Massoulie, "Impact of fairness on internet performance," in ACM Sigmetrics, Cambridge, Massachusetts, USA, 2001.
5. S.C. Borst, D.T.M.B. Van Ooteghem, and A.P. Zwart, "Tail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements," Tech. Rep. 2003-25, Eindhoven University of Technology, SPOR, 2003, to appear in Perf. Eval
6. G. van Kessel, R. Núñez-Queija, and S.C. Borst, "Asymptotic regimes for discriminatory processor sharing," Perf. Eval. Rev., vol. 32, no. 2, pp. 44-46, 2004.
7. T.M. O'Donovan, "Direct solutions of M/G/1 processor-sharing models," Oper. Res., vol. 22, pp. 1232-1235, 1974.
8. K.M. Rege and B. Sengupta, "Queue length distribution for the discriminatory processor-sharing queue," Oper.Res., vol. 44, pp. 653-657, 1996.
9. G. van Kessel, R. Núñez-Queija, and S.C. Borst, "Differentiated bandwidth sharing with disparate flow sizes." in Proc. IEEE INFOCOM, 2005.
10. K.M. Rege and B. Sengupta, "A decomposition theorem and related results for the discriminatory processor sharing queue," Queueing Systems, vol. 18, pp. 333-351, 1994.
11. S. Grishechkin, "On a relationship between processor-sharing queues and Crump-Mode-Jagers branching processes," Adv. Appl. Prob., vol. 24, pp. 653-698, 1992.
12. L. Guo and I. Malta, "Scheduling flows with unknown sizes: Approximate analysis." Perf. Eval. Rev., vol. 30, no. 1, pp. 276-277, 2002
13. Extended version available as a Boston University Technical Report BU-CS-2002-009.
14. T. Bonald and A. Proutière, "On stochastic bounds for monotonic processor sharing networks," Queueing Systems, vol. 47, pp. 81-106, 2004.
15. S. Asmussen, Applied Probability and Queues, Springer, 2002.
16. R.W. Wolff, Stochastic Modeling and the theory of Queues, Prentice-Hall. 1989.
17. A.N. Kolmogorov and S.V. Foming, Introductory Real Analysis, Dover Publications, 1970.
18. R.W. Wolff, "Poisson arrivals see time averages," Oper Res., vol. 30, pp. 223-231, 1982.
19. O.J. Boxma, "Workloads and waiting times in single-server systems with multiple customer classes," Queueing Systems, vol. 5, pp. 185-214, 1989.
20. J. Shanthikumar and D. Yao, "Multiclass queueing systems: Polymatroidal structure and optimal scheduling control," Oper. Res., vol. 40, no. 2, pp. 293-299, 1992.
21. T.C. Green and S. Stidham, "Sample-path conservation laws, with application to scheduling queues and fluid systems," Queueing Systems, vol. 36, pp. 175-199, 2000.
22. F. Baccelli and P. Bremaud, Elements of queuing theory: Palm martingale calculus and stochastic recurrences, Springer, 2003.
23. D. Brumelle, "On the relation between customer and time average in queues," J. Appl. Prob., vol. 2, pp. 508-520, 1971.
24. L.E. Schrage, "The queue M/G/1 with feedback to lower priority queues," Management Science, vol. 13, pp. 466-471, 1967.
25. R. Righter and G. Shanthikumar, "Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures," Prob. Eng. Inf. Sc., vol. 3, pp. 323-334, 1989.
26. R. Righter, G. Shanthikumar, and G. Yamazaki, "On extremal service disciplines in single-stage queueing systems," J. Appl. Prob., vol. 27, pp. 409-416, 1990.
27. H. Feng and V. Misra, "Mixed scheduling disciplines for network flows," Perf. Eval. Rev., vol. 31, no. 2, pp. 36-39, 2003.
28. S. Aalto, U. Ayesta, and E. Nyberg, "Two-level processor sharing scheduling disciplines: Mean delay analysis," in Proc. ACM SIGMETRICS, New York, 2004, pp. 97-105.