The buffer allocation problem for general finite buffer queueing networks

被引：79

作者：

Smith, JM ^{[1
]}

Cruz, FRB

机构：

[1] Univ Massachusetts, Dept Mech & Ind Engn, Amherst, MA 01003 USA

[2] Univ Fed Minas Gerais, Dept Stat, Belo Horizonte, MG, Brazil

来源：

IIE TRANSACTIONS | 2005年 / 37卷 / 04期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1080/07408170590916986

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

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.

引用

页码：343 / 365

页数：23