Join Idle Queue with Service Elasticity: Large-Scale Asymptotics of a Nonmonotone System
From MaRDI portal
Publication:5113913
Abstract: We consider the model of a token-based joint auto-scaling and load balancing strategy, proposed in a recent paper by Mukherjee, Dhara, Borst, and van Leeuwaarden (SIGMETRICS '17, arXiv:1703.08373), which offers an efficient scalable implementation and yet achieves asymptotically optimal steady-state delay performance and energy consumption as the number of servers . In the above work, the asymptotic results are obtained under the assumption that the queues have fixed-size finite buffers, and therefore the fundamental question of stability of the proposed scheme with infinite buffers was left open. In this paper, we address this fundamental stability question. The system stability under the usual subcritical load assumption is not automatic. Moreover, the stability may not even hold for all . The key challenge stems from the fact that the process lacks monotonicity, which has been the powerful primary tool for establishing stability in load balancing models. We develop a novel method to prove that the subcritically loaded system is stable for large enough , and establish convergence of steady-state distributions to the optimal one, as . The method goes beyond the state of the art techniques -- it uses an induction-based idea and a "weak monotonicity" property of the model; this technique is of independent interest and may have broader applicability.
Recommendations
- Large-scale join-idle-queue system with general service times
- Many-server asymptotics for join-the-shortest-queue: large deviations and rare events
- Join the shortest queue with many servers. The heavy-traffic asymptotics
- Asymptotically optimal idling in the \(GI/GI/N+GI\) queue
- \(M/M/n/m\) queueing systems with non-identical servers
- Large fork-join queues with nearly deterministic arrival and service times
- Equilibrium joining strategies in batch service queueing systems
- Strategic Joining in an M/M/1 Constant Retrial Queue with Reserved Idle Time Under N-Policy
- Queue-and-idleness-ratio controls in many-server service systems
- A unified approach for large queue asymptotics in a heterogeneous multiserver queue
Cites work
- scientific article; zbMATH DE number 1190409 (Why is no real title available?)
- scientific article; zbMATH DE number 3892344 (Why is no real title available?)
- A law of large numbers for M/M/c/delayoff-setup queues with nonstationary arrivals
- A service system with on-demand agent invitations
- Asymptotic independence of queues under randomized load balancing
- Decay of tails at equilibrium for FIFO join the shortest queue networks
- Ergodicity of stochastic processes describing the operation of open queueing networks
- Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward
- Large-scale join-idle-queue system with general service times
- Markov chains and stochastic stability
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- 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
- Stability conditions for a discrete-time decentralised medium access algorithm
- Universality of load balancing schemes on the diffusion scale
- Universality of power-of-\(d\) load balancing in many-server systems
This page was built for publication: Join Idle Queue with Service Elasticity: Large-Scale Asymptotics of a Nonmonotone System
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113913)
