Performance analysis of packet switching interconnection networks with finite buffers

In this paper, a mathematical method for analysis of synchronous packet-switching interconnection networks with finite buffering capacity at the output of switching elements is presented. The proposed mathematical method is general in that it analyzed interconnection networks under uniform and nonuniform traffic with blocking. The existing methods for analysis of buffered interconnection networks have assumed either single or infinite buffers at each input (or output) port of a switch, as well as uniform traffic pattern of the networks. Firstly, in the paper a general model of synchronous buffered switching element, using output buffering, under assumption of finite buffer size for a very general class of traffic, is presented. Traffic can be uniform or nonuniform. It is assumed that the subsequent stages of the network are nearly independent and a model is extended for entire network under this assumption. Analytical results obtained with proposed model are then compared with each other and it is shown that the proposed mathematical method is more general then the known models of interconnection networks.