摘要
在分析选播通信服务的基础上,研究了蚁群算法在网络选播路由问题中的应用,提出了一种基于蚁群系统原理,用于解决有时延约束的选播路由问题。算法采用调整最优解路径上的信息素和算法重启策略,较好地解决了蚁群算法易于陷入局部最优的问题。仿真实验结果表明,该算法是有效且切实可行的,它可以在满足延时约束的条件下迅速找到最优解。
Based on studying anycast service and the application of ant colony algorithm in anycast routing,an anycast routing algorithm based on ant colony system principles to solve delay constrained problem is proposed in this paper.This algorithm uses the strategy of adjusting pheromone on best path and restarting algorithm,and can solve the problem that ant algorithm is easy to fall into local optimum solution.The results of simulation experiment show that the proposed algorithm is effective and feasible, and it can effectively find the best solution of the problem in condition of satisfying delay constraint.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第24期121-123,127,共4页
Computer Engineering and Applications
基金
广西省自然科学基金No.06400026~~
关键词
蚁群算法
时延约束
选播路由
服务质量(QoS)
Ant Colony Algorithm
delay constraint
anycast routing
Service of Quality（QoS）
