The Power of Slightly More than One Sample in Randomized Load Balancing
From MaRDI portal
Publication:5359116
DOI10.1287/moor.2016.0823zbMath1420.68028OpenAlexW2589907274MaRDI QIDQ5359116
No author found.
Publication date: 22 September 2017
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2016.0823
batch arrivalmean-field analysissample complexityrandomized load balancingKurtz's theoreminterchange of the limits
Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (12)
To Pool or Not to Pool: Queueing Design for Large-Scale Service Systems ⋮ MDS coding is better than replication for job completion times ⋮ Zero-wait load balancing with sparse messaging ⋮ Approximations for a queueing game model with join-the-shortest-queue strategy ⋮ Mean field approximations to a queueing system with threshold-based workload control scheme ⋮ A lower bound on the queueing delay in resource constrained load balancing ⋮ A non-linear multi-objective technique for hybrid peer-to-peer communication ⋮ Transform Methods for Heavy-Traffic Analysis ⋮ Dynamic routing in a distributed parallel many-server service system: the effect of \(\xi \)-choice ⋮ Interference queueing networks on grids ⋮ Power-of-d-Choices with Memory: Fluid Limit and Optimality ⋮ Balanced routing with partial information in a distributed parallel many-server queueing system
This page was built for publication: The Power of Slightly More than One Sample in Randomized Load Balancing
