Modeling adaptive routing in k-ary n-cube networks

Interest in parallel processing has steadily increased in recent years, and correspondingly, modeling techniques for communication systems have become increasingly important. In this paper we present a performance evaluation study of adaptive routing strategies in k-ary n-cube interconnection networks. Adaptive routing, as opposed to deterministic routing, exploits the presence of multiple paths in a network in order to reduce communication latency. Two minimal path adaptive strategies are evaluated using extensive simulation experiments. In addition, we derive an analytic model using Markov queueing for the case when n=2. We use these models to measure the communication speedup that can be achieved by adaptive routing, and to assess the impact of various network parameters on the performance of such systems