On hierarchical DHT systems - An analytical approach for optimal designs

In this work, we study hierarchical DHT-based Peer-to-Peer (P2P) systems. We present an analytical model for two-tier architectures deploying a DHT at the top-level overlay and varying organizations at the lower level. Based on this model, we determine the optimal operating point of the analyzed architectures, i.e., the optimal ratio between peers at the top level and peers at the lower level. This allows us to compare the analyzed system designs and to decide which one is most suited for typical heterogeneous environments such as mobile P2P settings.

[1]  Gurmeet Singh Manku,et al.  Routing networks for distributed hash tables , 2003, PODC '03.

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

[3]  Krishna P. Gummadi,et al.  Canon in G major: designing DHTs with hierarchical structure , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

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

[5]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

[6]  Karl Aberer,et al.  P-Grid: a self-organizing structured P2P system , 2003, SGMD.

[7]  Antonio F. Gómez-Skarmeta,et al.  Cyclone: a novel design schema for hierarchical DHTs , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[8]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[9]  Ion Stoica,et al.  The Case for a Hybrid P2P Search Infrastructure , 2004, IPTPS.

[10]  Wolfgang Kellerer,et al.  Cost-Based Analysis of Hierarchical DHT Design , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

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

[12]  John Kubiatowicz,et al.  Handling Churn in a DHT (Awarded Best Paper!) , 2004, USENIX Annual Technical Conference, General Track.

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

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

[15]  Ling Liu,et al.  A hybrid topology architecture for P2P systems , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[16]  Nicolas Christin,et al.  A cost-based analysis of overlay routing geometries , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  Peter Druschel,et al.  Providing Administrative Control and Autonomy in Structured Peer-to-Peer Overlays , 2004, IPTPS.

[18]  Krishna P. Gummadi,et al.  The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.

[19]  David Mazières,et al.  Sloppy Hashing and Self-Organizing Clusters , 2003, IPTPS.

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

[21]  Juan Li,et al.  Ontology-Based Clustering and Routing in Peer-to-Peer Networks , 2005, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05).

[22]  Wolfgang Kellerer,et al.  Hybrid DHT Design for Mobile Environments , 2006, AP2PC.

[23]  Zhiyong Xu,et al.  HIERAS: a DHT based hierarchical P2P routing algorithm , 2003, 2003 International Conference on Parallel Processing, 2003. Proceedings..