抢占型优先服务机制下多类排队网络的扩散逼近

Diffusion Approximations for Multiclass Queueing Networks Under Preemptive Priority Service Discipline

证明一个满负荷交通极限定理以证实在抢占型优先服务机制下多类排队网络的扩散逼近,进而为该系统提供有效的随机动力学模型.所研究的排队网络典型地出现在现代通讯系统中高速集成服务分组数据网络,其中包含分组数据包的若干交通类型,每个类型涉及若干工作处理类(步骤),并且属于同一交通类型的工作在可能接受服务的每一个网站被赋予相同的优先权等级,更进一步地,在整个网络中,属于不同交通类型的分组数据包之间无交互路由.

A heavy traffic limit theorem is proved to justify diffusion approximations for multiclass queueing networks under preemptive priority service discipline and provide effective stochastic dynamical models for the systems. Such queueing networks typically appear in high-speed integrated services packet networks in telecommunication system. In the network, there are a number of packet traffic types. Each type needs a number of job classes （stages） of processing and each type of jobs is assigned the same priority rank at every station where it possibly receives service. Moreover, there is no inter-routing among different traffic types throughout the entire network.