The Remaining Busy Period of a Finite Queue
暂无分享,去创建一个
In the M/G/1/N queuing system where no more than N < ∞ customers are allowed in the system, define the remaining busy period from state i = 0, 1, …, N as the time spent in transition from state i to state 0, i.e., until the server becomes idle for the first time. The purpose of this paper is to derive the Laplace-Stieltjes transform of the distribution of this time and the generating function of the number of customers served in this time.
[1] R. Pyke. Markov Renewal Processes with Finitely Many States , 1961 .
[2] G. F. Newell,et al. Introduction to the Theory of Queues. , 1963 .
[3] Sven Erlander,et al. The Remaining Busy Period for a Single Server Queue with Poisson Input , 1965 .