计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (29): 108-111.DOI: 10.3778/j.issn.1002-8331.2008.29.030

• 网络、通信、安全 • 上一篇    下一篇

基于遗传-蚁群融合算法的OSPF路由算法QoS扩展

王卫亚,王凤琳   

  1. 长安大学 信息工程学院,西安 710064
  • 收稿日期:2008-04-15 修回日期:2008-07-09 出版日期:2008-10-11 发布日期:2008-10-11
  • 通讯作者: 王卫亚

QoS extend of OSPF based on combination algorithm of genetic algorithm and ant colony algorithm

WANG Wei-ya,WANG Feng-lin   

  1. Academy of Information Engineering,Chang’an University,Xi’an 710064,China
  • Received:2008-04-15 Revised:2008-07-09 Online:2008-10-11 Published:2008-10-11
  • Contact: WANG Wei-ya

摘要: OSPF路由协议是现代计算机网络应用最为广泛的路由协议之一,为了适应现代网络应用对路由选择的QoS要求,IETF对其进行了扩展,最短路径算法也采用BF算法。但是,这些算法只能计算满足某一条件的路径集合中最短路径,不能满足对带宽、时延和差错率等多项QoS参数都有要求的最优路由选择。采用遗传算法和蚁群算法相结合的融合算法,继承了遗传算法和蚁群算法的优点,在求精解效率上优于遗传算法,在时间效率上优于蚁群算法,能很好地实现多QoS要求的最优路径计算。测试证明融合算法优化性能和时间性能都取得了很好的效果,可以应用于OSPF协议。

关键词: 开放式最短路径优先(OSPF), 遗传-蚁群融合算法, 路由算法

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.

Key words: Open Shortest Path First(OSPF), combination algorithm of genetic and ant colony algorithm, Routing Algorithm