Large deviations for sojourn times in processor sharing queues.
| Authors |
|
|---|---|
| Publication date | 2006 |
| Journal | Queueing Systems |
| Volume | Issue number | 52 | 4 |
| Pages (from-to) | 237-250 |
| Organisations |
|
| Abstract |
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. |
| Document type | Article |
| Published at |
https://doi.org/10.1007/s11134-006-5567-6
(Final published version)
|
| Downloads | |
| Permalink to this page | |