排队网络可以用来模拟诸如通信网络这样的复杂系统。对排队网络的研究中的一个主要议题是建立其在某些特殊的规则下稳定的充要条件。本文的研究对象是一类具有两类顾客输入的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.