Asymptotic Optimality of Power-of-d Load Balancing in Large-Scale Systems
DOI10.1287/moor.2019.1042zbMath1455.60124arXiv1612.00722OpenAlexW2980494667MaRDI QIDQ3387935
Debankur Mukherjee, Johan S. H. van Leeuwaarden, Philip A. Whiting, Sem C. Borst
Publication date: 8 January 2021
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.00722
functional limit theoremsload balancingdiffusion limitfluid limitjoin the shortest queuestochastic couplingmany-server asymptoticspower-of-\(d\) scheme
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heavy traffic analysis for EDF queues with reneging
- Reflected diffusions defined via the extended Skorokhod map
- Deterministic and stochastic differential inclusions with multiple surfaces of discontinuity
- Martingale proofs of many-server heavy-traffic limits for Markovian queues
- Optimality of the shortest line discipline with state-dependent service rates
- Optimality of routing and servicing in dependent parallel processing systems
- The Skorohod oblique reflection problem in domains with corners and application to stochastic differential equations
- Large loss networks
- Queueing system with selection of the shortest of two queues: An asymptotic approach
- Law of large numbers for the many-server earliest-deadline-first queue
- A Skorokhod map on measure-valued paths with applications to priority queues
- Largest weighted delay first scheduling: Large deviations and optimality
- Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers
- Pull-based load distribution in large-scale heterogeneous service systems
- Stochastic-Process Limits
- Universality of load balancing schemes on the diffusion scale
- Double Skorokhod Map and Reneging Real-Time Queues
- Heavy-Traffic Approximations for Service Systems With Blocking
- Stochastic differential equations with reflecting boundary conditions
- A simple dynamic routing problem
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Optimal routing and buffer allocation for a class of finite capacity queueing systems
- Optimality of the shortest line discipline
- On the optimal assignment of customers to parallel servers
- Sample Path Criteria for Weak Majorization
- Some Properties of the Erlang Loss Function
- The Effect of Increasing Routing Choice on Resource Pooling
- Universality of Power-of-d Load Balancing in Many-Server Systems
- Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics
- Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates
This page was built for publication: Asymptotic Optimality of Power-of-d Load Balancing in Large-Scale Systems