An efficient fault tolerant routing algorithm for binary cube interconnection networks

This paper presents a fault tolerant routing algorithm for injured hypercube. The proposed routing algorithm backtracks from the faulty nodes using stacks of passed nodes embedded in the header of messages. When a node receives a new message, a set of possible destinations for the message is formed using the mentioned stack. This helps the receiving node to detect its adjacent faulty nodes and to prevent the message to pass through the corresponding links. In this way, the proposed algorithm efficiently works with any number of faulty nodes in the network. Deadlock freedom of the proposed routing algorithm is obtained by the lowest possible requirements i.e., one virtual channel per each physical channel. In order to evaluate the proposed routing algorithm, a 7-dimentional hypercube network is simulated in various conditions i.e., different traffic rates, different number of faulty nodes, and different message lengths. Simulation results confirm that the proposed routing algorithm in comparison with the previously proposed routings: 1) provides an average of 20% improvement in the performance of the network, and 2) increases the reliability of the network.