For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Moment Calculating Algorithm for Busy-period of Discrete-time Finite-capacity M/G/1 Type Queue
Chikara OHTA Masakatu MORII
IEICE TRANSACTIONS on Communications
Publication Date: 2002/01/01
Print ISSN: 0916-8516
Type of Manuscript: PAPER
discrete-time M/G/1 type queue, busy period, moments, HOL priority control,
Full Text: PDF(454.1KB)>>
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.