Skip to main content

Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations

  • Conference paper
  • First Online:
Peer-to-Peer Systems (IPTPS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2429))

Included in the following conference series:

Abstract

Data-sharing scientific collaborations have particular characteristics, potentially different from the current peer-to-peer environments. In this paper we advocate the benefits of exploiting emergent patterns in self-configuring networks specialized for scientific data-sharing collaborations. We speculate that a peer-to-peer scientific collaboration network will exhibit small-world topology, as do a large number of social networks for which the same pattern has been documented. We propose a solution for locating data in decentralized, scientific, data-sharing environments that exploits the small-worlds topology. The research challenge we raise is: what protocols should be used to allow a self-configuring peer-to-peer network to form small worlds similar to the way in which the humans that use the network do in their social interactions?

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Clip2. The gnutella protocol specifications v0.4, http://www.clip2.com.

  2. Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong. Freenet: A distributed anonymous information storage and retrieval system. In ICSI Workshop on Design Issues in Anonymity and Unobservability, Berkeley, California, 2000.

    Google Scholar 

  3. Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content-addressable network. In SIGCOMM, San Diego USA, 2001.

    Google Scholar 

  4. Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In SIGCOMM 2001, San Diego, USA, 2001.

    Google Scholar 

  5. Ben Y. Zhao, John D. Kubiatowicz, and Anthony D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report CSD-01-1141, Berkeley, 2001.

    Google Scholar 

  6. The GriPyN Project, http://www.griphyn.org.

  7. Sloan Digital Sky Survey, http://www.sdss.org/sdss.html.

  8. The Human Genome Project, http://www.nhgri.nih.gov.

  9. Reka Albert and Albert-Laszlo Barabasi. Statistical mechanics of complex networks. Reviews of Modern Physics, 74:47–97, January 2002.

    Google Scholar 

  10. Duncan J. Watts. Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton University Press, 1999.

    Google Scholar 

  11. The D0 Experiment, http://www-d0.fnal.gov.

  12. Lauri Loebel-Carpenter, Lee Lueking, Carmenita Moore, Ruth Pordes, Julie Trumbo, Sinisa Veseli, Igor Terekhov, Matthew Vranicar, Stephen White, and Victoria White. SAM and the particle physics data grid. In Proceedings of Computing in High-Energy and Nuclear Physics, Beijing, China, 2001.

    Google Scholar 

  13. Anne-Marie Kermarrec, Laurent Massoulie, and Ayalvadi Ganesh. Reliable probabilistic communication in large-scale information dissemination systems. Technical Report MSR-TR-2000-105, Microsoft Research Cambridge, Oct. 2000 2000.

    Google Scholar 

  14. Burton Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422–426, 1970.

    Article  MATH  Google Scholar 

  15. Michael Mitzenmacher. Compressed bloom filters. In Twentieth ACM Symposium on Principles of Distributed Computing (PODC 2001), Newport, Rhode Island, 2001.

    Google Scholar 

  16. Mihajlo A. Jovanovic, Fred S. Annexstein, and Kenneth A. Berman. Scalability issues in large peer-to-peer networks—a case study of gnutella. Technical report, University of Cincinnati, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iamnitchi, A., Ripeanu, M., Foster, I. (2002). Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds) Peer-to-Peer Systems. IPTPS 2002. Lecture Notes in Computer Science, vol 2429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45748-8_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-45748-8_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44179-3

  • Online ISBN: 978-3-540-45748-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics