BRAVO for Many-Server QED Systems with Finite Buffers
From MaRDI portal
Publication:5246179
DOI10.1239/aap/1427814589zbMath1310.60128arXiv1308.0933OpenAlexW2054817414MaRDI QIDQ5246179
Yoni Nazarathy, Johan S. H. van Leeuwaarden, Daryl J. Daley
Publication date: 17 April 2015
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.0933
queueing systemsHalfin-Whitt regimefinite birth-death processesqueueing output variance asymptoticsstationary Poisson queue asymptotics
Queueing theory (aspects of probability theory) (60K25) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items
The intercept term of the asymptotic variance curve for some queueing output processes ⋮ Service Systems with Slowdowns: Potential Failures and Proposed Solutions ⋮ Precise formulae for bravo coefficients
Cites Work
- Unnamed Item
- Unnamed Item
- The variance of departure processes: puzzling behavior and open problems
- Revisiting queueing output processes: a point process viewpoint
- The asymptotic variance rate of the output process of finite capacity birth-death queues
- Martingale proofs of many-server heavy-traffic limits for Markovian queues
- The \(G/GI/N\) queue in the Halfin-Whitt regime
- Heavy traffic limits for queues with many deterministic servers
- Refining Square-Root Safety Staffing by Expanding Erlang C
- The asymptotic variance of departures in critically loaded queues
- Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime
- Dimensioning Large Call Centers
- On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design
- Queueing Networks: A Survey of Their Random Processes
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Queueing output processes
- A Diffusion Approximation for the G/GI/n/m Queue
- Diffusion Approximations for a Multiclass Markovian Service System with “Guaranteed” and “Best-Effort” Service Levels
- Heavy-Traffic Limits for the G/H2*/n/mQueue
