Sojourn time tails in the single server queue with heavy-tailed service times

被引:4
|
作者
Boxma, Onno [1 ,2 ]
Denisov, Denis [3 ]
机构
[1] Eindhoven Univ Technol, EURANDOM, NL-5600 MB Eindhoven, Netherlands
[2] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
[3] Heriot Watt Univ, Sch Math & Comp Sci, Edinburgh, Midlothian, Scotland
关键词
GI/GI/1; queue; Regular variation; Sojourn time tail; WAITING TIME; DISCIPLINE;
D O I
10.1007/s11134-011-9229-y
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider the GI/GI/1 queue with regularly varying service requirement distribution of index -alpha. It is well known that, in the M/G/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1-alpha, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution is regularly varying of index -alpha. That raises the question whether there exist service disciplines that give rise to a regularly varying sojourn time distribution with any index -gamma epsilon [-alpha, 1-alpha]. In this paper that question is answered affirmatively.
引用
收藏
页码:101 / 119
页数:19
相关论文
共 50 条