Abstract
We consider the multimessage multicasting over the n processor complete (or fully connected) static network when the forwarding of messages is allowed, and initially each processor only knows the messages it needs to send and their destinations. We present an efficient distributed algorithm to route the messages for every degree d problem instance with total expected communication time O(d + log n), where d is the maximum number of messages that each processor may send (or receive). Our routing algorithm consists of three phases. In the first phase the processors exchange messages to learn some basic global information. In the second phase each processor forwards its messages to transform the problem to a multimessage unicasting problem of degree d. The third phase uses a well known distributed algorithm to transmit all the resulting unicasting messages.
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.
