IEICE TRANSACTIONS on Communications
Approximation of the Mean Waiting Time in a Finite Buffer Queue with a Combination of HOL-Priority and Buffer-Reservation Schemes
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E86-B No.11 pp.3283-3287
- Publication Date
- 2003/11/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Fundamental Theories
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shuichi SUMITA, "Approximation of the Mean Waiting Time in a Finite Buffer Queue with a Combination of HOL-Priority and Buffer-Reservation Schemes" in IEICE TRANSACTIONS on Communications,
vol. E86-B, no. 11, pp. 3283-3287, November 2003, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e86-b_11_3283/_p
Copy
@ARTICLE{e86-b_11_3283,
author={Shuichi SUMITA, },
journal={IEICE TRANSACTIONS on Communications},
title={Approximation of the Mean Waiting Time in a Finite Buffer Queue with a Combination of HOL-Priority and Buffer-Reservation Schemes},
year={2003},
volume={E86-B},
number={11},
pages={3283-3287},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Approximation of the Mean Waiting Time in a Finite Buffer Queue with a Combination of HOL-Priority and Buffer-Reservation Schemes
T2 - IEICE TRANSACTIONS on Communications
SP - 3283
EP - 3287
AU - Shuichi SUMITA
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E86-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2003
AB - 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.
ER -
English
