Performance analysis of a finite buffer burst-switched node

Abstract

A queuing model for an integrated voice and data node using burst switching is presented. The integrated node is assumed to have finite capacity for holding the data units waiting for transmission. An exact analytical technique is presented for estimating the mean number of data units in the system. The computational complexity of the analytic approach developed does not depend on the buffer size. The mean number of data units in the system obtained using a quasistatic analysis is compared to that obtained using the exact approach. It is shown that the accuracy of the quasistatic analysis depends on how valid the assumption that each mode reaches the steady state is.<>