Steady state approximations of limited processor sharing queues in heavy traffic

被引:32
作者
Zhang, Jiheng [1 ]
Zwart, Bert [1 ]
机构
[1] Georgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA
基金
美国国家科学基金会;
关键词
Limited processor sharing; Measure-valued process; Steady state; Heavy traffic; Queue size; Delay probability; Response time; 60K25; 68M20; 90B22; 68M07;
D O I
10.1007/s11134-008-9095-4
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We investigate steady state properties of limited processor sharing queues in heavy traffic. Our analysis builds on previously obtained process limit theorems, and requires the interchange of steady state and heavy traffic limits, which are established by a coupling argument. The limit theorems yield explicit approximations of the steady state queue length and response time distribution in heavy traffic, of which the quality is supported by simulation experiments.
引用
收藏
页码:227 / 246
页数:20
相关论文
共 26 条
[1]  
[Anonymous], 2003, APPL PROBABILITY QUE
[2]  
[Anonymous], 1976, QUEUEING SYSTEMS COM
[3]  
AVIITZHAK B, 1988, P 12 INT TEL C TOR
[4]  
BALKE R, 1982, P 1982 ACM SIGMETRIC
[5]  
Billingsley P, 1999, WILEY SERIES PROBABI, V2nd
[6]  
BUDHIRAJA A, 2008, STATIONARY DISTRIBUT
[7]   OPTIMAL MULTIPROGRAMMING [J].
DENNING, PJ ;
KAHN, KC ;
LEROUDIER, J ;
POTIER, D ;
SURI, R .
ACTA INFORMATICA, 1976, 7 (02) :197-216
[8]  
ELNIKETY S, 2004, WORLD WID WEB C
[9]   Validity of heavy traffic steady-state approximations in generalized Jackson networks [J].
Gamarnik, D ;
Zeevi, A .
ANNALS OF APPLIED PROBABILITY, 2006, 16 (01) :56-90
[10]   GI/G/1 PROCESSOR SHARING QUEUE IN HEAVY TRAFFIC [J].
GRISHECHKIN, S .
ADVANCES IN APPLIED PROBABILITY, 1994, 26 (02) :539-555