Near equilibrium fluctuations for supermarket models with growing choices
From MaRDI portal
(Redirected from Publication:2170372)
Abstract: We consider the supermarket model in the usual Markovian setting where jobs arrive at rate for some , with parallel servers each processing jobs in its queue at rate 1. An arriving job joins the shortest among randomly selected service queues. We show that when and , under natural conditions on the initial queues, the state occupancy process converges in probability, in a suitable path space, to the unique solution of an infinite system of constrained ordinary differential equations parametrized by . Our main interest is in the study of fluctuations of the state process about its near equilibrium state in the critical regime, namely when . Previous papers have considered the regime while the objective of the current work is to develop diffusion approximations for the state occupancy process that allow for all possible rates of growth of . In particular we consider the three canonical regimes (a) ; (b) and, (c) . In all three regimes we show, by establishing suitable functional limit theorems, that (under conditions on ) fluctuations of the state process about its near equilibrium are of order and are governed asymptotically by a one dimensional Brownian motion. The forms of the limit processes in the three regimes are quite different; in the first case we get a linear diffusion; in the second case we get a diffusion with an exponential drift; and in the third case we obtain a reflected diffusion in a half space. In the special case our work gives alternative proofs for the universality results established by Mukherjee et al in 2018.
Recommendations
- Asymptotic distributions and chaos for the supermarket model
- The supermarket model with bounded queue lengths in equilibrium
- Strong approximation for the supermarket model
- Supermarket model on graphs
- Averaging over fast variables in the fluid limit for Markov chains: Application to the supermarket model with memory
Cites work
- scientific article; zbMATH DE number 1857645 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- An explicit formula for the Skorokhod map on \([0,a]\)
- Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems
- Asymptotic distributions and chaos for the supermarket model
- Asymptotic independence of queues under randomized load balancing
- Chaoticity on path space for a queueing network with selection of the shortest queue among several
- Delay, memory, and messaging tradeoffs in distributed service systems
- Diffusion approximations for load balancing mechanisms in cloud storage systems
- Fast Jackson networks
- Foundations of modern probability. In 2 volumes
- Join the shortest queue with many servers. The heavy-traffic asymptotics
- Large loss networks
- On the maximum queue length in the supermarket model
- Queueing system with selection of the shortest of two queues: An asymptotic approach
- Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
- 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
- Strong approximation for the supermarket model
- Strong approximation theorems for density dependent Markov chains
- The supermarket model with bounded queue lengths in equilibrium
- Universality of power-of-\(d\) load balancing in many-server systems
Cited in
(4)
This page was built for publication: Near equilibrium fluctuations for supermarket models with growing choices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170372)