arXiv Analytics

Sign in

arXiv:math/0405183 [math.PR]AbstractReferencesReviewsResources

Strong approximation for the supermarket model

Malwina J. Luczak, James Norris

Published 2004-05-11Version 1

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.

Related articles: Most relevant | Search more
arXiv:0808.2865 [math.PR] (Published 2008-08-21)
Central limit theorem for a many-server queue with random service rates
arXiv:1212.1379 [math.PR] (Published 2012-12-06, updated 2013-06-09)
Optimal On-Line Selection of an Alternating Subsequence: A Central Limit Theorem
arXiv:math/0702481 [math.PR] (Published 2007-02-16, updated 2007-05-04)
Central Limit Theorem for a Class of Relativistic Diffusions