The Research of Shortest Path Tree Algorithm for Multicast Routing
Yi Yun-Hui, Wang Run-liu · International Conference on Electric Information and Control Engineering · 2012
with the development of computer technology and network technology, the network bandwidth consumption and congestion became more and more serious. IP multicast is the best way to achieve this kind of communication. The key of realize multicast communication is to implement the multicast routing algorithm, namely how to build a simple, effective and robust multicast routing tree. This paper proposes a low-cost multicast routing algorithm based on the path node driven idea, which reduced the cost of multicast tree mainly by link sharing links. Correctness and performance of the algorithm were analyzed in theory. Experiments were simulated in different aspects. The algorithm can not only generate a SPT correctly, but also had the best optimization performance by comparing with other SPT algorithm.