Concavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals

被引:0
|
作者
Jeongsim Kim
Bara Kim
机构
[1] Chungbuk National University,Department of Mathematics Education
[2] Korea University,Department of Mathematics and Telecommunication Mathematics Research Center
来源
Queueing Systems | 2008年 / 58卷
关键词
Processor-sharing; Batch arrivals; Sojourn time; Concavity; 60K25;
D O I
暂无
中图分类号
学科分类号
摘要
Avrachenkov et al. (Queueing Syst. 50:459–480, [2005]) conjectured that in an M/G/1 processor-sharing queue with batch arrivals, the conditional mean sojourn time is concave. In this paper, we show that this conjecture is generally not true.
引用
收藏
页码:57 / 64
页数:7
相关论文
共 50 条