| chord路由表结构的分析与改进 |
| |
| 引用本文： | 祁玉,张新有.chord路由表结构的分析与改进[J].计算机工程与设计,2010,31(6). |
| |
| 作者姓名： | 祁玉 张新有 |
| |
| 作者单位： | 西南交通大学,信息科学与技术学院,四川,成都,610031 |
| |
| 基金项目： | 国家自然科学基金项目 |
| |
| 摘 要： | 针时Chord协议在大规模的P2P网络中存在路由表结构信息严重冗余、查找效率不高等缺点,在深入分析路由表构造的基础上,提出新的路由表构造公式,增加路由表中节点的分布密度,最终达到了删除路由表的冗余表项,扩大路由查找覆盖范围的目的.理论分析表明,改进后的路由表的查找效率较原chord提高了29%,仿真实验结果也表明改进后的查找效率有显著提高.
|
| 关 键 词： | 对等网络 分布式散列表 路由 冗余 |
Analysis and improvement of finger table in chord protocol |
| |
| QI Yu,ZHANG Xin-you.Analysis and improvement of finger table in chord protocol[J].Computer Engineering and Design,2010,31(6). |
| |
| Authors: | QI Yu ZHANG Xin-you |
| |
| Affiliation: | QI Yu,ZHANG Xin-you(School of Information Science , Technology,Southwest Jiaotong University,Chengdu 610031,China) |
| |
| Abstract: | Chord protocol has the faults of serious redundancy and low searching efficiency in large scale network.Response to these issues, based on deeply analyzing the structure of routing list, new route table structure formulas are proposed, node distribution density of routing list is increased, and finally goals of deleting redundant information and increasing route searching coverage areas are realized.Theory analysis shows that the modified approach reduces the path length at least 29%, and the final experime... |
| |
| Keywords: | chord peer to peer distributed hash table chord route redundancy |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
