无穷维非遍历Jackson网络的极限行为
Long-Time Behavior of Non-Ergodic Infinite Jackosn Network
-
摘要: 假定无穷维Jackson网络的净流入的速率大于服务速率. 通过解非线性的Jackson方程, 并且利用耦合方法得到了无穷维Jackson网络的随机可比性, 进而得到其各排队分支队长的极限行为. 证明了此时尽管整个排队系统是非遍历的, 但仍可找到最大的遍历子网络.Abstract: For the infinite Jackson network, assume that the net input rates are greater than the service rates for some nodes. Via solving the new throughput equation, the stochastic comparable processes are obtained by coupling method, and furthermore the limits for the queueing length in all nodes are also obtained. Despite the whole network is non-ergodic, it is possible to get the maximal ergodic subnetwork.