一类Kelly-型排队网络的稳定性(英文)  

Stability of a Kind of Kelly-type Queueing Network

作　　者：吕文[1] 刘存霞[1] 

机构地区：[1]烟台大学数学与信息科学学院

出　　处：《工程数学学报》2008年第4期724-728,共5页Chinese Journal of Engineering Mathematics

基　　金：NNSF of China(60574005);Shandong Province Soft Science Research Project(B2006069)

摘　　要：排队网络可以用来模拟诸如通信网络这样的复杂系统。对排队网络的研究中的一个主要议题是建立其在某些特殊的规则下稳定的充要条件。本文的研究对象是一类具有两类顾客输入的Kelly-型排队网络。利用流体模型以及Lyapunov函数等工具,建立了该排队网络在所有非闲置的规则下稳定的充分条件。最后,对条件的充分性作了说明。Queueing networks can be used to model complex systems such as communication networks. One of the main topics in the study of queueing network is to establish the necessary and sufficient condition for its stability under some particular disciplines. The subject of this paper is a kind of Kelly-type queueing network with two type customers input. With the help of the fluid model and Lyapunov function, we established a sufficient condition for the stability of the queueing network under all non-idling disciplines. At the end of this paper, some remarks are given to show the sufficiency of the condition.

关 键 词：稳定性 Kelly-型排队网络 流体模型 

分 类 号：O226[理学—运筹学与控制论]