Many server queuing problem with limited waiting space

Abstract

In this paper the multi-channel queuing system with finite waiting space has been considered under poison arrival and exponential service time distributions. The Laplace transform of the time-dependent probability generating function has been obtained. In two and three channel cases probabilities have been derived explicate and known equilibrium results are shown to hold. At the end are given the tables for mean number of units in the system, with two and three channels, and the probability that an arriving unit on finding the system occupied is lost.