Skip to main content
Log in

A class of hierarchical queueing networks and their analysis

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

Queueing networks are an adequate model type for the analysis of complex system behavior. Most of the more realistic models are rather complex and do not fall into the easy solvable class of product form networks. Those models have to be analyzed by numerical solution of the underlying Markov chain and/or approximation techniques including simulation. In this paper a class of hierarchically structured queueing networks is considered and it is shown that the hierarchical model structure is directly reflected in the state space and the generator matrix of the underlying Markov chain. Iterative solution techniques for stationary and transient analysis can be modified to make use of the model structure and allow an efficient numerical analysis of large, up to now not solvable queueing networks.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. 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.

    Google Scholar 

  2. H. Beilner, J. Mater and N. Weissenberg, Towards a performance modelling environment: News on HIT, in:Proc. 4th Int. Conf. on Modelling Techniques and Tools for Performance Evaluation, ed. R. Puijanger (Plenum, New York, 1988).

    Google Scholar 

  3. A. Bobbio and K.S. Trivedi, An aggregation technique for the transient analysis of stiff Markov chains, IEEETrans. Comp. 35 (1986) 803–814.

    Google Scholar 

  4. P. Buchholz,The Structured Analysis of Markovian Models (in German) (Informatik Fachberichte 282, Springer, Berlin, 1991).

    Google Scholar 

  5. P. Buchholz, The numerical analysis of hierarchical queueing network models, in:Proc. 6th GI/ ITG Fachtagung Messung, Modellierung und Bewertung von Rechensystemen, eds. A. Lehmann and F. Lehmann (Informatik Fachberichte 286, Springer, Berlin, 1991).

    Google Scholar 

  6. P. Buchholz, Numerical solution methods based on structured descriptions of Markovian models, in:Proc. 5th Int. Conf. on Computer Performance Evaluation-Modelling Techniques and Tools, eds. G. Balbo and G. Serazzi (North-Holland, Amsterdam, 1992).

    Google Scholar 

  7. P. Buchholz, A hierarchical view of GCSPNs and its impact on qualitative and quantitative analysis, J. Parallel and Distributed Comput. 15 (1992) 207–224.

    Google Scholar 

  8. W.L. Cao and W.J. Stewart, Iterative aggregation/disaggregation techniques for nearly uncoupled Markov chains, J. ACM 32 (1985) 702–719.

    Google Scholar 

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

    Google Scholar 

  10. P.J. Courtois, Exact aggregation in queueing networks, in:Proc. 1st AFCET-SMF Meeting on Appl. Math., Ecole Polytechn. Palaiseau, France (1978).

    Google Scholar 

  11. M. Davio, Kronecker products and shuffle algebra, IEEE Trans. Comp. 30 (1981) 116–125.

    Google Scholar 

  12. K.J. Gordon, J.F. Kurose, R.F. Gordon and E.A. MacNair, An extensible visual environment for construction and analysis of hierarchically-structured models of resource contention systems, IBM Research Report RC 15100 (1989).

  13. D. Gross, B. Gu and R.M. Soland, The biconjugate gradient method for obtaining the steady-state probability distributions of Markovian multi-echelon repairable item inventory systems, in:Proc. 1st Int. Workshop on the Numerical Solution of Markov Chains, ed. G.W. Stewart (Marcel Dekker, New York, 1991).

    Google Scholar 

  14. D. Gross and D.R. Miller, The randomization technique as a modelling tool and solution procedure for transient Markov processes, Oper. Res. 32 (1984) 343–361.

    Google Scholar 

  15. L. Kaufman, Matrix methods for queueing problems, SIAM J. Sci. Stat. Comput. 4 (1983) 525–552.

    Google Scholar 

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

    Google Scholar 

  17. B. Müller-Clostermann, NUMAS: A tool for the numerical modelling of computer systems, in ref. [20].

    Google Scholar 

  18. B. Müller-Clostermann and M. Sczittnick, MACOM — A tool for the Markovian analysis of communication systems, in:Proc. 4th Int. Conf. on Data Communication Systems and their Performance, Barcelona (1990).

  19. B. Plateau, On the stochastic structure of parallelism and synchronisation models for distributed algorithms, in:Proc. ACM Sigmetrics Conf. on Measurement and Modelling of Computer Systems, Austin (1985).

  20. D. Potier, ed.,Modelling Techniques and Tools for Performance Evaluation (North-Holland, Amsterdam, 1985).

    Google Scholar 

  21. A. Reibman and K.S. Trivedi, Numerical transient analysis of Markov models, Comput. Oper. Res. 15 (1988) 19–36.

    Google Scholar 

  22. C.H. Sauer and E.A. McNair, The evolution of the research queueing package, in ref. [20].

    Google Scholar 

  23. M. Veran and D. Potier, QNAP2: A portable environment for queueing systems modelling, in ref. [20].

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Buchholz, P. A class of hierarchical queueing networks and their analysis. Queueing Syst 15, 59–80 (1994). https://doi.org/10.1007/BF01189232

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation