A lower bound on the queueing delay in resource constrained load balancing
From MaRDI portal
Publication:2192743
DOI10.1214/19-AAP1519zbMath1457.60138arXiv1807.02882OpenAlexW3033044621MaRDI QIDQ2192743
Martin Zubeldia, David Gamarnik, John N. Tsitsiklis
Publication date: 17 August 2020
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.02882
Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems
Cites Work
- Unnamed Item
- Tight bounds for parallel randomized load balancing
- Decay of tails at equilibrium for FIFO join the shortest queue networks
- Queueing system with selection of the shortest of two queues: An asymptotic approach
- Pull-based load distribution in large-scale heterogeneous service systems
- Universality of load balancing schemes on the diffusion scale
- Optimality of the shortest line discipline
- Balanced Allocations
- Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems
- Choice-Memory Tradeoff in Allocations
- The Power of Slightly More than One Sample in Randomized Load Balancing
This page was built for publication: A lower bound on the queueing delay in resource constrained load balancing