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

共 40 条

[31] 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

[32] Asymptotic expansions for the conditional sojourn time distribution in the M/M/1-PS queue [J].

Qiang Zhen ;

Charles Knessl .

Queueing Systems, 2007, 57 :157-168

[33] Asymptotic expansions for the conditional sojourn time distribution in the M/M/1-PS queue [J].

Zhen, Qiang ;

Knessl, Charles .

QUEUEING SYSTEMS, 2007, 57 (04) :157-168

[34] TIME-DEPENDENT ANALYSIS OF A QUEUE WITH BATCH ARRIVALS AND N-LEVELS OF NONPREEMPTIVE PRIORITY [J].

LANGARIS, C ;

KATSAROS, A .

QUEUEING SYSTEMS, 1995, 19 (03) :269-288

[35] Moments of Conditional Sojourn Times in Finite Capacity M/M/1/N-PS Processor Sharing Queues [J].

Akar, Nail .

IEEE COMMUNICATIONS LETTERS, 2012, 16 (04) :533-535

[36] Sojourn-time Distribution for M/Ga/1Queue with Batch Service of Fixed Size - Revisited [J].

Goswami, Veena ;

Chaudhry, Mohan ;

Banik, Abhijit Datta .

METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY, 2022, 24 (04) :2897-2912

[37] Mean-variance performance optimization of response time in a tandem router network with batch arrivals [J].

Nalan Gülpınar ;

Uli Harder ;

Peter Harrison ;

Tony Field ;

Berç Rustem ;

Louis-Francois Pau .

Cluster Computing, 2007, 10 (2) :203-216

[38] Mean-variance performance optimization of response time in a tandem router network with batch arrivals [J].

Gulpinar, Nalan ;

Harder, Uli ;

Harrison, Peter ;

Field, Tony ;

Rustem, Berc ;

Pau, Louis-Francois .

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2007, 10 (02) :203-216

[39] Sojourn-Time Distribution for Geo/Ga,b/1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$Geo/G^{a,b}/1$$\end{document} Queue with Batch Service [J].

Veena Goswami ;

M. L. Chaudhry .

International Journal of Applied and Computational Mathematics, 2023, 9 (6)

[40] Sojourn-time Distribution for M/Ga/1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M/G^a/1$$\end{document} Queue with Batch Service of Fixed Size - Revisited [J].

Veena Goswami ;

Mohan Chaudhry ;

Abhijit Datta Banik .

Methodology and Computing in Applied Probability, 2022, 24 (4) :2897-2912

← 1 2 3 4 →