For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Approximation of the Mean Waiting Time in a Finite Buffer Queue with a Combination of HOL-Priority and Buffer-Reservation Schemes
IEICE TRANSACTIONS on Communications
Publication Date: 2003/11/01
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Fundamental Theories
finite buffer, delay priority, loss priority, approximation,
Full Text: PDF>>
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.