Further results on equivalence and decomposition in queueing network models
- 28 May 1980
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 9 (2) , 93-104
- https://doi.org/10.1145/1009375.806153
Abstract
This paper addresses three aspects related to the notion of exact equivalence in queueing models. In many cases the parameters of a system equivalent to a given model involve only a small subset of conditional probabilities of the state of the original model given the equivalent one. It is shown that meaningful bounds may be obtained for the conditional probabilities of interest with little computational effort. Such bounds are useful in assessing processing capacities as well as the accuracy of approximate solutions. As a second point it is shown that the notion of exact equivalence may be easily extended to networks with non-exponential servers. This is done for both the methods of supplementary variables and for the imbedded Markov chain technique. Qualitative analysis of approximation methods is also discussed. Finally, numerical methods based on the notion of exact equivalence, i.e. operating on conditional probabilities, are considered.Keywords
This publication has 2 references indexed in Scilit:
- Approximate Methods for Analyzing Queueing Network Models of Computing SystemsACM Computing Surveys, 1978
- A use of complex probabilities in the theory of stochastic processesMathematical Proceedings of the Cambridge Philosophical Society, 1955