一种基于Chord的抗Churn策略  

Churn-resistent Strategy Based on Chord

作　　者：任庆杰[1] 禹继国[1] 张云[1] 

机构地区：[1]曲阜师范大学计算机科学学院,山东日照276826

出　　处：《计算机工程》2011年第3期96-98,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60373012);山东省自然科学基金资助项目(ZR2009GM009;ZR2009AM013);山东省中青年科学家奖励基金资助项目(BS2009DX024)

摘　　要：利用覆盖网络节点之间的远近邻居关系,修改节点路由指针表,提出基于Chord的抗抖动(Churn)策略。修改节点路由并行度和应对Churn的维护策略。实验结果表明,当搜索路由源节点和目的节点确定时,该策略可降低Chord系统在Churn的网络环境中的维护开销,有效地提高系统抗Churn能力和搜索成功率。This paper proposes a new Chum-resistance strategy based on Chord using relationship between near and far neighbors in the overlay network to modify the node routing pointer table. At the same time, the route processing parallelism and the maintenance strategy of Churn for each peer are modified. Experimental results show that the modified network reduces the network maintenance cost in the network environment under Chum, and improves Chum-resistant ability of the system and successful rate of search effectively when the search routing source node and destination node are determined.

关 键 词：抖动 节点邻居 Chord维护策略 

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