Stability of Jackson type network output

被引:2
作者
Morozov, E [1 ]
机构
[1] Petrozavodsk State Univ, RAS, Karelian Res Ctr, Inst Appl Math Res, Petrozavodsk, Russia
[2] RAS, Kola Sci Ctr, Inst Informat & Math Modelling Technol Proc, Apatity, Russia
[3] Umea Univ, Dept Math Stat, S-90187 Umea, Sweden
基金
俄罗斯基础研究基金会;
关键词
Jackson-type queueing network; input perturbation; network output; long-run stability; renewal processes; overloaded stations;
D O I
10.1023/A:1015037502038
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider an open Jackson type queueing network N with input epochs sequence I = {T-n((0)), n greater than or equal to 0}, T-0((0)) = 0, assume another input (I) over tilde = {(T) over tilde ((0))(n)} and denote delta(k) = |(T) over tilde ((0))(k) -\(T) over tilde ((0))(k)|, Delta(0) = 0, Delta(n) = max(1less than or equal tokless than or equal ton) delta(k), n greater than or equal to 1. Let {T-n} and {(T) over tilde (n)} be the output points in network N and in modified network, (N) over tilde with input (I) over tilde, accordingly. We study the long-run stability of the network output, establishing two-sided bounds for output perturbation via input perturbation. In particular, we obtain conditions that imply max(k)less than or equal ton\T-k - (T) over tilde (k)\ = o(n(1/r)) with probability 1 as n --> infinity for some r > 0. This result is also extended to continuous time. We consider successively separate station (service node), tandem and feedforward networks. Then we extend stability analysis to general (feedback) networks and show that in our setting these networks can be reduced to feedforward ones. Similar stability results are also obtained in terms of the number of departures. Application to a tandem network with the overloaded stations is considered.
引用
收藏
页码:383 / 406
页数:24
相关论文
共 35 条
[1]  
Asmussen S, 2008, APPL PROBABILITY QUE, V51
[2]   ERGODICITY OF JACKSON-TYPE QUEUING-NETWORKS [J].
BACCELLI, F ;
FOSS, S .
QUEUEING SYSTEMS, 1994, 17 (1-2) :5-72
[3]  
BACCELLI F, 1993, 2015 INRIA
[4]  
BACCELLI F, 1992, J DYN DISCRETE EVENT, V1, P215
[5]   ON QUEUING-SYSTEMS WITH RENEWAL DEPARTURE PROCESSES [J].
BERMAN, M ;
WESTCOTT, M .
ADVANCES IN APPLIED PROBABILITY, 1983, 15 (03) :657-673
[6]  
BOROVKOV AA, 1986, THEOR PROBAB APPL, V31, P474
[7]   INSTABILITY OF FIFO QUEUEING NETWORKS WITH QUICK SERVICE TIMES [J].
Bramson, Maury .
ANNALS OF APPLIED PROBABILITY, 1994, 4 (03) :693-718
[8]   ON THE INPUT-OUTPUT MAP OF A G/G/1 QUEUE [J].
CHANG, CS .
JOURNAL OF APPLIED PROBABILITY, 1994, 31 (04) :1128-1133
[9]   DISCRETE FLOW NETWORKS - BOTTLENECK ANALYSIS AND FLUID APPROXIMATIONS [J].
CHEN, H ;
MANDELBAUM, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1991, 16 (02) :408-446
[10]  
CHEN H, 1996, LECT NOTES STAT