Multicast routing algorithm for network coding
Xiangyang Liu · Journal of Xidian University · 2008
This paper presents a new multicast routing algorithm for network coding.The algorithm searches the routing groups from source to each sink by using the Dijkstra reduction network.In the process of searching,link-sharing between different path groups is considered to decrease bandwidth resource consumption and improve load balance.Simulation results show that the routing algorithm is effective,and that its performance is closer to that of the minimum-cost multicast algorithm based on network coding.Finally,mathematical analysis indicates that the algorithm can reduce computation by 40% at least.