Routing Algorithms for DHTs: Some Open Questions | SpringerLink
Skip to main content
Springer Nature Link
Log in

Routing Algorithms for DHTs: Some Open Questions

  • 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

Even though they were introduced only a few years ago, peer-to-peer (P2P) filesharing systems are now one of the most popular Internet applications and have become a major source of Internet traffic. Thus, it is extremely important that these systems be scalable. Unfortunately, the initial designs for P2P systems have significant scaling problems; for example, Napster has a centralized directory service, and Gnutella employs a flooding based search mechanism that is not suitable for large systems.

The interfaces of these systems are not all identical; some reveal only the put and get interface while others reveal the lookup(key) function directly. However, the above discussion refers to the underlying functionality and not the details of the API.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. A. Rowstron, A-M. Kermarrec, M. C., AND Druschel, P. Scribe: The design of a large-scale event notification infrastructure. In Proceedings of NGC 2001 (Nov. 2001).

    Google Scholar 

  2. Cabrera, L. F., Jones, M. B., AND Theimer, M. Herald: Achieving a global event notification service. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII) (Elmau/Oberbayern, Germany, May 2001).

    Google Scholar 

  3. Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., AND Stoica, I. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP’01) (To appear; Banff, Canada, Oct. 2001).

    Google Scholar 

  4. Druschel, P., AND Rowstron, A. Past: Persistent and anonymous storage in a peer-topeer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS 2001) (Elmau/Oberbayern, Germany, May 2001), pp. 65–70.

    Google Scholar 

  5. Druschel, P., AND Rowstron, A. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACMInternational Conference on Distributed Systems Platforms (Middleware 2001)W (Nov 2001).

    Google Scholar 

  6. Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., AND Zhao, B. OceanStore: An architecture for global-scale persistent storage. In Proceeedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000) (Boston, MA, November 2000), pp. 190–201.

    Google Scholar 

  7. Ng, E., AND Zhang, H. Towards global network positioning. In Proceedings of ACM SIGCOMM Internet Measurement Workshop 2001 (Nov. 2001).

    Google Scholar 

  8. Plaxton, C., Rajaraman, R., AND Richa, A. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the ACM SPAA (Newport, Rhode Island, June 1997), pp. 311–320.

    Google Scholar 

  9. Ratnasamy, S., Francis, P., Handley, M., Karp, R., AND Shenker, S. A scalable content-addressable network. In Proc. ACM SIGCOMM (San Diego, CA, August 2001), pp. 161–172.

    Google Scholar 

  10. Ratnasamy, S., Handley, M., Karp, R., AND Shenker, S. Application-level Multicast using Content-Addressable Networks. In Proceedings of NGC 2001 (Nov. 2001).

    Google Scholar 

  11. Ratnasamy, S., Handley, M., Richardkarp, AND Shenker, S. Topologicallyaware overlay construction and server selection. In Proceedings of Infocom’ 2002 (Mar. 2002).

    Google Scholar 

  12. Saroiu, S., Gummadi, K., AND Gribble, S. A measurement study of peer-to-peer file sharing systems. In Proceedings of Multimedia Conferencing and Networking (San Jose, Jan. 2002).

    Google Scholar 

  13. Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., AND Balakrishnan, H. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM’ 01 Conference (San Diego, California, August 2001).

    Google Scholar 

  14. Zhao, B. Y., Kubiatowicz, J., AND Joseph, A. Tapestry: An infrastructure for faulttolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, University of California at Berkeley, Computer Science Department, 2001.

    Google Scholar 

  15. Zhuang, S., Zhao, B., Joseph, A. D., Katz, R. H., AND Kubiatowicz, J. Bayeux: An architecture for wide-area, fault-tolerant data dissemination. In Proceedings of NOSSDAV’ 01 (Port Jefferson, NY, June 2001).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California at Berkeley, CA, USA

    Sylvia Ratnasamy & Ion Stoica

  2. International Computer Science Institute, Berkeley, CA, USA

    Sylvia Ratnasamy & Scott Shenker

Authors
  1. Sylvia Ratnasamy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ion Stoica
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Scott Shenker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Rice University, MS 132, 88005, Houston, TX, USA

    Peter Druschel

  2. MIT Laboratory of Computer Science, 200 Technology Square, Cambridge, MA, USA

    Frans Kaashoek

  3. Microsoft Research Ltd., 7 J J Thomson Avenue, CB3 0FB, Cambridge, UK

    Antony Rowstron

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ratnasamy, S., Stoica, I., Shenker, S. (2002). Routing Algorithms for DHTs: Some Open Questions. 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_4

Download citation

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

  • 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

Search

Navigation