| 一种改进的Chord路由算法 |
| |
| 引用本文： | 李健利,徐乾. 一种改进的Chord路由算法[J]. 应用科技, 2007, 34(9): 30-33 |
| |
| 作者姓名： | 李健利 徐乾 |
| |
| 作者单位： | 哈尔滨工程大学,计算机科学与技术学院,黑龙江,哈尔滨,150001 |
| |
| 摘 要： | 对等网应用所面临的一个关键问题是如何有效定位存储特定资源的结点.该文提出的Full-Chord算法,在继承原始Chord算法简单、高效、可靠、负载平衡及开销少等特点的基础上,对原始Chord算法的指针表进行了扩充,使得在查找开始时就能将查找限定在半个Chord环上,从而提高了查找效率.理论分析和仿真实验表明,Full-Chord算法的查询效率要明显优于原始Chord算法.
|
| 关 键 词： | 对等网 分布式散列表 指针表 |
| 文章编号： | 1009-671X(2007)09-0030-04 |
| 修稿时间： | 2007-02-01 |
An improved Chord routing algorithm |
| |
| LI Jian-li,XU Qian. An improved Chord routing algorithm[J]. Applied Science and Technology, 2007, 34(9): 30-33 |
| |
| Authors: | LI Jian-li XU Qian |
| |
| Abstract: | 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. |
| |
| Keywords: | peer-to-peer network distributed hash table Chord |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
