The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objec-tive function, the constraints or both are usually not avail-able in closed-form, making the problem even harder. A good approximation for the performance measures is thus essential for a successful buffer allocation algorithm. A re-cently
... [Show full abstract] published two-moment approximation formula for predicting the optimal buffer allocation in general service time single queues is examined in details, based on which a new algorithm is proposed for buffer allocation in single-serve general service time queueing networks. Computa-tional results are shown to evaluate the efficacy of the ap-proach in generating optimal buffer allocation patterns.