基于超节点的Chord系统  

An Efficient Chord System Based on Super-peer

作　　者：姜守旭[1] 韩希先[1] 李建中[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,黑龙江哈尔滨150001

出　　处：《小型微型计算机系统》2007年第2期266-270,共5页Journal of Chinese Computer Systems

基　　金：哈尔滨工业大学校基金项目(HIT.2001.AEAQ18000103)资助.

摘　　要：Chord是一种比较成功的结构化P2P路由算法,但是网络节点性能的差异,影响了整个系统的效率;网络中一部分节点的频繁加入和退出所引起的系统震荡也影响了系统的性能;同时,结构化系统不提供相关节点的匿名性,也是结构化系统的一个不足之处.本文利用节点性能的差异,提出了基于超级节点的Chord路由算法,在Chord系统中形成节点簇,不但提高了系统的效率,而且能够有效地处理系统震荡问题,同时,为Chord系统提供了一定的匿名性.Chord is a successful structured P2P routing algorithm,but the heterogeneity of peers affects the efficiency of the system. And it brings system shaking because of a part of the peers in the network joining and leaving frequently. It＇s also a disadvantage that structured systems don＇t provide mutual anonymity. Taking advantage of the heterogeneity of capabilities across peers,we propose new Chord routing algorithm based on Super-Peer,not only to improve the efficiency of system,but also to deal with system shaking efficiently ,at the same time ,it could provide mutual anonymity.

关 键 词：P2P 分布式哈希表 Chord超节点 

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