IEICE TRANSACTIONS on Communications
An Analysis of M,MMPP/G/1 Queues with QLT Scheduling Policy and Bernoulli Schedule
Summary :
We analyze M,MMPP/G/1 finite queues with queue-length-threshold (QLT) scheduling policy and Bernoulli schedule where the arrival of type-1 customers (nonreal-time traffic) is Poisson and the arrival of type-2 customers (real-time traffic) is a Markov-modulated Poisson process (MMPP). The next customer to be served is determined by the queue length in the buffer of type-1 customers. We obtain the joint queue length distribution for customers of both types at departure epochs by using the embedded Markov chain method, and then obtain the queue length distribution at an arbitrary time by using the supplementary variable method. From these results, we obtain the loss probabilities and the mean waiting times for customers of each type. The numerical examples show the effects of the QLT scheduling policy on performance measures of the nonreal-time traffic and the bursty real-time traffic in ATM networks.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E81-B No.1 pp.13-22
- 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
Bong Dae CHOI, Yeong Cheol KIM, Doo Il CHOI, Dan Keun SUNG, "An Analysis of M,MMPP/G/1 Queues with QLT Scheduling Policy and Bernoulli Schedule" in IEICE TRANSACTIONS on Communications,
vol. E81-B, no. 1, pp. 13-22, January 1998, doi: .
Abstract: We analyze M,MMPP/G/1 finite queues with queue-length-threshold (QLT) scheduling policy and Bernoulli schedule where the arrival of type-1 customers (nonreal-time traffic) is Poisson and the arrival of type-2 customers (real-time traffic) is a Markov-modulated Poisson process (MMPP). The next customer to be served is determined by the queue length in the buffer of type-1 customers. We obtain the joint queue length distribution for customers of both types at departure epochs by using the embedded Markov chain method, and then obtain the queue length distribution at an arbitrary time by using the supplementary variable method. From these results, we obtain the loss probabilities and the mean waiting times for customers of each type. The numerical examples show the effects of the QLT scheduling policy on performance measures of the nonreal-time traffic and the bursty real-time traffic in ATM networks.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e81-b_1_13/_p
Copy
@ARTICLE{e81-b_1_13,
author={Bong Dae CHOI, Yeong Cheol KIM, Doo Il CHOI, Dan Keun SUNG, },
journal={IEICE TRANSACTIONS on Communications},
title={An Analysis of M,MMPP/G/1 Queues with QLT Scheduling Policy and Bernoulli Schedule},
year={1998},
volume={E81-B},
number={1},
pages={13-22},
abstract={We analyze M,MMPP/G/1 finite queues with queue-length-threshold (QLT) scheduling policy and Bernoulli schedule where the arrival of type-1 customers (nonreal-time traffic) is Poisson and the arrival of type-2 customers (real-time traffic) is a Markov-modulated Poisson process (MMPP). The next customer to be served is determined by the queue length in the buffer of type-1 customers. We obtain the joint queue length distribution for customers of both types at departure epochs by using the embedded Markov chain method, and then obtain the queue length distribution at an arbitrary time by using the supplementary variable method. From these results, we obtain the loss probabilities and the mean waiting times for customers of each type. The numerical examples show the effects of the QLT scheduling policy on performance measures of the nonreal-time traffic and the bursty real-time traffic in ATM networks.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - An Analysis of M,MMPP/G/1 Queues with QLT Scheduling Policy and Bernoulli Schedule
T2 - IEICE TRANSACTIONS on Communications
SP - 13
EP - 22
AU - Bong Dae CHOI
AU - Yeong Cheol KIM
AU - Doo Il CHOI
AU - Dan Keun SUNG
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 1998
AB - We analyze M,MMPP/G/1 finite queues with queue-length-threshold (QLT) scheduling policy and Bernoulli schedule where the arrival of type-1 customers (nonreal-time traffic) is Poisson and the arrival of type-2 customers (real-time traffic) is a Markov-modulated Poisson process (MMPP). The next customer to be served is determined by the queue length in the buffer of type-1 customers. We obtain the joint queue length distribution for customers of both types at departure epochs by using the embedded Markov chain method, and then obtain the queue length distribution at an arbitrary time by using the supplementary variable method. From these results, we obtain the loss probabilities and the mean waiting times for customers of each type. The numerical examples show the effects of the QLT scheduling policy on performance measures of the nonreal-time traffic and the bursty real-time traffic in ATM networks.
ER -
English
