We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Node-to-node cluster fault tolerant routing in hypercubes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Qian-Ping Gu ; Dept. of Comput. Software, Aizu Univ., Fukushima, Japan ; Peng, S.

In this paper, we study the node-to-node fault tolerant routing problem in the n-dimensional hypercube Hn based on the cluster fault tolerant model. For a graph G, a faulty cluster is a connected subgraph of G such that all its nodes are faulty. In cluster fault tolerant routing problems, how many faulty clusters and how large of those clusters can be tolerated are studied. It has been known that for the node-to-node routing, Hn can tolerate as many as n-1 faulty clusters of diameter at most 1 with at most 2n-3 faulty nodes in total. In this paper, we extend the above result to show the sufficient conditions on faulty clusters of arbitrary diameters that Hn can tolerate. We also give an algorithm which, given a set of faulty clusters satisfying the sufficient conditions and non-faulty nodes s and t in Hn, finds a fault-free path s→t of length d(s,t)+O(log n) in O(n+|F|) optimal time, where |F| is the total number of faulty nodes

Published in:

Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN '97) Proceedings., Third International Symposium on

Date of Conference:

18-20 Dec 1997