Abstract—Recently, parallel processing systems are enthusiastically studied, and many topologies for their inter- connection networks have been proposed. A hypercube was one of such popular topologies for interconnection networks, and it still provides fundamental structures for practical super- computers such as the NASA Pleiades and the NOAA Zeus and theoretical hierarchical topologies based on it. In this paper, we propose a link-fault-tolerant routing algorithm in hypercubes based on routing probabilities. The probability represents routing ability of a node for an arbitrary node located at a specific distance. Each node selects one of its neighbor nodes to send the message by considering their routing probabilities. We also conducted a computer experiment to evaluate performance of our algorithm.
Index Terms—Routing probability, fault tolerance, dependable computing, interconnection network, parallel processing.
Lam Boi Ngoc is with the Faculty of Mathematics and Computer Science, Ho Chi Minh University of Science, Ho Chi Minh City, Viet Nam (e-mail: boingoclam5893@gmail.com).
Bui Thi Thuan, Yuki Hirai, and Keiichi Kaneko are with Graduate School of Engineering, Tokyo University of Agriculture and Technology, Tokyo 184-8588, Japan (e-mail: k1kaneko@cc.tuat.ac.jp).
[PDF]
Cite:Lam Boi Ngoc, Bui Thi Thuan, Yuki Hirai, and Keiichi Kaneko, "Stochastic Link-Fault-Tolerant Routing in Hypercubes," Journal of Advances in Computer Networks vol. 4, no. 2, pp. 100-106, 2016.
