Constructing a balanced, (log(N)/1oglog(N))-diameter super-peer topology for scalable P2P systems

Current peer-to-peer (P2P) file sharing applications are remarkably simple and robust, but their inefficiency can produce very high network loads. The use of super-peers has been proposed to improve the performance of unstructured P2P systems. These have the potential to approach the performance and scalability of structured systems, while retaining the benefits of unstructured P2P systems. There has, however, been little consensus on the best topology for connecting these super-peers, or how to construct the topology in a distributed, robust way. In this paper we propose a scalable unstructured P2P system (SUPS). The unique aspect of SUPS is a protocol for the distributed construction of a super-peer topology that has highly desirable performance characteristics. The protocol is inspired by the theory of random graphs. We describe the protocol, and demonstrate experimentally that it produces a balanced and low-diameter super-peer topology at low cost. We show that the method is very robust to super-peer failures and inconsistent information, and compare it with other approaches.

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

[2]  Béla Bollobás,et al.  Random Graphs , 1985 .

[3]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[4]  Ian T. Foster,et al.  Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design , 2002, ArXiv.

[5]  Edith Cohen,et al.  Replication strategies in unstructured peer-to-peer networks , 2002, SIGCOMM.

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

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

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

[9]  Juan Li,et al.  Efa: an efficient content routing algorithm in large peer-to-peer overlay networks , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[10]  Nicholas C. Wormald,et al.  Random Graph Processes with Degree Restrictions , 1992, Combinatorics, Probability and Computing.

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

[12]  Eli Upfal,et al.  Building low-diameter P2P networks , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[13]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..