Skip to main content
SpringerLink
Log in
Book cover

Stochastic Programming pp 95–106Cite as

Iterative approximations for networks of queues

  • Part. I — Stochastic Modelling And Simulation
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 76))

Abstract

If networks of queues satisfy certain conditions, then the equilibrium distribution for the number of jobs in the various stations has the so-called product-form. In such cases there are relatively elegant and simple computational procedures for the relevant behavioral characteristics. Quite commonly, however, the conditions are too severe and exact solution is practically impossible for larger problems.

In this paper we will consider iterative approximations for networks of queues which either don't possess product-form solutions or are so large that exact solution becomes intractable even using the product-form of the solution. The approximations are based on a mean value analysis approach and use either aggregation of some sort or decomposition. For the details of the approximations heuristic arguments are used. The approach is worked out for some problem types.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Bard, Some extensions to multichain queueing network analysis. 4th Int. Symp. on Modelling and Performance Evaluation of Computer Systems, Vienna 1979.

    Google Scholar 

  2. K.M. Chandy and D. Neuse, Lineariser: A heuristic algorithm for queueing network models of computing systems. Comm. of the A.C.M. 25 (1982) 126–134.

    Google Scholar 

  3. K.M. Chandy and C.H. Sauer, Approximate methods for analyzing queueing network models of computing systems. Computing Surveys 10 (1978) 281–317.

    Google Scholar 

  4. P.J. Courtois, Decomposability: Queueing and Computer System Applications. Academic Press, New York 1977.

    Google Scholar 

  5. J. van Doremalen, A mean value approach for M/G/I priority queues. Memorandum COSOR 83-09, Eindhoven University of Technology 1983.

    Google Scholar 

  6. J. van Doremalen, Mean value analysis in multichain queueing networks: an iterative approximation. DGOR Operations Research Proceedings 1983, Springer Verlag, Berlin. To appear.

    Google Scholar 

  7. J. van Doremalen and J. Wessels, An iterative approximation for closed queueing networks with two-phase servers. Memorandum COSOR 83-12, Eindhoven University of Technology 1983.

    Google Scholar 

  8. N. van Dijk and A. Hordijk, Networks of queues: Part I, Job-local-balance and the adjoint process. Part II, General routing and service characteristics. Proc. of the Int. Sem. on Modelling and Performance Evaluation Methodology, Paris 1982.

    Google Scholar 

  9. J.H. Hine, I. Mitrani and S. Tsur, The control of response times in multiclass systems by memory allocation. Comm. of the A.C.M. 22 (1979) 415–424.

    Google Scholar 

  10. J.R. Jackson, Networks of waiting lines. O.R. 5 (1957) 518–521.

    Google Scholar 

  11. F.P. Kelly, Reversibility and stochastic networks. John Wiley and Sons, New York 1978.

    Google Scholar 

  12. P.J. Kühn, Approximate analysis of general queueing networks by decomposition. IEEE Trans. Comm. 27 (1979) 113–126.

    Google Scholar 

  13. S. Lam and Y. Lien, A tree convolution algorithm for the solution of queueing networks. Comm. of the A.C.M. 26 (1983) 203–215.

    Google Scholar 

  14. M. Reiser, Mean value analysis: A new look at an old problem. 4th Int. Symp. on Modelling and Performance Evaluation of Computer Systems, Vienna 1979.

    Google Scholar 

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

    Google Scholar 

  16. M. Reiser and H. Kobayashi, Queueing networks with multiple closed chains: theory and computational algorithms. IBM J. Res. Dev. 19 (1975) 283–294.

    Google Scholar 

  17. M. Reiser ans S.S. Lavenberg, Mean value analysis of closed multichain queueing networks. Comm. of the A.C.M. 27 (1980) 313–322.

    Google Scholar 

  18. P. Schweitzer, Approximate analysis of multiclass networks of queues. Presented at the Int. Conf. on Stochastic Control and Optimization, Amsterdam 1979.

    Google Scholar 

  19. E. de Souza a Silva, S.S. Lavenberg and R.R. Muntz, A perspective on iterative methods for the approximate analysis of closed queueing networks. Proc. Int. Workshop on Applied Mathematics and Performance Reliability Models of Computer Communication Systems, University of Pisa 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Eindhoven, 1983

    Jan van Doremalen & Jaap Wessels

Authors
  1. Jan van Doremalen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jaap Wessels
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

F. Archetti G. Di Pillo M. Lucertini

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

van Doremalen, J., Wessels, J. (1986). Iterative approximations for networks of queues. In: Archetti, F., Di Pillo, G., Lucertini, M. (eds) Stochastic Programming. Lecture Notes in Control and Information Sciences, vol 76. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006866

Download citation

  • DOI: https://doi.org/10.1007/BFb0006866

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16044-1

  • Online ISBN: 978-3-540-39729-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation