Skip to main content
SpringerLink
Log in
Book cover

International Conference on Modelling Techniques and Tools for Computer Performance Evaluation

TOOLS 1995: Quantitative Evaluation of Computing and Communication Systems pp 150–164Cite as

On the exact and approximate analysis of hierarchical discrete time queueing networks

  • Conference paper
  • First Online:

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

Abstract

Hierarchical queueing networks on a discrete time scale are introduced. It is shown that the hierarchical structure of the model can be exploited for representation and generation of the state space and transition matrix of the underlying discrete time Markov chain. The resulting representation of the transition matrix is used in various iterative solution techniques including aggregation/disaggregation techniques, enabling the analysis of large models. Furthermore we present an approximate analysis technique applicable for the analysis of very large models or the determination of an initial vector for a subsequent iterative analysis.

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. M. Ajmone-Marsan, S. Donatelli and F. Neri; GSPN models of multiserver multiqueue systems; Performance Evaluation 11 (1990) 227–240.

    Article  Google Scholar 

  2. F. Baskett, K.M. Chandy, R.R. Muntz and G.F. Palacois; Open, closed and mixed networks of queues with different classes of customers; J.ACM 22 (1975) 248–260.

    Article  Google Scholar 

  3. P. Buchholz; Hierarchical Markovian models-symmetries and aggregation-. Performance Evaluation 22 (1995) 93–110.

    Article  Google Scholar 

  4. P. Buchholz. A class of hierarchical queueing networks and their analysis; Queueing Syst. 15 (1994) 59–80.

    Article  Google Scholar 

  5. P. Buchholz; Lumpability and nearly-lumpability in hierarchical queueing networks; In: Proc. of the IPDS' 95, IEEE-CS Press (1995) 82–91.

    Google Scholar 

  6. K. M. Chandy, U. Herzog, L. Woo; Approximative analysis of general queueing networks; IBM J. Res. Develop. 19 (1975) 43–49.

    Google Scholar 

  7. G. Ciardo; Discrete-time Markovian stochastic Petri nets; In: W. J. Stewart (ed.); Computation with Markov Chains: Proc. of the 2nd Int. Worksh. on the Num. Sol. of Markov Chains, Kluwer (1995) 339–358.

    Google Scholar 

  8. G. Ciardo, K. Trivedi, A decomposition approach for stochastic reward net models; Performance Evaluation 18 (1994) 37–59.

    Article  MathSciNet  Google Scholar 

  9. P. J. Courtois; Decomposability queueing and computer system applications; Academic Press (1977).

    Google Scholar 

  10. M. Davio; Kronecker Products and shuffle algebra; IEEE Trans. Comp. 30 (1981) 116–125.

    Google Scholar 

  11. U. Krieger, B. Müller-Clostermann, M. Sczittnick. Modeling and analysis of communication systems based on computational methods for Markov chains; IEEE J. Sel. Areas in Commun. 8 (1990) 1630–1648.

    Article  Google Scholar 

  12. Y. Li, C. M. Woodside; Complete decomposition of stochastic Petri nets representing generalized service networks; IEEE Trans. Comp. 44 (1995) 577–592.

    Article  Google Scholar 

  13. Performance Evaluation 21 (1994); Special Issue: On discrete time models and analysis methods.

    Google Scholar 

  14. B. Plateau, K. Atif; Stochastic automata network for modeling parallel systems. IEEE Trans. on Softw. Eng. 17 (1991) 1093–1108.

    Article  Google Scholar 

  15. Queueing Systems, 18 (1994); Special Issue on discrete time queues.

    Google Scholar 

  16. W.J. Stewart, K. Atif, B. Plateau; The Numerical Solution of Stochastic Automata Networks; to appear in European Journal of Operations Research.

    Google Scholar 

  17. W. J. Stewart; Introduction to the numerical solution of Markov chains; Princeton University Press (1994).

    Google Scholar 

  18. R. Zijal, R. German; A new approach to discrete time stochastic Petri nets; In: Proc. 11th Int. Conf. on Analysis and Optimization of Systems, Springer Lect. Not. in Cont. and Inf. Sci 199 (1994) 198–204.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatik IV, Universität Dortmund, 44221, Dortmund, Germany

    Peter Buchholz

Authors
  1. Peter Buchholz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Heinz Beilner Falko Bause

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buchholz, P. (1995). On the exact and approximate analysis of hierarchical discrete time queueing networks. In: Beilner, H., Bause, F. (eds) Quantitative Evaluation of Computing and Communication Systems. TOOLS 1995. Lecture Notes in Computer Science, vol 977. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024313

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60300-9

  • Online ISBN: 978-3-540-44789-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation