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.
展开▼
机译：文献中已经提出了一些针对网络队列模型的有限分析推导方法，但是它们的解决方案常常面临很大的数学挑战。为了克服这些限制，必须开发可以处理一般网络队列拓扑的仿真工具。尽管有某些限制，但是仿真算法提供了一种机制来获得对网络队列的参数的见解和良好的数值逼近。本文提出了一个封闭的随机仿真网络模型以及G / G / c系统的几种近似和边界方案。最初进行该分析是为了验证用于开发代表美国空军执行的替代性政策选择的仿真模型的完整性。我们表明，理论上的界限可用于近似各种队列的平均容量。在本文中，我们给出了G / G / 8系统的结果，尽管对于其他队列网络也获得了类似的结果。
展开▼
