一种基于遗传粒子群算法的选播路由算法  

An Anycast Routing Algorithm Based on Genetic Algorithm and Particle Swarm Optimization

作　　者：熊琴[1] 李陶深[1] 

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004

出　　处：《微电子学与计算机》2009年第9期75-77,81,共4页Microelectronics & Computer

基　　金：广西自然科学基金项目(桂科自0640026)

摘　　要：选播是IPv6中定义的一种新的通信模式.在分析选播通信服务基础上,提出一种基于遗传粒子群算法的选播路由算法,以求解多QoS约束的选播路由问题.算法将遗传算法和粒子群算法结合起来,通过设置一个更新算子,让路径之间相互学习,使得整个种群不断地趋于最优路径.仿真实验结果表明,该算法是可行和有效的,比单独基于遗传算法或粒子群算法的选播路由算法有一定的优越性.Anycast is a new communication model of IPv6, Based on studying Anycast service, an anycast routing algorithm based on genetic algorithm and particle swarm optimization is proposed in this paper, which uses to solve anycast routing problem with multi-QoS constraints. This algorithm combines with the genetic algorithms and the particle swarm optimization algorithm, and designs an update operator to make routing paths learm from each other and find the best path finally. The experimental results show that the algorithm is effective and feasible. It has a better performance than the anycast routing algorithm based on genetic algorithm or particle swarm optimization algorithm.

关 键 词：选播路由 遗传算法 粒子群优化算法 更新算子 多QOS约束 

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