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

O.J. Boxma, D.E. Denisov

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)
4 Downloads (Pure)

Abstract

We consider the GI/GI/1 queue with regularly varying service requirement distribution of index -a. It is well known that, in the M/G/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1-a, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution is regularly varying of index -a. That raises the question whether there exist service disciplines that give rise to a regularly varying sojourn time distribution with any index -¿¿[-a,1-a]. In this paper that question is answered affirmatively.
Original languageEnglish
Pages (from-to)101-119
JournalQueueing Systems: Theory and Applications
Volume69
Issue number2
DOIs
Publication statusPublished - 2011

Fingerprint

Dive into the research topics of 'Sojourn time tails in the single server queue with heavy-tailed service times'. Together they form a unique fingerprint.

Cite this