Abstract
With the development of network multimedia technology, more and more real-time multimedia applications need to transmit information using multicast. To construct a multicast tree is the basis of multicast data transmission. The prime problem concerning the construction of a shared multicast tree is to determine the position of the root of the shared tree, which is a center selection problem. The selection of the center Rendezvous Point (RP) directly affects the structure of the tree, and the performance of multicast accordingly. This paper proposes a multicast RP selection algorithm based on tabu search in PIM-SM multicast routing. This algorithm selects RP by considering both cost and delay. Simulation results show that good performance is achieved in multicast cost, end-to-end delay and register delay.
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.
