A load balancing system in the many-server heavy-traffic asymptotics

DOI10.1007/s11134-022-09847-7zbMath1498.60362OpenAlexW4283273520MaRDI QIDQ2167923

Daniela Hurtado-Lange, Siva Theja Maguluri

Publication date: 1 September 2022

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

Full work available at URL: https://doi.org/10.1007/s11134-022-09847-7

zbMATH Keywords

Stein's methodstate space collapsetransform methodjoin the shortest queuedrift methodpower-of-\(d\) choicesload balancing systemLyapunov driftmany-server heavy-traffic

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)

Related Items (1)

Diffusion-level universality of many-server systems with concurrent service

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotically tight steady-state queue length bounds implied by drift conditions
• Fundamentals of Stein's method
• Diffusion models and steady-state approximations for exponentially ergodic Markovian queues
• Stein's method for steady-state diffusion approximations of \(\mathrm{M}/\mathrm{Ph}/n+\mathrm{M}\) systems
• State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
• 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
• Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
• Upper and lower bounds for the waiting time in the symmetric shortest queue system
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
• Optimal heavy-traffic queue length scaling in an incompletely saturated switch
• Join-the-shortest queue diffusion limit in Halfin-Whitt regime: tail asymptotics and scaling of extrema
• Heavy traffic resource pooling in parallel-server systems
• Heavy traffic queue length scaling in switches with reconfiguration delay
• 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
• Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers
• Asymptotic optimality of maximum pressure policies in stochastic processing networks
• Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse
• Validity of heavy traffic steady-state approximations in generalized Jackson networks
• State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems
• A Diffusion Regime with Nondegenerate Slowdown
• Universality of load balancing schemes on the diffusion scale
• Queue Length Behavior in a Switch under the MaxWeight Algorithm
• Stein's method for steady-state diffusion approximations: an introduction through the Erlang-A and Erlang-C models
• Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime
• Tightness of stationary distributions of a flexible-server system in the Halfin-Whitt asymptotic regime
• A simple dynamic routing problem
• Heavy-Traffic Limits for Queues with Many Exponential Servers
• Optimality of the shortest line discipline
• On the optimal assignment of customers to parallel servers
• A Basic Dynamic Routing Problem and Diffusion
• Large-scale join-idle-queue system with general service times
• On Choosing and Bounding Probability Metrics
• Universality of Power-of-d Load Balancing in Many-Server Systems
• SCALABLE LOAD BALANCING IN NETWORKED SYSTEMS: UNIVERSALITY PROPERTIES AND STOCHASTIC COUPLING METHODS
• Transform Methods for Heavy-Traffic Analysis
• Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics
• DIFFUSION APPROXIMATION FOR STATIONARY ANALYSIS OF QUEUES AND THEIR NETWORKS: A REVIEW
• Heavy traffic approximation for the stationary distribution of a generalized Jackson network: the BAR approach
• Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies
• Inequalities: theory of majorization and its applications

This page was built for publication: A load balancing system in the many-server heavy-traffic asymptotics