J. Korean Math. Soc. 2001; 38(4): 807-842
Printed July 1, 2001
Copyright © The Korean Mathematical Society.
Tetsuya Takine
Kyoto University
This paper summarizes recent developments of analytical and algorithmical results for stationary FIFO queues with multiple Markovian arrival streams, where service time distributions are general and they may differ for different arrival streams. While this kind of queues naturally arises in considering queues with a superposition of independent phase-type arrivals, the conventional approach based on the queue length dynamics (i.e., M/G/1 paradigm) is not applicable to this kind of queues. On the contrary, the workload process has a Markovian property, so that it is analytically tractable. This paper first reviews the results for the stationary distributions of the amount of work-in-system, actual waiting time and sojourn time, all of which were obtained in the last six years by the author. Further this paper shows an alternative approach, recently developed by the author, to analyze the joint queue length distribution based on the waiting time distribution. An emphasis is placed on how to construct a numerically feasible recursion to compute the stationary queue length mass function.
Keywords: FIFO queue, Markovian arrival stream, waiting time, queue length
MSC numbers: 60K25, 60J25, 60J27
1998; 35(3): 503-525
2005; 42(3): 517-527
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd