The Product form Tool for Queueing Networks

  • Nico M. van Dijk
  • Winfried Grassmann
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 24)

Abstract

Queueing networks are used widely as modelling and evaluation tools in manufacturing, telecommunications, computer networking, and related areas. Much of the research effort has been devoted to so-called Jackson networks, that is, networks with Poisson arrivals, exponential service times and routing independent of the state of the system and the history of the customer. The steady-state distribution of Jackson networks can be expressed in a so-called product form. This computationally attractive form will be shown to be directly related to the principle of balance per station. This principle will be used to provide practical insights concerning the following questions

  1. 1.

    When can a product form be expected?

     
  2. 2.

    Why is this product form often violated in practice?

     
  3. 3.

    How can one restore a product form to obtain simple bounds?

     

Keywords

Product Form Station Balance Loss Probability Computational Probability Overflow Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Basket et al., 1975]
    Basket, F., Chandy, K. M., Muntz, R. R., and Palacios, F. (1975). Open, closed and mixed networks with queues with different classes of customers. Journal of the ACM, 22: 248–260.CrossRefGoogle Scholar
  2. [de Souza e Silva and Muntz, 1990]
    de Souza e Silva, E. and Muntz, R. R. (1990). Queueing networks: Solutions and applications. In Takagi, H., editor, Stochastic Analysis of Computer and Communication Systems, pages 319–399. North-Holland, Amsterdam.Google Scholar
  3. [Guiasu, 1986]
    Guiasu, S. (1986). Maximum entropy condition in queueing theory. J. Opl. Res. Soc., 37: 293–301.Google Scholar
  4. [Heyman and Sobel, 1982]
    Heyman, D. P. and Sobel, M. J. (1982). Stochastic Models in Operations Research, volume 1. McGraw-Hill, New York.Google Scholar
  5. [Hordijk and Van Dijk, 1982]
    Hordijk, A. and Van Dijk, N. M. (1982). Stationary probabilities for networks of queues. In Applied Probability, Computer Science, Vol II, The Interface, pages 423–451. Birkhäuser, Boston.CrossRefGoogle Scholar
  6. [Hordijk and Van Dijk, 1983a]
    Hordijk, A. and Van Dijk, N. M. (1983a). Adjoint processes, job local balance and insensitivity for stochastic networks. Bull 44th Session Int. Stat. Inst., 50: 776–788.Google Scholar
  7. [Hordijk and Van Dijk, 1983b]
    Hordijk, A. and Van Dijk, N. M. (1983b). Networkds of Queues: Part I: Job-Balance and the Adjoint Process; Part II: General Routing and Service Characteristics. Lecture Notes in Control and Informations Sciences, ( Eds Baccelli F. and Fayelle, G.). Springer Verlag.Google Scholar
  8. [Jackson, 1957]
    Jackson, J. R. (1957). Networks of waiting lines. Operations Research, 5: 518–521.CrossRefGoogle Scholar
  9. [Jackson, 1964]
    Jackson, J. R. (1964). Job shop like queueing systems. Management Science, 10 (1): 131–142.CrossRefGoogle Scholar
  10. [Kelly, 1979]
    Kelly, F. P. (1979). Reversibility and Stochastic Networks. John Wiley and Sons, New York.Google Scholar
  11. [Reiser, 1980]
    Reiser, M. (1980). Mean-value analysis of closed multichain queuing networks. JACM, 27 (2): 313–322.CrossRefGoogle Scholar
  12. [Robertazzi, 1990]
    Robertazzi, T. G. (1990). Computer Networks and Systems. Springer-Verlag, New York, NY.Google Scholar
  13. 442.
    COMPUTATIONAL PROBABILITYGoogle Scholar
  14. [Schassberger, 1978]
    Schassberger, R. (1978). Insensitivity of steady-state distributions of generalized semi-Markov processes with speeds. Adv. Appl. Probability, 10:836–851.Google Scholar
  15. [van Dijk, 1989a]
    van Dijk, N. M. (1989a). A simple throughput bound for large closed queueing networks with finite capacities. Performance Evaluation, 10: 153–167.CrossRefGoogle Scholar
  16. [van Dijk, 1989b]
    van Dijk, N. M. (1989b). “Stop = Recirculate” for exponential product form queueing networks with departure blocking. Oper. Res. Letters.Google Scholar
  17. [van Dijk, 1990a]
    van Dijk, N. M. (1990a). A discrete-time product form for random access protocols. In Proceedings of IEEE INFOCOM’90, pages 10711077, San Francisco, California.Google Scholar
  18. [van Dijk, 1990b]
    van Dijk, N. M. (1990b). Mixed parallel processors with interdependent blocking. Applied Stochastic Models and Data Analysis, 6: 85100.Google Scholar
  19. [van Dijk, 1990c]
    van Dijk, N. M. (1990c). Queueing systems with restricted workload: an explicit solution. J. Appl. Prob., 27: 393–400.CrossRefGoogle Scholar
  20. [van Dijk, 1991]
    van Dijk, N. M. (1991). On “stop = repeat” servicing for non- exponential queueing networks with blocking. J. Appl. Prob., 28: 159–173.CrossRefGoogle Scholar
  21. [Van Dijk, 1993]
    Van Dijk, N. M. (1993). Queuing Networks and Product Forms. Wiley, New York, NY.Google Scholar
  22. [Van Dijk and Akylildiz, 1990]
    Van Dijk, N. M. and Akylildiz, I. F. (1990). Networks with mixed processor sharing parallel queues and common pools. In Performance 90, Amsterdam. North Holland.Google Scholar
  23. [van Dijk and Lamond, 1988]
    van Dijk, N. M. and Lamond, B. F. (1988). Simple bounds for finite single-server exponential tandem queues. Operations Research, 36: 470–477.CrossRefGoogle Scholar
  24. [Van Dijk and Tijms, 1986]
    Van Dijk, N. M. and Tijms, H. C. (1986). Intensitivity in two-mode blocking models with applications. In Boxma, O. J. and Cohen, W. J., editors, Teletraffic Analysis and Computer Performance Evaluation. North Holland, Amsterdam.Google Scholar
  25. [van Dijk et al., 1988]
    van Dijk, N. M., Tsoucas, P., and Walrand, J. (1988). Simple bounds and monotonicity of the call congestion of finite multiserver delay systems. Probability in the Engineering and Informational Sciences, 2: 129–138.CrossRefGoogle Scholar
  26. [van Dijk and van der Wal, 1989]
    van Dijk, N. M. and van der Wal, J. (1989). Simple bounds and monotonicity results for finite multi-server exponential tandem queues. Queueing Systems, 4: 1–16.CrossRefGoogle Scholar
  27. [Walrand, 1988]
    Walrand, J. (1988). An Introduction to Queueing Theory. Prentice-Hall, Englewood Cliffs, NJ.Google Scholar
  28. [Woodside, 1988]
    Woodside, C. M. (1988). Throughput calculations for basic stochastic rendezvous networks. Performance Evaluation, 9 (9): 143–160.Google Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Nico M. van Dijk
    • 1
  • Winfried Grassmann
    • 2
  1. 1.Department of Econometrics and Operations ResearchUniversity of AmsterdamThe Netherlands
  2. 2.Department of Computer ScienceUniversity of SaskatchewanSaskatoonCanada

Personalised recommendations