Two parallel paths in incomplete hypercubes

Previous routeing algorithms for incomplete hypercubes deal only with single-path routeing and fail to take advantage of the flexibility provided by incomplete hypercubes. The authors present a simple effective routeing algorithm that forwards messages through two parallel paths between a pair of nodes in any incomplete hypercube with an even number of nodes. This algorithm proves to be deadlock-free under both store-and-forward and wormhole routeing modes. The mean latency for sending large size messages is apparently reduced by forwarding them to their destinations through two parallel paths. This reduction in latency would result in a significant performance improvement. This algorithm can also tolerate one fault in the system by sending duplicate copies of messages through two parallel paths