Calculation of the steady state waiting time distribution in GI/PH/c and MAP/PH/c queues

被引:29
作者
Asmussen, S [1 ]
Moller, JR [1 ]
机构
[1] Univ Lund, Ctr Math Sci, S-22100 Lund, Sweden
关键词
busy period; heterogeneous servers; iteration; Kronecker product; Kronecker sum; many-server queue; Markovian arrival process; matrix-analytic methods; nonlinear matrix equation; phase-type distribution; waiting time;
D O I
10.1023/A:1011083915877
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider the waiting time (delay) W in a FCFS c-server queue with arrivals which are either renewal or governed by Neuts' Markovian arrival process, and (possibly heterogeneous) service time distributions of general phase-type F-i, with m(i) phases for the i th server. The distribution of W is then again phase-type, with m(1). . .m(c) phases for the general heterogeneous renewal case and (c(m+c-1)) phases for the homogeneous case F-i = F, m(i) = m We derive the phase-type representation in a form which is explicit up to the solution of a matrix fixed point problem; the key new ingredient is a careful study of the not-all-busy period where some or all servers are idle. Numerical examples are presented as well.
引用
收藏
页码:9 / 29
页数:21
相关论文
共 22 条
[1]   Exponential approximations for tail probabilities in queues .2. Sojourn time and workload [J].
Abate, J ;
Choudhury, GL ;
Whitt, W .
OPERATIONS RESEARCH, 1996, 44 (05) :758-763
[2]  
[Anonymous], 1994, MATRIX GEOMETRIC SOL
[3]  
Asmussen S, 1996, SCAND J STAT, V23, P419
[4]   PHASE-TYPE REPRESENTATIONS IN RANDOM-WALK AND QUEUING-PROBLEMS [J].
ASMUSSEN, S .
ANNALS OF PROBABILITY, 1992, 20 (02) :772-789
[5]  
Asmussen S., 1998, STOCH MODELS, V14, P369
[6]  
Asmussen S, 1991, INSUR MATH ECON, V10, P259
[7]  
Asmussen S., 1992, STOCH MODELS, V8, P421
[8]  
Bertsimas D., 1988, Queueing Systems Theory and Applications, V3, P305, DOI 10.1007/BF01157853
[9]  
BOEL RK, 1998, ADV MATRIX ANAL METH, P341
[10]  
Cohen J. W., 1982, Stochastic Processes & their Applications, V12, P231, DOI 10.1016/0304-4149(82)90046-1