CONCAVITY OF THE CONDITIONAL MEAN SOJOURN TIME IN THE PROCESSOR-SHARING QUEUE WITH BATCH ARRIVALS

被引:0
|
作者
Kim, Jeongsim [1 ]
机构
[1] Chungbuk Natl Univ, Dept Math Educ, Chungbuk 361763, South Korea
关键词
processor-sharing queue; batch arrivals; sojourn time; concavity; BULK ARRIVALS;
D O I
10.4134/BKMS.2010.47.6.1251
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
For an M/G/1 processor-sharing queue with batch arrivals, Avrachenkov et al. [1] conjectured that the conditional mean sojourn time is concave. However, Kim and Kim [5] showed that this conjecture is not true in general. In this paper, we show that this conjecture is true if the service times have a hyperexponential distribution.
引用
收藏
页码:1251 / 1258
页数:8
相关论文
共 50 条