LU-KUMAR重入排队网络的高负荷极限定理  

HEAVY TRAFFIC LIMITS THEOREM FOR LU-KUMAR REENTRANT QUEUEING NETWORKS

作　　者：吕文[1] 袁成桂[1] 张汉君[1] 

机构地区：[1]长沙铁道学院科研所,410075

出　　处：《经济数学》2002年第1期55-59,共5页Journal of Quantitative Economics

基　　金：国家自然科学基金资助项目 ( 1 9871 0 0 6 )

摘　　要：本文在给出了 L u- Kumar重入排队网络稳定性方面的一些结果的基础上 ,证明了在具有优先权的服务规则 π={ (4,1) ,(2 ,3) }下 。In this paper,we consider the heavy traffic limits of Lu Kumar reentrant queueing networks.First,we show some results of its stability,and then,we proved that under the priority discipline π={(4,1),(2,3)},the heavy traffic limits theorem holds for the network.The main tools we used here are the property of completely s for a matrix R and piecewise linear Lyapunov function.

关 键 词：重入排队网络 SRBM 高负荷. 

分 类 号：F22[经济管理—国民经济]