The buffer allocation problem for general finite buffer queueing networks
The buffer allocation problem for general finite buffer queueing networks
复制标题
DOI：
10.1080/07408170590916986
复制
发表时间：
2005-04-01
期刊：
影响因子：
--
通讯作者：
Cruz, FRB
中科院分区：
文献类型：
--
作者：
Smith, JM;Cruz, FRB
缓冲区分配问题是一个复杂的随机、整数、非线性规划问题。一般而言，问题的目标函数和约束条件不能以封闭的形式提供。基于M/M/1/K系统的二阶矩近似公式，给出了预测最优缓冲区分配的近似公式。将M/M/1/K和M/G/1/K系统的闭式表达式用于有限缓冲排队网络的BAP串联、合并和分裂拓扑。大量的计算结果证明了该方法的有效性。
The Buffer Allocation Problem (BAP) is a difficult stochastic, integer, nonlinear programming problem. In general, the objective function and constraints of the problem are not available in a closed form. An approximation formula for predicting the optimal buffer allocation is developed based upon a two-moment approximation formula involving the expressions for M/M/1/K systems. The closed-form expressions of the M/M/1/K and M/G/1/K systems are utilized for the BAP in series, merge, and splitting topologies of finite buffer queueing networks. Extensive computational results demonstrate the efficacy of the approach.