| 一种基于DHT的对等网络构造方式 |
| |
| 引用本文： | 韩丽,雷振明,刘芳. 一种基于DHT的对等网络构造方式[J]. 北京邮电大学学报, 2007, 29(1): 118-122 |
| |
| 作者姓名： | 韩丽 雷振明 刘芳 |
| |
| 作者单位： | 北京邮电大学,信息工程学院,北京,100876 |
| |
| 摘 要： | 基于 维star connected cycle (SCC)拓扑图首次提出了一种常量小度数的对等网络构造方式SCC-DHT，它采用分布式哈希表（DHT）的思想进行有效地资源查找定位，网络节点之间的覆盖连接则是参考SCC拓扑图，使得每个节点在维持 个邻居节点度数的前提下，资源查找路径为 ．实验结果表明, SCC-DHT具有更好的健壮性和可扩展性．
|
| 关 键 词： | 对等网络 分布式哈希表 SCC拓扑图 常量小度数 |
| 文章编号： | 1007-5321（2007）01-0118-05 |
| 收稿时间： | 2006-02-14 |
| 修稿时间： | 2006-02-14 |
A New Peer-to-Peer Network Constitution Based on DHT |
| |
| HAN Li,LEI Zhen-ming,LIU Fang. A New Peer-to-Peer Network Constitution Based on DHT[J]. Journal of Beijing University of Posts and Telecommunications, 2007, 29(1): 118-122 |
| |
| Authors: | HAN Li LEI Zhen-ming LIU Fang |
| |
| Affiliation: | School of Information Engineering , Beijing University of Posts and Telecommunications, Beijing 100876, China |
| |
| Abstract: | A constant-degree peer-to-peer network constitution based on d dimension star connected cycles(SCC) graph was presented firstly,namely SCC-distributed Hash table(DHT).It adopts DHT to search and locate resource,and the network nodes are connected according to SCC graph.SCC-DHT achieves O(d) logic hop per lookup request by using O(1) neighbors per node.The simulation results show that SCC-DHT has better robustness and expansibility. |
| |
| Keywords: | peer-to-peer network distribute Hash table star connected cycles graph small constant- degree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《北京邮电大学学报》浏览原始摘要信息 |
|
点击此处可从《北京邮电大学学报》下载全文 |
