Reproduce “Tail Bounds for Queues with Abandonment: Constant, Moderate, Large Deviations, and Efficient Concentration” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Zedong Wang, Siva Theja Maguluri
The authors bound stationary queue-length tails in an overloaded, continuous-time single-server queue stabilized by abandonment. They quantify the error between the normalized queue’s exceedance probability and the Gaussian tail at fixed deviations, then establish sub-Gaussian and sub-Poisson decay as deviations grow with the abandonment rate. These mathematical bounds apply under small abandonment and the stated overload scaling, not measured performance.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.