基于微粒群算法的QoS组播路由算法  

QoS Multicast Routing Optimization Algorithm Based on Particle Swarm Optimization Algorithms

作　　者：秦洁[1] 须文波[1] 孙俊[1] 

机构地区：[1]江南大学信息工程学院,江苏无锡214122

出　　处：《计算机工程与应用》2006年第27期106-108,133,共4页Computer Engineering and Applications

基　　金：国家自然科学基金资助项目(编号:60474030)

摘　　要：文章研究了带宽、延时、延时抖动约束最小代价的QoS组播路由问题,提出了一种基于微粒群优化(PSO)算法[2,5]来设计路由优化算法。该算法采用一种新的整数编码方案,将路由优化问题转化成准连续优化问题,并采用罚函数处理约束条件。给出了应用微粒群优化算法求解QoS组播路由问题的算例,并与遗传算法和改进后的遗传算法进行了比较。计算机仿真实验证明,该算法可以更有效地求得QoS组播路由问题的优化解,可靠性高。This paper studies the bandwidth,delay,delay jitter,and packet loss constrained least-cost multicast routing problem which is known to be NP-complete,and presents a quantum-behaved particle swarm optimization algorithm to solve the problem.The QoS muhicast routing optimization problem is changed into a quasi-continuous problem by designing a new integer coding.Constrained terms in the problem are processed by the penalty function.This proposed algorithm is applied to illustrate its higher searching efficiency in comparison with standard genetic algorithm and advanced genetic algorithm for this routing optimization problem.Computer simulations have verified that this algorithm is efficient and effective.

关 键 词：组播路由 QOS 路由优化 微粒群优化算法 

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