Routing in the presence of breakdowns
Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
A compositional approach to performance modelling
A compositional approach to performance modelling
Compositional approximate markov chain aggregation for PEPA models
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Compositional approximate markov chain aggregation for PEPA models
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
| Hi-index | 0.00 |
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.