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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
O.J. Boxma, J.W. Cohen, N. Huffels (1979) Oper. Res. 27, 1115–1127.
F.P. Kelly (1979) Reversibility and Stochastic Networks, Wiley.
S.A. Nozaki, S.M. Ross (1978) J. Appl. Probab. 15, 826–834.
S.M. Ross (1980) Introduction to Probability Models, 2nd Edition, Academic Press.
Y. Takahashi (1977) J. Oper. Res. Soc. Japan 20, 150–163.
H.C. Tijms, M.H. Van HOORN, A. Federgruen (1979) Approximations for the steady state probabilities in the M/G/c queue. Research Report 49, Free University, Amsterdam; Adv. in Appl. Probab., to appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 D. Reidel Publishing Company
About this paper
Cite this paper
Ross, S.M. (1982). Multi-Server Queues. In: Dempster, M.A.H., Lenstra, J.K., Rinnooy Kan, A.H.G. (eds) Deterministic and Stochastic Scheduling. NATO Advanced Study Institutes Series, vol 84. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7801-0_10
Download citation
DOI: https://doi.org/10.1007/978-94-009-7801-0_10
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-7803-4
Online ISBN: 978-94-009-7801-0
eBook Packages: Springer Book Archive