Fault-tolerant Routing in Dual-cubes Based on Routing Probabilities

Abstract Recently, there has been a growing demand for large-scale computing in various fields. A binary hypercube has been used as an interconnection network topology in parallel computers for large-scale computing. However, the hypercube has a limitation that the degree, that is, the number of links for each node augments rapidly according to the increase in the number of total nodes. This limitation has been complemented in a dual-cube. In this paper, we propose a fault-tolerant routing algorithm in a dual-cube based on routing probabilities. The routing probability is developed as limited global information for routing ability of a node in a hypercube for an arbitrary node located at a specific distance. Unlike other previous researches that use limited global information in each cluster on fault tolerant routing in a dual-cube, our routing algorithm applies limited global information for an overall dual-cube. Each node selects a neighbor node to forward the message to the destination node by considering routing probabilities of its neighbor nodes. The results of a computer experiment show better performance of our algorithm.