一种基于不精确信息的智能QoS组播路由算法  

Intelligent QoS multicast routing algorithm under inaccurate information

作　　者：王军伟[1] 王兴伟[1] 黄敏[1] 

机构地区：[1]东北大学信息科学与工程学院

出　　处：《计算机应用》2006年第10期2272-2274,2277,共4页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60473089);国家发改委CNGI示范工程资助项目(CNGI-04-13-2T;CNGI-04-6-2T;CNGI-04-15-7A);新世纪优秀人才支持计划资助项目

摘　　要：针对满足多个约束条件的服务质量(QoS)组播路由的特点,提出了一种下一代互联网中基于粒子群优化(PSO)和遗传算法(GA)的智能QoS组播路由算法。给出了QoS组播路由问题模型及其数学描述,针对QoS参数信息不精确的情况,综合PSO的快速搜索和GA的全局寻优能力,找出在给定费用下满足多个QoS约束概率最大的组播树的Pareto非劣集,从中选出最优组播树。对算法进行了仿真实现与性能评价,结果表明,它是可行和有效的。Taking the characteristics of multi-constrained Quality of Service（QoS） routing in next generation Internet into account, an intelligent multicast QoS routing algorithm based on Particle Swarm Optimization（PSO） and Genetic Algorithm （GA） was presented. The corresponding model and its mathematical description were introduced, Under inaccurate information of QoS parameters and combining fast searching ability of PSO and global optimization ability of GA, the proposed algorithm tries to find the Pareto no-dominated set with the maximum probability of meeting with multiple QoS constraints under the given cost, from which the best multicast tree was selected. Simulation research and performance evaluation show that the proposed algorithm is both feasible and effective.

关 键 词：QOS 组播路由 遗传算法 粒子群优化算法 Pareto非劣集 

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