摘要
高速多媒体网络路由问题是一个多QoS约束的NP-完全问题,提出一种改进蚁群路由算法对该问题进行求解。该算法采取了带记忆的后继节点选择方式,利用蚂蚁已走过的路径启发后继节点的选取;引入了基于目标函数的信息素更新机制,依据目标函数评价蚂蚁路径搜索行为,并根据蚂蚁的表现采取不同的信息素更新策略,提高了算法的寻优能力和收敛速度。仿真实验表明,该算法能快速得到较大程度满足业务QoS要求的路径。
An improved ant colony algorithm is proposed in this paper to solve the high-speed multimedia network routing problem which is a multiple QoS （quality of service） constrained NP-complete problem. The algorithm adopted the memorial manner to illumine the selection of successor node following the route the ants passed. The objective-function-based pheromone updating mechanism was introduced as well to estimate the path searching behaviour of the ants according to the objective-function, and then to use the different pheromone updating tactics on the performance of the ants, thus the algorithm improved its search ability and convergence speed. Simulation results demonstrated that the algorithm can quickly generate a route satisfying operations＇ QoS demand more.
出处
《计算机应用与软件》
CSCD
北大核心
2008年第5期15-17,55,共4页
Computer Applications and Software
关键词
多约束QOS
网络路由
蚁群算法
Multiple constrained QoS Network routing Ant algorithm
