Replicate to the shortest queues
DOI10.1007/s11134-019-09605-2zbMath1427.60053OpenAlexW2915721625WikidataQ128329696 ScholiaQ128329696MaRDI QIDQ2281366
Rami Atar, Gal Mendelson, Isaac Keslassy
Publication date: 19 December 2019
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-019-09605-2
heavy trafficstate space collapsediffusion limitsjoin the shortest queuerandomized load balancingjob cancellationsjoin the least workloadreplicate to shortest queuestask redundancy
Queueing theory (aspects of probability theory) (60K25) Diffusion processes (60J60) Functional limit theorems; invariance principles (60F17)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diffusion approximations for open Jackson networks with reneging
- Heavy traffic analysis for EDF queues with reneging
- Resource allocation in grid computing
- Certain optimality properties of the first-come first-served discipline for G/G/s queues
- On the stability of a partially accessible multi-station queue with state-dependent routing
- Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse
- State space collapse with application to heavy traffic limits for multiclass queueing networks
- Join the shortest queue: Stability and exact asymptotics
- Asymptotic Optimality of Balanced Routing
- Upper bounds on work in system for multichannel queues
- Deciding Which Queue to Join: Some Counterexamples
- Subdiffusive Load Balancing in Time-Varying Queueing Systems
- An ɛ-Nash Equilibrium with High Probability for Strategic Customers in Heavy Traffic
This page was built for publication: Replicate to the shortest queues
