Serve the shortest queue and Walsh Brownian motion
Rami Atar, Asaf Cohen

TL;DR
This paper analyzes a queueing system with multiple classes under heavy traffic, revealing that the workload converges to a Walsh Brownian motion, which captures the dominance of one queue at a time and exhibits unique asymptotic properties.
Contribution
It introduces a novel diffusion limit for a multi-class queue with shortest queue priority, characterized by Walsh Brownian motion, highlighting unconventional heavy traffic behavior.
Findings
Workload converges to Walsh Brownian motion in heavy traffic
One queue becomes dominant during excursions
The angular distribution indicates class dominance probabilities
Abstract
We study a single-server Markovian queueing model with customer classes in which priority is given to the shortest queue. Under a critical load condition, we establish the diffusion limit of the workload and queue length processes in the form of a Walsh Brownian motion (WBM) living in the union of the nonnegative coordinate axes in and a linear transformation thereof. This reveals the following asymptotic behavior. Each time that queues begin to build starting from an empty system, one of them becomes dominant in the sense that it contains nearly all the workload in the system, and it remains so until the system becomes (nearly) empty again. The radial part of the WBM, given as a reflected Brownian motion (RBM) on the half-line, captures the total workload asymptotics, whereas its angular distribution expresses how likely it is for each class to become dominant on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
