Asymptotics of insensitive load balancing and blocking phases
From MaRDI portal
Publication:1649969
DOI10.1007/s11134-017-9559-5zbMath1390.60325arXiv1605.02996OpenAlexW2768979897MaRDI QIDQ1649969
Matthieu Jonckheere, Balakrishna J. Prabhu
Publication date: 29 June 2018
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.02996
Central limit and other weak theorems (60F05) Queueing theory (aspects of probability theory) (60K25) Large deviations (60F10)
Related Items (2)
Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ Stability of JSQ in queues with general server-job class compatibilities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic independence of queues under randomized load balancing
- An explicit formula for the coefficients in Laplace's method
- Functional inequalities for the incomplete gamma function
- Insensitive versus efficient dynamic load balancing in networks without blocking
- Corrected asymptotics for a multi-server queue in the Halfin-Whitt regime
- Towards an Erlang formula for multiclass networks
- Queueing system with selection of the shortest of two queues: An asymptotic approach
- Insensitive bandwidth sharing in data networks
- The stationary behaviour of fluid limits of reversible processes is concentrated on stationary points
- Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers
- Optimal robust policies for bandwidth allocation and admission control in wireless networks
- Insensitive load balancing in data networks
- A queueing analysis of max-min fairness, proportional fairness and balanced fairness
- Refining Square-Root Safety Staffing by Expanding Erlang C
- A Diffusion Regime with Nondegenerate Slowdown
- Universality of load balancing schemes on the diffusion scale
- On the Optimality of the Generalized Shortest Queue Policy
- Heavy-Traffic Approximations for Service Systems With Blocking
- Insensitive bounds for the stationary distribution of non-reversible Markov chains
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Some Properties of the Erlang Loss Function
- Chaoticity on path space for a queueing network with selection of the shortest queue among several
- Large-scale join-idle-queue system with general service times
- Partial balance and insensitivity
- Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates
- Gaussian expansions and bounds for the Poisson distribution applied to the Erlang B formula
- Elements of Information Theory
This page was built for publication: Asymptotics of insensitive load balancing and blocking phases
