基于配队蚁群算法的QoS组播路由方法  

Team-matching-based Ant Colony Algorithm for QoS Multicast Routing Problem

作　　者：陈岩[1] 杨华江[1] 朱华勇[1] 沈林成[1] 

机构地区：[1]国防科技大学机电工程与自动化学院,湖南长沙410073

出　　处：《系统仿真学报》2008年第5期1361-1365,共5页Journal of System Simulation

基　　金：973基础研究项目(5130801)

摘　　要：QoS组播路由是网络信息传输的一项关键技术,提出了一种配队蚁群算法对该问题进行求解。算法以满足约束条件下的组播分解、策略控制下的组播树生成为基本思想;定义了扩展组播树,并改进了蚁群算法的信息素更新策略,使之更适合于组播问题的求解。仿真实验表明,该算法能快速搜索并收敛到全局(近似)最优解,且随着网络规模的增大算法保持了良好的特性。QoS multicast routing is a key technology of information transmission in network. A team-matching ant colony algorithm, based on decomposing a multicast-tree to single paths under restriction and composing single paths to a multicast-tree under strategy, was proposed to solve the problem in this paper. The concept of extended multicast-tree was defined, and the pheromone update strategy of ant colony algorithm was improved to be more suitable for multicast routing in the algorithm. Simulation results demonstrate that the algorithm can converge to the （approximately） best solution fast, and perform well as the size of network increasing.

关 键 词：组播路由 配队策略 组播树 蚁群算法 

分 类 号：TP393.04[自动化与计算机技术—计算机应用技术]