Research of Dynamic Hierachical Small Group Multicast Routing
Weiyan Wang · Computer Engineering and Science · 2007
After studying the existing multicast routing protocols, we propose a new dynamic hierachical small group multicast routing protocol. The idea is, in an AS, if the number of receivers is small, the multicast sender will send the multicast data packets by unicast transmission, and if the number of receivers increases and exceeds a threshold value, multicast transmission will be used. The multicast sender can dynamically decide which transmission to take according to the number of receivers in the AS. Similarly, this approach can also be applied to border routers, treating the router as the root and constructing the hierachical multicast routing architecture dynamically. Then, we present the data structures and function models for implementing the dynamic hierachical multicast routing protocol. Finally, with the consideration of bandwidth and router computing, we evaluate the cost of dispersing multicast data packets when adopting the approach.