This paper reviews five strategies for the allocation of output buffers to nodes in store-and-forward computer networks. A good buffer allocation scheme reduces message blocking and thus the message delay time. Algorithms to determine the minimum buffer sizes for four of the five strategies are developed given the set of blocking probabilities and the set of delays on each outgoing channel at a node. The performance of the strategies are compared under various network traffic conditions and blocking requirements. Numerical examples for the case of four channels are presented and guidelines on which strategy to use under different conditions are also given.

This paper extends and refines the work of others in the analysis of five output buffer allocation strategies, particularly work done by Kamoun and Kleinrock [1]. Conclusions drawn from a sample of numerical examples should always be interpreted within context, and care must be taken in their generalization. Nevertheless, the results of this work will be of interest to network designers in determining the output buffer allocation scheme to be used and the amount of buffers to be allocated to each network node.