A simulation framework for networked queue models: Analysis of queue bounds in a G/G/c supply chain
Author(s) -
Mahyar A. Amouzegar,
Khosrow Moshirvaziri
Publication year - 2006
Publication title -
journal of applied mathematics and decision sciences
Language(s) - English
Resource type - Journals
eISSN - 1532-7612
pISSN - 1173-9126
DOI - 10.1155/jamds/2006/87514
Subject(s) - bounding overwatch , computer science , queue , fork–join queue , mathematical optimization , queueing theory , distributed computing , topology (electrical circuits) , queue management system , computer network , mathematics , artificial intelligence , combinatorics
Some limited analytical derivation for networked queue models hasbeen proposed in the literature, but their solutions are often ofa great mathematical challenge. To overcome such limitations,simulation tools that can deal with general networked queuetopology must be developed. Despite certainlimitations, simulation algorithms provide a mechanism to obtaininsight and good numerical approximation to parameters ofnetworked queues. This paper presents a closed stochasticsimulation network model and several approximation and boundingschemes for G/G/c systems. The analysis was originally conductedto verify the integrity of simulation models used to developalternative policy options conducted on behalf of the US AirForce. We showed that the theoretical bounds could be used toapproximate mean capacities at various queues. In this paper, wepresent results for a G/G/8 system though similar results havebeen obtained for other networks of queues as well
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom