By Topic

Optimal fault-tolerant routing scheme for generalized hypercube

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
$33 $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

3 Author(s)
Shaohuai Tian ; Software Sch., Hunan Univ., Changsha, China ; Yingping Lu ; Dafang Zhang

We propose node path vector (NPV) to capture complete shortest routing information for a generalized hypercube system. We also introduce the concept of relay node technique to reduce the computation complexity in obtaining NPV. Optimal fault-tolerant routing scheme (OFTRS) is further proposed to derive an optimal or sub-optimal routing path for any communication pair in a generalized hypercube system. Compared to previous work, OFTRS does not omit any routing information for optimal and sub-optimal path even in a generalized hypercube system with large number of faulty nodes and links while the previous schemes can potentially omit 60% routing paths. Thus it considerably improves the quality of fault-tolerant routing. In addition, our proposed scheme is distributed and relying only on non-faulty neighboring nodes, thus it has high applicability. Finally, the algorithm guarantees to route through the optimal or sub-optimal path as long as a path between the source-destination pair exists.

Published in:

11th Pacific Rim International Symposium on Dependable Computing (PRDC'05)

Date of Conference:

12-14 Dec. 2005