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

O.J. Boxma, D.E. Denisov

Research output: Book/ReportReportAcademic

78 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 - 2 [-a, 1 - a]. In this paper that question is answered affirmatively.
Original languageEnglish
Place of PublicationEindhoven
PublisherEurandom
Number of pages16
Publication statusPublished - 2009

Publication series

NameReport Eurandom
Volume2009057
ISSN (Print)1389-2355

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