对一类等待空间有限的抢占优先权排队的分析

Analysis for a preemptive priority queue with finite capacity

讨论M/M/1抢占优先权排队模型,且假设低优先权顾客的等待空间有限.该模型可以用有限位相拟生灭过程来描述.由矩阵解析方法,对该拟生灭过程进行了分析,并得到排队模型平稳队长的计算公式,最后还用数值结果说明了方法的有效性.

This paper considers an M/M/1 queue that handles arrivals form 2 classes of customers on a preemptive priority basis, where the lower-priority customers with finite buffering. The queue model can be described in a quasi-birth-and-death （QBD） process with finitely many phases. By matrix-geometric method, we get the formula of stationary queue length distribution, and illustrate the effectiveness of the method by numerical examples.