The impact of certain parameter estimation errors 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) , 3-9
- https://doi.org/10.1145/1009375.806145
Abstract
The effect that parameter estimation errors have on performance in closed product form queueing networks is investigated. In particular, the effects of errors in the relative utilization estimates of the servers are analyzed. It is shown that in single class load independent networks, the resulting errors in throughput and utilizations are of approximately the same percentage as the errors in the relative utilization estimates. This result does not hold in networks with load dependent servers or multiple customer classes. The percentage errors in mean queue length depend upon the degree of multiprogramming in the network. Errors in mean queue lengths can become unbounded as the degree of multiprogramming becomes unbounded. Implications of these results to computer system modeling are discussed.Keywords
This publication has 9 references indexed in Scilit:
- Survey of analytic queueing network models of computer systemsPublished by Association for Computing Machinery (ACM) ,1979
- An exact solution method for the general class of closed separable queueing networksPublished by Association for Computing Machinery (ACM) ,1979
- The Operational Analysis of Queueing Network ModelsACM Computing Surveys, 1978
- Approximate Methods for Analyzing Queueing Network Models of Computing SystemsACM Computing Surveys, 1978
- On the convolution algorithm for separable queuing networksPublished by Association for Computing Machinery (ACM) ,1976
- A generating function approach to queueing network analysis of multiprogrammed computersNetworks, 1976
- Queuing Networks with Multiple Closed Chains: Theory and Computational AlgorithmsIBM Journal of Research and Development, 1975
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Computational algorithms for closed queueing networks with exponential serversCommunications of the ACM, 1973