By Topic

A Fault-Tolerant Routing Algorithm with Safety Vectors on the (n, k)-Star Graph

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

4 Author(s)
Chiao-Wei Chiu ; Dept. of Comput. Sci. & Eng., Nat. Sun Yat-sen Univ., Kaohsiung, Taiwan ; Chang-Biau Yang ; Kuo-Si Huang ; Chiou-Ting Tseng

In this paper, we focus on the design of the fault-tolerant routing algorithm for the (n,k)-star graph. We apply the idea of collecting the limited global information used for routing on the n-star graph to the (n,k)-star graph. First, we build the probabilistic safety vector (PSV) with modified cycle patterns. Then, our routing algorithm decides the fault-free routing path with the help of PSV. The performance is judged by the average length of routing paths. Compared with distance first search and safety level, we get the best performance in the simulations.

Published in:

Pervasive Systems, Algorithms, and Networks (ISPAN), 2009 10th International Symposium on

Date of Conference:

14-16 Dec. 2009