RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks
RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks
复制标题
RECAL——一种新的高效多链封闭排队网络精确分析算法
DOI：
--
复制
发表时间：
1986
期刊：
影响因子：
--
通讯作者：
N. Georganas
中科院分区：
文献类型：
--
作者：
A. Conway;N. Georganas
提出了一种求解乘积型多链闭排队网络平均性能指标的递归链式算法。它是基于一个新的递归表达式，涉及到一个网络的正规化常数r封闭的路由链的一组网络具有（r - 1）链。它依赖于将每条链分解为组成子链的技巧，每个子链都有一个种群。该算法的时间和空间的要求是多项式的链的数量。当网络包含多个路由链时，该算法比卷积或平均值分析算法更有效。因此，该算法扩展了排队网络的范围，可以有效地分析精确的手段。
RECAL, a Recursion by Chain Algorithm for computing the mean performance measures of product-form multiple-chain closed queuing networks, is presented. It is based on a new recursive expression that relates the normalization constant of a network with r closed routing chains to those of a set of networks having (r - 1) chains. It relies on the artifice of breaking down each chain into constituent subchains that each have a population of one. The time and space requirements of the algorithm are shown to be polynomial in the number of chains. When the network contains many routing chains, the proposed algorithm is substantially more efficient than the convolution or mean value analysis algorithms. The algorithm, therefore, extends the range of queuing networks that can be analyzed efficiently by exact means.