PRST-Chord:基于Chord的低延时查询改进算法  

PRST-Chord:Improved lookup algorithm with lower latency on chord

作　　者：黄翼[1] 吕智慧[1] 吴杰[1] 钟亦平[1] 

机构地区：[1]复旦大学计算机科学技术学院,上海200433

出　　处：《计算机工程与设计》2010年第18期3939-3942,共4页Computer Engineering and Design

摘　　要：针对目前Chord协议中逻辑覆盖网与底层物理拓扑不匹配的问题,提出了一种改进算法PRST-Chord(proximity routing selection and topology-based Chord)。该算法基于底层的拓扑信息来构造节点标识,使得物理上相邻的节点在逻辑上也尽可能相邻,同时修改了Chord的查询算法,通过预测节点间的网络延时优化下一跳节点的路由选择。仿真实验结果表明,改进算法有效地降低了查询延时,提高了资源定位的性能。PRST-Chord （proximity routing selection and topology-based Chord） is proposed to address the problem that the overlay network in Chord protocol is incongruent with the underlying network topology. The improved algorithm decreases the incompatibility between the logical and physical network by constructing the node identifiers based on the topology of physical network. Meanwhile, the method revises the lookup algorithm by predicting the latency between two nodes to optimize the next hop routing. The simulation results show that this approach can effectively lower the lookup latency and improve the performance of resource locating.

关 键 词：CHORD协议 界标节点 覆盖网 底层拓扑 路由选择 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]