| 蚁群算法在时延约束选播路由问题中的应用 |
| |
| 引用本文： | 肖猛,李陶深.蚁群算法在时延约束选播路由问题中的应用[J].计算机工程与应用,2008,44(24):121-123. |
| |
| 作者姓名： | 肖猛 李陶深 |
| |
| 作者单位： | 1.广西大学 计算机与电子信息学院，南宁 530004 2.中南大学 信息科学与工程学院，长沙 410083 |
| |
| 摘 要： | 在分析选播通信服务的基础上，研究了蚁群算法在网络选播路由问题中的应用，提出了一种基于蚁群系统原理，用于解决有时延约束的选播路由问题。算法采用调整最优解路径上的信息素和算法重启策略，较好地解决了蚁群算法易于陷入局部最优的问题。仿真实验结果表明，该算法是有效且切实可行的，它可以在满足延时约束的条件下迅速找到最优解。
|
| 关 键 词： | 蚁群算法 时延约束 选播路由 服务质量（QoS） |
| 收稿时间： | 2007-10-31 |
| 修稿时间： | 2008-1-7
|
Application of ant colony algorithm in delay constrained anycast routing |
| |
| XIAO Meng,LI Tao-shen.Application of ant colony algorithm in delay constrained anycast routing[J].Computer Engineering and Applications,2008,44(24):121-123. |
| |
| Authors: | XIAO Meng LI Tao-shen |
| |
| Affiliation: | 1.School of Computer，Electronics and Information，Guangxi University，Nanning 530004，China 2.School of Information Science and Engineering，Central South University，Changsha 410083，China |
| |
| Abstract: | 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. |
| |
| Keywords: | Ant Colony Algorithm delay constraint anycast routing Service of Quality(QoS) |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
