Adaptive tabu search algorithm for RP selection in Protocol Independent Multicast - sparse mode

Protocol Independent Multicast - sparse mode (PIM-SM) builds a shared distribution tree centred at a Rendezvous Point (RP) and then it builds source specific trees. The RP selection problem is very trivial in PIM-SM because it not only affects the structure of the multicast tree but also affects the performance of multicast. In this paper, we propose an Adaptive Tabu Search based algorithm for RP selection (ATS-RPS) in PIM-SM. The proposed algorithm aims to find the best location of RP so that the cost and delay of the multicast tree can be minimized simultaneously. The simulation results reveal that the proposed algorithm performs better than the existing algorithms in terms of multicast tree cost and delay with a comparable execution time.