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

doi:10.3778/j.issn.1002-8331.2008.29.030

Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (29): 108-111.DOI: 10.3778/j.issn.1002-8331.2008.29.030

• 网络、通信、安全 • Previous Articles Next Articles

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

WANG Wei-ya,WANG Feng-lin

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扩展

王卫亚,王凤琳

长安大学信息工程学院，西安 710064

通讯作者: 王卫亚

Abstract

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

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

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

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.

王卫亚,王凤琳. 基于遗传-蚁群融合算法的OSPF路由算法QoS扩展[J]. 计算机工程与应用, 2008, 44(29): 108-111.

[1]	ZHOU Feijie, ZHANG Kunli, WANG Guoqing, ZHUANG Lei. Research of Adaptive SDN Routing Algorithm Based on Genetic Mechanism [J]. Computer Engineering and Applications, 2019, 55(2): 86-91.
[2]	SUN Ling1, LUO Changyuan2. Secure Geographic Information Based Routing Protocol of Aeronautical Ad Hoc Networks [J]. Computer Engineering and Applications, 2019, 55(12): 77-82.
[3]	WU Haotian, WANG Bo. Partial multi-path QoS routing algorithm based on MSR [J]. Computer Engineering and Applications, 2018, 54(8): 72-77.
[4]	QIN Junxiang1, XU Xiaofeng2, YI Kefu1, LU Yafang1, WAN Jiangwen1. Clustering algorithm for wireless sensor networks using weighted function timing [J]. Computer Engineering and Applications, 2017, 53(3): 138-143.
[5]	JIA Yinliang1, CHANG Xiangmao2. Cluster heads selection algorithm for wireless sensor networks——Based on cluster heads sending energy consumption [J]. Computer Engineering and Applications, 2017, 53(22): 82-86.
[6]	TONG Ning1, HUN Jiexu2, YANG Qi1, JIA Huimin1. 3D-Ad hoc network routing algorithm based on hypercube cluster [J]. Computer Engineering and Applications, 2016, 52(15): 135-140.
[7]	DUAN Xinming, CHAO Sheng, WU Jigang. Fault-tolerant routing algorithm for PRDT（2，1）-based NoCs [J]. Computer Engineering and Applications, 2015, 51(3): 89-92.
[8]	JIA Zongpu, PANG Xiaoyan. Node rotation routing algorithm based on equilateral triangle model under uniform clustering [J]. Computer Engineering and Applications, 2015, 51(23): 82-86.
[9]	WANG Hui, WANG Zheng. Bidirectional search chord routing algorithm based on new finger table [J]. Computer Engineering and Applications, 2014, 50(23): 95-99.
[10]	GENG Qingmin, ZHENG Mingchun. Routing strategy offering global optimization in SON [J]. Computer Engineering and Applications, 2013, 49(7): 102-105.
[11]	ZHONG Yuanchang, SONG Yang. Energy-saving adaptive routing algorithm for large-scale wireless sensor network [J]. Computer Engineering and Applications, 2013, 49(1): 89-93.
[12]	WANG Zhenchao1, WANG Yijin2, WANG Jing1. Overlapping clustering routing algorithm for Ad hoc network [J]. Computer Engineering and Applications, 2012, 48(7): 88-91.
[13]	XIAO Kejiang, XIONG Zhongyang, ZHANG Yufang. Improvement and performance analysis of multipath AOMDV routing protocol [J]. Computer Engineering and Applications, 2012, 48(6): 99-101.
[14]	SUN Jianzhi1, YUN Bing2, HAN Zhongming1, ZHANG Yingxin1, CHEN Dan1. Robustness analysis of opportunistic network routing algorithms under flooding attacks [J]. Computer Engineering and Applications, 2012, 48(5): 54-58.
[15]	TAN Ziyou, LIANG Pingyuan, HUANG Guosheng. Novel high energy-efficient cooperative routing algorithm in Wireless Sensor Networks [J]. Computer Engineering and Applications, 2012, 48(36): 100-104.

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

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

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics