IEICE TRANSACTIONS on Communications
Analysis of a Finite-Buffer Head-of-the-Line Priority Queue with Buffer Reservation Scheme as Space Priority
Summary :
This paper presents 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 buffer reservation schemes. This combination gives each class of customers high or low priorities in terms of both delay and loss. The scheme is analyzed for the model in which one class of customers has high priorities over the other class of customers with respect to both delay and loss. First, steady-state joint probability distribution of the number of each class of customers in the buffer and remaining service time is derived by a supplementary variable method. Second, loss probability and mean waiting time for each class of customers are provided using this probability distribution. Finally, a combination of head-of-the-line priority and buffer reservation schemes is numerically compared with other buffer management schemes in terms of admissible offered load to show its effectiveness under differing QoS requirements.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E81-B No.5 pp.1062-1076
- Publication Date
- 1998/05/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Switching and Communication Processing
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, "Analysis of a Finite-Buffer Head-of-the-Line Priority Queue with Buffer Reservation Scheme as Space Priority" in IEICE TRANSACTIONS on Communications,
vol. E81-B, no. 5, pp. 1062-1076, May 1998, doi: .
Abstract: This paper presents 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 buffer reservation schemes. This combination gives each class of customers high or low priorities in terms of both delay and loss. The scheme is analyzed for the model in which one class of customers has high priorities over the other class of customers with respect to both delay and loss. First, steady-state joint probability distribution of the number of each class of customers in the buffer and remaining service time is derived by a supplementary variable method. Second, loss probability and mean waiting time for each class of customers are provided using this probability distribution. Finally, a combination of head-of-the-line priority and buffer reservation schemes is numerically compared with other buffer management schemes in terms of admissible offered load to show its effectiveness under differing QoS requirements.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e81-b_5_1062/_p
Copy
@ARTICLE{e81-b_5_1062,
author={Shuichi SUMITA, },
journal={IEICE TRANSACTIONS on Communications},
title={Analysis of a Finite-Buffer Head-of-the-Line Priority Queue with Buffer Reservation Scheme as Space Priority},
year={1998},
volume={E81-B},
number={5},
pages={1062-1076},
abstract={This paper presents 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 buffer reservation schemes. This combination gives each class of customers high or low priorities in terms of both delay and loss. The scheme is analyzed for the model in which one class of customers has high priorities over the other class of customers with respect to both delay and loss. First, steady-state joint probability distribution of the number of each class of customers in the buffer and remaining service time is derived by a supplementary variable method. Second, loss probability and mean waiting time for each class of customers are provided using this probability distribution. Finally, a combination of head-of-the-line priority and buffer reservation schemes is numerically compared with other buffer management schemes in terms of admissible offered load to show its effectiveness under differing QoS requirements.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Analysis of a Finite-Buffer Head-of-the-Line Priority Queue with Buffer Reservation Scheme as Space Priority
T2 - IEICE TRANSACTIONS on Communications
SP - 1062
EP - 1076
AU - Shuichi SUMITA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 1998
AB - This paper presents 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 buffer reservation schemes. This combination gives each class of customers high or low priorities in terms of both delay and loss. The scheme is analyzed for the model in which one class of customers has high priorities over the other class of customers with respect to both delay and loss. First, steady-state joint probability distribution of the number of each class of customers in the buffer and remaining service time is derived by a supplementary variable method. Second, loss probability and mean waiting time for each class of customers are provided using this probability distribution. Finally, a combination of head-of-the-line priority and buffer reservation schemes is numerically compared with other buffer management schemes in terms of admissible offered load to show its effectiveness under differing QoS requirements.
ER -
English
