| 一种改进的Chord路由算法 |
| |
| 引用本文： | 姜守旭,韩希先,李建中.一种改进的Chord路由算法[J].计算机应用,2006,26(4):918-921. |
| |
| 作者姓名： | 姜守旭 韩希先 李建中 |
| |
| 作者单位： | 哈尔滨工业大学,计算机科学与技术学院,黑龙江,哈尔滨,150001 |
| |
| 基金项目： | 哈尔滨工业大学校科研和教改项目 |
| |
| 摘 要： | 如何有效地确定存储给定数据项的节点在P2P中非常重要。Chord是一种比较成功的P2P路由算法，但是Chord的路由表存在严重的信息冗余。提出了一种对Chord的改进算法，继承了Chord算法简单、高效、可靠、负载平衡及开销少的优点，对Chord的路由表提出了改造，增加了路由表中的有效信息，提高了查询效率。
|
| 关 键 词： | Peer-to-Peer 分布哈希 路由 Chord |
| 文章编号： | 1001-9081（2006）04-0918-04 |
| 收稿时间： | 2005-10-18 |
| 修稿时间： | 2005-10-182006-01-04 |
Improvement of Chord routing algorithm |
| |
| JIANG Shou-xu,HAN Xi-xian,LI Jian-zhong.Improvement of Chord routing algorithm[J].journal of Computer Applications,2006,26(4):918-921. |
| |
| Authors: | JIANG Shou-xu HAN Xi-xian LI Jian-zhong |
| |
| Affiliation: | School of Computer Science and Technology, Harbin Institute of Technology, Harbin Heilongjiang 150001 |
| |
| Abstract: | Routing is essential in P2P applications, and it is very important to locate the nodes that contain given data items. Chord is a successful routing algorithm, but the routing table in Chord has a terrible problem of information redundancy. To address this problem, an improved Chord algorithm was proposed which inherited the advantages of Chord, such as simplicity, efficiency, reliability, load balance and low cost. The routing table was improved to gain more useful information and get higher efficiency. |
| |
| Keywords: | Peer-to-Peer Chord |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
