Abstract

Core Selection CS problem consists in choosing an optimal multicast router in the network as the root of the shared path multicast tree (SPT). The choice of this designated router (refer to as the “Rendezvous Point RP” in PIM-SM protocol and the “core” in CBT protocol) is the main problem concerning multicast tree construction; this choice influences multicast routing tree structure, and therefore influences performances of both multicast session and routing scheme. The determination of a best position of the Rendezvous Point is an NP complete problem: it needs to be solved with a heuristic algorithm. In this paper we propose a new Core Selection CS algorithm based on Variable Neighborhood Descent algorithm, based on a systematic neighborhood changing. VND-CS algorithm selects the core router by considering both cost and delay functions. Simulation results show that good performance is achieved in terms of multicast cost, end-to-end delay and tree construction delay.

Full Text
Paper version not known

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 call

Disclaimer: 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.