Moment Calculating Algorithm for Busy-period of Discrete-time Finite-capacity M/G/1 Type Queue
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we propose an algorithm to calculate the higher moments of the busy period length of a discretetime 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.
- 社団法人電子情報通信学会の論文
- 2002-01-01
著者
-
Chikara Ohta
The Faculty Of Engineering University Of Tokushima
-
Masakatu MORIl
the Faculty of Engineering, University of Tokushima
-
Masakatu Moril
The Faculty Of Engineering University Of Tokushima
-
Ohta C
the Faculty of Engineering, University of Tokushima
-
Morii M
the Faculty of Engineering, University of Tokushima