Abstract
Decomposition and aggregation is a very important technique for the approximative analysis of large scale hierarchical models. In particular a decomposition on model level rather than on the underlying Markov chain allows to reduce the solution effort for a complex model significantly. We introduce here an extended approach for the aggregation of Markovian submodels including different types of entities. Aggregate construction is based on numerical pre-analysis of absorbing Markov chains. The resulting aggregates can be interpreted as queueing network stations with Coxian service time distributions, special subnets of coloured GSPNs or as specific station types in process interaction models. The aggregation approach has been automized and integrated in a tool environment. The resulting aggregation errors are most times much smaller than errors resulting from standard flow equivalent aggregation.
Part of this work has been supported by the CEC under the Esprit II contract no. 2143 (IMSE)
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G. Balbo, S.C. Bruell, S. Ghanta; Combining Queueing Networks and Generalized Stochastic Petri Nets for the Solution of Complex Models of System Behavior; IEEE Trans, on Comp, Vol. 37, No 10, 1988, pp. 1251–1268.
G. Balbo, S.C. Bruell; Computational Aspects of Aggregation in Multiple Class Queueing Networks; Performance Evaluation, Vol. 3, 1983, pp. 177–185.
G. Balbo, G. Serazzi (ed.), Computer Performance Evaluation - Modelling Techniques and Tools; North Holland 1992.
P. Bucliholz; The Structured Analysis of Markovian Models (in German); IFB 282, Springer 1991.
P. Buchholz, M. Sczittnick; DAT Final Report; IMSE Deliverable D5. 4 –2, 1992.
K.M. Chandy, U. Herzog, L. Woo; Parametric Analysis of Queueing Networks; IBM Jour. Res. and Dev. Vol. 19, No. 1, January 1975, pp. 36–42.
G. Chiola; GreatSPN 1.5 Software Architecture; in [3]
P.J. Courtois; Decomposability: Queueing and Computer System Application; Academic Press 1977.
J.P. Hong, G. Kim; Class dependent queueing disciplines with product form solutions; in A.K. Aggrawalla, S.K. Tripathi (ed.), Performance 83; North Holland 1983.
P.J. Kuehn; Analysis of busy periods and response times in queueing networks by the method of first passage times; in A.K. Aggrawalla, S.K. Tripathi (ed.), Performance 83, North Holland 1983.
R. Lai, U.N. Bhat; Reduced Systems in Markov Chains and their Application in Queueing Theory; Queueing Systems, Vol. 2, 1987, pp. 147 - 172.
S.S. Lavenberg, M. Reiser; Stationary State Probabilities at Arrival Instants for Closed Queueing Networks with Multiple Types of Customers; J. Appl. Prob., vol. 17, 1980, pp. 1048–1061.
R. Pooley; The Integrated Modelling Support Environment a new generation of performance modelling tools; in [3].
M. Veran, D. Potier; A Portable Environment for Queueing Systems Modelling; in D. Potier (ed.); Modelling Techniques and Tools for Performance Analysis, North Holland 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buchholz, P. (1993). A Heuristic Approach for the Aggregation of Markovian Submodels. In: Walke, B., Spaniol, O. (eds) Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78495-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-78495-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57201-5
Online ISBN: 978-3-642-78495-8
eBook Packages: Springer Book Archive