The buffer allocation problem for general finite buffer queueing networks

Abstract

Abstract 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.