Approximation of the Mean Waiting Time in a Finite Buffer Queue with a Combination of HOL-Priority and Buffer-Reservation Schemes

Shuichi SUMITA  

IEICE TRANSACTIONS on Communications   Vol.E86-B   No.11   pp.3283-3287
Publication Date: 2003/11/01
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Fundamental Theories
finite buffer,  delay priority,  loss priority,  approximation,  

Full Text: PDF>>
Buy this Article

This letter reports on an approximation of the mean waiting time in a finite buffer queue with delay priority and loss priority. Both priorities are controlled by head-of-the-line (HOL) priority scheduling and buffer reservation. The proposed approximation is based on the known results on a HOL-priority queue with infinite buffer and a finite buffer queue with FIFO scheduling and buffer reservation. The accuracy of the approximation is validated by comparing exact and approximate results. The approximation provides good estimates when the blocking probabilities at the buffer controlled by the buffer reservation are low.