On sojourn times in the finite capacity M/M/1 queue with processor sharing

被引：8

作者：

Zhen, Qiang ^{[1
]}

Knessl, Charles ^{[1
]}

机构：

[1] Univ Illinois, Dept Math Stat & Comp Sci, Chicago, IL 60607 USA

来源：

OPERATIONS RESEARCH LETTERS | 2009年 / 37卷 / 06期

关键词：

Finite capacity; Processor sharing; Sojourn time; Tail behavior; SERVICE;

D O I：

10.1016/j.orl.2009.09.007

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider a processor shared M/M/1 queue that can accommodate at most a finite number K of customers. We give an exact expression for the sojourn time distribution in this finite capacity model, in terms of a Laplace transform. We then give the tail behavior, for the limit K -> infinity. (C) 2009 Elsevier B.V. All rights reserved.

引用

页码：447 / 450

页数：4

共 50 条

[1] Sojourn times in the M/PH/1 processor sharing queue
Sericola, B
Guillemin, F
Boyer, J
[J]. QUEUEING SYSTEMS, 2005, 50 (01) : 109 - 130
[2] Sojourn Times in the M/PH/1 Processor Sharing Queue
Bruno Sericola
Fabrice Guillemin
Jacqueline Boyer
[J]. Queueing Systems, 2005, 50 : 109 - 130
[3] On the sojourn of an arbitrary customer in an M/M/1 Processor Sharing Queue
Guillemin, Fabrice
Rodriguez, Veronica Quintuna
[J]. STOCHASTIC MODELS, 2020, 36 (03) : 378 - 400
[4] THE SOJOURN TIME IN THE GI/M/1 QUEUE WITH PROCESSOR SHARING
RAMASWAMI, V
[J]. JOURNAL OF APPLIED PROBABILITY, 1984, 21 (02) : 437 - 442
[5] Moments of Conditional Sojourn Times in Finite Capacity M/M/1/N-PS Processor Sharing Queues
Akar, Nail
[J]. IEEE COMMUNICATIONS LETTERS, 2012, 16 (04) : 533 - 535
[6] Sojourn time in an M/M/1 processor sharing queue with permanent customers
Guillemin, Fabrice
Slim, Farah
[J]. STOCHASTIC MODELS, 2018, 34 (01) : 115 - 137
[7] CONDITIONAL SOJOURN TIME MOMENTS IN THE FINITE-CAPACITY GI/M/1 QUEUE WITH PROCESSOR-SHARING SERVICE
YANG, YZ
KNESSL, C
[J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1993, 53 (04) : 1132 - 1193
[8] Sojourn time tails in the M/D/1 processor sharing queue
Egorova, Regina
Zwart, Bert
Boxma, Onno
[J]. PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2006, 20 (03) : 429 - 446
[9] Sojourn time asymptotics in the M/G/1 processor sharing queue
Zwart, AP
Boxma, OJ
[J]. QUEUEING SYSTEMS, 2000, 35 (1-4) : 141 - 166
[10] Sojourn time asymptotics in the M/G/1 processor sharing queue
A.P. Zwart
O.J. Boxma
[J]. Queueing Systems, 2000, 35 : 141 - 166

← 1 2 3 4 5 →