Skip to main content

Application Examples of Queueing Networks with Blocking

  • Chapter
Analysis of Queueing Networks with Blocking

Abstract

As discussed in chapter 1, customers in real systems usually require different services provided by different servers. During this process, customers may wait in different queues in front of servers prior to start receiving services. Such complex service systems are often modeled using a network of queueing systems, referred to as a queueing network. The topology of the network represents the flow of customers from one service station to another to meet their service requirements. Hence, a queueing network is a connected directed graph whose nodes represent the service centers. The waiting area in front of a server is represented as a queue. That is, each service station has a queue associated with it. A connection between two servers indicates the one-step moves that customers may make from one service center to another service center. The route that a customer takes through the network may be deterministic or random. Customers may be of different types and may follow different routes through the network.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

  • Highleyman, W. H. Performance Analysis of Transaction Processing Systems. Prentice Hall, Inc., Englewood Cliffs, New Jersey, 1989.

    Google Scholar 

  • Kleinrock, L. Queueing Systems. Vol. l: Theory. Wiley, 1975.

    Google Scholar 

  • Lavenberg, S.S. Computer Performance Modeling Handbook. Prentice Hall, 1983.

    Google Scholar 

  • Onvural, R.O. Survey of Closed Queueing Networks with Blocking. ACM Computing Surveys, Vol. 22, 2 (1990) 83–121.

    Article  Google Scholar 

  • Onvural, R.O., and Perros, H.G. “On Equivalencies of Blocking Mechanisms in Queueing Networks with Blocking” Oper. Res. Letters, Vol. 5 (1986) 293–298.

    Article  Google Scholar 

  • Reiser, M. “A Queueing Network Analysis of Computer Communications Networks with Window Flow Control” IEEE Trans. on Comm., Vol. 27 (1979) 1199–1209.

    Article  Google Scholar 

  • Yao, D.D., and Buzacott, J.A. “Modeling a Class of State Dependent Routing in Flexible Manufacturing Systems” Annals of Operations Research, Vol. 3 (1985) 153–167.

    Article  Google Scholar 

  • Yao, D.D., and Buzacott, J.A. “Queueing Models for Flexible Machining Stations Part II: The Method of Coxian Phases” Eur. J. Operations Research, Vol. 19 (1985) 241–252.

    Article  Google Scholar 

  • Yao, D.D., and Buzacott, J.A. “The Exponentialization Approach to Flexible Manufacturing System Models with General Processing Times” Eur. J. of Operations Research, Vol. 24 (1986) 410–416.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media New York

About this chapter

Cite this chapter

Balsamo, S., de Nitto Personé, V., Onvural, R. (2001). Application Examples of Queueing Networks with Blocking. In: Analysis of Queueing Networks with Blocking. International Series in Operations Research & Management Science, vol 31. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3345-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3345-7_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5014-7

  • Online ISBN: 978-1-4757-3345-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics