Fault-Tolerant node-to-set disjoint-path routing in hypercubes

Authors:
Antoine Bossard;Keiichi Kaneko;Shietung Peng
Affiliations:
,Graduate School of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan;,Graduate School of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan;,Graduate School of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan
Venue:
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Year:
2010

Citing 6
Cited 0

Topological Properties of Hypercubes

IEEE Transactions on Computers
Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
Fault tolerant routing in the star and pancake interconnection networks

Information Processing Letters
Node-to-set and set-to-set cluster fault tolerant routing in hypercubes

Parallel Computing
A Node-to-Set Disjoint-Path Routing Algorithm in Metacube

ISPAN '09 Proceedings of the 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks
Node-to-Set Disjoint-path Routing in Metacube

PDCAT '09 Proceedings of the 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies

Quantified Score

Hi-index	0.01

Visualization

Abstract

Hypercube-based interconnection networks are one of the most popular network topologies when dealing with parallel systems In a hypercube of dimension n, node addresses are made of n bits, and two nodes are adjacent if and only if their Hamming distance is equal to 1 In this paper we introduce a fault-tolerant hypercube routing algorithm which constructs n minus the number of faulty nodes f disjoint paths connecting one source node to k=n−f destination nodes in O(n2) time complexity.