Balanced routing of random calls

DOI10.1214/14-AAP1023zbMath1314.60152arXiv0801.1260OpenAlexW3106404877MaRDI QIDQ2346072

Malwina J. Luczak, Colin J. H. McDiarmid

Publication date: 29 May 2015

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0801.1260

zbMATH Keywords

load balancingblocking probabilitypower of two choicesrouting of random calls

Mathematics Subject Classification ID

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) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items

Scalable Load Balancing in Networked Systems: A Survey of Recent Advances

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A limit result respecting graph structure for a fully connected loss network with alternative routing
• Loss networks
• On-line routing of random calls in networks
• Efficient PRAM simulation on a distributed memory machine
• On the maximum queue length in the supermarket model
• On the power of two choices: balls and bins in continuous time
• Balanced allocations (extended abstract)
• Balanced allocations
• Balanced Allocations
• Asymptotically Optimal Loss Network Control
• Steady state analysis of balanced‐allocation routing