Tail behavior of conditional sojourn times in Processor-Sharing queues

R.R. Egorova, B. Zwart

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)
2 Downloads (Pure)


We investigate the tail behavior of the sojourn-time distribution for a request of a given length in an M/G/1 Processor-Sharing (PS) queue. An exponential asymptote is proven for general service times in two special cases: when the traffic load is sufficiently high and when the request length is sufficiently small. Furthermore, using the branching process technique we derive exact asymptotics of exponential type for the sojourn time in the M/M/1 queue. We obtain an equation for the asymptotic decay rate and an exact expression for the asymptotic constant. The decay rate is studied in detail and is compared to other service disciplines. Finally, using numerical methods, we investigate the accuracy of the exponential asymptote.
Original languageEnglish
Pages (from-to)107-121
JournalQueueing Systems
Issue number2
Publication statusPublished - 2007


Dive into the research topics of 'Tail behavior of conditional sojourn times in Processor-Sharing queues'. Together they form a unique fingerprint.

Cite this