Overloading parallel servers when arrivals join the shortest queue

被引：0
|
作者：
McDonald, D
机构：
来源：
STOCHASTIC NETWORKS: STABILITY AND RARE EVENTS | 1996年 / 117卷
关键词：
D O I：
暂无
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
We consider two parallel servers with an arrival stream of customers who join the shorter of the two servers' queues. We use the theory of Markov additive processes to prove exact asymptotic results on the mean time for the queue at the first server to attain a high level l. We also give the limiting behaviour of the second queue at this hitting time as well as the steady state of the second queue when the first contains l customers.
引用
收藏
页码：169 / 196
页数：28
相关论文
共 50 条
12345