Performance Enhancement in Hierarchical Peer-to-Peer Systems

Increased popularity of decentralized peer-to-peer (P2P) architecture comes with several challenges, like how to handle efficient lookup and query routing, frequent joining and leaving of nodes and scalability problem. Several key based deterministic routing approaches in a structured P2P networks have been proposed to overcome with these problems. Still, problems become worse if nodes are heterogenous in processing speed, power, stability and storage capability. To bridge the heterogeneity, we propose a 2-tier hierarchical distributed hash table (DHT) in which nodes are classified into three categories: temporary, stable and fully stable nodes. We have achieved intra-group lookup and query routing in O(log(|Gj|)) steps, where |Gj| is the number of (super)peers in destination group Gj, while inter-group lookup in O(1) steps. We have also saved at least 66.67% messages in repairing the routing table due to frequent joining and leaving of nodes in average case.

[1]  Guillaume Urvoy-Keller,et al.  Hierarchical Peer-To-Peer Systems , 2003, Parallel Process. Lett..

[2]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.

[3]  Li Xiao,et al.  Differentiated search in hierarchical peer-to-peer networks , 2005, 2005 International Conference on Parallel Processing (ICPP'05).

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

[5]  Stefan Savage,et al.  Structured superpeers: leveraging heterogeneity to provide constant-time lookup , 2003, Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003.

[6]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[7]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[9]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

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

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

[12]  ShenkerScott,et al.  A scalable content-addressable network , 2001 .

[13]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[14]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[15]  Karl Aberer,et al.  P-Grid: A Self-Organizing Access Structure for P2P Information Systems , 2001, CoopIS.