摘要： 对等网的节点定位与路由是当前研究的热点，在网络扰动率不高的情况下，可在每个节点维护全局路由表以实现单跳查询。该文提出一个基于分组随机广播的单跳DHT算法——GRBM。通过合并节点的加入与退出事件消息，使用一个新颖的消息传播机制，将事件以较低的代价通知到系统的所有节点。与当前单跳DHT算法相比，GRBM算法在保证较高查询效率的同时，降低了节点网络带宽代价，具有很高的实用价值。

关键词: 对等技术, 定位与路由, 组通信

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.

Key words: P2P, location and routing, group communication

中图分类号: 

• TP393