An Adaptive Wormhole Routhing using Virtual Channels in K-ary n-cubes
Sung-Mok Lee, Chagn-Soo Kim · The Transactions of the Korea Information Processing Society · 1997
This paper is based on multicasting model in k-ary n-cubes, and Proposes an adaptive wormhole routing algorithm which allows faults and channel contention. The proposed algorithm only requires virtual channels per physical channel which is proportional to the dimension n in order to allow (n-1) faults in a k-ary n-cube. This method uses smaller number of virtual channels than the previously Proposed adaptive routing algorithms [5, 18]. Through a chaos simulator, we have measured message delay considering fault-tolerant as well as message traffic to our adaptive routing algorithm.