This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Location Awareness in Unstructured Peer-to-Peer Systems
February 2005 (vol. 16 no. 2)
pp. 163-174

Abstract—Peer-to-Peer (P2P) computing has emerged as a popular model aiming at further utilizing Internet information and resources. However, the mechanism of peers randomly choosing logical neighbors without any knowledge about underlying physical topology can cause a serious topology mismatch between the P2P overlay network and the physical underlying network. The topology mismatch problem brings great stress in the Internet infrastructure. It greatly limits the performance gain from various search or routing techniques. Meanwhile, due to the inefficient overlay topology, the flooding-based search mechanisms cause a large volume of unnecessary traffic. Aiming at alleviating the mismatching problem and reducing the unnecessary traffic, we propose a location-aware topology matching (LTM) technique. LTM builds an efficient overlay by disconnecting slow connections and choosing physically closer nodes as logical neighbors while still retaining the search scope and reducing response time for queries. LTM is scalable and completely distributed in the sense that it does not require any global knowledge of the whole overlay network. The effectiveness of LTM is demonstrated through simulation studies.

[1] BRITE, http://www.cs.bu.edubrite/, 2003.
[2] Fasttrack, http:/www.fasttrack.nu, 2003.
[3] Gnutella, http:/gnutella.wego.com/, 2003.
[4] The Gnutella protocol specification 0.6, http:/rfc-gnutella. sourceforge.net, 2003.
[5] KaZaA, http:/www.kazaa.com, 2003.
[6] Napster, http:/www.napster.com, 2003.
[7] NTP: The Network Time Protocol, http:/www.ntp.org/, 2003.
[8] V. Almeida, A. Bestavros, M. Crovella, and A.D. Olivera, “Characterizing Reference Locality in the WWW,” Proc. IEEE Conf. Parallel and Distributed Information Systems (PDIS), 1996.
[9] R. Bhagwan, S. Savage, and G.M. Voelker, “Understanding Availability,” Proc. Second Int'l Workshop Peer-to-Peer Systems (IPTPS '03), 2003.
[10] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web Caching and Zipf-Like Distributions: Evidence and Implications,” Proc. IEEE INFOCOM, 1999.
[11] T. Bu and D. Towsley, “On Distinguishing between Internet Power Law Topology Generators,” Proc. IEEE INFOCOM, 2002.
[12] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, “Making Gnutella-Like P2P Systems Scalable,” Proc. ACM SIGCOMM, 2003.
[13] Y. Chu, S.G. Rao, and H. Zhang, “A Case for End System Multicast,” Proc. ACM SIGMETRICS, 2000.
[14] E. Cohen and S. Shenker, “Replication Strategies in Unstructured Peer-to-Peer Networks,” Proc. ACM SIGCOMM, 2002.
[15] O.D. Gnawali, “A Keyword-Set Search System for Peer-to-Peer Networks,” master's thesis, Massachusetts Inst. of Tech nology, June 2002.
[16] B.J. Jansen, A. Spink, J. Bateman, and T. Saracevic, “Real Life Information Retrieval: A Study of User Queries on the Web,” Proc. SIGIR Forum, 1998.
[17] B. Krishnamurthy and J. Wang, “Topology Modeling via Cluster Graphs,” Proc. SIGCOMM Internet Measurement Workshop, 2001.
[18] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” Proc. 16th ACM Int'l Conf. Supercomputing, 2002.
[19] 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.
[20] D.A. Menasce and L. Kanchanapalli, “Probabilistic Scalable P2P Resource Location Services,” ACM SIGMETRICS Performance Evaluation Rev., vol. 30, pp. 48-58, 2002.
[21] V.N. Padmanabhan and L. Subramanian, “An Investigation of Geographic Mapping Techniques for Internet Hosts,” Proc. ACM SIGCOMM, 2001.
[22] S. Patro and Y.C. Hu, “Transparent Query Caching in Peer-to-Peer Overlay Networks,” Proc. 17th Int'l Parallel and Distributed Processing Symp. (IPDPS), 2003.
[23] L. Peterson, D. Culler, T. Anderson, and T. Roscoe, “A Blueprint for Introducing Disruptive Technology into the Internet,” Proc. HOTNETS, 2002.
[24] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM, 2001.
[25] M. Ripeanu, A. Iamnitchi, and I. Foster, “Mapping the Gnutella Network,” IEEE Internet Computing, 2002.
[26] J. Ritter, “Why Gnutella Can't Scale. No, Really,” http://www.tch.orggnutella.html, 2001.
[27] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. Int'l Conf. Distributed Systems Platforms, 2001.
[28] S. Saroiu, P. Gummadi, and S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” Proc. Multimedia Computing and Networking (MMCN), 2002.
[29] S. Saroiu, K.P. Gummadi, R.J. Dunn, S.D. Gribble, and H.M. Levy, “An Analysis of Internet Content Delivery Systems,” Proc. Fifth Symp. Operating Systems Design and Implementation, 2002.
[30] M.T. Schlosser and S.D. Kamvar, “Availability and Locality Measurements of Peer-to-Peer File Systems,” Proc. ITCom: Scalability and Traffic Control in IP Networks, 2002.
[31] S. Sen and J. Wang, “Analyzing Peer-to-Peer Traffic across Large Networks,” Proc. ACM SIGCOMM Internet Measurement Workshop, 2002.
[32] K. Sripanidkulchai, “The Popularity of Gnutella Queries and Its Implications on Scalability,” http://www2.cs.cmu.edu/kunwadee/research/ p2pgnutella. html, 2001.
[33] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM, 2001.
[34] H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, “Network Topology Generators: Degree-Based vs. Structural,” Proc. SIGCOMM '02, 2002.
[35] Y. Xie and D. O'Hallaron, “Locality in Search Engine Queries and Its Implications for Caching,” Proc. IEEE INFOCOM, 2002.
[36] Z. Xu, C. Tang, and Z. Zhang, “Building Topology-Aware Overlays Using Global Soft-state,” Proc. 23rd Int'l Conf. Distributed Computing Systems (ICDCS), 2003.
[37] B. Yang and H. Garcia-Molina, “Efficient Search in Peer-to-Peer Networks,” Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS), 2002.
[38] B.Y. Zhao, J.D. Kubiatowicz, and A.D. Joseph, “Tapestry: An Infrastructure for Fault-Resilient Wide-Area Location and Routing,” Technical Report UCB//CSD-01-1141, Univ. of California, Berkeley, 2001.
[39] Z. Zhuang, Y. Liu, L. Xiao, and L.M. Ni, “Hybrid Periodical Flooding in Unstructured Peer-to-Peer Networks,” Proc. Int'l Conf. Parallel Processing, 2003.

Index Terms:
Peer-to-peer, topology matching, flooding, location-aware topology, search efficiency.
Citation:
Yunhao Liu, Li Xiao, Xiaomei Liu, Lionel M. Ni, Xiaodong Zhang, "Location Awareness in Unstructured Peer-to-Peer Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 2, pp. 163-174, Feb. 2005, doi:10.1109/TPDS.2005.21
Usage of this product signifies your acceptance of the Terms of Use.