Skip to main content

Topology-Aware Routing in Structured Peer-to-Peer Overlay Networks

  • Chapter
  • First Online:
Future Directions in Distributed Computing

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

Abstract

Structured peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry [19.14], [19.20], [19.17], [19.22] provide a self-organizing substrate for large-scale p2p applications. They can implement a scalable, fault-tolerant distributed hash table (DHT), in which any item can be located within a small number of routing hops using a small per-node routing table. These systems have been used in a variety of distributed applications, including distributed stores [19.7], [19.18], [19.10], [19.6], event notification, and content distribution [19.23], [19.5], [19.9], [19.4].

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. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. Wallach. Secure routing for structured peer-to-peer overlay networks. In Proc. OSDI’02, Dec. 2002.

    Google Scholar 

  2. M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron. Exploiting network proximity in peer-to-peer overlay networks, 2002. Technical report MSR-TR-2002-82.

    Google Scholar 

  3. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh. Splitstream: A bandwidth-intensive content streaming system, 2002. Submitted for publication.

    Google Scholar 

  4. M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron. Scribe: A large-scale and decentralized application-level multicast infrastructure. IEEE JSAC, 20(8), Oct. 2002.

    Google Scholar 

  5. L. P. Cox, C. D. Murray, and B. D. Noble. Pastiche: Making backup cheap and easy. In Proc. OSDI’02, Dec. 2002.

    Google Scholar 

  6. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. SOSP, Oct. 2001.

    Google Scholar 

  7. J. Douceur. The Sybil attack. In Proc. IPTPS’02, Mar. 2002.

    Google Scholar 

  8. S. Iyer, A. Rowstron, and P. Druschel. Squirrel: A decentralized peer-to-peer web cache. In Proc. PODC’02, July 2002.

    Google Scholar 

  9. J. Kubiatowicz et al. Oceanstore: An architecture for global-scale persistent store. In Proc. ASPLOS’2000, Nov. 2000.

    Google Scholar 

  10. Q. Lv, S. Ratnasamy, and S. Shenker. Can heterogeneity make Gnutella scalable? In Proc. IPTPS’02, Mar. 2002.

    Google Scholar 

  11. N. Lynch, D. Malkhi, and D. Ratajczak. Atomic data access in content addressable networks. In Proc. IPTPS’02, Mar. 2002.

    Google Scholar 

  12. A. Muthitacharoen, R. Morris, T. Gil, and B. Chen. Ivy: A read/write peer-to-peer file system. In OSDI’02, Dec. 2002.

    Google Scholar 

  13. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proc. SIGCOMM’01, Aug. 2001.

    Google Scholar 

  14. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologically-aware overlay construction and server selection. In Proc. INFOCOM’02, 2002.

    Google Scholar 

  15. S. Ratnasamy, S. Shenker, and I. Stoica. Routing algorithms for DHTs: Some open questions. In Proc. IPTPS’02, Mar. 2002.

    Google Scholar 

  16. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. Middleware’01, 2001.

    Google Scholar 

  17. A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc. SOSP, Oct. 2001.

    Google Scholar 

  18. E. Sit and R. Morris. Security considerations for peer-to-peer distributed hash tables. In Proc. IPTPS’02, Mar. 2002.

    Google Scholar 

  19. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. SIGCOMM’01, 2001.

    Google Scholar 

  20. B. Zhao, Y. Duan, L. Huang, A. Joseph, and J. Kubiatowicz. Brocade: Landmark routing on overlay networks. In Proc. IPTPS’02, Mar. 2002.

    Google Scholar 

  21. B. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-resilient wide-area location and routing. Technical Report UCB//CSD-01-1141, U. C. Berkeley, Apr. 2001.

    Google Scholar 

  22. S. Zhuang, B. Zhao, A. Joseph, R. Katz, and J. Kubiatowicz. Bayeux: An Architecture for Scalable and Fault-tolerant Wide-Area Data Dissemination. In Proc. NOSSDAV’01, June 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Castro, M., Druschel, P., Hu, Y.C., Rowstron, A. (2003). Topology-Aware Routing in Structured Peer-to-Peer Overlay Networks. In: Schiper, A., Shvartsman, A.A., Weatherspoon, H., Zhao, B.Y. (eds) Future Directions in Distributed Computing. Lecture Notes in Computer Science, vol 2584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37795-6_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-37795-6_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00912-2

  • Online ISBN: 978-3-540-37795-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics