The processor-sharing queue with bulk arrivals and phase-type services

被引:5
|
作者
Kim, Jeongsim
Kim, Bara
机构
[1] Korea Univ, Dept Math & Telecommun, Math Res Ctr, Seoul 136701, South Korea
[2] Chungbuk Natl Univ, Dept Math Educ, Cheongju 361763, Chungbuk, South Korea
关键词
processor-sharing; queue-length; sojourn time; joint transform; bulk arrivals;
D O I
10.1016/j.peva.2006.05.006
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we consider a queue with compound Poisson arrivals, phase type required service times in which a single processor serves according to the processor-sharing discipline. For this queue, we derive a. system of equations for the transform of the queue-length and obtain the moments of the queue-length as a solution of linear equations. We also obtain a system of equations for the joint transforms of the sojourn time and the queue-length and find the moments of the sojourn time as a solution of linear equations. Numerical examples show that the smaller the variation of the required service times becomes, the larger the mean and variance of the sojourn times become. (C) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:277 / 297
页数:21
相关论文
共 50 条