The impact of the service discipline on delay asymptotics

Performance Evaluation

Volumn 54, Issue 2, 2003, Pages 175-206

  Borst, S C ^a,b,c   Boxma, O J ^a,b   Nunez Queija R ^a,b   Zwart, A P ^a,b  

^a CWI   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Delay asymptotics; M G 1; Regular variation; Service discipline

Indexed keywords

NUMERICAL ANALYSIS; PERFORMANCE; PROBABILITY; TELECOMMUNICATION TRAFFIC;

DELAY ASYMPTOTICS;

TELECOMMUNICATION NETWORKS;

EID: 0042829468     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(03)00071-3     Document Type: Conference Paper

References (65)

1. Abate J., Choudhury G.L., Whitt W., Waiting-time tail probabilities in queues with long-tail service-time distributions. Queue. Syst. 16:1994;311-338.
2. Abate J., Whitt W., Asymptotics for. M/G/1 low-priority waiting-time tail probabilities Queue. Syst. 25:1997;173-233.
3. Anantharam V., How large delays build up in a. GI/G/1 queue Queue. Syst. 5:1988;345-368.
4. Anantharam V., Scheduling strategies and long-range dependence. Queue. Syst. 33:1999;73-89.
5. A. Arvidsson, P. Karlsson, On traffic models for TCP/IP, in: P. Key, D. Smith (Eds.), Teletraffic Engineering in a Competitive World, Proceedings of the ITC-16, Edinburgh, UK, North-Holland, Amsterdam, 1999, pp. 457-466.
6. Asmussen S., Klüppelberg C., Stationary. M/G/1 excursions in the presence of heavy tails J. Appl. Probab. 33:1996;208-212.
7. K.B. Athreya, P.E. Ney, Branching Processes, Springer, Berlin, 1972.
8. A. Baltrunas, D.J. Daley, C. Klüppelberg, Tail behaviour of the busy-period of a GI/G/1 queue with subexponential service times, Technical Report, Munich University of Technology, 2002.
9. F. Baccelli, S. Foss, Moments and tails in monotone-separable stochastic networks, Research Report RR 4197, INRIA Rocquencourt, 2001.
10. Beran J., Sherman R., Taqqu M.S., Willinger W., Long-range dependence in variable-bit-rate video traffic. IEEE Trans. Commun. 43:1995;1566-1579.
11. Bingham N.H., Doney R.A., Asymptotic properties of super-critical branching processes. I: The Galton-Watson process. Adv. Appl. Probab. 6:1974;711-731.
12. N.H. Bingham, C.M. Goldie, J.L. Teugels, Regular Variation, Cambridge University Press, Cambridge, UK, 1987.
13. S.C. Borst, O.J. Boxma, P.R. Jelenković, Coupled processors with regularly varying service times, in: Proceedings of the IEEE Infocom, Tel-Aviv, Israel, 2000, pp. 157-164.
14. S.C. Borst, O.J. Boxma, P.R. Jelenković, Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows, Queue. Syst. 43 (2003) 273-306.
15. S.C. Borst, O.J. Boxma, J.A. Morrison, R. Núñez-Queija, The equivalence between processor sharing and service in random order, Oper. Res. Lett. 31 (2003) 254-262.
16. S.C. Borst, O.J. Boxma, R. Núñez-Queija, Heavy tails: the effect of the service discipline, in: T. Field, P.G. Harrison, J. Bradley, U. Harder (Eds.), Computer Performance Evaluation-Modelling Techniques and Tools, Proceedings of the Tools 2002, London, UK, Springer, Berlin, 2002, pp. 1-30.
17. S.C. Borst, O.J. Boxma, M.J.G. Van Uitert, Two coupled queues with heterogeneous traffic, in: J. Moreira de Souza, N.L.S. da Fonseca, E.A. de Souza e Silva (Eds.), Teletraffic Engineering in the Internet Era, Proceedings of the ITC-17, Salvador da Bahia, Brazil, North-Holland, Amsterdam, 2001, pp. 1003-1014.
18. S.C. Borst, O.J. Boxma, M.J.G. Van Uitert, The asymptotic workload behavior of two coupled queues, Queue. Syst. 43 (2003) 81-102.
19. S.C. Borst, A.P. Zwart, Fluid queues with heavy-tailed M/G/∞ input, SPOR-Report 2001-02, Eindhoven University of Technology, submitted for publication.
20. O.J. Boxma, J.W. Cohen, The single server queue: heavy tails and heavy traffic, in: K. Park, W. Willinger (Eds.), Self-Similar Network Traffic and Performance Evaluation, Wiley, New York, 2000, pp. 143-169.
21. O.J. Boxma, J.W. Cohen, Q. Deng, Heavy-traffic analysis of the M/G/1 queue with priority classes, in: P. Key, D. Smith (Eds.), Teletraffic Engineering in a Competitive World, Proceedings of the ITC-16, Edinburgh, UK, North-Holland, Amsterdam, 1999, pp. 1157-1167.
22. Boxma O.J., Deng Q., Resing J.A.C., Polling systems with regularly varying service and/or switchover times. Adv. Perf. Anal. 3:2000;71-107.
23. Boxma O.J., Dumas V., The busy-period in the fluid queue. Perf. Eval. Rev. 26:1998;100-110.
24. J. Cao, K. Ramanan, A Poisson limit for buffer overflow probabilities, in: Proceedings of the IEEE Infocom, New York, 2002, pp. 994-1003.
25. Cohen J.W., Some results on regular variation for distributions in queueing and fluctuation theory. J. Appl. Probab. 10:1973;343-353.
26. J.W. Cohen, The Single Server Queue, revised edition, North-Holland, Amsterdam, 1982.
27. J.W. Cohen, O.J. Boxma, Boundary Value Problems in Queueing System Analysis, North-Holland, Amsterdam, 1983.
28. Chistyakov V.P., A theorem on sums of independent, positive random variables and its applications to branching processes. Theory Probab. Appl. 9:1964;640-648.
29. Cline D., Intermediate regular and. Π variation Proc. London Math. Soc. 68:1994;594-616.
30. M. Crovella, A. Bestavros, Self-similarity in World Wide Web traffic: evidence and possible causes, in: Proceedings of the ACM Sigmetrics'96, 1996, pp. 160-169.
31. Q. Deng, The two-queue E/1-L polling model with regularly varying service and/or switchover times, SPOR-Report 2001-09, Department of Mathematics and Computer Science, Eindhoven University of Technology; Stoch. Mod., to appear.
32. Q. Deng, The two-queue E/1-L polling model with regularly varying service and/or switchover times, SPOR-Report 2001-09, Department of Mathematics and Computer Science, Eindhoven University of Technology; Stoch. Mod., to appear.
33. Fayolle G., Iasnogorodski R., Two coupled processors: the reduction to a Riemann-Hilbert problem. Z. Wahrsch. Verw. Gebiete. 47:1979;325-351.
34. W. Feller, An Introduction to Probability Theory and its Applications, vol. II, Wiley, New York, 1971.
35. P.R. Jelenković, P. Momčilović, Resource sharing with subexponential distributions, in: Proceedings of the IEEE Infocom, New York, 2002, pp. 1316-1325.
36. P.R. Jelenković, P. Momčilović, Large deviations of square-root insensitive random sums, Technical Report, Columbia University, 2002.
37. P.R. Jelenković, P. Momčilović, A.P. Zwart, Reduced-load equivalence under subexponentiality, Research Report RR 4444, INRIA Rocquencourt, 2002; Queue. Syst., to appear.
38. P.R. Jelenković, P. Momčilović, A.P. Zwart, Reduced-load equivalence under subexponentiality, Research Report RR 4444, INRIA Rocquencourt, 2002; Queue. Syst., to appear.
39. Karamata J., Sur un mode de croissance régulière des fonctions. Mathematica Cluj. 4:1930;38-53.
40. L. Kleinrock, Queueing Systems, vol. II: Computer Applications, Wiley, New York, 1976.
41. Klüppelberg C., Subexponential distributions and integrated tails. J. Appl. Probab. 25:1988;132-141.
42. Konheim A.G., Meilijson I., Melkman A., Processor sharing of two parallel lines. J. Appl. Probab. 18:1981;952-956.
43. Korshunov D.A., On distribution tail of the maximum of a random walk. Stoch. Proc. Appl. 72:1997;97-103.
44. Leland W.E., Taqqu M.S., Willinger W., Wilson D.V., On the self-similar nature of Ethernet traffic (extended version). IEEE/ACM Trans. Netw. 2:1994;1-15.
45. De Meyer A., Teugels J.L., On the asymptotic behaviour of the distributions of the busy period and the service time in. M/G/1 J. Appl. Probab. 17:1980;802-813.
46. T. Mikosch, Regular variation, subexponentiality and their applications in probability theory, EURANDOM Report 99-013.
47. R. Núñez-Queija, Processor-sharing models for integrated-services networks, Ph.D. Thesis, Eindhoven University of Technology, ISBN 90-646-4667-8, 2000; also available from the author upon request.
48. Núñez-Queija R., Sojourn-times in a processor-sharing queue with service interruptions. Queue. Syst. 34:2000;351-386.
49. Núñez-Queija R., Queues with equally heavy sojourn-time and service requirement distributions. Ann. Oper. Res. 113:2002;101-117.
50. Ott T.J., The sojourn-time distribution in the. M/G/1 queue with processor sharing J. Appl. Probab. 21:1984;360-378.
51. Pakes A.G., On the tails of waiting-time distributions. J. Appl. Probab. 12:1975;555-564.
52. Parekh A.K., Gallager R.G., A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Netw. 1:1993;344-357.
53. Paxson A., Floyd S., Wide area traffic: the failure of Poisson modeling. IEEE/ACM Trans. Netw. 3:1995;226-244.
54. Resnick S., Samorodnitsky G., Activity periods of an infinite server queue and performance of certain heavy-tailed fluid queues. Queue. Syst. 33:1999;43-71.
55. Sakata M., Noguchi S., Oizumi J., An analysis of the. M/G/1 queue under round-robin scheduling Oper. Res. 19:1971;371-385.
56. Schrage L.E., Miller L.W., The queue. M/G/1 with the shortest remaining processing time discipline Oper. Res. 14:1966;670-684.
57. Schassberger R., A new approach to the. M/G/1 processor sharing queue Adv. Appl. Probab. 16:1984;802-813.
58. Willinger W., Taqqu M.S., Sherman R., Wilson D.V., Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level. IEEE/ACM Trans. Netw. 5:1997;71-86.
59. Yashkov S.F., A derivation of response time distribution for a. M/G/1 processor-sharing queue Probab. Control Inf. Theory. 12:1983;133-148.
60. Yashkov S.F., Processor-sharing queues: Some progress in analysis. Queue. Syst. 2:1987;1-17.
61. A.P. Zwart, Sojourn-times in a multiclass processor sharing queue, in: P. Key, D. Smith (Eds.), Teletraffic Engineering in a Competitive World, Proceedings of the ITC-16, Edinburgh, UK, North-Holland, Amsterdam, 1999, pp. 335-344.
62. A.P. Zwart, Queueing systems with heavy tails, Ph.D. Thesis, Eindhoven University of Technology, 2001.
63. Zwart A.P., Tail asymptotics for the busy period in the. GI/G/1 queue Math. Oper. Res. 26:2001;485-493.
64. A.P. Zwart, S.C. Borst, M. Mandjes, Exact asymptotics for fluid queues fed by multiple heavy-tailed On-Off flows, Shortened version in: Proceedings of the IEEE Infocom, 2001, Anchorage AK, USA, pp. 279-288, Ann. Appl. Probab., in press.
65. Zwart A.P., Boxma O.J., Sojourn time asymptotics in the. M/G/1 processor sharing queue Queue. Syst. 35:2000;141-166.