摘要
IP multicast faces a serious state scalability problem when there are large numbers of groups in the network. Aggregated Multicast has been proposed as a novel solution to solve this problem, in which multiple groups shared one aggregated tree, so as to reduce the multicast forwarding states. In this paper, we propose a Ant Colony Optimization Algorithm for Aggregated Multicast on Clustering to solve the problem that the time complexity of traditional aggregated multicast algorithm increases exponentially. Simulation results show that our algorithm performs well in program execution time and aggregation degree.
- 出版日期2012
- 单位山东大学