Advertisement

Maximizing Remote Work in Flooding-Based Peer-to-Peer Systems

  • Qixiang Sun
  • Neil Daswani
  • Hector Garcia-Molina
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2848)

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.

Keywords

Processing Capacity Search Query Local Query Regular Node Extra Capacity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Daswani, N., Garcia-Molina, H.: Query-flood DoS attacks in Gnutella. In: ACM Conference on Computer and Communications Security, Washington, DC (November 2002)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    The Gnutella Developer Forum (GDF). Database of vendor codes, http://groups.yahoo.com/group/the_gdf/
  4. 4.
    Gnutella. Website, http://gnutella.wego.com
  5. 5.
    Concurrent Gnutella Hosts, http://www.limewire.com/
  6. 6.
    Kuhn, F., Wattenhofer, R.: Constant-time distributed dominating set approximation. In: 22nd ACM Symposium on Principles of Distributed Computing, Boston, MA (July 2003)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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
  13. 13.
    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)Google Scholar
  14. 14.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Qixiang Sun
    • 1
  • Neil Daswani
    • 1
  • Hector Garcia-Molina
    • 1
  1. 1.Computer Science DepartmentStanford UniversityStanfordUSA

Personalised recommendations