Abstract

Some limited analytical derivation for networked queue models has
been proposed in the literature, but their solutions are often of
a great mathematical challenge. To overcome such limitations,
simulation tools that can deal with general networked queue
topology must be developed. Despite certain
limitations, simulation algorithms provide a mechanism to obtain
insight and good numerical approximation to parameters of
networked queues. This paper presents a closed stochastic
simulation network model and several approximation and bounding
schemes for G/G/c systems. The analysis was originally conducted
to verify the integrity of simulation models used to develop
alternative policy options conducted on behalf of the US Air
Force. We showed that the theoretical bounds could be used to
approximate mean capacities at various queues. In this paper, we
present results for a G/G/8 system though similar results have
been obtained for other networks of queues as well.

Copyright Hindawi Publishing Corporation. The ELibM mirror is published by FIZ Karlsruhe.