Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems
From MaRDI portal
Publication:2060617
DOI10.1016/j.orl.2021.06.010OpenAlexW3177468128MaRDI QIDQ2060617
Siva Theja Maguluri, Daniela Hurtado-Lange
Publication date: 13 December 2021
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.00538
Probability theory and stochastic processes (60-XX) Calculus of variations and optimal control; optimization (49-XX)
Related Items (2)
A load balancing system in the many-server heavy-traffic asymptotics ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
Cites Work
- Unnamed Item
- Unnamed Item
- Asymptotically tight steady-state queue length bounds implied by drift conditions
- Optimality of routing and servicing in dependent parallel processing systems
- On the stability of a partially accessible multi-station queue with state-dependent routing
- Asymptotic Optimality of Balanced Routing
- Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay
- A simple dynamic routing problem
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- Optimality of the shortest line discipline
- On the optimal assignment of customers to parallel servers
- A Basic Dynamic Routing Problem and Diffusion
- Balanced Allocations
- Transform Methods for Heavy-Traffic Analysis
- Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems
- Inequalities: theory of majorization and its applications
This page was built for publication: Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems
