Skip to main content
SpringerLink
Log in

Product Form Queueing Networks

  • Chapter
  • First Online:
Book cover Performance Evaluation: Origins and Directions

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1769))

Abstract

System performance evaluation is often based on the development and analysis of appropriate models. Queueing network models have been extensively applied to represent and analyze resource sharing systems, such as production, communication and computer systems. They have proved to be a powerful and versatile tool for system performance evaluation and prediction.

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

Access this chapter

Log in via an institution
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

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. I. F. Akyildiz. Exact product form solution for queueing networks with blocking. IEEE Trans. on Computer, C-36(1):122–125, 1987.

    MathSciNet  Google Scholar 

  2. S. Balsamo and M. C. Clò. A convolution algorithm for product-form queueing networks with blocking. Annals of Operations Research, 79:97–117, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  3. S. Balsamo and G. Iazeolla. An extension of Norton theorem for queueing networks. IEEE Trans. on Software Engineering, SE-8, 1982.

    Google Scholar 

  4. S. Balsamo and G. Iazeolla. Product-form synthesis of queueing networks. IEEE Trans. on Software Engineering, SE-11(2):194–199, 1985.

    Article  MathSciNet  Google Scholar 

  5. S. Balsamo and V. De Nitto. A survey of product-form queueing networks with blocking and their equivalences. Annals of Operations Research, 48:31–61, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  6. F. Baskett, K. M. Chandy, R. R. Muntz, and G. Palacios. Open, closed, and mixed networks of queues with different classes of customers. Journal of the ACM, 22(2):248–260, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  7. H. Beilner, J. Mäter, and C. Wysocki. The hierarchical evaluation tool HIT. Report 581/1995, University of Dortmund, Dortmund, Germany, 6–9, 1995.

    Google Scholar 

  8. R. Boucherie and N. M. van Dijk. Product-form queueing networks with state dependent multiple job transitions. Adv. in Applied Prob., 23:152–187, 1991.

    Article  MATH  Google Scholar 

  9. R. Boucherie and N.M. van Dijk. On the arrival theorem for product-form queueing networks with blocking. Performance Evaluation, 29:155–176, 1997.

    Article  Google Scholar 

  10. J. Y. Le Boudec. A BCMP extension to multiserver stations with concurrent classes of customers. Proc. Performance’ 86 and 1986 ACM Sigmetrics Conf., pages 79–81, 1986.

    Google Scholar 

  11. J. Y. Le Boudec. The multibus algorithm. Performance Evaluation, 8:1–18, 1988.

    Article  Google Scholar 

  12. P. J. Burke. The output of a queueing system. Oper. Res., 4:699–704, 1956.

    MathSciNet  Google Scholar 

  13. J. P. Buzen. Computational algorithms for closed queueing networks with exponential servers. Comm. of the ACM, 16(9):527–531, 1973.

    Article  MATH  MathSciNet  Google Scholar 

  14. K. M. Chandy, U. Herzog, and L. Woo. Parametric analysis of queueing networks. IBM Journal of Res. and Dev., 1(1):36–42, 1975.

    MathSciNet  Google Scholar 

  15. K. M. Chandy, J. H. Howard, and D. Towsley. Product form and local balance in queueing networks. Journal of the ACM, 24(2):250–263, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  16. K. M. Chandy and A. J. Martin. A characterization of product-form queueing networks. Journal of the ACM, 30(2):286–299, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  17. K. M. Chandy and D. Neuse. Linearizer: a heuristic algorithm for queueing network models of computer systems. Comm. of the ACM, 25:126–134, 1982.

    Article  Google Scholar 

  18. K. M. Chandy and C. H. Sauer. Computational algorithms for product form queueing networks. Comm. of the ACM, 23(10):573–583, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  19. A. E. Conway, E. de Souza e Silva, and S. S. Lavenberg. Mean value analysis by chain of product-form queueing networks. IEEE Trans. on Computers, C-38(10):573–583, 1989.

    Google Scholar 

  20. A. E. Conway and N. D. Georganas. RECAL-a new efficient algorithm for the exact analysis of multiple-chain closed queueing networks. Journal of the ACM, 33:768–791, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  21. A. E. Conway and N. D. Georganas. Queueing Networks-Exact Computational Algorithms. MIT Press, Cambridge, Massachusetts, 1989.

    Google Scholar 

  22. P. J. Courtois. Decomposability. Academic Press, New York, 1977.

    MATH  Google Scholar 

  23. E. de Souza e Silva and S. S. Lavenberg. Calculating the joint queue length distribution in product-form queueing networks. Journal of the ACM, 36:194–207, 1989.

    Article  MATH  Google Scholar 

  24. E. de Souza e Silva and R. R. Muntz. Queueing networks: Solutions and applications. In H. Takagy, editor, Stochastic Analysis of Computer and Communication Systems, pages 319–399. Elsevier, North Holland, 1990.

    Google Scholar 

  25. D.L. Eager and K. C. Sevick. Bound hierarchies for multiple-class queueing networks. Journal of the ACM, 33:179–206, 1986.

    Article  Google Scholar 

  26. E. Gelenbe. Product form networks with negative and positive customers. Journal of Applied Prob., 28(3):656–663, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  27. E. Gelenbe and I. Mitrani. Analysis and Synthesis of Computer Systems. Academic Press, New York, 1980.

    MATH  Google Scholar 

  28. W. J. Gordon and G. F. Newell. Cyclic queueing networks with exponential servers. Operations Research, 15(2):254–265, 1967.

    Article  MATH  Google Scholar 

  29. W. Henderson and P. Taylor. Product form in networks of queues with batch arrivals and batch services. Queueing Systems, 6:71–88, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  30. W. Henderson and P. Taylor. Some new results on queueing networks with batch movements. J. of Applied Prob., 28:409–421, 1990.

    Article  MathSciNet  Google Scholar 

  31. K. P. Hoyme, S. C. Bruell, P. V. Afshari, and R. Y. Jain. A tree structured mean value analysis algorithm. ACM Trans. on Computer Systems, 4:178–185, 1986.

    Article  Google Scholar 

  32. C. T. Hsieh and S. S. Lam. Two classes of performance bounds for closed queueing networks. Performance Evaluation, 7:3–30, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  33. C. T. Hsieh and S. S. Lam. PAM-a noniterative approximate solution method for closed multichain queueing networks. Performance Evaluation, 9:119–133, 1989.

    Article  MATH  Google Scholar 

  34. J. R. Jackson. Jobshop-like queueing systems. Management Science, 10:131–142, 1963.

    Google Scholar 

  35. K. Kant. Introduction to Computer System Performance Evaluation. MacGraw-Hill, 1992.

    Google Scholar 

  36. F. P. Kelly. Reversibility and Stochastic Networks. Wiley, New York, 1979.

    MATH  Google Scholar 

  37. P. J. B. King. Computer and Communication System Performance Modelling. Prentice-Hall, Englewood Cliffs, 1990.

    Google Scholar 

  38. L. Kleinrock. Queueing Systems, volume 1: Theory. John Wiley, New York, 1975.

    MATH  Google Scholar 

  39. P. Kritzinger, S. van Wyk, and A. Krezesinski. A generalization of Norton’s theorem for multiclass queueing networks. Performance Evaluation, 2:98–107, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  40. S. S. Lam. Queueing networks with capacity constraints. IBM Journal of Res. and Dev., 21(4):370–378, 1977.

    Article  MATH  Google Scholar 

  41. S. S. Lam. Dynamic scaling and grow behavior of queueing networks normalization constant. Journal of the ACM, 29(2):492–513, 1982.

    Article  MATH  Google Scholar 

  42. S. S. Lam and Y. L. Lien. A tree convolution algorithm for the solution of queueing networks. Comm. of the ACM, 26(3):203–215, 1983.

    Article  Google Scholar 

  43. S. S. Lavenberg. Computer Performance Modeling Handbook. Academic Press, New York, 1983.

    MATH  Google Scholar 

  44. S. S. Lavenberg and M. Reiser. Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers. Journal of Applied Prob., 17:1048–1061, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  45. E. D. Lazowska, J. L. Zahorjan, G. S. Graham, and K. C. Sevcick. Quantitative System Performance: Computer System Analysis Using Queueing Network Models. Prentice Hall, Englewood Cliffs, 1984.

    Google Scholar 

  46. R. Marie. An approximate analytical method for general queueing networks. IEEE Trans. on Software Eng., 5(5):530–538, 1979.

    Article  MathSciNet  Google Scholar 

  47. J. McKenna and I. Mitrani. Asymptotic expansions and integral representations of moments of queue lengths in closed Markovian networks. Journal of the ACM, 31:346–360, 1984.

    Article  MATH  Google Scholar 

  48. D. Mitra and J. McKenna. Asymptotic expansions for closed Markovian networks with state dependent service rates. Journal of the ACM, 33:568–592, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  49. R. Nelson. The mathematics of product-form queueing networks. ACM Computing Survey, 25(3):339–369, 1993.

    Article  Google Scholar 

  50. K. R. Pattipati, M. M. Kostreva, and J. L. Teele. Approximate mean value analysis algorithms for queueing networks: Existence, uniqueness and convergence results. Journal of the ACM, 37:643–673, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  51. D. Potier. The modelling package QNAP2 and applications to computer networks simulation. In Computer Networks and Simulation. North Holland, 1986.

    Google Scholar 

  52. M. Reiser. Mean value analysis and convolution method for queue-dependent servers in closed queueing networks. Performance Evaluation, 1(1):7–18, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  53. M. Reiser and S. S. Lavenberg. Mean value analysis of closed multichain queueing networks. Journal of the ACM, 27(2):313–320, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  54. C. H. Sauer. Computational algorithms for state-dependent queueing networks. ACM Trans. on Computer Systems, 1(1):67–92, 1983.

    Article  MathSciNet  Google Scholar 

  55. R. Schassberger. The insensitivity of stationary probabilities in networks of queues. Journal of Applied Prob., 10:85–93, 1978.

    Article  Google Scholar 

  56. P. J. Schweitzer. Approximate analysis of multiclass closed networks of queues. In Proc. of Int. Conference on Stochastic Control and Optimization, pages 25–29, Amsterdam, The Netherlands, 1979.

    Google Scholar 

  57. K. S. Sevcik and I. Mitrani. The distribution of queueing network states at input and output instants. Journal of the ACM, 28(2):358–371, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  58. C. Smith. Performance Engineering of Software Systems. Addison-Wesley, Reading, MA, US, 1990.

    Google Scholar 

  59. R. Suri. Robustness of queueing network formulas. Journal of the ACM, 30(3):564–594, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  60. D. Towsley. Queueing network with state dependent routing. Journal of the ACM, 27(2):323–337, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  61. K. S. Trivedi. Probability and Statistics with Reliability, Queueing and Computer Science Applications. Prentice Hall, Englewood Cliffs, 1982.

    Google Scholar 

  62. S. Tucci and C. H. Sauer. The tree MVA algorithm. Performance Evaluation, 5:187–196, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  63. N. van Dijk. Queueing networks and product forms. John Wiley, 1993.

    Google Scholar 

  64. G. F. Newell W. J. Gordon. Cyclic queueing networks with restricted length queues. Operations Research, 15(2):266–277, 1967.

    MATH  Google Scholar 

  65. J. Walrand. An Introduction to Queueing Networks. Prentice-Hall, 1988.

    Google Scholar 

  66. P. Whittle. Partial balance and insensitivity. J. of Applied Prob., 22:168–175, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  67. J. L. Zahorjan, K. C. Sevcik, D. L. Eager, and B. Galler. Balanced job bound analysis of queueing networks. Comm. of the ACM, 25:134–141, 1981.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Udine, Italy

    Simonetta Balsamo

Authors
  1. Simonetta Balsamo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Angewandte Informatik und Informationssysteme, Universität Wien, Lenaugasse 2/8, 1080, Wien, Austria

    Günter Haring

  2. Informatik IV, Universität Dortmund, August-Schmidt-Straße 12, 44227, Dortmund, Germany

    Christoph Lindemann

  3. GMD Institut für Medienkommunikation, Schloß Birlinghoven, Postfach 1316, 53754, Sankt Augustin, Germany

    Martin Reiser

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Balsamo, S. (2000). Product Form Queueing Networks. In: Haring, G., Lindemann, C., Reiser, M. (eds) Performance Evaluation: Origins and Directions. Lecture Notes in Computer Science, vol 1769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46506-5_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-46506-5_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67193-0

  • Online ISBN: 978-3-540-46506-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation