J Austral Math Soc Ser B 31 pp241--258, 1990.
(Received December 1988; revised February 1989)
A general condition is provided from which an error bound can be concluded for approximations of queueing networks which are based on modifications of the transition and state space structure. This condition relies upon Markov reward theory and can be verified inductively in concrete situations. The results are illustrated by estimating the accuracy of a simple throughput bound for a closed queueing network with alternate routing and a large finite source input. An explicit error bound for this example is derived which is of order M -1, where M is the number of sources.
Last Modified: Mon Jan 14 16:50:02 2002