Abstract
This paper presents a large deviation analysis of the steady-state sojourn time distribution in the GI/G/1 PS queue. Logarithmic estimates are obtained under the assumption of the service time distribution having a light tail, thus supplementing recent results for the heavy-tailed setting. Our proof gives insight into the way a large sojourn time occurs, enabling the construction of an (asymptotically efficient) importance sampling algorithm. Finally our results for PS are compared to a number of other service disciplines, such as FCFS, LCFS, and SRPT.
Original language | English |
---|---|
Pages (from-to) | 237-250 |
Journal | Queueing Systems |
Volume | 52 |
Issue number | 4 |
DOIs | |
Publication status | Published - 2006 |