On Ultra-Sharp Queueing Bounds
Florin Ciucu, Sima Mehri, Amr Rizk
摘要
We present a robust method to analyze a broad range of classical queueing models, e.g., the GI/G/1 queue with renewal arrivals, an AR/G/1 queue with alternating renewals (AR), as a special class of Semi-Markovian processes, and Markovian fluids queues. At the core of the method lies a standard change-of-measure argument to reverse the sign of the negative drift in the underlying random walks. Combined with a suitable representation of the overshoot, we obtain exact results in terms of series. Closed-form and computationally fast bounds follow by taking the series’ first terms, which are the dominant ones because of the positive drift under the new probability measure. The obtained bounds generalize the state-of-the-art class of martingale bounds and can be much sharper by orders of magnitude.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
相关 Paper
- Delay Analysis for Triggered Requests: M/G/1 Modeling ApproachMehran Rahnamania, Farid AshtianiINFOCOM 2026 · 被引用 1 次
- A Worst-Case Approximate Analysis of Peak Age-of-Information Via Robust Queueing ApproachZhongdong Liu, Yu Sang, Bin Li, Bo JiINFOCOM 2021 · 被引用 6 次
- Quantitative Supermartingale CertificatesAlessandro Abate, Mirco Giacobbe, Diptarko RoyCAV 2025 · 被引用 7 次
- Learning Deep Generative Models for Queuing SystemsCésar Ojeda, Kostadin Cvejoski, Bogdan Georgiev, Christian Bauckhage 等AAAI 2021 · 被引用 14 次
- Quantifying the Cost of Learning in Queueing SystemsDaniel Freund, Thodoris Lykouris, Wentao WengNeurIPS 2023 · 被引用 4 次
