| 基于分组随机广播的单跳DHT算法 |
| |
| 引用本文： | 王文方,马文辉,刘璟. 基于分组随机广播的单跳DHT算法[J]. 计算机工程, 2008, 34(13): 4-6 |
| |
| 作者姓名： | 王文方 马文辉 刘璟 |
| |
| 作者单位： | 南开大学信息技术科学学院计算机系,天津,300071 |
| |
| 基金项目： | 国家自然科学基金资助项目(90612001); 天津市科技发展计划基金资助重点项目(043800311,043185111-14) |
| |
| 摘 要： | 对等网的节点定位与路由是当前研究的热点，在网络扰动率不高的情况下，可在每个节点维护全局路由表以实现单跳查询。该文提出一个基于分组随机广播的单跳DHT算法——GRBM。通过合并节点的加入与退出事件消息，使用一个新颖的消息传播机制，将事件以较低的代价通知到系统的所有节点。与当前单跳DHT算法相比，GRBM算法在保证较高查询效率的同时，降低了节点网络带宽代价，具有很高的实用价值。
|
| 关 键 词： | 对等技术 定位与路由 组通信 |
| 修稿时间： | |
One-hop DHT Algorithm Based on Grouped Random Broadcast Messages |
| |
| WANG Wen-fang,MA Wen-hui,LIU Jing. One-hop DHT Algorithm Based on Grouped Random Broadcast Messages[J]. Computer Engineering, 2008, 34(13): 4-6 |
| |
| Authors: | WANG Wen-fang MA Wen-hui LIU Jing |
| |
| Affiliation: | (Department of Computer Science, College of Information Technical Science, Nankai University, Tianjin 300071) |
| |
| Abstract: | Location and routing of P2P node is currently a hot subject of research. If network churn is not very high, maintaining global lookup table at every node is reasonable. This paper presents Grouped Random Broadcast Messages(GBRM) algorithom for maintaining global lookup table to achieve one-hop lookup. Events are merged into notification message in the dispatcher node, and notification messages are sent to all nodes using a novel event dissemination algorithm. It shows that GBRM is able to achieve one-hop lookup, while using less bandwidth than other one-hop DHT algorithom, and it has high practical value. |
| |
| Keywords: | P2P location and routing group communication |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
