Queueing Systems

, 69:101 | Cite as

Sojourn time tails in the single server queue with heavy-tailed service times

Article

Abstract

We consider the GI/GI/1 queue with regularly varying service requirement distribution of index −α. It is well known that, in the M/G/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1−α, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution is regularly varying of index −α. That raises the question whether there exist service disciplines that give rise to a regularly varying sojourn time distribution with any index −γ∈[−α,1−α]. In this paper that question is answered affirmatively.

Keywords

GI/GI/1 queue Regular variation Sojourn time tail 

Mathematics Subject Classification (2000)

60K25 60F10 68M20 90B18 90B22 

References

  1. 1.
    Asmussen, S.: Applied Probability and Queues, 2nd edn. Springer, New York (2003) Google Scholar
  2. 2.
    Avrachenkov, K., Ayesta, U., Brown, P., Nyberg, E.: Differentiation between short and long TCP flows: predictability of the response time. In: Proceedings of IEEE INFOCOM 2004 (2004) Google Scholar
  3. 3.
    Borst, S.C., Boxma, O.J., Núñez-Queija, R., Zwart, A.P.: The impact of the service discipline on delay asymptotics. Perform. Eval. 54, 175–206 (2003) CrossRefGoogle Scholar
  4. 4.
    Boxma, O.J., Zwart, A.P.: Tails in scheduling. Perform. Eval. Rev. 34, 13–20 (2007) CrossRefGoogle Scholar
  5. 5.
    Fuk, D.Kh., Nagaev, S.V.: Probability inequalities of sums of independent random variables. Theory Probab. Appl. 16(4), 643–660 (1971) CrossRefGoogle Scholar
  6. 6.
    Harchol-Balter, M. (ed.): Special Issue on New Perspectives in Scheduling. Perform. Eval. Rev. 34(4), 1–70 (2007) Google Scholar
  7. 7.
    Kherani, A.A., Kumar, A.: The lightening effect of adaptive window control. IEEE Commun. Lett. 7(5), 284–286 (2003) CrossRefGoogle Scholar
  8. 8.
    Kherani, A.A., Kumar, A.: Closed loop analysis of the bottleneck buffer under adaptive window controlled transfer of HTTP-like traffic. In: Proc. INFOCOM 2003 (2003) Google Scholar
  9. 9.
    Kingman, J.F.C.: The effect of queue discipline on waiting time variance. Proc. Camb. Philos. Soc. 58, 163–164 (1962) CrossRefGoogle Scholar
  10. 10.
    Rai, I.A., Biersack, E.W., Urvoy-Keller, G.: Size-based scheduling to improve the performance of short TCP flows. IEEE Netw. 19, 12–17 (2005) CrossRefGoogle Scholar
  11. 11.
    Stolyar, A., Ramanan, K.: Largest weighted delay first scheduling: large deviations and optimality. Ann. Appl. Probab. 11, 1–48 (2001) CrossRefGoogle Scholar
  12. 12.
    Tambouratzis, D.G.: On a property of the variance of the waiting time in a queue. J. Appl. Probab. 5, 702–703 (1968) CrossRefGoogle Scholar
  13. 13.
    Zwart, B.: Tail asymptotics for the busy period in the GI/G/1 queue. Math. Oper. Res. 26, 485–493 (2001) CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.EURANDOM and Department of Mathematics and Computer ScienceEindhoven University of TechnologyEindhovenThe Netherlands
  2. 2.School of Mathematical and Computer SciencesHeriot-Watt UniversityEdinburghUK
  3. 3.University of CardiffCardiffUK

Personalised recommendations