One-Hop DHT Lookup based on Grouped Random Broadcast Messages

Recent research has explored that if network churn is not very high, maintaining global lookup table at every node is reasonable. This paper presents GRBM protocol for maintaining global lookup table. In GRBM, events are merged into notification message in the dispatcher node. Then notification messages are sent to all nodes using a novel event dissemination algorithm. It shows that GRBM is able to maintain global lookup table, while using less bandwidth than other one-hop DHT schemes. GRBM guarantees to minimize lookup failure rate at its first attempt. It is quite suitable for large and dynamic system.