Fault-tolerant routing based on approximate directed routable probabilities for hypercubes

Recently, parallel processing systems have been studied very actively, and many topologies have been proposed. A hypercube is one of the most popular topologies for interconnection networks. In this paper, we propose two new fault-tolerant routing algorithms for hypercubes based on approximate directed routable probabilities. Probabilities represent the ability of routing toward any node located at a specific distance and are calculated by considering from which direction the message has been received. Each node chooses one of its neighbor nodes to forward the message by comparing the approximate directed routable probabilities. We also conducted a computer experiment to verify the effectiveness of our algorithms.