Exponential Tail Bounds on Queues: A Confluence of Non-Asymptotic Heavy Traffic and Large Deviations
Prakirt Raj Jhunjhunwala, Daniela Hurtado-Lange, Siva Theja Maguluri

TL;DR
This paper develops non-asymptotic exponential tail bounds for queue lengths under heavy traffic, applicable to various queueing models, bridging classical heavy traffic and large deviations regimes with sharper results.
Contribution
It introduces a novel method for deriving sharper, non-asymptotic tail bounds in queueing systems under heavy traffic, applicable to multiple models and regimes, including large system limits.
Findings
Provides exponential tail bounds for queue lengths in different models.
Bridges the gap between heavy traffic and large deviations regimes.
Offers refined analysis of state space collapse in JSQ systems.
Abstract
In general, obtaining the exact steady-state distribution of queue lengths is not feasible. Therefore, we establish bounds for the tail probabilities of queue lengths. Specifically, we examine queueing systems under Heavy-Traffic (HT) conditions and provide exponentially decaying bounds for the probability , where is the HT parameter denoting how far the load is from the maximum allowed load. Our bounds are not limited to asymptotic cases and are applicable even for finite values of , and they get sharper as . Consequently, we derive non-asymptotic convergence rates for the tail probabilities. Unlike other approaches such as moment bounds based on drift arguments and bounds on Wasserstein distance using Stein's method, our method yields sharper tail bounds. Furthermore, our results offer bounds on the exponential rate of…
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.
Taxonomy
TopicsAdvanced Queuing Theory Analysis · Age of Information Optimization · Reliability and Maintenance Optimization
