| 基于遗传-蚁群融合算法的OSPF路由算法QoS扩展 |
| |
| 引用本文： | 王卫亚,王凤琳.基于遗传-蚁群融合算法的OSPF路由算法QoS扩展[J].计算机工程与应用,2008,44(29):108-111. |
| |
| 作者姓名： | 王卫亚 王凤琳 |
| |
| 作者单位： | 长安大学 信息工程学院，西安 710064 |
| |
| 摘 要： | OSPF路由协议是现代计算机网络应用最为广泛的路由协议之一，为了适应现代网络应用对路由选择的QoS要求，IETF对其进行了扩展，最短路径算法也采用BF算法。但是，这些算法只能计算满足某一条件的路径集合中最短路径，不能满足对带宽、时延和差错率等多项QoS参数都有要求的最优路由选择。采用遗传算法和蚁群算法相结合的融合算法，继承了遗传算法和蚁群算法的优点，在求精解效率上优于遗传算法，在时间效率上优于蚁群算法，能很好地实现多QoS要求的最优路径计算。测试证明融合算法优化性能和时间性能都取得了很好的效果，可以应用于OSPF协议。
|
| 关 键 词： | 开放式最短路径优先（OSPF） 遗传-蚁群融合算法 路由算法 |
| 收稿时间： | 2008-4-15 |
| 修稿时间： | 2008-7-9
|
QoS extend of OSPF based on combination algorithm of genetic algorithm and ant colony algorithm |
| |
| WANG Wei-ya,WANG Feng-lin.QoS extend of OSPF based on combination algorithm of genetic algorithm and ant colony algorithm[J].Computer Engineering and Applications,2008,44(29):108-111. |
| |
| Authors: | WANG Wei-ya WANG Feng-lin |
| |
| Affiliation: | Academy of Information Engineering，Chang’an University，Xi’an 710064，China |
| |
| Abstract: | As a widely used routing algorithm,OSPF is extended to QoSR by IETF in RFC2676,and recommended BF(Bellman-Ford) as the shortest-path algorithm.But this shortest-path algorithm with one or two limit QoS parameter cannot satisfy the growing need of multi-media data transmission which limited by more than bandwidth,time delay and cost etc.The combination of genetic algorithm and ant colony algorithm inherits the advantages of genetic algorithm and ant colony algorithm,have a better efficiency than genetic algorithm and a faster speed than ant colony algorithm in computing the shortest route under multi link state limited.The testing proves that the combination algorithm is a new better heuristic algorithm both in the efficiency of precise results and time,and does good in QoS-OSPF. |
| |
| Keywords: | Open Shortest Path First(OSPF) combination algorithm of genetic and ant colony algorithm Routing Algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
