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
关键词
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 条