Published November 17, 2026 | Version 4

The heavy-traffic diffusion limit of symmetric queues

Authors/Creators

  • 1. Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem, Israel

Description

Consider an M/G/1 queue operating under a symmetric service discipline in the sense of Kelly: at queue length $n$ the job in position $i$ receives the fraction $\gamma(n,i)$ of the server, and an arriving job joins position $i$ with probability $\gamma(n+1,i)$. Zwart conjectured that, for every such discipline and every service law with finite second moment, the queue length started empty and scaled diffusively in heavy traffic converges to the same reflected Brownian motion, the workload limit divided by $h=\mathbb E B^2/(2\mathbb E B)$. This was known for processor sharing and for last-come-first-served. We prove the conjecture for every symmetric discipline and every service law with $\mathbb E B^2<\infty$. The proof is a state-space collapse $\sup_{s\le r^2T}|W_r(s)-hQ_r(s)|=o_{\mathbb P}(r)$. It uses only the product-form stationary law of the queue with the original service requirements kept as marks, the regenerative structure at empty times, and a Bernstein bound for jobs grouped into dyadic classes of original requirement, which can be summed over the classes because the number of busy cycles up to time $r^2T$ is of order $r$.

Files

symmetric-queue-heavy-traffic.pdf

Files (505.6 kB)

Name Size
md5:b56f1b47094fe149fc15d375bc2cb442
505.6 kB Preview Download

Additional details

References

  • M. Bramson, State space collapse with application to heavy traffic limits for multiclass queueing networks, Queueing Syst. 30 (1998), 89–140.
  • B. Fralix and B. Zwart, Time-dependent properties of symmetric queues, Queueing Syst. 67 (2011), 33–45.
  • H. C. Gromoll, Diffusion approximation for a processor sharing queue in heavy traffic, Ann. Appl. Probab. 14 (2004), 555–611.
  • F. P. Kelly, Reversibility and Stochastic Networks, Wiley, Chichester, 1979.
  • A. Lambert, F. Simatos and B. Zwart, Scaling limits via excursion theory: interplay between Crump–Mode–Jagers branching processes and processor-sharing queues, Ann. Appl. Probab. 23 (2013), 2357–2381.
  • V. Limic, A LIFO queue in heavy traffic, Ann. Appl. Probab. 11 (2001), 301–331.
  • Y. Shmalo, Computations for "The heavy-traffic diffusion limit of symmetric queues", https://github.com/yspennstate/symmetric-queue-heavy-traffic, 2026.
  • W. Whitt, Stochastic-Process Limits, Springer, New York, 2002.
  • R. J. Williams, Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse, Queueing Syst. 30 (1998), 27–88.
  • B. Zwart, Conjectures on symmetric queues in heavy traffic, Queueing Syst. 100 (2022), 369–371.
  • Y. Shmalo, Math Brain: public snapshot, code and tests, 2026, https://github.com/yspennstate/math-brain-public.
  • Y. Shmalo, Math Brain: shared, auditable memory for multi-agent mathematical research, October 2026, https://github.com/yspennstate/math-brain-public/tree/main/papers/math-brain-2026-10-24.
  • Y. Shmalo, Brain Framework, public software repository, 2026, https://github.com/yspennstate/brain-framework-public.