arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1201.5523math.PRmath.CO
收藏

到达率趋于1的超市模型

The supermarket model with arrival rate tending to one

Graham Brightwell, Malwina Luczak

摘要:

在超级市场模型中,存在$n$队列,每个队列都有一个服务器。顾客到达服从泊松过程,到达率为$λn$,其中$λ= λ(n) \in (0,1)$。到达后,客户随机均匀地选择$d=d(n)$服务器,并加入所选服务器中负载最小的服务器的队列。服务时间是独立的指数分布的随机变量,平均值约为1。在本文中,我们分析了超市模型的行为在一个政权,$λ(n)$趋于~1,$d(n)$趋于无穷大,$n \to \infty$。对于合适的三元组$(n,d,λ)$,我们确定了一个子集${\cal N}$的状态空间的过程中保持了很长一段时间的平衡。我们进一步表明,该过程是迅速混合时,开始在${\cal N}$,并给出边界的速度混合更一般的初始条件。

英文摘要:

In the supermarket model, there are $n$ queues, each with a single server. Customers arrive in a Poisson process with arrival rate $λn$, where $λ= λ(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 $λ(n)$ tends to~1, and $d(n)$ tends to infinity, as $n \to \infty$. For suitable triples $(n,d,λ)$, 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑