Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
From MaRDI portal
Publication:5094912
DOI10.1137/20M1323746MaRDI QIDQ5094912
Johan S. H. van Leeuwaarden, Debankur Mukherjee, Mark van der Boor, Sem C. Borst
Publication date: 5 August 2022
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.05444
Stochastic network models in operations research (90B15) 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) Distributed systems (68M14) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A service system with on-demand agent invitations
- Queueing with redundant requests: exact analysis
- On the rate of convergence to stationarity of the M/M/\(n\) queue in the Halfin-Whitt regime
- Asymptotic independence of queues under randomized load balancing
- Steady-state GI/G/\(n\) queue in the Halfin-Whitt regime
- Asymptotic approximations for stationary distributions of many-server queues with abandonment
- Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward
- Transient behavior of the Halfin-Whitt diffusion
- Stability of join the shortest queue networks
- Differential equation approximations for Markov chains
- Optimality of the shortest line discipline with state-dependent service rates
- Stability of two families of queueing networks and a discussion of fluid limits
- Ergodicity of partially accessible multichannel communication systems
- Optimality of routing and servicing in dependent parallel processing systems
- Strong approximation theorems for density dependent Markov chains
- On the stability of a partially accessible multi-station queue with state-dependent routing
- Large loss networks
- Queueing system with selection of the shortest of two queues: An asymptotic approach
- On-line routing of random calls in networks
- Asymptotics of insensitive load balancing and blocking phases
- Join-the-shortest queue diffusion limit in Halfin-Whitt regime: tail asymptotics and scaling of extrema
- The supermarket model with bounded queue lengths in equilibrium
- Functional central limit theorems for a large network in which customers join the shortest of several queues
- Space efficient hash tables with worst case constant access time
- Join the shortest queue: Stability and exact asymptotics
- Heavy traffic limit theorems for a sequence of shortest queueing systems
- Averaging over fast variables in the fluid limit for Markov chains: Application to the supermarket model with memory
- The stationary behaviour of fluid limits of reversible processes is concentrated on stationary points
- Open problems in queueing theory inspired by datacenter computing
- Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems
- Join-the-shortest queue diffusion limit in Halfin-Whitt regime: sensitivity on the heavy-traffic parameter
- Zero-wait load balancing with sparse messaging
- A lower bound on the queueing delay in resource constrained load balancing
- Job assignment in large-scale service systems with affinity relations
- The hydrodynamic limit of a randomized load balancing network
- Balanced routing of random calls
- Choosing among heterogeneous server clouds
- Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers
- Supermarket model on graphs
- Asymptotic distributions and chaos for the supermarket model
- Validity of heavy traffic steady-state approximations in generalized Jackson networks
- On the maximum queue length in the supermarket model
- Limits of relative entropies associated with weakly interacting particle systems
- Pull-based load distribution in large-scale heterogeneous service systems
- On the power of two choices: balls and bins in continuous time
- Strong approximation for the supermarket model
- Balanced allocations (extended abstract)
- Random Graphs and Complex Networks
- A Diffusion Regime with Nondegenerate Slowdown
- Universality of load balancing schemes on the diffusion scale
- Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay
- Balanced allocations
- Steady-state analysis of load-balancing algorithms in the sub-Halfin–Whitt regime
- Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime
- Asymptotic Optimality of Power-of-d Load Balancing in Large-Scale Systems
- How asymmetry helps load balancing
- Balanced allocation on graphs
- A simple dynamic routing problem
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Expected Length of the Longest Probe Sequence in Hash Code Searching
- Optimal routing and buffer allocation for a class of finite capacity queueing systems
- Optimality of the shortest line discipline
- On the optimal assignment of customers to parallel servers
- A Basic Dynamic Routing Problem and Diffusion
- Sample Path Criteria for Weak Majorization
- Chaoticity on path space for a queueing network with selection of the shortest queue among several
- A Law of Large Numbers for M/M/c/Delayoff-Setup Queues with Nonstationary Arrivals
- Flexible Queueing Architectures
- Large-scale join-idle-queue system with general service times
- Loss networks under diverse routing: the symmetric star network
- Cuckoo hashing
- The Effect of Increasing Routing Choice on Resource Pooling
- First Passage Times to Congested States of Many-Server Systems in the Halfin–Whitt Regime
- The equilibrium states of large networks of Erlang queues
- Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems
- Universality of Power-of-d Load Balancing in Many-Server Systems
- Join Idle Queue with Service Elasticity: Large-Scale Asymptotics of a Nonmonotone System
- SCALABLE LOAD BALANCING IN NETWORKED SYSTEMS: UNIVERSALITY PROPERTIES AND STOCHASTIC COUPLING METHODS
- Subdiffusive Load Balancing in Time-Varying Queueing Systems
- Spectral gap of the Erlang A model in the Halfin-Whitt regime
- Diffusion approximations for load balancing mechanisms in cloud storage systems
- Insensitivity of the mean field limit of loss systems under SQ(d) routeing
- Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics
- Economies-of-Scale in Many-Server Queueing Systems: Tutorial and Partial Review of the QED Halfin--Whitt Heavy-Traffic Regime
- Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates
- Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems
- Redundancy-d: The Power of d Choices for Redundancy
- Balanced Allocations: The Heavily Loaded Case
- Shared memory simulations with triple-logarithmic delay
This page was built for publication: Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
