| H-Chord:基于层次划分的Chord路由模型及算法实现 |
| |
| 引用本文： | 王必晴,贺鹏.H-Chord:基于层次划分的Chord路由模型及算法实现[J].计算机工程与应用,2007,43(36):141-143. |
| |
| 作者姓名： | 王必晴 贺鹏 |
| |
| 作者单位： | 1. 三峡大学电气信息学院,湖北,宜昌,443002
2. 三峡大学电气信息学院,湖北,宜昌,443002;三峡大学信息技术中心,湖北,宜昌,443002 |
| |
| 摘 要： | Chord是一种结构化的P2P网络,但是存在路由表信息冗余、查找效率不高的问题。为此,提出了一种基于层次划分的Chord路由模型(H-Chord)及其算法实现。仿真实验表明,H-Chord将大多数节点的路由表长度压缩到只有一项,消除了重复表项,降低了信息冗余,减少了平均查找跳数,提高了查找效率,使控制路由表长度和提高查找效率得到很好的统一。
|
| 关 键 词： | H-Chord 路由表 分布式哈希表 |
| 文章编号： | 1002-8331(2007)36-0141-03 |
| 修稿时间： | 2007年7月1日 |
H-Chord:routing model and algorithm implementation for Chord based on hierarchical dividing |
| |
| WANG Bi-qing,HE Peng.H-Chord:routing model and algorithm implementation for Chord based on hierarchical dividing[J].Computer Engineering and Applications,2007,43(36):141-143. |
| |
| Authors: | WANG Bi-qing HE Peng |
| |
| Affiliation: | 1.College of Electrical Engineering and Information Technology，China Three Gorges University，Yichang，Hubei 443002，China 2.Information Technology Center，China Three Gorges University，Yichang，Hubei 443002，China |
| |
| Abstract: | Chord is a kind of structured P2P network,but the routing table in Chord suffers serious information redundancy and it is not very efficient.Therefore,a routing model and algorithm implementation for Chord based on hierarchical dividing(H-Chord)is proposed.Simulation experiments show that H-Chord compresses the routing table length of most nodes into only one so as to eliminate repetitious entries and depress information redundancy.Simulation experiments also show that H-Chord reduces the average lookup path length and gets higher efficiency.H-Chord coordinates lookup efficiency and routing table length well. |
| |
| Keywords: | Hierarchical-Chord routing table Distributed Hash Table(DHT) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
