A simple method for computing state probabilities of the M/G/1 and GI/M/1 finite waiting space queues

This paper presents a simple method for computing steady state probabilities at arbitrary and departure epochs of the M/G/1/K queue. The method is recursive and works efficiently for all service time distributions. The only input required for exact evaluation of state probabilities is the Laplace transform of the probability density function of service time. Results for the GI/M/1/K-1 queue have also been obtained from those of M/G/1/K queue.