Chord路由算法的分析与改进  

Analysis and improvement on the routine algorithm of Chord

作　　者：张亚松[1] 

机构地区：[1]武汉理工大学计算机科学与技术学院,湖北武汉430063

出　　处：《微型机与应用》2012年第8期74-76,共3页Microcomputer & Its Applications

摘　　要：在P2P网络中,如何高效地查找需要的资源是关系P2P网络性能的关键。传统的Chord的路由表信息冗余,查找效率不高,且不考虑实际物理网络的拓扑结构,因此使逻辑拓扑与物理拓扑不匹配,导致了较大的网路延迟。提出一种改进的Chord路由算法,该算法在一定程度上解决了上述两个问题,提高了搜索查询的效率。In P2P network,how to efficiently search the needed resources is the key decides the performance of P2P networks.The traditional routing table of Chord has the problem of information redundancy leads to low search efficiency.In addition,Chord does not consider the topological structure of actual physical network,which results in a critical mismatching between the logical topology and physical topology,which bring about a larger network latency.This paper presents an improved routing algorithm of Chord which solves the above two problems to a certain degree and improves the efficiency of the search.

关 键 词：对等网络 CHORD 路由 拓扑匹配 

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