Skip to main content
SpringerLink
Log in

Multi-Server Queues

  • Conference paper
Deterministic and Stochastic Scheduling

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 84))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O.J. Boxma, J.W. Cohen, N. Huffels (1979) Oper. Res. 27, 1115–1127.

    Article  MATH  Google Scholar 

  2. F.P. Kelly (1979) Reversibility and Stochastic Networks, Wiley.

    Google Scholar 

  3. S.A. Nozaki, S.M. Ross (1978) J. Appl. Probab. 15, 826–834.

    Article  MathSciNet  MATH  Google Scholar 

  4. S.M. Ross (1980) Introduction to Probability Models, 2nd Edition, Academic Press.

    Google Scholar 

  5. Y. Takahashi (1977) J. Oper. Res. Soc. Japan 20, 150–163.

    MATH  Google Scholar 

  6. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California, Berkeley, USA

    Sheldon M. Ross

Authors
  1. Sheldon M. Ross
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Dalhousie University, Halifax, Nova Scotia, Canada

    M. A. H. Dempster

  2. Balliol College, Oxford, England

    M. A. H. Dempster

  3. Mathematisch Centrum, P.O. Box 4079, 1009 AB, Amsterdam, The Netherlands

    J. K. Lenstra

  4. Econometric Institute H2-11, Erasmus University, P.O. Box 1738, 3000 DR, Rotterdam, The Netherlands

    A. H. G. Rinnooy Kan

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation