LIGHT TRAFFIC APPROXIMATIONS IN MANY-SERVER QUEUES

被引:9
|
作者
DALEY, DJ
ROLSKI, T
机构
[1] UNIV WROCLAW,INST MATH,PL-50384 WROCLAW,POLAND
[2] CASE WESTERN RESERVE UNIV,DEPT MATH & STAT,CLEVELAND,OH 44106
关键词
GI GI/K QUEUE; M/G/K QUEUE; STATIONARY POINT PROCESS WITH MULTIPLE POINTS; MULTIVARIATE ABELIAN LEMMA;
D O I
10.2307/1427736
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
This paper complements two previous studies (Daley and Rolski (1984), (1991)) by investigating limit properties of the waiting time in k-server queues with renewal arrival process under 'light traffic' conditions. Formulae for the limits of the probability of waiting and the waiting time moments are derived for the two approaches of dilation and thinning of the arrival process. Asmussen's (1991) approach to light traffic limits applies to the cases considered, of which the Poisson arrival process (i.e. M/G/k) is a special case and for which formulae are given.
引用
收藏
页码:202 / 218
页数:17
相关论文
共 50 条