Abstract
In the interconnection networks, broadcast is an important communication pattern. In this paper, we introduce a new fault-free broadcast algorithm for the bijective connection networks with restricted faulty node set. We then prove that under the condition that each node of an n-dimensional bijective connection network X n has at least one fault-free neighbor, all the fault-free nodes will be broadcasted within n+ [log (|F| + 1)] +3 steps from any fault-free node. Finally, we simulate the algorithm on randomly generated bijective connection networks with randomly faulty node set to estimate the real performance.
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.
