摘要
如何有效的确定存储给定数据项的节点在P2P中非常重要。Chord作为结构化P2P的一个典型的比较成功的路由算法一直是人们研究的热点。该文对Chord多节点加入时带来的低效问题进行了分析,并且给出了相应的优化方案。
As you know,it is very important to effective locate the given data item nodes in p2p. As a successful structure routing algorithm,chord has attracted more and more attention of the scholar in the field of computer. This paper proposes a solution to the problem that is cause by the adding of new nodes. In addition it also analyse the reasons that cause the inefficient of the chord.
出处
《电脑知识与技术（过刊）》
2009年第10X期8153-8154,共2页
Computer Knowledge and Technology
