作　　者： ; ;

机构地区： 中山大学信息科学与技术学院计算机科学系

出　　处： 《计算机应用》 2006年第12期2803-2805,共3页

摘　　要： Chord是一种比较有效的P2P路由算法,它能够快速地查找到该资源的位置。但Chord算法对网络中传送的消息利用率过低,路由表存在严重的信息冗余,网络维护量大。为此,提出了一种Chord的改进算法,解决了Chord算法中存在的一些问题,提高了网络查询效率,增强了网络的容错能力。将改进的Chord算法用于一个文件共享系统的设计,实践表明该Chord改进算法是有效的。 Chord is a kind of comparatively effective P2P route algorithm, and it can locate the target resources quickly. But because of the over low utilization of the message during transmission, the routing table suffers serious information redundancy and great network maintenance is needed. Therefore, this text put forward an improved Chord arithmetic, and resolved some existing problems. As a result, the network search efficiency was raised and fault-tolerance ability of the network was strengthened. The improved one was implemented in a design of the file sharing system and proved to be effective.

关 键 词： 文件共享 路由表

领　　域： [自动化与计算机技术] [自动化与计算机技术]