| 蚁群算法在QoS单播路由中的应用研究 |
| |
| 引用本文： | 岐世峰,李艳华,梅大成. 蚁群算法在QoS单播路由中的应用研究[J]. 电子科技大学学报(社会科学版), 2010, 0(2) |
| |
| 作者姓名： | 岐世峰 李艳华 梅大成 |
| |
| 作者单位： | 攀枝花学院计算机学院;西南石油大学计算机学院; |
| |
| 基金项目： | 四川省科技厅应用技术研究项目基金(2008JY0114) |
| |
| 摘 要： | QoS路由问题被证明是一个NP-C问题,而传统的路由算法很难有效地解决NP-C问题。该文提出了一种基于蚁群算法、用于解决带宽和时延约束问题的QoS单播路由算法,利用蚁群算法中蚂蚁通过信息素寻找最优路径的机制,并以网络吞吐量和数据报的平均时延等性能为最优的准则,来定义蚂蚁的转移概率、路由表和信息素更新方式,实现基于蚁群算法的路由选择算法.这种算法具有较强全局最优解搜索能力,较强的灵活性,以及潜在的并行性。
|
| 关 键 词： | 蚁群算法 信息素 QoS路由 路由算法 转移概率 |
Application Research of Ant Colony Algorithm for QoS Unicast routing |
| |
| QI Shi-feng,LI Yan-hua,, MEI Da-cheng. Application Research of Ant Colony Algorithm for QoS Unicast routing[J]. Journal of University of Electronic Science and Technology of China(Social Sciences Edition), 2010, 0(2) |
| |
| Authors: | QI Shi-feng LI Yan-hua MEI Da-cheng |
| |
| Affiliation: | QI Shi-feng1,LI Yan-hua1,, MEI Da-cheng2(1.Institute of Computer,Panzhihua University Panzhihua Sichuan 617000,2.Institute of Computer,Southwest Petroleum University Chengdu 610500) |
| |
| Abstract: | QoS routing problem is proved to be a NP-C problem,it is very difficult to solve the NP-C problem effectively by conventional routing algorithms.This paper puts forward an QoS unicast routing algorithm which is based on the principle of ant colony algorithm and used to solve the problem of bandwidth and delay constrain.The rule of ant colony algorithm that the ants find the shortest path through the laying down of pheromone and the rule with emphasis on the maximal network throughput and the lowest average ... |
| |
| Keywords: | ant colony algorithm pheromone QoS routing routing algorithm transition probability |
| 本文献已被 CNKI 等数据库收录！ |
|
