Moment Calculating Algorithm for Busy-period of Discrete-time Finite-capacity M/G/1 Type Queue

Chikara OHTA  Masakatu MORII  

Publication
IEICE TRANSACTIONS on Communications   Vol.E85-B   No.1   pp.293-304
Publication Date: 2002/01/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
Keyword: 
discrete-time M/G/1 type queue,  busy period,  moments,  HOL priority control,  

Full Text: PDF(454.1KB)>>
Buy this Article




Summary: 
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.