Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
From MaRDI portal
Publication:5094912
Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)
Recommendations
- Scalable load balancing in networked systems: universality properties and stochastic coupling methods
- Universality of power-of-d load balancing in many-server systems
- Universality of load balancing schemes on the diffusion scale
- Asymptotic optimality of power-of-\(d\) load balancing in large-scale systems
- Replicate to the shortest queues
Cites work
- A Basic Dynamic Routing Problem and Diffusion
- A diffusion regime with nondegenerate slowdown
- A law of large numbers for M/M/c/delayoff-setup queues with nonstationary arrivals
- A lower bound on the queueing delay in resource constrained load balancing
- A service system with on-demand agent invitations
- A simple dynamic routing problem
- Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems
- Asymptotic approximations for stationary distributions of many-server queues with abandonment
- Asymptotic distributions and chaos for the supermarket model
- Asymptotic independence of queues under randomized load balancing
- Asymptotic optimality of power-of-\(d\) load balancing in large-scale systems
- Asymptotics of insensitive load balancing and blocking phases
- Averaging over fast variables in the fluid limit for Markov chains: Application to the supermarket model with memory
- Balanced allocation on graphs
- Balanced allocations (extended abstract)
- Balanced Allocations: The Heavily Loaded Case
- Balanced allocations: the heavily loaded case
- Balanced routing of random calls
- Chaoticity on path space for a queueing network with selection of the shortest queue among several
- Choosing among heterogeneous server clouds
- Comparing load balancing algorithms for distributed queueing networks
- Cuckoo hashing
- Delay, memory, and messaging tradeoffs in distributed service systems
- Differential equation approximations for Markov chains
- Diffusion approximations for load balancing mechanisms in cloud storage systems
- Economies-of-scale in many-server queueing systems: tutorial and partial review of the QED Halfin-Whitt heavy-traffic regime
- Efficient hashing with lookups in two memory accesses
- Ergodicity of partially accessible multichannel communication systems
- Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward
- Expected Length of the Longest Probe Sequence in Hash Code Searching
- Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates
- First passage times to congested states of many-server systems in the Halfin-Whitt regime
- Flexible queueing architectures
- Functional central limit theorems for a large network in which customers join the shortest of several queues
- Heavy traffic limit theorems for a sequence of shortest queueing systems
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- How asymmetry helps load balancing
- scientific article; zbMATH DE number 3868389 (Why is no real title available?)
- scientific article; zbMATH DE number 3950178 (Why is no real title available?)
- scientific article; zbMATH DE number 1263199 (Why is no real title available?)
- scientific article; zbMATH DE number 1947316 (Why is no real title available?)
- scientific article; zbMATH DE number 4188945 (Why is no real title available?)
- Insensitivity of the mean field limit of loss systems under \(\mathrm{SQ}(d)\) routeing
- Job assignment in large-scale service systems with affinity relations
- Join Idle Queue with Service Elasticity: Large-Scale Asymptotics of a Nonmonotone System
- Join the shortest queue with many servers. The heavy-traffic asymptotics
- Join the shortest queue: Stability and exact asymptotics
- Join-the-shortest queue diffusion limit in Halfin-Whitt regime: sensitivity on the heavy-traffic parameter
- Join-the-shortest queue diffusion limit in Halfin-Whitt regime: tail asymptotics and scaling of extrema
- Large loss networks
- Large-scale join-idle-queue system with general service times
- Limits of relative entropies associated with weakly interacting particle systems
- Loss networks under diverse routing: the symmetric star network
- On optimality of the FCFS discipline in multiserver queueing systems and networks
- On the maximum queue length in the supermarket model
- On the optimal assignment of customers to parallel servers
- On the power of (even a little) resource pooling
- On the power of two choices: balls and bins in continuous time
- On the rate of convergence to stationarity of the M/M/n queue in the Halfin-Whitt regime
- On the stability of a partially accessible multi-station queue with state-dependent routing
- On-line routing of random calls in networks
- Open problems in queueing theory inspired by datacenter computing
- Optimal routing and buffer allocation for a class of finite capacity queueing systems
- Optimality of routing and servicing in dependent parallel processing systems
- Optimality of the shortest line discipline
- Optimality of the shortest line discipline with state-dependent service rates
- Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers
- Pull-based load distribution in large-scale heterogeneous service systems
- Queueing system with selection of the shortest of two queues: An asymptotic approach
- Queueing with redundant requests: exact analysis
- Random graphs and complex networks. Volume 1
- Randomized assignment of jobs to servers in heterogeneous clusters of shared servers for low delay
- Redundancy-\(\mathbf{d}\): the power of \(\mathbf{d}\) choices for redundancy
- Sample Path Criteria for Weak Majorization
- Scalable load balancing in networked systems: universality properties and stochastic coupling methods
- Shared memory simulations with triple-logarithmic delay
- Space efficient hash tables with worst case constant access time
- Spectral gap of the Erlang A model in the Halfin-Whitt regime
- Stability of join the shortest queue networks
- Stability of two families of queueing networks and a discussion of fluid limits
- 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
- Steady-state GI/G/\(n\) queue in the Halfin-Whitt regime
- Strong approximation for the supermarket model
- Strong approximation theorems for density dependent Markov chains
- Subdiffusive load balancing in time-varying queueing systems
- Supermarket model on graphs
- The Effect of Increasing Routing Choice on Resource Pooling
- The equilibrium states of large networks of Erlang queues
- The hydrodynamic limit of a randomized load balancing network
- The stationary behaviour of fluid limits of reversible processes is concentrated on stationary points
- The supermarket model with bounded queue lengths in equilibrium
- Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems
- Transient behavior of the Halfin-Whitt diffusion
- Universality of load balancing schemes on the diffusion scale
- Universality of power-of-d load balancing in many-server systems
- Validity of heavy traffic steady-state approximations in generalized Jackson networks
- Zero-wait load balancing with sparse messaging
Cited in
(14)- Near equilibrium fluctuations for supermarket models with growing choices
- Zero-wait load balancing with sparse messaging
- Scalable load balancing in networked systems: A survey of recent advances
- Heavy-traffic limits for parallel single-server queues with randomly split Hawkes arrival processes
- Optimal rate-matrix pruning for large-scale heterogeneous systems
- Fluid limits for interacting queues in sparse dynamic graphs
- Invariance principle and McKean-Vlasov limit for randomized load balancing in heavy traffic
- Optimal capacity planning for cloud service providers with periodic, time-varying demand
- Mean-field analysis for load balancing on spatial graphs
- Geometric lower bounds for the steady-state occupancy of processing networks with limited connectivity
- Stochastic Volterra integral equations with ranks as scaling limits of parallel infinite-server queues under weighted shortest queue policy
- Mean-field analysis of large-scale bipartite queueing models for threshold-based and stochastic offloading multi-access edge computing
- Flocking under fast and large jumps: stability, chaos, and traveling waves
- Large deviation asymptotics for the supermarket model with growing choices
This page was built for publication: Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094912)
