Open Problems in Data-Sharing Peer-to-Peer Systems

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


In a Peer-To-Peer (P2P) system, autonomous computers pool their resources (e.g., files, storage, compute cycles) in order to inexpensively handle tasks that would normally require large costly servers. The scale of these systems, their “open nature,” and the lack of centralized control pose difficult performance and security challenges. Much research has recently focused on tackling some of these challenges; in this paper, we propose future directions for research in P2P systems, and highlight problems that have not yet been studied in great depth. We focus on two particular aspects of P2P systems—search and security —and suggest several open and important research problems for the community to address.


Query Language Malicious Node Distribute Hash Table Reputation System Search Mechanism 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 2.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. Proc. ACM SIGCOMM (2001)Google Scholar
  2. 3.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. Proc. ACM SIGCOMM (2001)Google Scholar
  3. 4.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. Proc. of the 18th IFIP/ACM Intl. Conf. on Distributed Systems Platforms (2001)Google Scholar
  4. 5.
    Ratnasamy, S., Shenker, S., Stoica, I.: Routing Algorithms for DHTs: Some Open Questions. Proc. IPTPS (2002)Google Scholar
  5. 6.
    Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. Proc. of Intl. Conf. on Supercomputing (2002)Google Scholar
  6. 7.
    Cuenca-Acuna, F. M., Peery, C., Martin, R. P., Nguyen, T. D.: PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities. Technical Report DCS-TR-487, Dept. of Computer Science, Rutgers Univ. (2002)Google Scholar
  7. 8.
    Bawa, M., Garcia-Molina, H., Gionis, A., Motwani, R.: Estimating the size of apeer-to-peer network (2002)Google Scholar
  8. 9.
    Harren, M., Hellerstein, M., Huebsch, R., Loo, B., Shenker, S., Stoica, I.: Complex Queries in DHT-based Peer-to-Peer Networks. Proc. IPTPS (2002)Google Scholar
  9. 10.
    Crespo, A., Garcia-Molina, H.: Routing indicies for peer-to-peer systems. Proc. 28th Intl. Conf. on Distributed Computing Systems (2002)Google Scholar
  10. 11.
    Yang, B., Garcia-Molina, H.: Improving search in peer-to-peer systems. Proc. 28th Intl. Conf. on Distributed Computing Systems (2002)Google Scholar
  11. 12.
    Yang, B., Garcia-Molina, H.: Designing a super-peer network. Proc. ICDE (2003)Google Scholar
  12. 13.
    Schlosser, M., Sintek, M., Decker, S., Nejdl, W.: A scalable and ontology-based P2P infrastructure for semantic web services (2002)Google Scholar
  13. 14.
    Malkhi, D., Nao, M., Ratajczak, D.: Viceroy: a scalable and dynamic emulation of the butterfly. Proc. PODC (2002)Google Scholar
  14. 15.
    Harvey, N., Jones, M., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: a scalable overlay network with practical locality properties (2002)Google Scholar
  15. 22.
    Stoica, I., Adkins, D., Zhuang, S., Shenker, S., Surana, S.: Internet Indirection Infrastructure. Proc. SIGCOMM (2002)Google Scholar
  16. 27.
    Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system.Workshop on Design Issues in Anonymity and Unobservability, pages 46–66 (2000)Google Scholar
  17. 28.
    Cooper, B., Garcia-Molina., H.: Peer to peer data trading to preserve information. ACM Transactions on Information Systems (2002)Google Scholar
  18. 29.
    Dingledine, R., Freedman, M.J., Molnar, D.: The free haven project: Distributed anonymous storage service. Workshop on Design Issues in Anonymity and Unobservability, pages 67–95 (2000)Google Scholar
  19. 30.
    Freedman, M.J., Morris, R.: Tarzan: A peer-to-peer anonymizing network layer. Proc. 9th ACM Conference on Computer and Communications Security, Washington, D.C. (2002)Google Scholar
  20. 31.
    Garber, L.: Denial-of-service attacks rip the internet. Computer, pages 12–17 (April 2000)Google Scholar
  21. 32.
    Hill, R., Hwang, A., Molnar, D.: Approaches to mixnets.Google Scholar
  22. 33.
    Lethin, R.: Chapter 17: Reputation. Peer-to-Peer: Harnessing the Power of Disruptive Technologies ed. Andy Oram, O’Reilly and Associates (2001)Google Scholar
  23. 34.
    Lynch, N.A.: Distributed algorithms. Morgan Kaufmann (1996)Google Scholar
  24. 35.
    Maniatis, P., Baker, M.: Secure History Preservation Through Timeline Entanglement. Proc. 11th USENIX Security Symposium, SF, CA, USA (2002)Google Scholar
  25. 36.
    Ganesh, A., Rowstron, A., Castro, M., Druschel, P., Wallach, D.: Security for structured peer-to-peer overlay networks. Proc. 5th OSDI, Boston, MA (2002)Google Scholar
  26. 37.
    Peinado, M., Biddle, P., England, P., Willman, B.: The darknet and the future of content distribution.
  27. 38.
    Daswani, N., Garcia-Molina, H.: Query-flood DoS Attacks in Gnutella. Proc. Ninth ACM Conference on Computer and Communications Security, Washington, DC (2002)Google Scholar
  28. 39.
    Molnar, D., Dingledine, R., Freedman, M.: Chapter 12: Free haven. Peer-to-Peer: Harnessing the Power of Disruptive Technologies ed. Andy Oram, O’Reilly and Associates (2001)Google Scholar
  29. 40.
    Reiter, M.K., Rubin, A.D.: Crowds: anonymity for Web transactions. ACM Transactions on Information and System Security, 1(1):66–92 (1998)CrossRefGoogle Scholar
  30. 41.
    Resnick, P., Zeckhauser, R., Friedman, E., Kuwabara, K.: Reputation systems. Communications of the ACM, pages 45–48 (2000)Google Scholar
  31. 42.
    Shamir, A.: How to share a secret. Communications of the ACM, 22:612–613 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  32. 43.
    Sit, E., Morris, R.: Security considerations for peer-to-peer distributed hash tables. IPTPS’ 02, (2002)
  33. 44.
    Wright, M., Adler, M., Levine, B., Shields, C.: An analysis of the degradation of anonymous protocols. Technical Report, Univ. of Massachusetts, Amherst (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Neil Daswani
    • 1
  • Hector Garcia-Molina
    • 1
  • Beverly Yang
    • 1
  1. 1.Stanford UniversityStanfordUSA

Personalised recommendations