This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Improving Query Response Delivery Quality in Peer-to-Peer Systems
November 2006 (vol. 17 no. 11)
pp. 1335-1347
Yunhao Liu, IEEE
Li Xiao, IEEE

Abstract—Unstructured peer-to-peer (P2P) system is the prevalent model in today's P2P systems. In such systems, a response is sent along the same path that carried the incoming query message. To guarantee the anonymity of the requestor, no requestor information is included in the response message, and each node in the query's incoming path only knows its direct neighbors who sent the query request to it. This mechanism introduces response loss when any one node or connection in the path fails, which is a common occurrence in the P2P system due to its dynamic feature. In this paper, we address the response loss problem and show that peers' oscillation can cause up to a 35 percent response loss in an unstructured P2P system. We also present three techniques to alleviate this problem: the redundant response delivery (RRD) scheme as a proactive approach, the adaptive response delivery (ARD) scheme as a reactive approach, and the extended adaptive response delivery scheme to render ARD to function in an unstructured P2P system with limited or no flooding-based search mechanism. We have evaluated our techniques in a large-scale network simulation. With limited traffic overhead, all three techniques reduce response loss rate by more than 65 percent and are fully distributed. We have designed our techniques to be simple to develop and implement in existing P2P systems.

[1] The Gnutella protocol specification 0.6, http:/rfc-gnutella. sourceforge.net, 2002.
[2] KaZaA, http:/www.kazaa.com, 2003.
[3] Napster, http:/www.napster.com, 2003.
[4] K. Aberer, P. Cudre-Mauroux, A. Datta, and Z. Despotovic, “P-Grid: A Self-Organizing Structured P2P System,” Proc. Int'l Conf. Cooperative Informantion Systems, 1995.
[5] 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.
[6] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web Caching and Zipf-Like Distributions: Evidence and Implications,” Proc. INFOCOM, 1999.
[7] F.E. Bustamante and Y. Qiao, “Friendships that Last: Peer Lifespan and Its Role in P2P Protocols,” Proc. Eighth Int'l Workshop Web Content Caching and Distribution (WCW '03), 2003.
[8] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, “Making Gnutella-Like P2P Systems Scalable,” Proc. ACM SIGCOMM, 2003.
[9] N. Daswani and H. Garcia-Molina, “Query-Flood DoS Attacks in Gnutella,” Proc. ACM Computer and Comm. Security Conf., 2002.
[10] D. Dumitriu, E. Knightly, A. Kuzmanovic, I. Stoica, and W. Zwaenepoel, “Denial-of-Service Resilience in Peer-to-Peer File Sharing Systems,” Proc. ACM SIGMETRICS '05, 2005.
[11] C. Gkantsidis, M. Mihail, and A. Saberi, “Random Walks in Peer-to-Peer Networks,” Proc. INFOCOM, 2004.
[12] K.P. Gummadi, R.J. Dunn, S. Saroiu, S.D. Gribble, H.M. Levy, and J. Zahorjan, “Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP '03), 2003.
[13] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networking,” Proc. Mobile Computing Conf., 1996.
[14] K. Sripanidkulchai, B. Maggs, and H. Zhang, “Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems,” Proc. INFOCOM, 2003.
[15] P. Keyani, B. Larson, and M. Senthil, “Peer Pressure: Distributed Recovery from Attacks in Peer-to-Peer Systems,” Proc. IFIP Workshop Peer-to-Peer Computing, 2002.
[16] Y. Liu, X. Liu, L. Xiao, L. Ni, and X. Zhang, “Location-Aware Topology Matching in Unstructured P2P Systems,” Proc. INFOCOM, 2004.
[17] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” Proc. ACM Int'l Conf. Supercomputing, 2002.
[18] E.P. Markatos, “Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella,” Proc. IEEE Int'l Symp. Cluster Computing and the (CCGrid), 2002.
[19] V. Park and M. Corson, “Temporally-Ordered Routing Algorithm (TORA) Version 1: Functional Specification,” IETF Internet draft (draft-ietf-tora-spec-04.txt), 2001.
[20] C.E. Perkins and E.M. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. MILCOM '97, 1997.
[21] L. Peterson, D. Culler, T. Anderson, and T. Roscoe, “A Blueprint for Introducing Disruptive Technology into the Internet,” Proc. HotNets Conf., 2002.
[22] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM, 2001.
[23] C. Rohrs, “Query Routing for the Gnutella Network,” http:/rfc-gnutella.sourceforge.net, 2001.
[24] S. Sen and J. Wang, “Analyzing Peer-to-Peer Traffic across Large Networks,” Proc. ACM SIGCOMM Internet Measurement Workshop, 2002.
[25] S. Saroiu, K. Gummadi, R. Dunn, S. Gribble, and H. Levy, “An Analysis of Internet Content Delivery Systems,” Proc. Symp. Operating Systems Design and Implementation (OSDI), 2002.
[26] S. Saroiu, P. Gummadi, S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” Proc. Mutimedia Computing and Netowrking Conf. (MMCN), 2002.
[27] K. Sripanidkulchai, “The Popularity of Gnutella Queries and Its Implications on Scalability,” http://www-2.cs.cmu.edu/~kunwadee/research/ p2pgnutella.html, 2001.
[28] I. Stoica, S. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM, 2001.
[29] H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, “Network Topology Generators: Degree-Based vs. Structural,” Proc. ACM SIGCOMM, 2002.
[30] S. Wang, D. Xuan, and W. Zhao, “On Resilience of Structured Peer-to-Peer Systems,” Proc. GLOBECOM, 2003.
[31] B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph, and J.D. Kubiatowicz, “Tapestry: An Infrastructure for Fault-Resilient Wide-Area Location and Routing,” IEEE J. Selected Areas in Comm., 2001.
[32] S.Q. Zhuang, D. Geels, I. Stoica, and R.H. Katz, “On Failure Detection Algorithms in Overlay Networks,” Proc. INFOCOM, 2005.

Index Terms:
Peer-to-peer system, flooding search, query response, response path, response loss problem.
Citation:
Xiaomei Liu, Yunhao Liu, Li Xiao, "Improving Query Response Delivery Quality in Peer-to-Peer Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 11, pp. 1335-1347, Nov. 2006, doi:10.1109/TPDS.2006.157
Usage of this product signifies your acceptance of the Terms of Use.