On the stability of a partially accessible multi-station queue with state-dependent routing

被引:49
作者
Foss, S [1 ]
Chernova, N
机构
[1] Russian Acad Sci, Inst Math, Novosibirsk 630090, Russia
[2] Novosibirsk State Univ, Novosibirsk 630090, Russia
关键词
multi-server queue; customer class; state-dependent routing; stability; Markov chain; fluid limit;
D O I
10.1023/A:1019175812444
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider a multi-station queue with a multi-class input process when any station is available for the service of only some (not all) customer classes. Upon arrival, any customer may choose one of its accessible stations according to some state-dependent policy. We obtain simple stability criteria for this model in two particular cases when service rates are either station- or class-independent. Then, we study a two-station queue under general assumptions on service rates. Our proofs are based on the fluid approximation approach.
引用
收藏
页码:55 / 73
页数:19
相关论文
共 15 条
[1]  
Asmussen S, 2008, APPL PROBABILITY QUE, V51
[2]   DISCRETE FLOW NETWORKS - BOTTLENECK ANALYSIS AND FLUID APPROXIMATIONS [J].
CHEN, H ;
MANDELBAUM, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1991, 16 (02) :408-446
[3]   FLUID APPROXIMATIONS AND STABILITY OF MULTICLASS QUEUEING NETWORKS: WORK-CONSERVING DISCIPLINES [J].
Chen, Hong .
ANNALS OF APPLIED PROBABILITY, 1995, 5 (03) :637-665
[4]  
Dai JG, 1996, ANN APPL PROBAB, V6, P751
[5]   ON POSITIVE HARRIS RECURRENCE OF MULTICLASS QUEUEING NETWORKS: A UNIFIED APPROACH VIA FLUID LIMIT MODELS [J].
Dai, J. G. .
ANNALS OF APPLIED PROBABILITY, 1995, 5 (01) :49-77
[6]   STABILITY AND CONVERGENCE OF MOMENTS FOR MULTICLASS QUEUING-NETWORKS VIA FLUID LIMIT MODELS [J].
DAI, JG ;
MEYN, SP .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1995, 40 (11) :1889-1904
[7]  
FALIN GI, 1987, TEOR VEROYA PRIMEN, V32, P577
[8]  
Foss S. G., 1991, Problems of Information Transmission, V27, P94
[9]  
FOSS SG, 1996, MARKOV P REL FIELDS, V2, P261
[10]   A QUEUING SYSTEM WITH GENERAL-USE AND LIMITED-USE SERVERS [J].
GREEN, L .
OPERATIONS RESEARCH, 1985, 33 (01) :168-182