Abstract
In peer-to-peer (P2P) systems where individual peers must cooperate to process each other’s requests, a useful metric for evaluating the system is how many remote requests are serviced by each peer. In this paper we apply this remote work metric to flooding-based P2P search networks such as Gnutella. We study how to maximize the remote work in the entire network by controlling the rate of query injection at each node. In particular, we provide a simple procedure for finding the optimal rate of query injection and prove its optimality. We also show that a simple prefer-high-TTL protocol in which each peer processes only queries with the highest time-to-live (TTL) is optimal.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Daswani, N., Garcia-Molina, H.: Query-flood DoS attacks in Gnutella. In: ACM Conference on Computer and Communications Security, Washington, DC (November 2002)
Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: 39th Annual Symposium on Foundations of Computer Science, Palo Alto, California, November 1998, pp. 300–309 (1998)
The Gnutella Developer Forum (GDF). Database of vendor codes, http://groups.yahoo.com/group/the_gdf/
Gnutella. Website, http://gnutella.wego.com
Concurrent Gnutella Hosts, http://www.limewire.com/
Kuhn, F., Wattenhofer, R.: Constant-time distributed dominating set approximation. In: 22nd ACM Symposium on Principles of Distributed Computing, Boston, MA (July 2003)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proceedings of the 16th annual ACM International Conference on Supercomputing, ICS (2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of ACM SIGCOMM, San Diego, August 2001, pp. 149–160 (2001)
Rowstron, A., Druschel, P.: Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In: Proceedings of SOSP 2001 (2001)
Sariou, S., Gummadi, P.K., Gribble, S.D.: Measuring and analyzing the characteristics of Napster and Gnutella hosts. In: Multimedia Computing and Networking (MMCN), San Jose, CA (January 2002)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of ACM SIGCOMM, San Diego, August 2001, pp. 160–177 (2001)
Sun, Q., Daswani, N., Garcia-Molina, H.: Maximizing remote work in flooding-based peer-to-peer systems. Technical report, Stanford University (2003), http://dbpubs.stanford.edu:8090/pub/2003-05
Yang, B., Garcia-Molina, H.: Efficient search in peer-to-peer networks. In: Proceedings of the 22nd IEEE International Conference on Distributred Computing Systems (ICDCS), Vienna, Austria (July 2002)
Zhao, B.Y., Kubiatowicz, J., Joseph, A.: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, University of California at Berkeley (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, Q., Daswani, N., Garcia-Molina, H. (2003). Maximizing Remote Work in Flooding-Based Peer-to-Peer Systems. In: Fich, F.E. (eds) Distributed Computing. DISC 2003. Lecture Notes in Computer Science, vol 2848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39989-6_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-39989-6_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20184-7
Online ISBN: 978-3-540-39989-6
eBook Packages: Springer Book Archive