Transient Behaviour of an M/M/1/N queue

For a simple queue with finite waiting space the difference equations satisfied by the Laplace transforms of the state probabilities at finite time are solved and the state probabilities have been obtained. The method economizes in algebra and the simple closed form of the state probabilities is used to obtain important parameters.     

Transient and busy period analysis of theGI/G/1 queue: The method of stages

In this paper we study the transient behavior of the MGE_L/MGE_M/1 queueing system, where MGE is the class of mixed generalized Erlang distributions which can approximate an arbitrary distribution. We use the method of stages combined with the separation of variables and root finding techniques together with linear and tensor algebra. We find simple closed form expressions for the Laplace transforms of the queue length distribution and the waiting time distribution under FCFS when the system is initially empty and the busy period distribution. We report computational results by inverting these expressions numerically in the time domain. Because of the simplicity of the expressions derived our algorithm is very fast and robust.The research of the author was partially supported by grants from the Leaders for Manufacturing program at MIT and from Draper Laboratory.