Tractable analytic models of demand assignment protocols in networks with arbitrary buffer capacity

The authors introduce analytic models for evaluating demand assignment protocols in realistic finite-buffer/finite-station network configurations. A solution for protocols with gated and nongated service disciplines that enables one to model demand assignment protocols as found, for example, in local and metropolitan area networks and in satellite communication systems is presented. A tractable approximate solution based on linear equations whose number is also linear is given. It is demonstrated that in addition to its computational efficiency, the presented approach does not incur a significant penalty in terms of accuracy