摘要
基于蚁群系统的自组织能力,提出了一个分布式的动态QoS多播路由的算法。与其他算法不同,在该算法中,蚁群从多播组的目的结点出发进行搜索,将每次迭代选中的符合QoS约束且具有最小代价的路径加入到多播树中,而多播树以“拉”的模式分布式地被构造。仿真结果表明,与其他两种算法相比,该算法具有更好的性能,能够快速有效地找到动态QoS多播路由问题的全局最(近)优解。
Based on the self-organized capacity of ant colony, a distributed dynamic QoS multicast routing algorithm was presented for next-generation Internet in this paper. In this algorithm, ants started out the destination nodes in a multicast group and searched for multicast tree and selected the lowest cost path meeting its QoS constrains at every step of iteration, and then added this path into the current multicast tree. The multicast tree could be built distributedly in the “Pull” manner. Our tests indicate that as compared with other two algorithms, the presented algorithm gives better performance in terms of the total cost, and can quickly and effectively find globally optimal （or near optimal） solution for dynamic QoS multicast routing problem.
出处
《计算机应用》
CSCD
北大核心
2005年第10期2241-2243,共3页
journal of Computer Applications
基金
江苏省自然科学基金资助项目(BK2001124)
江苏省高校自然科学基金资助项目(01KJB510001)
关键词
蚁群系统
多播路由
QOS
约束
代价
ant colony system
multicast routing
QoS
constrain
cost
