A matrix continued fraction algorithm for the multiserver repeated order queue

被引：24
作者：
Hanschke, T
机构：
[1] Tech Univ Clausthal, Inst Math, D-38678 Clausthal Zellerfeld, Germany
[2] Int Business Machines Corp, Dept 5200, D-55131 Mainz, Germany
来源：
MATHEMATICAL AND COMPUTER MODELLING | 1999年 / 30卷 / 3-4期
关键词：
repeated order queueing systems; quasi-birth-and-death process; truncation procedures for infinite matrices; subdominant solutions of linear difference equations;
D O I：
10.1016/S0895-7177(99)00139-9
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper describes a multiserver repeated order queue with an unlimited number of sources, for which the underlying queueing process can be represented as a level-dependent quasi-birth-and-death process. For calculating its steady-state probabilities, a recursive method is proposed, which generalizes the notion of a continued fraction to sequences of matrices. In addition, rigorous proofs of the ergodicity and transience condition are given. (C) 1999 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码：159 / 170
页数：12
相关论文
共 34 条
[1]  
[Anonymous], 1996, ELECTRON T NUMER ANA
[2]  
BRIGHT L, 1995, COMMUNICATIONS STAT, V11, P497
[3]  
Cohen JW., 1957, Philips Telecomm Rev, V18, P49
[4]  
DEUL N, 1980, ELEKTRON INFOR, V10, P607
[5]  
Elldin A., 1967, ERICSSON TECH, V23, P345
[6]  
Falin G., 1990, Queueing Systems Theory and Applications, V7, P127, DOI 10.1007/BF01158472
[7]  
Falin G., 1984, DOUBLE CHANNEL QUEUE
[8]  
Falin G. I., 1987, Journal of Information Processing and Cybernetics, V23, P37
[9]  
FALIN GI, 1987, SOV J COMPUT SYST S+, V25, P60
[10]   NUMERICAL ASPECTS OF RECURRENCE RELATIONS [J].
GAUTSCHI, W .
COMPUTING, 1972, 9 (02) :107-&
1234