An analytical model of adaptive wormhole routing in hypercubes in the presence of hot spot traffic
Analytical models of fully adaptive routing for common wormhole-routed networks (e.g., hypercubes) under the uniform traffic pattern have recently been reported in the literature. However, many studies have revealed that the performance advantages of adaptive routing over deterministic routing is more noticeable when the traffic is nonuniform due to, for example, the existence of hot spots in the network. This paper proposes a new queueing model of fully adaptive routing in the hypercube in the presence of hot spot traffic. The analysis focuses on Duato's algorithm [11], but can easily be applied to other fully adaptive routing algorithms. Results from simulation experiments are presented to validate the model.
adaptive routing routing algorithms multicomputers interconnection networks virtual channels message latency performance modeling m/g/1 queues