arXiv Analytics

Sign in

arXiv:math/0405298 [math.PR]AbstractReferencesReviewsResources

Diffusion approximation for a processor sharing queue in heavy traffic

H. Christian Gromoll

Published 2004-05-14Version 1

Consider a single server queue with renewal arrivals and i.i.d. service times in which the server operates under a processor sharing service discipline. To describe the evolution of this system, we use a measure valued process that keeps track of the residual service times of all jobs in the system at any given time. From this measure valued process, one can recover the traditional performance processes, including queue length and workload. We show that under mild assumptions, including standard heavy traffic assumptions, the (suitably rescaled) measure valued processes corresponding to a sequence of processor sharing queues converge in distribution to a measure valued diffusion process. The limiting process is characterized as the image under an appropriate lifting map, of a one-dimensional reflected Brownian motion. As an immediate consequence, one obtains a diffusion approximation for the queue length process of a processor sharing queue.

Journal: Annals of Applied Probability 2004, Vol. 14, No. 2, 555-611
Categories: math.PR
Subjects: 60K25, 68M20, 90B22
Related articles: Most relevant | Search more
arXiv:0707.4600 [math.PR] (Published 2007-07-31)
Heavy traffic limit for a processor sharing queue with soft deadlines
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:0905.3700 [math.PR] (Published 2009-05-22)
On a Processor Sharing Queue That Models Balking