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

来源：

BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY | 2010年 / 47卷 / 06期

关键词：

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 条

[31] STABILITY OF A PROCESSOR-SHARING QUEUE WITH VARYING THROUGHPUT
Moyal, Pascal
JOURNAL OF APPLIED PROBABILITY, 2008, 45 (04) : 953 - 962
[32] On the ASTA property in a feedback processor-sharing queue
Mitrani, I
Robert, P
PERFORMANCE EVALUATION, 2004, 58 (01) : 81 - 85
[33] Queue-length distribution for the discriminatory processor-sharing queue
Rege, KM
Sengupta, B
OPERATIONS RESEARCH, 1996, 44 (04) : 653 - 657
[34] Sojourn times in a multiclass processor sharing queue
Zwart, AP
TELETRAFFIC ENGINEERING IN A COMPETITIVE WORLD, 1999, 3 : 335 - 344
[35] On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
Brandt, A
Brandt, M
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 1998, 47 (02) : 181 - 220
[36] On the sojourn times for many-queue head-of-the-line Processor-sharing systems with permanent customers
Andreas Brandt
Manfred Brandt
Mathematical Methods of Operations Research, 1998, 47 : 181 - 220
[37] On the Sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
Mathematical Methods of Operations Research, 47 (02): : 181 - 220
[38] Sojourn time tails in the M/D/1 processor sharing queue
Egorova, Regina
Zwart, Bert
Boxma, Onno
PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2006, 20 (03) : 429 - 446
[39] Sojourn time asymptotics in the M/G/1 processor sharing queue
Zwart, AP
Boxma, OJ
QUEUEING SYSTEMS, 2000, 35 (1-4) : 141 - 166
[40] On the sojourn time distribution in a finite population Markovian processor sharing queue
Zhen, Qiang
van Leeuwaarden, Johan S. H.
Knessl, Charles
IMA JOURNAL OF APPLIED MATHEMATICS, 2017, 82 (01) : 33 - 59

← 1 2 3 4 5 →