Skip to Main Content
Analytical models for fully adaptive wormhole routing in k-ary n-cubes interconnection networks have been widely reported in the literature. However, there are few performance models for 2D-mesh network-on-chip. Most current models assume Poisson traffic, but studies reveal that network traffic shows peculiar types of behavior, such as long-range dependence and self-similarity. An analytical model of fully adaptive wormhole routing is proposed in this paper, which explores the shortest path to the destination node in 2D-mesh NoC and assumes an MMPP (2) input traffic. The details of the model are elaborated. The proposed analytical model is solved through VC++ and Matlab programming.