一种基于兴趣分组的改进的Chord协议算法  

An Improved Chord Protocol Algorithm Based on Interest Group

作　　者：沈嘉灵[1] 

机构地区：[1]西北工业大学软件与微电子学院,陕西西安710072

出　　处：《计算机与现代化》2013年第9期148-151,共4页Computer and Modernization

摘　　要：Chord协议是一种典型的基于DHT的结构化P2P网络协议。DHT机制在节点失效、遭受攻击和突发性高负载面前能表现出很好的健壮性,也具有良好的可扩展性,但由于经典Chord协议没有考虑到拓扑结构,导致实际的路由效率低下。本文对P2P网络系统及Chord协议算法进行深入的研究与分析,提出基于兴趣分组的Chord协议算法的优化和改进策略,并对算法的有效性、可用性等进行仿真实验和分析。Chord protocol is a typical structured P2P networks protocol based on DHT protocol.The DHT mechanism shows a good robustness in node failure,attack and suddenly high load,and is also of good scalability.But,because the classic Chord protocol does not consider the topological structure,it leads to low routing efficiency in practice.This paper further analyzes the P2P network system and the Chord protocol algorithm based on interest group,proposes a Chord protocol algorithm optimization and improvement strategy,and emulates the effectiveness of the algorithm.

关 键 词：DHT CHORD P2P 兴趣分组 

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