Approximately optimal scheduling of an M/G/1 queue with heavy tails

被引：0

作者：

Kamble, Vijay ^{[1
]}

Walrand, Jean ^{[1
]}

机构：

[1] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA

来源：

QUEUEING SYSTEMS | 2015年 / 80卷 / 03期

关键词：

Scheduling; Heavy Tails; M/G/1; queue; Approximation; LARGE-DEVIATIONS; GITTINS INDEX; DISCIPLINE; IMPACT;

D O I：

10.1007/s11134-015-9435-0

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Distributions with a heavy tail are difficult to estimate. If the design of an optimal scheduling policy is sensitive to the details of heavy tail distributions of the service times, an approximately optimal solution is difficult to obtain. This paper shows that the mean optimal scheduling of an M/G/1 queue with heavy tailed service times does not present this difficulty and that an approximately optimal strategy can be derived by truncating the distributions.

引用

页码：261 / 271

页数：11

共 50 条

[31] OPTIMAL-CONTROL OF THE M/G/1 QUEUE WITH REPEATED VACATIONS OF THE SERVER
ALTMAN, E
NAIN, P
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1993, 38 (12) : 1766 - 1775
[32] Simple Near-Optimal Scheduling for the M/G/1
Scully, Ziv
Harchol-Balter, Mor
Scheller-Wolf, Alan
PROCEEDINGS OF THE ACM ON MEASUREMENT AND ANALYSIS OF COMPUTING SYSTEMS, 2020, 4 (01)
[33] Simple Near-Optimal Scheduling for the M/G/1
Scully Z.
Harchol-Balter M.
Scheller-Wolf A.
Performance Evaluation Review, 2020, 48 (01): : 37 - 38
[34] Optimal control for an M(x)/G/1 queue with two operation modes
Dudin, A
PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 1997, 11 (02) : 255 - 265
[35] OPTIMAL CUSTOMER DECISIONS IN A G/M/C QUEUE
MARTIN, GE
PANKOFF, LD
MATHEMATICAL AND COMPUTER MODELLING, 1988, 10 (04) : 251 - 256
[36] THE CORRELATED M/G/1 QUEUE
BOXMA, OJ
COMBE, MB
AEU-ARCHIV FUR ELEKTRONIK UND UBERTRAGUNGSTECHNIK-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS, 1993, 47 (5-6): : 330 - 335
[37] Correlated M/G/1 queue
Boxma, Onno
Combe, Marco B.
AEU. Archiv fur Elektronik und Ubertragungstechnik, 1993, 47 (5-6): : 330 - 335
[38] The G/M/1 queue revisited
Adan, I
Boxma, O
Perry, D
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2005, 62 (03) : 437 - 452
[39] The G/M/1 queue revisited
Ivo Adan
Onno Boxma
David Perry
Mathematical Methods of Operations Research, 2005, 62 : 437 - 452
[40] 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

← 1 2 3 4 5 →