Strong approximation for the supermarket model

DOI10.1214/105051605000000368MaRDI QIDQ2572400zbMATH OpenOpenAlexFDO

Authors Malwina Luczak, James R. Norris

Publication date 8 November 2005

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0405183

zbMATH Keywords

law of large numbersjoin the shortest queue

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Strong limit theorems (60F15)

Abstract: We prove three strong approximation theorems for the `supermarket' or `join the shortest queue' model -- a law of large numbers, a jump process approximation and a central limit theorem. The estimates are carried through rather explicitly. This allows us to estimate each of the infinitely many components of the process in its own scale and to exhibit a cut-off in the set of active components which grows slowly with the number of servers.

Recommendations

• The supermarket model with bounded queue lengths in equilibrium
• Asymptotic distributions and chaos for the supermarket model
• Dynamics of the non-homogeneous supermarket model
• Near equilibrium fluctuations for supermarket models with growing choices
• Supermarket model on graphs
• On the maximum queue length in the supermarket model
• Block-structured supermarket models
• The mean-field computation in a supermarket model with server multiple vacations
• Supermarket Choice and Supermarket Competition in Market Equilibrium
• On a doubly dynamically controlled supermarket model with impatient customers

Cites work

• scientific article; zbMATH DE number 3951715 (Why is no real title available?)
• scientific article; zbMATH DE number 48952 (Why is no real title available?)
• scientific article; zbMATH DE number 2034511 (Why is no real title available?)
• scientific article; zbMATH DE number 1488838 (Why is no real title available?)
• An approximation of partial sums of independent RV'-s, and the sample DF. I
• Chaoticity on path space for a queueing network with selection of the shortest queue among several
• Fast Jackson networks
• Functional central limit theorems for a large network in which customers join the shortest of several queues
• On the maximum queue length in the supermarket model
• On the power of two choices: balls and bins in continuous time
• Ordinary differential equations in Banach spaces
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• Structure of large random hypergraphs
• Tusnady's lemma, 24 years later

Cited in

(14)

• On the maximum queue length in the supermarket model
• Real-time dynamic control in the supermarket models and some numerical analyses
• The hydrodynamic limit of a randomized load balancing network
• Supermarket model on graphs
• Universality of power-of-\(d\) load balancing in many-server systems
• The supermarket model with bounded queue lengths in equilibrium
• The mean-field computation in a supermarket model with server multiple vacations
• Staffing and control of instant messaging contact centers
• Asymptotic distributions and chaos for the supermarket model
• Block-structured supermarket models
• Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
• Economies-of-scale in many-server queueing systems: tutorial and partial review of the QED Halfin-Whitt heavy-traffic regime
• Averaging over fast variables in the fluid limit for Markov chains: Application to the supermarket model with memory
• Near equilibrium fluctuations for supermarket models with growing choices

This page was built for publication: Strong approximation for the supermarket model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2572400)