Skip to main content

Queueing Networks

  • Chapter
  • First Online:
Book cover An Introduction to Queueing Theory

Part of the book series: Statistics for Industry and Technology ((SIT))

Abstract

The queueing systems considered in the preceding chapters had customers demanding service from a single facility. But there are many real-world systems in which customers get served in more than one station arranged in a network structure, which is a collection of nodes connected by a set of paths. In a queueing network, a group of servers operating from the same facility are identified as a node.As described in Chapter 1, under the historical perspective, a large portion of the advances occurring in queueing theory after the 1960s is connected to networks of queues one way or the other. Computer, communication, and manufacturing systems where queueing theory has found major application areas abound with such networks. This chapter provides an introduction to some simple queueing networks and their analysis.

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 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 129.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

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Science+Business Media New York

About this chapter

Cite this chapter

Bhat, U. (2015). Queueing Networks. In: An Introduction to Queueing Theory. Statistics for Industry and Technology. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-8421-1_7

Download citation

Publish with us

Policies and ethics