摘要
在P2P应用系统中,如何有效地定位分布在网络中不同节点上的数据资源一直是研究的重点。Chord模型通过提供了一个分布式的资源查找协议成功地解决了这个问题,同时Chord协议能够有效支持节点动态地加入和退出网络。文章对Chord的系统基础及特性进行了论述,并重点分析了协议所提供的文件资源查询和节点加入退出算法,从理论上论证了Chord是一种具有可扩展性的低消耗系统。
A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item.Chord presents a distributed look up protocol to solve this problem.And Chord adapts efficiently as nodes join and leave the system.This paper has discussed the foundations and characteristics of Chord and analyzed algorithms of querying data items and nodes join and departure in Chord.The results of analysis have proved that Chord is a scalability and low cost system.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第1期132-135,共4页
Computer Engineering and Applications
基金
国家863高科技发展计划资助项目"新型网络体系结构(Peer-to-Peer网络技术)研究"(编号:2001AA111141)