HP2P: A Hybrid Hierarchical P2P Network

Unstructured and structured P2P are two typical distributed models for P2P networking. The unstructured P2P uses flooding method, and has poor scalability and low efficiency, while the structured P2P uses DHT (Distributed Hash Table) method, and has low stability. This paper proposes a two-layer hybrid P2P network - HP2P, which combines flooding and DHT methods: Chord is used for the upper layer and flooding for the lower layer. The general framework of HP2P is presented and its upper and lower layers are described. By analyzing the performance of HP2P, it shows that HP2P has well scalability, high efficiency, and good stability.

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

[2]  Olivier Festor,et al.  A Hierarchical Architecture for a Distributed Management of P2P Networks and Services , 2005, DSOM.

[3]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

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

[5]  Dimitrios Gunopulos,et al.  A local search mechanism for peer-to-peer networks , 2002, CIKM '02.

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

[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]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[9]  Yue Guang A P2P Network Model with Multi-Layer Architecture Based on Region , 2005 .

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

[11]  Yang Cao,et al.  Implementing Chord for HP2P Network , 2006, OTM Workshops.

[12]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[13]  Peter Druschel,et al.  Exploiting network proximity in peer-to-peer overlay networks , 2002 .

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

[15]  Witold Litwin,et al.  LH*—a scalable, distributed data structure , 1996, TODS.

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