Abstract
Multicast can provide efficient information dissemination for a subscribed user group on networks. This paper proposes a set of novel efficient fault-tolerant multicast routing algorithms on mesh networks using optimal shared free routing. The algorithms can select an optimal root for constructing the shared tree so as to minimize the average delay for multicast messages. Tree generation is able to best utilize network resources with fewer links and nodes compared to other approaches. Simulation results indicate that our algorithms are efficient compared with the existing multicast algorithms for balancing the objectives of short average delay and reduced resource utilization.
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.
