Modeling Latency in Deterministic Wormhole-Routed Hypercubes under Hot-Spot Traffic

Analytical models of deterministic routing in common wormhole-routed networks, such as the hypercube, have been widely reported in the literature. However, all these models have been discussed for the uniform traffic pattern. The performance of deterministic routing under other important non-uniform communication patterns, such as hot-spots, has often been analyzed through simulation. The main advantage of the analytical approach over simulation is that the analytical models can be used to obtain performance results for large systems that are infeasible by simulation due to the excessive computation demands on conventional computers. This paper presents the first analytical model of deterministic routing in the hypercube in the presence of hot-spot traffic. Simulation results confirm that the proposed model predicts message latency with a reasonable degree of accuracy under different traffic conditions.