The effects of traffic patterns on the performance of 2-D mesh interconnection networks

Many routing algorithms have been proposed in the literature over the past decade. The performance characteristics of most of these algorithms have been analyzed by means of software simulation. In order to have a clear understanding of the performance Of these routing algorithms, this paper is presenting such a comparison in order to use by researchers. In this paper, the effects of different radix of the network-have been investigated on the performance of the 2D-mesh interconnected networks, with deterministic wormhole routing under different traffic patterns. We considered uniform and hotspot traffic distributions for the destination address of generated messages. The simulation results have shown that choosing the same number of nodes in each dimension of mesh topology performs better in most cases.