By Topic

Reliable unicasting in faulty hypercubes using safety levels

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

1 Author(s)
Jie Wu ; Dept. of Comput. Sci. & Eng., Florida Atlantic Univ., Boca Raton, FL, USA

We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes and unicasting is a one-to-one communication between two nodes in the hypercube. Each node is associated with a safety level which is an approximated measure of the number and distribution of faulty nodes in the neighborhood. The safety level of each node in an n-dimensional hypercube (or n-cube) can be easily calculated through n-1 rounds of information exchange among neighboring nodes. Optimal unicasting between two nodes is guaranteed if the safety level of the source node is no less than the Hamming distance between the source and the destination. The proposed unicasting algorithm can also be used in disconnected hypercubes, where nodes in a hypercube are disjointed into two or more parts. The feasibility of an optimal or suboptimal unicasting can be easily determined at the source node by comparing its safety level, its neighbors' safety levels, and the Hamming distance between the source and the destination. The proposed scheme is the first attempt to address the unicasting problem in disconnected hypercubes. The safety level concept is also extended to be used in hypercubes with both faulty nodes and links and in generalized hypercubes

Published in:

Computers, IEEE Transactions on  (Volume:46 ,  Issue: 2 )