Analysis of Finite Buffer Head-of-the-Line Priority Queues with Push-Out Scheme as Space Priority

Shuichi SUMITA  

IEICE TRANSACTIONS on Communications   Vol.E81-B   No.1   pp.23-31
Publication Date: 1998/01/25
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Communication Networks and Services
combination of delay and loss priority control,  push-out,  M/G/1 queues,  

Full Text: PDF>>
Buy this Article

This paper analyzes a finite buffer M/G/1 queue with two classes of customers who are served by a combination of head-of-the-line priority and push-out schemes. This combination gives each class of customers two different types of priorities with respect to both delay and loss. There are two models considered. The first one is that one class of customers has a higher priority over the other class with respect to both delay and loss; the second one is that one class has a higher priority with respect to loss and the other has high-priority with respect to delay. For both of these models, the joint probability distribution of the number of customers of both classes in the buffer is derived by a supplementary variable method. Using this probability distribution, we can easily calculate the loss probabilities of both classes, the mean waiting time for high-priority customers with respect to loss and the upper bound for mean waiting time for low-priority customers with respect to loss. Numerical examples demonstrate an effect of the combination of different types of priorities.