摘要
OSPF路由协议是现代计算机网络应用最为广泛的路由协议之一,为了适应现代网络应用对路由选择的QoS要求,IETF对其进行了扩展,最短路径算法也采用BF算法。但是,这些算法只能计算满足某一条件的路径集合中最短路径,不能满足对带宽、时延和差错率等多项QoS参数都有要求的最优路由选择。采用遗传算法和蚁群算法相结合的融合算法,继承了遗传算法和蚁群算法的优点,在求精解效率上优于遗传算法,在时间效率上优于蚁群算法,能很好地实现多QoS要求的最优路径计算。测试证明融合算法优化性能和时间性能都取得了很好的效果,可以应用于OSPF协议。
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 muhi-media data transmission whieh limited by more than bandwidth,time delay and eost ete.The eombination of genetic algorithm and ant colony algorithm inherits the advantages of genetic algorithm and ant eolony algorithm,have a better ef- ficiency than genetie algorithm and a faster speed than ant eolony algorithm in eomputing the shortest route under multi link state limited.The testing proves that the eombination algorithm is a new better heuristic algorithm both in the efficiency of pre- eise results and time,and does good in QoS-OSPF.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第29期108-111,共4页
Computer Engineering and Applications
基金
陕西省自然科学基金No.2005F19~~
关键词
开放式最短路径优先(OSPF)
遗传-蚁群融合算法
路由算法
Open Shortest Path First（OSPF）
eombination algorithm of genetie and ant colony algorithm
Routing Algorithm
