Improved multicast network coding algorithm
Sanyang Liu · Computer Engineering and Applications Journal · 2011
The application of network coding in the multicast communication network,which has achieved the maximum value of network traffic determined by the Max-flow and Min-cut theorem.The problem can be solved by linear network coding algorithms such as linear multicast,linear brodcast,linear dispersion as well as generic linear network coding algorithm.However,all of these methods have high degrees of computational complexity.Based on the generic linear network coding algorithm,and combined with the usage of discrete routing,a novel improved multicast network coding algorithm is proposed in this paper.The rationality of the algorithm has been proved.Complexity analysis indicates that,compared with generic algorithm,the algorithm in this paper reduces the computational complexity obviously.