Journal of Applied Mathematics and Decision Sciences
Volume 2006 (2006), Article ID 87514, 13 pages
doi:10.1155/JAMDS/2006/87514
A simulation framework for networked queue models: Analysis of queue bounds in a G/G/c supply chain
1The RAND Corporation , Santa Monica 90407-2138, CA, USA
2College of Engineering, California State University, Long Beach 90840, CA, USA
3Information Systems Department, California State University, Long Beach 90840, CA, USA
Received 4 April 2006; Accepted 18 May 2006
Copyright © 2006 Mahyar Amouzegar and Khosrow Moshirvaziri. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
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.