Limiting diffusion approximations for the many server queue and the repairman problem

Publisher Website
Google Scholar
Abstract
We shall consider a many server (multiple channels in parallel) queueing process in which customers arrive at the queue according to a Poisson process. The service times are assumed to be independent and exponentially distributed. As usual, the service times are independent of the arrival process. We assume that no server is idle if there is a customer waiting, but that otherwise the service discipline is arbitrary. If there are n servers and we let Xn (t) denote the number of customers waiting or being served at time t, then it is well known that Xn (t) is a birth and death process with stationary transition probabilities. A very comprehensive analysis of this many server queue from the point of view of birth and death processes has been carried out by Karlin and McGregor [5].

This publication has 8 references indexed in Scilit: