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
WANG Feng1,ZHOU Jia-jun2,LI Xiao-jian1,3,ZHOU Xiao-fa1
Received:
Revised:
Online:
Published:
Contact:
王 峰1,周佳骏2,李肖坚1,3,周小发1
通讯作者:
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 Feng1,ZHOU Jia-jun2,LI Xiao-jian1,3,ZHOU Xiao-fa1. Adaptive routing protocol based on ant algorithm for P2P networks[J]. Computer Engineering and Applications, 2010, 46(17): 101-104.
王 峰1,周佳骏2,李肖坚1,3,周小发1. 基于蚁群算法的对等网络自适应寻径协议[J]. 计算机工程与应用, 2010, 46(17): 101-104.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2010.17.028
http://cea.ceaj.org/EN/Y2010/V46/I17/101