Fault-tolerant wormhole routing for hypercube networks
We present an adaptive fault-tolerant wormhole routing algorithm for hypercubes by using 3 virtual networks. The routing algorithm can tolerate at least n - 1 faulty nodes and can route a message via a path of length no more than the shortest path plus four. Previous algorithms which achieve the same fault tolerant ability need 5 virtual networks. Simulation results are also given in this paper. (C) 2002 Elsevier Science B.V. All rights reserved.
wormhole routing hypercubes fault tolerance interconnection networks