Exact and approximate analysis of sojourn times in finite discriminatory processor sharing queues

AEU - International Journal of Electronics and Communications

Volumn 60, Issue 2, 2006, Pages 109-115

  Boxma, Onno J ^a   Hegde, Nidhi ^b   Núñez Queija, Rudesindo ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b France Telecome R and D DMR/RMO   (France)

Author keywords

Admission control; Discriminatory processor sharing; Nearly complete decomposability; Time scale separation

Indexed keywords

COMPUTATIONAL COMPLEXITY; FINITE DIFFERENCE METHOD; NUMERICAL ANALYSIS; TIME AND MOTION STUDY;

ADMISSION CONTROL; DISCRIMINATORY PROCESSOR SHARING; NEARLY COMPLETE DECOMPOSABILITY; TIME SCALE SEPARATION;

QUEUEING NETWORKS;

EID: 30944455903     PISSN: 14348411     EISSN: 16180399     Source Type: Journal    
DOI: 10.1016/j.aeue.2005.11.007     Document Type: Article

References (26)

1. L. Kleinrock Time-shared systems: a theoretical treatment J ACM 14 1967 242 261
2. Massoulié L, Roberts JW. Arguments in favor of admission control for TCP flows. In: Key P, Smith D, editors. Teletraffic Engineering in a Competitive World, Proceedings of ITC-16, Edinburgh, UK, Amsterdam: North-Holland; 1999. p. 33-44.
3. Massoulié L, Roberts JW. Bandwidth sharing: objectives and algorithms. In: Proceedings of IEEE Infocom 1999, New York NY, USA, p. 1395-1403.
4. Núñez-Queija R. Processor-Sharing Models for Integrated-Services Networks. PhD thesis, Eindhoven University of Technology (2000), ISBN 90-646-4667-8. Available at http://www.cwi.nl/ ∼ sindo.
5. Altman E, Jimenez T, Kofman D. DPS queues with stationary ergodic service times and the performance of TCP in overload. Proceedings of IEEE Infocom 2004.
6. M. Sakata, S. Noguchi, and J. Oizumi An analysis of the M/G/1 queue under round-robin scheduling Oper Res 19 1971 371 385
7. S.F. Yashkov A derivation of response time distribution for a M/G/1 processor-sharing queue Probl Control Inform Theory 12 1983 133 148
8. Yashkov SF. New applications of random time change to the analysis of processor-sharing queues. Proceedings of the 4th International Vilnius Conference on Probability Theory and Mathematical Statistics, 1985. p. 343-5.
9. S.C. Borst, O.J. Boxma, R. Núñez-Queija, and A.P. Zwart The impact of the service discipline on delay asymptotics Perform Evaluation 54 2003 175 206
10. K.M. Rege, and B. Sengupta A decomposition theorem and related results for the discriminatory processor-sharing queue Queueing Syst 18 1994 333 351
11. G. Fayolle, I. Mitrani, and R. Iasnogorodski Sharing a processor among many job classes J ACM 27 1980 519 532
12. K.M. Rege, and B. Sengupta Queue length distribution for the discriminatory processor-sharing queue Oper Res 44 1996 653 657
13. G. Van Kessel, R. Núñez-Queija, and S.C. Borst Asymptotic regimes and approximations for discriminatory processor sharing Perform Evaluation Rev 32 2004 44 46
14. Avrachenkov KE, Ayesta U, Brown P, Núñez-Queija R. Discriminatory processor sharing revisited. Proceedings of IEEE Infocom 2005.
15. Borst SC, Van Ooteghem DTMB, Zwart AP. Tail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements. Perform Evaluation, 2005 (special issue on long range dependence and heavy tail distributions).
16. Van Kessel G, Núñez-Queija R, Borst SC. Differentiated bandwidth sharing with disparate flow sizes. Proceedings of Infocom 2005.
17. T. Bonald, and A. Proutière On stochastic bounds for monotonic processor sharing networks Queueing Syst 47 2004 81 106
18. R. Syski Markovian queues W. Smith W. Wilkinson Proceedings of the Symposium on Congestion Theory The University of North Carolina, Chapel Hill, August 24-26 1964 170 222
19. Kühn P. On a combined delay and loss system with different queue disciplines. Information Theory, Statistical Decision Functions, Random Processes. Transactions of the Sixth Prague Conference, 1971. p. 501-28.
20. Borst SC, Boxma OJ, Hegde N. Sojourn time distributions in finite capacity processor sharing queues. Proceedings of the 1st Euro-NGI conference, Rome, April 2005.
21. R.A. Horn, and C.R. Johnson Matrix analysis 1985 Cambridge University Press Cambridge
22. F. Delcoigne, A. Proutière, and G. Regnie Modelling integration of streaming and data traffic Perform Evaluation 55 2004 185 209
23. D. Mitra, M.I. Reiman, and J. Wang Robust admission control for heterogeneous ATM systems with both cell and call QoS requirements Proceedings of ITC-15 Washington, DC 1997 1421 1432
24. Benameur N, Fredj SB, Delcoigne F, Oueslati-Boulahia S, Roberts JW. Integrated admission control for streaming and elastic traffic. Lecture notes in computer science, vol. 2156. 2001; 69-81.
25. J.L. Van den Berg, and O.J. Boxma The M/G/1 queue with processor sharing and its relation to a feedback queue Queueing Syst 9 1991 365 401
26. J.W. Cohen The multiple phase service network with generalized processor sharing Acta Inform 12 1979 245 284