论文信息 - One-Hop DHT Lookup based on Grouped Random Broadcast Messages

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.

Gang Wang | Xiaoguang Liu | Jing Liu | Wenfang Wang

[1] Peter Druschel,et al. Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[2] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[3] Anjali Gupta,et al. Efficient Routing for Peer-to-Peer Overlays , 2004, NSDI.

[4] Liuba Shrira,et al. The design of a robust peer-to-peer system , 2002, EW 10.

[5] Rodrigo Rodrigues,et al. When Multi-hop Peer-to-Peer Lookup Matters , 2004, IPTPS.

[6] Abhinandan Das,et al. SWIM: scalable weakly-consistent infection-style process group membership protocol , 2002, Proceedings International Conference on Dependable Systems and Networks.

[7] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[8] Ji Li,et al. Achieving one-hop DHT lookup and strong stabilization by passing tokens , 2004, Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955).

[9] Ben Y. Zhao,et al. Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.