RBTree: A New and Scalable P2P Model Based on Gossiping

A major challenge in peer-to-peer systems is the problem of efficiently locating data or resources and scalability. According to the actual practical heterogeneous network system, we explore a fast and scalable super-peer P2P network model based on a rigorous binary tree code algorithm. In our model, if the size of network is small, file lookups are resolved with only one hop. As the systempsilas scale become larger, it can expand automatically based on the super-peerpsilas capability and suit for large scale system. In the worst case, file lookups are resolved with only three hops. Experimental results and theoretical analysis show that the problem of efficiently lookups and scalability in P2P systems are resolved.

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

[2]  Jinyang Li,et al.  Routing tradeoffs in dynamic peer-to-peer networks , 2005 .

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

[4]  Scott Shenker,et al.  Can Heterogeneity Make Gnutella Scalable? , 2002, IPTPS.

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

[6]  Wolfgang Nejdl,et al.  Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks , 2003, WWW '03.

[7]  Ben Y. Zhao,et al.  Towards a Common API for Structured Peer-to-Peer Overlays , 2003, IPTPS.

[8]  Hector Garcia-Molina,et al.  Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[9]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[10]  Anne-Marie Kermarrec,et al.  Gossip-based peer sampling , 2007, TOCS.

[11]  Indranil Gupta,et al.  Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead , 2003, IPTPS.

[12]  Ping Luo,et al.  A structured hierarchical P2P model based on a rigorous binary tree code algorithm , 2007, Future Gener. Comput. Syst..

[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.