Abstract
AbstractIn this paper we study a large system of N servers, each with capacity to process at most C simultaneous jobs; an incoming job is routed to a server if it has the lowest occupancy amongst d (out of N) randomly selected servers. A job that is routed to a server with no vacancy is assumed to be blocked and lost. Such randomized policies are referred to JSQ(d) (Join the Shortest Queue out of d) policies. Under the assumption that jobs arrive according to a Poisson process with rate
$N\lambda^{(N)}$
where
$\lambda^{(N)}=\sigma-\frac{\beta}{\sqrt{N}\,}$
,
$\sigma\in\mathbb{R}_+$
and
$\beta\in\mathbb{R}$
, we establish functional central limit theorems for the fluctuation process in both the transient and stationary regimes when service time distributions are exponential. In particular, we show that the limit is an Ornstein–Uhlenbeck process whose mean and variance depend on the mean field of the considered model. Using this, we obtain approximations to the blocking probabilities for large N, where we can precisely estimate the accuracy of first-order approximations.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference23 articles.
1. [13] Mitzenmacher, M. (1996). The power of two choices in randomized load balancing. PhD thesis, University of California, Berkeley.
2. Queueing system with selection of the shortest of two queues: an asymptotic approach;Vvedenskaya;Probl. Inform. Transm.,1996
3. Chaoticity on path space for a queueing network with selection of the shortest queue among several
4. The Power of Randomized Routing in Heterogeneous Loss Systems
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献