离散时间优先队列的尾部渐近性分析

Analysis of a Discrete-Time Preemptive Priority Queue

本文研究在离散情形下,两类不同优先权的顾客进入服务系统的情况。稳态概率可以用矩阵形式表示出来。用矩阵分析法,联合稳态概率在一定条件下几何衰减。

In this paper, we consider a discrete-time preemptive priority queue with a single server and two types of customers. The stationary probabilities are presented in a matrix form with respect to the background state space. Applying the matrix analytic method, it is shown that certain reasonable conditions lead to a geometric decay of the tail probabilities as the level goes to infinity.