TY - JOUR
T1 - Tail behavior of conditional sojourn times in Processor-Sharing queues
AU - Egorova, R.R.
AU - Zwart, B.
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
U2 - 10.1007/s11134-006-9007-4
DO - 10.1007/s11134-006-9007-4
M3 - Article
VL - 55
SP - 107
EP - 121
JO - Queueing Systems: Theory and Applications
JF - Queueing Systems: Theory and Applications
SN - 0257-0130
IS - 2
ER -