Cart (Loading....) | Create Account
Close category search window
 

Unicast in hypercubes with large number of faulty nodes

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.

Unicast in computer/communication networks is a one-to-one communication between a source node s and a destination node t. We propose three algorithms which find a nonfaulty routing path between s and t for unicast in the hypercube with a large number of faulty nodes. Given the n-dimensional hypercube Hn and a set F of faulty nodes, node uε Hn is called k-safe if u has at least k nonfaulty neighbors. The Hn is called k-safe if every node of Hn is k-safe. It has been known that for 0⩽k⩽n/2, a k-safe Hn is connected if |F|⩽2k(n-k)-1. Our first algorithm finds a nonfaulty path of length at most d(s,t)+4 in O(n) time for unicast between 1-safe s and t in the Hn with |F|⩽2n-3, where d(s,t) is the distance between s and t. The second algorithm finds a nonfaulty path of length at most d(s,t)+6 in O(n) time for unicast in the 2-safe Hn with |F|⩽4n-9. The third algorithm finds a nonfaulty path of length at most d(s,t)+O(k2) in time O(|F|+n) for unicast in the k-safe Hn with |F|⩽2k(n-k)-1 (0⩽k⩽n/2). The time complexities of the algorithms are optimal. We show that in the worst case, the length of the nonfaulty path between s and t in a k-safe Hn with |F|⩽2k(n-k)-1 is at least d(s,t)+2(k+1) for 0⩽k⩽n/2. This implies that the path lengths found by the algorithms for unicast in the 1-safe and 2-safe hypercubes are optimal

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:10 ,  Issue: 10 )

Date of Publication:

Oct 1999

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.