Multicast routing algorithm based on network coding

Network coding has been proved can approach the max-flow min-cut limit of the network graph and can improve the performance of multicast communication. Considering the advantages of Dijkstra shortest path algorithm and network coding respectively, an improved multicast routing algorithm based on network coding is proposed in this paper. The details of algorithm are given to construct a proper multicast topology for data transmission. The simulation results show proposed algorithm has an apparent advantage of throughput and load balance compared with shortest path distribution tree algorithm, and has better advantage than previously proposed multicast routing algorithm based on network coding in terms of the metrics of load balance.