Adaptive routing protocol based on ant algorithm for P2P networks

doi:10.3778/j.issn.1002-8331.2010.17.028

Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (17): 101-104.DOI: 10.3778/j.issn.1002-8331.2010.17.028

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

Adaptive routing protocol based on ant algorithm for P2P networks

WANG Feng¹，ZHOU Jia-jun²，LI Xiao-jian^1，3，ZHOU Xiao-fa¹

1.Guangxi Normal University，Guilin，Guangxi 541004，China
2.Anqing Teachers College，Anqing，Anhui 246003，China
3.Beihang University，Beijing 100083，China

Received:2008-12-02 Revised:2009-02-02 Online:2010-06-11 Published:2010-06-11
Contact: WANG Feng

基于蚁群算法的对等网络自适应寻径协议

王峰¹，周佳骏²，李肖坚^1，3，周小发¹

1.广西师范大学，广西桂林 541004
2.安庆师范学院，安徽安庆 246003
3.北京航空航天大学，北京 100083

通讯作者: 王峰

Abstract

Abstract: To deal with the serious problem that existing ant algorithm can not adapt to transform the corresponding number of ants and set up TTL of colony ant for routing in P2P networks，an adaptive routing model for P2P networks is given，and an adaptive routing protocol AARP for P2P networks is put forward and the adaptive colony and routing process in P2P networks for ant are described.Analysis and simulation experiment results illustrate that AARP has better routing efficiency by low routing cost and time-delay.

Key words: peer-to-peer networks, ant algorithm, colony, adaptive routing

摘要：

针对现有的蚁群算法在对等网络寻径中，不能根据访问的对等体状况去自适应克隆转发相应数目的蚂蚁，自适应设置克隆蚂蚁的TTL的问题，给出一种面向对等网络的自适应寻径模型，提出一种基于蚁群算法的对等网络自适应寻径协议AARP，描述蚁群在对等网络中自适应的克隆、寻径过程。分析和仿真实验结果表明，AARP能够以较低的寻径开销、较短的寻径时延，实现较高的寻径效率。

关键词: 对等网, 蚁群算法, 克隆, 自适应寻径

CLC Number:

TP393

WANG Feng¹，ZHOU Jia-jun²，LI Xiao-jian^1，3，ZHOU Xiao-fa¹. Adaptive routing protocol based on ant algorithm for P2P networks[J]. Computer Engineering and Applications, 2010, 46(17): 101-104.

王峰¹，周佳骏²，李肖坚^1，3，周小发¹. 基于蚁群算法的对等网络自适应寻径协议[J]. 计算机工程与应用, 2010, 46(17): 101-104.

[1]	SHI Chuntian, ZENG Yanyang, HOU Shouming. Summary of Application of Swarm Intelligence Algorithms in Image Segmentation [J]. Computer Engineering and Applications, 2021, 57(8): 36-47.
[2]	ZHANG Songcan, PU Jiexin, SI Yanna, SUN Lifan. Adaptive Improved Ant Colony Algorithm Based on Population Similarity and Its Application [J]. Computer Engineering and Applications, 2021, 57(8): 70-77.
[3]	ZHU Jiaying, GAO Maoting. AUV Path Planning Based on Particle Swarm Optimization and Improved Ant Colony Optimization [J]. Computer Engineering and Applications, 2021, 57(6): 267-273.
[4]	BU Guannan, LIU Jianhua, JIANG Lei, ZHANG Dongyang. Ant Colony Algorithm with Adaptive Grouping [J]. Computer Engineering and Applications, 2021, 57(6): 67-73.
[5]	MA Xianghua, ZHANG Qian. Research on Improved Ant Colony Algorithm in Robots Path Planning [J]. Computer Engineering and Applications, 2021, 57(5): 210-215.
[6]	LI Zhuangkuo, CHANG Kaixuan. Ant Colony Optimization for Continuous Domains Applied to Cooperative Game [J]. Computer Engineering and Applications, 2021, 57(24): 198-204.
[7]	WANG Xiaoguang, YANG Peibei. Design and Effect Analysis of Digital Transformation of Shipping Logistics Enterprises [J]. Computer Engineering and Applications, 2021, 57(21): 241-247.
[8]	ZHANG Ziran, HUANG Weihua, CHEN Yang, ZHANG Zheng, LI Ziyuan. Improved Ant Colony Path Planning Algorithm Based on Bidirectional Search [J]. Computer Engineering and Applications, 2021, 57(21): 270-277.
[9]	LI Erchao, QI Kuankuan. Improved Bidirectional Ant Colony Algorithm Mobile Robot Path Planning [J]. Computer Engineering and Applications, 2021, 57(18): 281-288.
[10]	HE Yaying, FAN Xinwei. Application of Improved Ant Colony Optimization in Robot Path Planning [J]. Computer Engineering and Applications, 2021, 57(16): 276-282.
[11]	FU Zhaohui, LIU Changshi. Research on Multi-depot Vehicle Routing Problem Based on Joint Distribution Mode [J]. Computer Engineering and Applications, 2021, 57(16): 291-298.
[12]	ZHANG Suying, GUO Baoliang, CHEN Lingzhi, LIU Huixian. Path Planning of Intelligent Fire Evacuation Map Based on Bidirectional Ant Colony Algorithm [J]. Computer Engineering and Applications, 2021, 57(14): 259-266.
[13]	ZHANG Ming, DENG Wenhan, LIN Juan, ZHONG Yiwen. Modified Ant Colony Optimization Algorithm for Discounted {0-1} Knapsack Problem [J]. Computer Engineering and Applications, 2021, 57(13): 85-95.
[14]	LI Yuxin, LI Yueyue. Multi-objective Vehicle Scheduling Problem for JIT Procurement [J]. Computer Engineering and Applications, 2021, 57(12): 263-272.
[15]	FU Zhaohui, LIU Changshi. Research on Open Time-Dependent Vehicle Routing Problem of Fresh Food E-commerce Distribution [J]. Computer Engineering and Applications, 2021, 57(1): 271-278.

Adaptive routing protocol based on ant algorithm for P2P networks

基于蚁群算法的对等网络自适应寻径协议

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics