论文部分内容阅读
当大量组播组并存于网络中时,IP组播将遭遇严重的组播状态扩展性问题.聚合组播是针对该问题的一种新颖的解决方案,它的主要思想是使多个组共享同一棵聚合树,从而减少组播转发状态.树选择问题作为聚合组播的核心问题已经被证明是一个NP完全问题.本文提出一种改进的蚁群算法(ACAM算法)对聚合树进行选择.仿真结果表明该算法在聚合度、转发状态降低率等性能指标上都优于传统聚合组播算法.
When a large number of multicast groups co-exist in the network, IP multicast will experience serious multicast state scalability problems.An aggregate multicast is a novel solution to this problem, and its main idea is to share multiple groups The same aggregation tree, so as to reduce the multicast forwarding status.The tree selection problem has been proved to be a NP-complete problem as the core problem of aggregate multicast.In this paper, an improved ant colony algorithm (ACAM algorithm) is proposed to select the aggregation tree. The simulation results show that the proposed algorithm is superior to the traditional aggregation and multicasting algorithm in performance indexes such as aggregation degree and forwarding state reduction rate.