Join the shortest queue with many servers. The heavy-traffic asymptotics
From MaRDI portal
Publication:5219674
Abstract: We consider queueing systems with n parallel queues under a Join the Shortest Queue (JSQ) policy in the Halfin-Whitt heavy traffic regime. We use the martingale method to prove that a scaled process counting the number of idle servers and queues of length exactly 2 weakly converges to a two-dimensional reflected Ornstein-Uhlenbeck process, while processes counting longer queues converge to a deterministic system decaying to zero in constant time. This limiting system is comparable to that of the traditional Halfin-Whitt model, but there are key differences in the queueing behavior of the JSQ model. In particular, only a vanishing fraction of customers will have to wait, but those who do will incur a constant order waiting time.
Recommendations
- 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
- Join the shortest queue among \(k\) parallel queues: tail asymptotics of its stationary distribution
- A join the shorter queue model in heavy traffic
- Heavy traffic limit theorems for a queueing system in which customers join the shortest line
Cites work
- A Basic Dynamic Routing Problem and Diffusion
- An Inequality for a Class of Integral Systems
- Heavy traffic limit theorems for a queueing system in which customers join the shortest line
- Heavy traffic limit theorems for a sequence of shortest queueing systems
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- scientific article; zbMATH DE number 2237386 (Why is no real title available?)
- Martingale proofs of many-server heavy-traffic limits for Markovian queues
- On the optimal assignment of customers to parallel servers
- Optimal Control of Distributed Parallel Server Systems Under the Halfin and Whitt Regime
- Optimality of the shortest line discipline
- Queueing system with selection of the shortest of two queues: An asymptotic approach
- Randomized longest-queue-first scheduling for large-scale buffered systems
- Reflected diffusions defined via the extended Skorokhod map
- Shorter Notes: A Note on an Inequality Due to Greene
- Small Random perturbation of dynamical systems with reflecting boundary
- State space collapse in many-server diffusion limits of parallel server systems
- Stochastic-Process Limits
- The shortest queue problem
- Two queues in parallel
- TWO QUEUES IN PARALLEL
- Two Similar Queues in Parallel
Cited in
(49)- Queueing systems with different service disciplines
- Stationary analysis of the shortest queue problem
- Join-the-shortest queue diffusion limit in Halfin-Whitt regime: tail asymptotics and scaling of extrema
- Approximating the mean response time of parallel queues with JSQ policy
- Join the shortest queue among \(k\) parallel queues: tail asymptotics of its stationary distribution
- Group service system with three queues and load balancing
- A load balancing system in the many-server heavy-traffic asymptotics
- Near equilibrium fluctuations for supermarket models with growing choices
- Join-the-shortest queue diffusion limit in Halfin-Whitt regime: sensitivity on the heavy-traffic parameter
- Stability of JSQ in queues with general server-job class compatibilities
- Limit theorems for queueing systems with various service disciplines in heavy-traffic conditions
- Many-server asymptotics for join-the-shortest-queue: large deviations and rare events
- Martingales and buffer overflow for the symmetric shortest queue model
- Gravitation versus Brownian motion
- Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers
- 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
- Deciding Which Queue to Join: Some Counterexamples
- Heavy traffic limit theorems for a queueing system in which customers join the shortest line
- A join the shorter queue model in heavy traffic
- Large-scale join-idle-queue system with general service times
- Heavy traffic limits for join-the-shortest-estimated-queue policy using delayed information
- Sensitivity of mean-field fluctuations in Erlang loss models with randomized routing
- To pool or not to pool: queueing design for large-scale service systems
- Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
- Stability of parallel server systems
- Universality of power-of-d load balancing in many-server systems
- Delay-minimizing capacity allocation in an infinite server-queueing system
- Join Idle Queue with Service Elasticity: Large-Scale Asymptotics of a Nonmonotone System
- Inert drift system in a viscous fluid: steady state asymptotics and exponential ergodicity
- Transform methods for heavy-traffic analysis
- Performance analysis of joining the shortest queue model among a large number of queues
- 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
- A Large Deviation Principle for Join the Shortest Queue
- The inert drift atlas model
- Approximations for a queueing game model with join-the-shortest-queue strategy
- <scp>Steady‐state</scp> analysis of load balancing with Coxian‐2 distributed service times
- A 3-queue polling system with join the shortest-serve the longest policy
- Cost-aware defense for parallel server systems against reliability and security failures
- The Join-the-Shortest-Queue System in the Halfin-Whitt Regime: Rates of Convergence to the Diffusion Limit
- The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times
- Optimal rate-matrix pruning for large-scale heterogeneous systems
- A game-theoretic framework for distributed load balancing: static and dynamic game models
- Invariance principle and McKean-Vlasov limit for randomized load balancing in heavy traffic
- Mean-field analysis of large-scale bipartite queueing models for threshold-based and stochastic offloading multi-access edge computing
- Large deviation asymptotics for the supermarket model with growing choices
- Large deviations without principle: join the shortest queue
This page was built for publication: Join the shortest queue with many servers. The heavy-traffic asymptotics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5219674)
