摘要
对等网应用所面临的一个关键问题是如何有效定位存储特定资源的结点.该文提出的Full-Chord算法,在继承原始Chord算法简单、高效、可靠、负载平衡及开销少等特点的基础上,对原始Chord算法的指针表进行了扩充,使得在查找开始时就能将查找限定在半个Chord环上,从而提高了查找效率.理论分析和仿真实验表明,Full-Chord算法的查询效率要明显优于原始Chord算法.
One of key issues confronted by P2P network applications is how to efficiently locate the nodes that store particular resourses.The Full-Chord algorithm proposed in this paper,which inherits the features of simplicity,high efficiency,high reliability,balanced load and low overhead of original Chord algorithm,expands the finger table of the original Chord algorithm.As a result,the search of a particular node can be restricted in the scope of an half Chord-Circle at the very beginning of the seaching process,and therefore the efficiency is greatly improved.Theoretical analysis and simulating experiments show that the efficiency of Full-Chord algorithm is obviously superior to original Chord algorithm.
出处
《应用科技》
CAS
2007年第9期30-33,共4页
Applied Science and Technology
关键词
对等网
分布式散列表
指针表
peer-to-peer network
distributed hash table
Chord
