One-Hop DHT Lookup based on Grouped Random Broadcast Messages

Author

Wang, Wenfang ; Wang, Gang ; Liu, Xiaoguang ; Liu, Jing

Author_Institution

Nankai Univ., Tianjin

fYear

2007

fDate

20-24 March 2007

Firstpage

199

Lastpage

202

Abstract

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.

Keywords

message passing; peer-to-peer computing; routing protocols; table lookup; event dissemination algorithm; global lookup table; group communication; grouped random broadcast message protocol; notification message; one-hop DHT lookup; peer-to-peer system; route protocol; Bandwidth; Broadcast technology; Broadcasting; Computer science; Costs; Delay; Peer to peer computing; Routing protocols; Table lookup; Technological innovation; DHT; Group Communication; Route Protocol;

fLanguage

English

Publisher

ieee

Conference_Titel

Integration Technology, 2007. ICIT '07. IEEE International Conference on

Conference_Location

Shenzhen

Print_ISBN

1-4244-1092-4

Electronic_ISBN

1-4244-1092-4

Type

conf

DOI

10.1109/ICITECHNOLOGY.2007.4290459

Filename

4290459