Advanced aggregated multicast algorithm
Jia Wei Xu · Jisuanji yingyong yanjiu · 2013
In order to improve multicast state scalability problem,this paper proposed an advanced aggregated multicast algorithm.The algorithm was on the basis of generic dynamic on-line algorithm.When matching group-tree,the algorithm determined the feasible range of aggregated trees to reduce matching and calculation times and to get lower time complexity.In order to optimize aggregated tree structure,remove unnecessary intermediate node,increase aggregated degree and reduce node forwarding state,the algorithm improved the optimal matching aggregated tree selection algorithm and regularly adjusted aggregation tree in the network.Simulation results show that,when compared to similar algorithm,the algorithm can get higher aggregated degree and state reduction ratio in lower time complexity,and the improvement is much more obviously in the higher number of concurrent multicast group and group density.