Abstract
In this paper we use the Markovian process algebra PEPA to specify and analyse a class of queueing models which, in general, do not give rise to a product form solution but can nevertheless be decomposed into their components to obtain a scalable solution. Such a decomposition gives rise to expressions for marginal probabilities which may be used to derive potentially interesting system performance measures, such as the average number of jobs in the system. It is very important that some degree of confidence in such measures can also be given; however, we show here that it is not generally possible to calculate the variance exactly from the marginal probabilities. Hence, two approximations for the variance of the total population are presented and compared numerically.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Bradley, J., Davis, N.: Measuring improved reliability in stochastic systems. In: Proceedings of 15th UK Performance Engineering Workshop, University of Bristol, pp. 121–130 (1999)
Clark, G., Gilmore, S., Hillston, J., Thomas, N.: Experiences with the PEPA performance modelling tools. IEE Proceedings - Software 146(1) (1999)
Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press, Cambridge (1996)
Mitrani, I., Wright, P.E.: Routing in the Presence of Breakdowns. Performance Evaluation 20, 151–164 (1994)
Thomas, N.: Extending Quasi-separability. In: Proceedings of 15th UK Performance Engineering Workshop, University of Bristol, pp. 131–140 (1999)
Thomas, N., Bradley, J.: Approximating variance in non-product form decomposed models. In: Proceedings of the 8th International Workshop on Process Algebra and Performance Modelling. Carleton Scientific Publishers (2000)
Thomas, N., Gilmore, S.: Applying Quasi-Separability to Markovian Process Algebra. In: Proceedings of 6th International Workshop on Process Algebra and Performance Modelling (1998)
Thomas, N., Mitrani, I.: Routing Among Different Nodes Where Servers Break Down Without Losing Jobs. In: Quantitative Methods in Parallel Systems, pp. 248–261. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Thomas, N., Bradley, J. (2011). Analysis of Non-product Form Parallel Queues Using Markovian Process Algebra. In: Kouvatsos, D.D. (eds) Network Performance Engineering. Lecture Notes in Computer Science, vol 5233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02742-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-02742-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02741-3
Online ISBN: 978-3-642-02742-0
eBook Packages: Computer ScienceComputer Science (R0)