Abstract
In a communication network with a source node, a multicast tree is defined as a tree rooted at the source node and all its leaves being recipients of the multicast originating at the source. Tree or bandwidth cost is normally measured by its utilization of tree links along with Quality of Service (QoS) measures such as delay constraint, end-to-end delay etc. However, if nodes are allowed to join or leave the multicast group at any time during the lifetime of the multicast connection, then the problem is known as Dynamic Multicast Routing Problem. In this paper, we combine a greedy approach with static multicast routing using Tabu Search to find a low cost dynamic multicast tree with desirable QoS parameters. The proposed algorithm is then compared with several static multicast routing algorithms. Simulation results show that, on a large number of events i.e. where nodes are leaving or joining, the proposed algorithm is able to find multicast trees of lower cost and more desirable QoS properties.
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.
