Abstract
In this paper, we propose a distributed algorithm for one-to-all broadcasting on the arrangement graph. The algorithm exploits the rich topological properties of the (n, k)-arrangement graph to constitute the broadcasting binary tree and works recursively. When faulty links are encountered, the concepts of node-disjoint paths and virtual paths are used to deal with the broadcasting procedure. It is shown that the message can be broadcast to all n!/(n−k)! processors in O(k lg n) steps for fault-free mode, and in O(k(k+lg n)) for less than k(n−k)−1 faulty links.
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.
