无穷维非遍历Jackson网络的极限行为  

Long-Time Behavior of Non-Ergodic Infinite Jackosn Network

作　　者：程慧慧[1] 毛永华[2] 

机构地区：[1]华北水利水电大学数学与信息科学学院,郑州450045 [2]北京师范大学数学科学学院,数学与复杂系统教育部重点实验室,北京100875

出　　处：《应用概率统计》2016年第4期433-440,共8页Chinese Journal of Applied Probability and Statistics

基　　金：国家自然科学基金(11201145;11131003;11571043);985项目资助

摘　　要：假定无穷维Jackson网络的净流入的速率大于服务速率.通过解非线性的Jackson方程,并且利用耦合方法得到了无穷维Jackson网络的随机可比性,进而得到其各排队分支队长的极限行为.证明了此时尽管整个排队系统是非遍历的,但仍可找到最大的遍历子网络.For the infinite Jackson network, assume that the net input rates are greater than theservice 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.

关 键 词：Jackson网络 非线性Jackson方程 随机可比 非遍历性 

分 类 号：O212.62[理学—概率论与数理统计]