Heuristic Gradient based Multicast routing policy for dynamic network

IP multicast technology is employed in many distributed real-time applications such as IPTV services, live video-teleconferences, etc. In this paper, we formulate the Gradient based Multicast Policy problem, and propose a heuristic gradient based multicast routing algorithm. In the algorithm, routing policy is adaptive to the network states based on the gradient and multicast group members can join or leave a multicast session dynamically. Simulation results show that our algorithm can not only reduce the probability of congestion during the routing but also have low total cost of the multicast tree.