A Single-Channel Queueing System with Limited Queueing, Several Input Flows, and Arbitrary Servicing Time

We consider a single-channel queueing system in which there are several input flows with relative servicing priorities and a limited number of queueing positions. The servicing time distribution is assumed to be arbitrary. Recurrence relations are obtained for finding the system-state probabilities. We find the mean waiting time and the mean number of requests in each type of queue. A computational algorithm is found for determining the probability of loss for each type of request.