A simple and efficient analysis of an M/G/1/K/N queue

In this paper the authors give a recursive procedure to obtain steady state distribution of number of customers (down machines, messages or units) at service completion and arbitrary times of the M/G/1 finite source queue with finite waiting space. It is denoted by M/G/1/K/N queue. Numerical results shows that the proposed method is simpler and efficient than that discussed by Takine et al and works for high and low values of the model parameters. It is also shown that the mean and variance of waiting time can be easily obtained from the Laplace-Stieltjes transform of the distribution function of waiting time.