Approximations in Finite Capacity Multi-Server Queues with Poisson Arrivals
CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
Pagination or Media Count:
This paper considers an MGK queueing model having finite capacity N. That is, a model in which customers, arriving in accordance with a Poisson process having rate lambda, enter the system if there are less than N others present when they arrive, and are then serviced by one of k servers, each of whom has service distribution G. Upon entering, a customer will either immediately enter service if at least one server is free or else join the queue if all servers are busy. Our results will be independent of the order of service of those waiting in queue as long as it is supposed that a server will never remain idle if customers are waiting. To facilitate the analysis, however, assume a service discipline of first come first to enter service.
- Statistics and Probability