Asymptotic independence of queues under randomized load balancing

DOI10.1007/s11134-012-9311-0zbMath1275.60071OpenAlexW2023246505MaRDI QIDQ383265

Yi Lu, Balaji Prabhakar, Maury Bramson

Publication date: 25 November 2013

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-012-9311-0

zbMATH Keywords

asymptotic independenceload balancingjoin the shortest queuejoin the least loaded queue

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (33)

Choosing among heterogeneous server clouds ⋮ Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers ⋮ Asymptotic independence of servers' activity in queueing systems with limited resource pooling ⋮ Asymptotics of insensitive load balancing and blocking phases ⋮ On a doubly dynamically controlled supermarket model with impatient customers ⋮ Near equilibrium fluctuations for supermarket models with growing choices ⋮ Decay of tails at equilibrium for FIFO join the shortest queue networks ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ <scp>Steady‐state</scp> analysis of load balancing with Coxian‐2 distributed service times ⋮ Estimating Multiclass Service Demand Distributions Using Markovian Arrival Processes ⋮ On the Approximation Error of Mean-Field Models ⋮ Universality of Power-of-d Load Balancing in Many-Server Systems ⋮ Join Idle Queue with Service Elasticity: Large-Scale Asymptotics of a Nonmonotone System ⋮ Stability of join the shortest queue networks ⋮ Stability of JSQ in queues with general server-job class compatibilities ⋮ The mean-field computation in a supermarket model with server multiple vacations ⋮ Block-structured supermarket models ⋮ Many-server asymptotics for join-the-shortest-queue: large deviations and rare events ⋮ TAIL PROBABILITIES IN QUEUEING PROCESSES ⋮ Randomized longest-queue-first scheduling for large-scale buffered systems ⋮ Performance Analysis of Joining the Shortest Queue Model Among a Large Number of Queues ⋮ Large-scale join-idle-queue system with general service times ⋮ On the impact of job size variability on heterogeneity-aware load balancing ⋮ Diffusion approximations for load balancing mechanisms in cloud storage systems ⋮ Pull-based load distribution in large-scale heterogeneous service systems ⋮ Large-scale parallel server system with multi-component jobs ⋮ Power-of-d-Choices with Memory: Fluid Limit and Optimality ⋮ Propagation of chaos and Poisson hypothesis ⋮ Economies-of-Scale in Many-Server Queueing Systems: Tutorial and Partial Review of the QED Halfin--Whitt Heavy-Traffic Regime ⋮ Large-scale heterogeneous service systems with general packing constraints ⋮ Delay asymptotics and bounds for multitask parallel jobs ⋮ The hydrodynamic limit of a randomized load balancing network ⋮ Parallel Server Systems with Cancel-on-Completion Redundancy

Cites Work

• Decay of tails at equilibrium for FIFO join the shortest queue networks
• Stability of join the shortest queue networks
• On the stability of a partially accessible multi-station queue with state-dependent routing
• Chaos hypothesis for a system interacting through shared resources
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• Fast Jackson networks
• On the maximum queue length in the supermarket model
• On the power of two choices: balls and bins in continuous time
• Balanced Allocations
• Chaoticity on path space for a queueing network with selection of the shortest queue among several
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotic independence of queues under randomized load balancing