Abstract

Abstract We propose a fault-tolerant broadcasting algorithm for hypercubes with link faults. This algorithm is based on an extended spanning binomial tree structure that still keeps the simplicity of conventional binomial-tree-based broadcasting. In addition, it is optimal in the sense that exactly n steps are required to complete a broadcast in an n-dimensional injured hypercube with up to n − 2 faulty links. We also show that n − 2 is the maximum number of faulty links that can be tolerated in any optimal broadcast scheme in an n-dimensional hypercube. To implement the proposed algorithm each node keeps information of nearby faulty links in terms of addresses for those faulty adjacent m-subcubes that contain at least m − 1 faulty links.

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 call

Disclaimer: 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.