Abstract
In this paper, we propose a new fault-tolerant routing algorithm for the hypercube, which overcomes the performance limitations of the recently proposed safety vectors algorithm [IEEE Trans. Parallel Distrib. Syst. 9 (4) (1998) 321]. We present first a method for evaluating the k-level unsafety sets S k A for all 1⩽ k⩽ n in an n-dimensional hypercube. The k-level unsafety set at node A represents the set, S k A , of all nodes at Hamming distance k from A, which are faulty or unreachable from A due to faulty nodes or links. Equipped with these unsafety sets we show how each node calculates numeric probability vectors and uses them to achieve efficient fault-tolerant routing. A probability-based analysis is conducted to prove some properties of the proposed fault-tolerant algorithm. A performance comparison against the safety vectors algorithm, through extensive simulation experiments, reveals that the new algorithm exhibits superior performance in terms of routing distances and percentage of reachability.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
