The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Neste artigo, propomos um algoritmo para calcular os momentos mais altos da duração do período ocupado de uma fila do tipo M/G/1 de tempo discreto com buffer finito. O modelo de filas possui uma matriz de probabilidade de transição dependente do nível. Nosso algoritmo é dado como um conjunto de fórmulas recursivas que são derivadas do relacionamento entre as matrizes de funções geradoras do período fundamental. Como exemplo de nosso algoritmo, fornecemos uma análise aproximada de uma fila de controle de prioridade HOL (Head Of Line).
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.
Copiar
Chikara OHTA, Masakatu MORII, "Moment Calculating Algorithm for Busy-period of Discrete-time Finite-capacity M/G/1 Type Queue" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 1, pp. 293-304, January 2002, doi: .
Abstract: In this paper, we propose an algorithm to calculate the higher moments of the busy period length of a discrete-time M/G/1 type queue with finite buffer. The queueing model has a level-dependent transition probability matrix. Our algorithm is given as a set of recursive formulas which are derived from the relationship among the generating function matrices of the fundamental period. As an example of our algorithm, we provide an approximate analysis of a HOL (Head Of Line) priority control queue.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_1_293/_p
Copiar
@ARTICLE{e85-b_1_293,
author={Chikara OHTA, Masakatu MORII, },
journal={IEICE TRANSACTIONS on Communications},
title={Moment Calculating Algorithm for Busy-period of Discrete-time Finite-capacity M/G/1 Type Queue},
year={2002},
volume={E85-B},
number={1},
pages={293-304},
abstract={In this paper, we propose an algorithm to calculate the higher moments of the busy period length of a discrete-time M/G/1 type queue with finite buffer. The queueing model has a level-dependent transition probability matrix. Our algorithm is given as a set of recursive formulas which are derived from the relationship among the generating function matrices of the fundamental period. As an example of our algorithm, we provide an approximate analysis of a HOL (Head Of Line) priority control queue.},
keywords={},
doi={},
ISSN={},
month={January},}
Copiar
TY - JOUR
TI - Moment Calculating Algorithm for Busy-period of Discrete-time Finite-capacity M/G/1 Type Queue
T2 - IEICE TRANSACTIONS on Communications
SP - 293
EP - 304
AU - Chikara OHTA
AU - Masakatu MORII
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2002
AB - In this paper, we propose an algorithm to calculate the higher moments of the busy period length of a discrete-time M/G/1 type queue with finite buffer. The queueing model has a level-dependent transition probability matrix. Our algorithm is given as a set of recursive formulas which are derived from the relationship among the generating function matrices of the fundamental period. As an example of our algorithm, we provide an approximate analysis of a HOL (Head Of Line) priority control queue.
ER -