A NOVEL ROUTING ALGORITHM FOR K-ARY N-CUBE INTERCONNECTION NETWORKS

This paper proposes a novel routing algorithm, called the direction-fi rst e-cube, for routing on k-ary n-cube interconnection networks. It i s an adaptive, partially minimal algorithm based on the wormhole-routi ng strategy and effectively extends the basic e-cube technique, It has been proved by a set of theorems that the proposed algorithm is deadl ock-, livelock- and starvation-free. In the absence of faults, the alg orithm is fully minimal. Even in the presence of faults and network co ngestion, the number of extra hops required to route a message is mini mal. The algorithm is also simple to implement, since it utilizes a sm all header node of 2 log(2) n + n log(2) k + 1 bits. Simulation result s are given to validate the proposed algorithm.