Multi-Server Queues.
Abstract
We will survey a variety of multiserver models in which the arrival stream is a Poisson process. In particular, we will consider the Erlang loss model in which arrivals finding all servers busy are lost. In this system, we assume a general service distribution. We will also consider finite and infinite capacity versions of this model. Another model of this type is the shared processor system in which service is shared by all customers. Another model to be considered is the G/M/K in which arrivals are in accordance with a renewal process and the service distribution is exponential. We will analyze this model by means of the embedded Markov chain approach. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1981
- Accession Number
- ADA101851
Entities
People
- Sheldon M. Ross
Organizations
- University of California, Berkeley