Abstract
We propose two multicast routing algorithms. One is a delay-constrained multicast algorithm that finds a multicast tree between one source node and multiple destination nodes. The other is a dynamic multicast algorithm that allows multiple nodes to dynamically join or leave a multicast group during a session. The first algorithm, which provides multicasting and guaranteed QoS (Quality-of-Service) services at the network layer, is a distributed routing algorithm where the reduced multicast tree is computed through a single round of message exchanges between network nodes, consequently reducing the number of messages and the accompanying computation time. The distributed algorithm is shown to generate within much less time a multicast tree slightly more expensive than that by the centralized one. The second algorithm is efficient under dynamic network environment, with frequent status changes for network nodes or links and multicast group members.
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.
