This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Large Scaling Unstructured Peer-to-Peer Networks with Heterogeneity-Aware Topology and Routing
November 2006 (vol. 17 no. 11)
pp. 1277-1293

Abstract—Peer-to-peer (P2P) file sharing systems such as Gnutella have been widely acknowledged as the fastest-growing Internet applications ever. The P2P model has many potential advantages, including high flexibility and serverless management. However, these systems suffer from the well-known performance mismatch between the randomly constructed overlay network topology and the underlying IP-layer topology. This paper proposes to structure the P2P overlay topology using a heterogeneity-aware multitier topology to better balance the load at peers with heterogeneous capacities and to prevent low-capability nodes from throttling the performance of the system. An analytical model is developed to enable the construction and maintenance of heterogeneity-aware overlay topologies with good node connectivity and better load balance. We also develop an efficient routing scheme, called probabilistic selective routing, that further utilizes heterogeneity-awareness to enhance the routing performance. We evaluate our design through simulations. The results show that our multitier topologies alone can provide eight to 10 times improvement in the messaging cost, two to three orders of magnitude improvement in terms of load balancing, and seven to eight times lower topology construction and maintenance costs when compared to Gnutella's random power-law topology. Moreover, our heterogeneity-aware routing scheme provides further improvements on all evaluation metrics, when used with our heterogeneity-aware overlay topologies.

[1] E. Adar and B.A. Huberman, “Free Riding On Gnutella,” http://www.firstmonday.dk/issues/issue5_10 adar, 2003.
[2] Y. Chawathe, S. Ratnaswamy, L. Breslau, N. Lanham, and S. Shenker, “Making Gnutella-Like P2P Systems Scalable,” Proc. ACM SIGCOMM, 2003.
[3] A. Crespo and H. Garcia-Molina, “Routing Indices for Peer-to-Peer Systems,” Proc. Int'l Conf. Distributed Computing Systems, July 2002.
[4] A. Crespo and H. Garcia-Molina, “Semantic Overlay Networks for P2P Systems,” technical report, Computer Science Dept., Stanford Univ., Oct. 2002.
[5] G.S. Fishman, Discrete-Event Simulation. Springer-Verlag, 2001.
[6] “Super-Peer Architectures for Distributed Computing,” F.S. Inc., http://www.fiorano.com/whitepaperssuperpeer.pdf , 2004.
[7] “Kazaa Home Page,” http:/www.kazaa.com/, 2003.
[8] S. Kirkpatrick, C.D. Gellat, and M.P. Vecchi, “Optimization by Simulated Annealing,” Science, no. 4598, May 1983.
[9] “Improving Gnutella Protocol: Protocol AnalysisandResearch Proposals,” Limewire, http://www9.limewire.com/downloadivkovic_paper.pdf , 2002.
[10] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” Proc. 16th Ann. ACM Int'l Conf. Supercomputing, 2002.
[11] E.P. Markatos, “Tracing A Large-Scale Peer to Peer System: An Hour in the Life of Gnutella,” Proc. Second IEEE/ACM Int'l Symp. Cluster Computing and the Grid, 2002.
[12] H.D. Meer, “Peer-to-Peer Programmability,” Programmable Networks for IP-Service Deployment, A. Galis, S. Denazis, C. Brou, and C. Klein, eds., chapter 6, pp. 87-107. Artech House Books, 2004.
[13] S.R. Qin Lv and S. Shenker, “Can Heterogeneity Make Gnutella Scalable?” Proc. First Int'l Workshop Peer-to-Peer Systems, 2002.
[14] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. SIGCOMM Ann. Conf. Data Comm., Aug. 2001.
[15] S. Saroiu, P.K. Gummadi, and S.D. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” Technical Report UW-CSE-01-06-02, Univ. of Washington, 2001.
[16] A. Singh, “Mini Project I,” http://www.cc.gatech.edu/~aameek/Projects/ mpsmp1.html, 2002.
[17] K. Sripanidkulchai, “The Popularity of Gnutella Queries and Its Implications on Scalability,” http://www-2.cs.cmu.edu/~kunwadee/research/ p2ppaper.html, 2001.
[18] I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. SIGCOMM Ann. Conf. Data Comm., Aug. 2001.
[19] Z. Xu, M. Mahalingam, and M. Karlsson, “Turning Heterogeneity into an Advantage in Overlay Routing,” Proc. IEEE Infocom, 2003.
[20] B. Yang and H. Garcia-Molina, “Improving Search in Peer-to-Peer Networks,” Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS '03), July 2003.

Index Terms:
Peer-to-peer systems, overlay topology, overlay routing, node heterogeneity, load balancing.
Citation:
Mudhakar Srivatsa, Bugra Gedik, Ling Liu, "Large Scaling Unstructured Peer-to-Peer Networks with Heterogeneity-Aware Topology and Routing," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 11, pp. 1277-1293, Nov. 2006, doi:10.1109/TPDS.2006.158
Usage of this product signifies your acceptance of the Terms of Use.