Fault-tolerant Routing Algorithms based on Approximate Routable Probabilities for Hypercube Networks

Abstract Recently, research on parallel processing systems is very active, and many complex topologies have been proposed. One of the most popular topologies is a hypercube network. In this paper, we propose new fault-tolerant routing algorithms for hypercube networks based on approximate routable probabilities. The probability represents ability of routing to any node at a specific distance. Each node selects one of its neighbor nodes to send a message by taking the approximate routable probabilities into consideration. We also conducted a computer experiment to verify the effectiveness of our algorithms