arXiv:0707.4600 [math.PR]AbstractReferencesReviewsResources
Heavy traffic limit for a processor sharing queue with soft deadlines
H. Christian Gromoll, Łukasz Kruk
Published 2007-07-31Version 1
This paper considers a GI/GI/1 processor sharing queue in which jobs have soft deadlines. At each point in time, the collection of residual service times and deadlines is modeled using a random counting measure on the right half-plane. The limit of this measure valued process is obtained under diffusion scaling and heavy traffic conditions and is characterized as a deterministic function of the limiting queue length process. As special cases, one obtains diffusion approximations for the lead time profile and the profile of times in queue. One also obtains a snapshot principle for sojourn times.
Comments: Published at http://dx.doi.org/10.1214/105051607000000014 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
Journal: Annals of Applied Probability 2007, Vol. 17, No. 3, 1049-1101
Categories: math.PR
Keywords: processor sharing queue, heavy traffic limit, soft deadlines, residual service times, limiting queue length process
Tags: journal article
Related articles: Most relevant | Search more
arXiv:math/0405298 [math.PR] (Published 2004-05-14)
Diffusion approximation for a processor sharing queue in heavy traffic
arXiv:math/0512281 [math.PR] (Published 2005-12-13)
Explicit formulas for the moments of the sojourn time in the M/G/1 processor sharing queue with permanent jobs
arXiv:1702.01778 [math.PR] (Published 2017-02-06)
Heavy Traffic Limit for a Tandem Queue with Identical Service Times