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

共 39 条

[21] Sojourn times in a processor sharing queue with multiple vacations [J].

U. Ayesta ;

O. J. Boxma ;

I. M. Verloop .

Queueing Systems, 2012, 71 :53-78

[22] Sojourn Times in the M/PH/1 Processor Sharing Queue [J].

Bruno Sericola ;

Fabrice Guillemin ;

Jacqueline Boyer .

Queueing Systems, 2005, 50 :109-130

[23] Sojourn times in the M/PH/1 processor sharing queue [J].

Sericola, B ;

Guillemin, F ;

Boyer, J .

QUEUEING SYSTEMS, 2005, 50 (01) :109-130

[24] Sojourn Time Analysis for Processor Sharing Loss Queuing System with Service Interruptions and MAP Arrivals [J].

Samouylov, Konstantin ;

Sopin, Eduard ;

Gudkova, Irina .

DISTRIBUTED COMPUTER AND COMMUNICATION NETWORKS, DCCN 2016, 2016, 678 :406-417

[25] Performance Analysis of Multi-Server based on Processor-Sharing Queue [J].

Zhang, Xiaofeng ;

Yin, Baoqun ;

Shi, Hao .

2016 18TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATIONS TECHNOLOGY (ICACT) - INFORMATION AND COMMUNICATIONS FOR SAFE AND SECURE LIFE, 2016, :843-848

[26] An RG-factorization approach for a BMAP/M/1 generalized processor-sharing queue [J].

Li, QL ;

Lian, ZT .

STOCHASTIC MODELS, 2005, 21 (2-3) :507-530

[27] Processor-sharing and random-service queues with semi-Markovian arrivals [J].

Wu, DA ;

Takagi, H .

JOURNAL OF APPLIED PROBABILITY, 2005, 42 (02) :478-490

[28] On the sojourn of an arbitrary customer in an M/M/1 Processor Sharing Queue [J].

Guillemin, Fabrice ;

Rodriguez, Veronica Quintuna .

STOCHASTIC MODELS, 2020, 36 (03) :378-400

[29] On sojourn times in the finite capacity M/M/1 queue with processor sharing [J].

Zhen, Qiang ;

Knessl, Charles .

OPERATIONS RESEARCH LETTERS, 2009, 37 (06) :447-450

[30] Heavy-traffic limits for Discriminatory Processor Sharing models with joint batch arrivals [J].

Vis, P. ;

Bekker, R. ;

van der Mei, R. D. ;

Nunez-Queija, R. .

OPERATIONS RESEARCH LETTERS, 2020, 48 (02) :136-141

← 1 2 3 4 →