The supermarket model with arrival rate tending to one

Details The supermarket model with arrival rate tending to one The supermarket model with arrival rate tending to one

2012-01-26

arxiv.org/abs/1201.5523v1

Mathematics

Probability

64 pages

Scientific paper

In the supermarket model, there are $n$ queues, each with a single server. Customers arrive in a Poisson process with arrival rate $\lambda n$, where $\lambda = \lambda (n) \in (0,1)$. Upon arrival, a customer selects $d=d(n)$ servers uniformly at random, and joins the queue of a least-loaded server amongst those chosen. Service times are independent exponentially distributed random variables with mean~1. In this paper, we analyse the behaviour of the supermarket model in a regime where $\lambda(n)$ tends to~1, and $d(n)$ tends to infinity, as $n \to \infty$. For suitable triples $(n,d,\lambda)$, we identify a subset ${\cal N}$ of the state space where the process remains for a long time in equilibrium. We further show that the process is rapidly mixing when started in ${\cal N}$, and give bounds on the speed of mixing for more general initial conditions.

Affiliated with

Also associated with

No associations

Rating

The supermarket model with arrival rate tending to one does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The supermarket model with arrival rate tending to one, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The supermarket model with arrival rate tending to one will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-445660