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.
机构:
Satyam Comp Serv Ltd, Appl Res Grp, Bangalore, Karnataka, IndiaSatyam Comp Serv Ltd, Appl Res Grp, Bangalore, Karnataka, India
Kumar, A
Srinivasan, SH
论文数: 0引用数: 0
h-index: 0
机构:
Satyam Comp Serv Ltd, Appl Res Grp, Bangalore, Karnataka, IndiaSatyam Comp Serv Ltd, Appl Res Grp, Bangalore, Karnataka, India
Srinivasan, SH
8TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL III, PROCEEDINGS: COMMUNICATION AND NETWORK SYSTEMS, TECHNOLOGIES AND APPLICATIONS,
2004,
: 487
-
491
机构:
Dept. of Info. Systems Engineering, Graduate School of Engineering, Osaka University, 2-1 Yamadaoka, Osaka 565, JapanDept. of Info. Systems Engineering, Graduate School of Engineering, Osaka University, 2-1 Yamadaoka, Osaka 565, Japan
Takine, Tetsuya
Sengupta, Bhaskar
论文数: 0引用数: 0
h-index: 0
机构:
CandC Research Laboratories, NEC USA, 4 Independence Way, Princeton, NJ 08540, United StatesDept. of Info. Systems Engineering, Graduate School of Engineering, Osaka University, 2-1 Yamadaoka, Osaka 565, Japan