Queuing with Multiple Poisson Inputs and Exponential Service Times

Abstract

This paper contains an analysis of a single-server queuing system for m different types of customers having independent Poisson arrivals with rates λ ı , ı = 1, …, m and exponential service times with rates μ ı , ı = 1, …, m . The discipline is first-come, first-served. Some derived results are (a) a recursion relation for the steady-state probability of n in queue, (b) a recursion relation for the steady-state probability that some member of a particular class is in service and that n of any class are in queue, and (c) the characteristic equation for the waiting-time distribution and its general inversion for the two-population case. The recursion relations are simple for computational purposes.