A New RP Selection Algorithm Based on Delay in DiffServ Networks

摘要

Rendezvous Point (RP) selection is a critical problem in PIM-SM multicast routing protocol, which influences the performance of the multicast tree. Currently most protocols use manual operation to do RP selection. But the selected RP may not be the best one, thus leading to congestions and delays unavoidably. What we want to achieve is that the best node can be selected as RP automatically and reselected dynamically when the group members change. In this paper, we use PIM-SM multicast routing protocol on the Diffserv network and evaluate the total cost of the shared tree with delay. We propose a new RP selection and a reselection algorithm when the multicast group members join and leave dynamically. Simulation shows that our new algorithms have better performance than the conventional one because the total cost of the shared tree is reduced evidently.