|
|||||
|
|
| Ca-Chord：基于主从环的Chord路由算法 | |
| 引用本文： | 李京文,熊焰,高燕. Ca-Chord：基于主从环的Chord路由算法[J]. 计算机工程, 2009, 35(11): 107-109 |
| 作者姓名： | 李京文 熊焰 高燕 |
| 作者单位： | 1. 中国科学技术大学计算机科学技术系,合肥,230026;安徽职业技术学院,合肥,230051 2. 中国科学技术大学计算机科学技术系,合肥,230026 3. 中国科学技术大学计算机科学技术系,合肥,230026安徽职业技术学院,合肥,230051 |
| 摘 要： | 提出基于主从结构的Chord路由算法。该算法根据区域组成多个子环，在子环中推选出处理能力强的节点为超节点彼此相连构成主环。每次路由都从子环开始，然后进入主环，确定路由跳节点后，再在该节点对应的子环查找目标节点，使得大部分路由都在子环执行，避免在整个P2P环上往复跨区域查找，减少路由跳数，提高路由延时性能。 |
| 关 键 词： | 主从Chord 超节点 分布式哈希表 |
| 修稿时间： | |
Ca-Chord: Chord Routing Algorithm Based on Main and Subordinate Ring |
|
| LI Jing-wen,XIONG Yan,GAO Yan. Ca-Chord: Chord Routing Algorithm Based on Main and Subordinate Ring[J]. Computer Engineering, 2009, 35(11): 107-109 | |
| Authors: | LI Jing-wen XIONG Yan GAO Yan |
| Affiliation: | 1.Department of Computer Science and Technology;University of Science and Technology of China;Heifei 230026;2.Anhui Vocational and Technical College;Heifei 230051 |
| Abstract: | This paper proposes the Chord routing algorithm based on the main and subordinate structure.The algorithm composes many subrings according to the region.The super node is elected according to the node's handling abilities in the subring,and each of super nodes constitutes the main ring and connects each other.Each time the routing starts from subring,and then enters the main ring.After the routing jump node is definited,the goal node is searched in the subring to correspond this node.The majority of routing... |
| Keywords: | main and subordinate Chord super node distributed Hash table |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《计算机工程》浏览原始摘要信息 | |
| 点击此处可从《计算机工程》下载免费的PDF全文 | |