IEICE TRANSACTIONS on Communications
Analysis of Finite Buffer Head-of-the-Line Priority Queues with Push-Out Scheme as Space Priority
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E81-B No.1 pp.23-31
- Publication Date
- 1998/01/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Communication Networks and Services
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 Finite Buffer Head-of-the-Line Priority Queues with Push-Out Scheme as Space Priority" in IEICE TRANSACTIONS on Communications,
vol. E81-B, no. 1, pp. 23-31, January 1998, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e81-b_1_23/_p
Copy
@ARTICLE{e81-b_1_23,
author={Shuichi SUMITA, },
journal={IEICE TRANSACTIONS on Communications},
title={Analysis of Finite Buffer Head-of-the-Line Priority Queues with Push-Out Scheme as Space Priority},
year={1998},
volume={E81-B},
number={1},
pages={23-31},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Analysis of Finite Buffer Head-of-the-Line Priority Queues with Push-Out Scheme as Space Priority
T2 - IEICE TRANSACTIONS on Communications
SP - 23
EP - 31
AU - Shuichi SUMITA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 1998
AB - 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.
ER -
English
