Skip to main content

Part of the book series: Applications of Mathematics ((SMAP,volume 52))

  • 904 Accesses

Abstract

The queue with an infinite number of servers is, with the M/M/1queue, a basic model. It plays a crucial role in most of the stochastic models of communication networks. If the M/M/1 queue is the basic element of a Jackson network (see Section 4.4.1 page 92), the M/M/∞ queue is the basic element of loss networks (see Example 4.2.3 page 88) used to represent communication networks. As it is the case for the M/M/1 queue, the stochastic processes describing this queue are not only important in the analysis of queueing systems but also in various areas such as statistical physics or theoretical computer science.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. C. Fricker, Ph. Robert, and D. Tibi, On the rates of convergence of Erlang model,Journal of Applied Probability 36 (1999), no. 4, 1167–1184.

    Google Scholar 

  2. J.L. Doob, J.L. Snell, and R.E. Williamson, Application of boundary theory to sums of independent random variables, Contributions to probability and statistics, Stanford Univ. Press, Stanford, Calif., 1960, pp. 182–197.

    Google Scholar 

  3. L. Takàcs, On a probability problem arising in the theory of counters, Proceedings of the Cambridge Philosophical Society 52 (1956), 488–498.

    Google Scholar 

  4. F. Guillemin and A. Simonian, Transient characteristics of an MIMIco system, Advances in Applied Probability 27 (1995), no. 3, 862–888.

    Article  MathSciNet  MATH  Google Scholar 

  5. F.P. Kelly, Blocking probabilities in large circuit-switched network,s Advances in Applied Probability 18 (1986), 473–505.

    Article  MATH  Google Scholar 

  6. F.P. Kelly, Loss networks, Annals of Applied Probability 1 (1991), no. 3, 319–378.

    Article  MathSciNet  MATH  Google Scholar 

  7. A.A. Borovkov, Limit laws for queueing processes in multichannel systems, Sibirsk. Mat.. 2. 8 (1967), 983–1004.

    MathSciNet  Google Scholar 

  8. D. Aldous, Some interesting processes arising as heavy traffic limits in an M/M/oo storage process, Stochastic Processes and their Applications 22 (1986), 291–313.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Robert, P. (2003). The M/M/∞ Queue. In: Stochastic Networks and Queues. Applications of Mathematics, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-13052-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-13052-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05625-3

  • Online ISBN: 978-3-662-13052-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics