Diffusion approximation for a processor sharing queue in heavy traffic

Abstract

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.

References in corpus (1)

• Invariant states and rates of Convergence for a critical fluid model of a processor sharing queue

Cited by in corpus (9)

• Heavy traffic analysis for EDF queues with reneging
• Scaling limits via excursion theory: Interplay between Crump-Mode-Jagers branching processes and processor-sharing queues
• Spatial Birth-Death Wireless Networks
• Diffusion limits of limited processor sharing queues
• Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
• Invariant states and rates of Convergence for a critical fluid model of a processor sharing queue
• Heavy traffic limit for a processor sharing queue with soft deadlines
• Distribution-valued heavy-traffic limits for the $G/GI/\infty$ queue
• Stabilizing the virtual response time in single-server processor sharing queues with slowly time-varying arrival rates