摘要
利用空间换取时间的基本思想,提出一种基于邻居路由表的Chord改进算法NRToChord,该算法中每一个节点都维护一个具有更多节点信息的感知表,在路由过程中能够获取到与目标更加接近的下一跳节点,以提高路由效率,满足对路由时延有着更为苛刻要求的应用需要(如紧急通信,实时语音业务等).通过仿真实验证明:该算法在少量增加节点路由表容量的前提下,资源查找过程中的逻辑路由路径长度和物理路由时延都能缩短30%以上.
A more efficient Chord-based routing algorithm, named NRToChord using neighbors＇ routing tables is proposed based on the space-for-time approach, in which each node maintains a learn table for the more routing information of the other nodes in order to increase the routing efficiency by detecting the optimal next-hop node in the hop-by hop routing. That is much more necessary for some time-restricted applications such as emergency communication, real-time voice interaction. Results from theoretical analysis and simulations show that both logical path length and physical end-to-end path latency of our algorithm are shorten above 30% than Chord algorithm with the assist of neighbors＇ routing tables per node.
出处
《华中科技大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2009年第2期49-52,共4页
Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金
国家自然科学基金资助项目(60803005)
关键词
对等网络
CHORD算法
路由表
指针表
时延
peer-to-peer（P2P）
Chord algorithm
routing table
finger table
latency
