Advertisement

Application Examples of Queueing Networks with Blocking

  • Simonetta Balsamo
  • Vittoria de Nitto Personé
  • Raif Onvural
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 31)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Highleyman, W. H. Performance Analysis of Transaction Processing Systems. Prentice Hall, Inc., Englewood Cliffs, New Jersey, 1989.Google Scholar
  2. Kleinrock, L. Queueing Systems. Vol. l: Theory. Wiley, 1975.Google Scholar
  3. Lavenberg, S.S. Computer Performance Modeling Handbook. Prentice Hall, 1983.Google Scholar
  4. Onvural, R.O. Survey of Closed Queueing Networks with Blocking. ACM Computing Surveys, Vol. 22, 2 (1990) 83–121.CrossRefGoogle Scholar
  5. 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.CrossRefGoogle Scholar
  6. Reiser, M. “A Queueing Network Analysis of Computer Communications Networks with Window Flow Control” IEEE Trans. on Comm., Vol. 27 (1979) 1199–1209.CrossRefGoogle Scholar
  7. 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.CrossRefGoogle Scholar
  8. 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.CrossRefGoogle Scholar
  9. 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.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Simonetta Balsamo
    • 1
  • Vittoria de Nitto Personé
    • 2
  • Raif Onvural
    • 3
  1. 1.Universita’ di VeneziaItaly
  2. 2.Universita’ di Roma “Tor Vergata”Italy
  3. 3.IBMUSA

Personalised recommendations