Large deviations of sojourn times in processor sharing queues

M.R.H. Mandjes; A.P. Zwart

doi:10.1007/s11134-006-5567-6

Large deviations of sojourn times in processor sharing queues

M.R.H. Mandjes, A.P. Zwart

Research output: Contribution to journal › Article › Academic › peer-review

26 Citations (Scopus)

3 Downloads (Pure)

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: Theory and Applications
Volume	52
Issue number	4
DOIs	https://doi.org/10.1007/s11134-006-5567-6
Publication status	Published - 2006

Access to Document

10.1007/s11134-006-5567-6

Fingerprint Dive into the research topics of 'Large deviations of sojourn times in processor sharing queues'. Together they form a unique fingerprint.

Cite this

@article{54d2c782ebad48adb10dd58cffc0c49a,

title = "Large deviations of sojourn times in processor sharing queues",

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.",

author = "M.R.H. Mandjes and A.P. Zwart",

year = "2006",

doi = "10.1007/s11134-006-5567-6",

language = "English",

volume = "52",

pages = "237--250",

journal = "Queueing Systems: Theory and Applications",

issn = "0257-0130",

publisher = "Springer",

number = "4",

}

TY - JOUR

T1 - Large deviations of sojourn times in processor sharing queues

AU - Mandjes, M.R.H.

AU - Zwart, A.P.

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

U2 - 10.1007/s11134-006-5567-6

DO - 10.1007/s11134-006-5567-6

M3 - Article

VL - 52

SP - 237

EP - 250

JO - Queueing Systems: Theory and Applications

JF - Queueing Systems: Theory and Applications

SN - 0257-0130

IS - 4

ER -