Building a Peer-to-Peer Overlay for Efficient Routing and Low Maintenance

  • Honghao Wang
  • Yimingf Hu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3823)


Most of current structured P2P systems exploit Distributed Hash Table (DHT) to archive an administration-free, fault tolerant overlay network and guarantee to deliver a message to its destination within O(logN) hops. While elegant from a theoretical perspective, those systems face difficulties in a realistic environment. Instead of building P2P overlays from a theoretical perspective, this design tries to construct an overlay from the physical network. By combining different network topology aware techniques, a distinctive overlay structure closely matching the Internet topology is created. The P2P overlay based on this structure is not only highly efficient for routing, but also keeps maintenance overhead very low even under highly dynamic environment.


  1. 1.
    Saroiu, S., Gummadi, P.K., Gribble, S.D.: A Measurement Study of Peer-to-Peer File Sharing Systems. In: Proceedings of Multimedia Computing and Networking 2002 (MMCN 2002), San Jose, CA (January 2002)Google Scholar
  2. 2.
    Dabek, F., Li, J., Sit, E., Robertson, J., Kaashoek, M.F., Morris, R.: Designing a DHT for low latency and high throughput. In: USENIX First Symposium on Nerworked Systems Design and Implementation(NSDI 2004) (March 2004)Google Scholar
  3. 3.
    Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling Churn in a DHT. In: Proceedings of the USENIX Annual Technical Conference (2004)Google Scholar
  4. 4.
    Sen, S., Wang, J.: Analyzing Peer-to-Peer Traffic Across Large Networks. In: Proc. ACM SIGCOMM Internet Measurement Workshop, Marseille, France (November 2004)Google Scholar
  5. 5., Route Views Archive,
  6. 6.
    CIDR-Report, The CIDR Report,
  7. 7.
    Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-aware overlay construction and server selection. In: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM 2002), p. 6 (2002)Google Scholar
  8. 8.
    Cox, R., Dabek, F., Kaashoek, F., Li, J., Morris, R.: Vivaldi: A Decentralized Network Coordinate System. In: Proceedings of the 2004 conference on applications, technologies, architectures, and protocols for computer communications, SIGCOMM (2004)Google Scholar
  9. 9.
    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 the 2001 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM), San Diego, CA, pp. 149–160 (2001)Google Scholar
  10. 10.
    Larrea, M., Arévalo, S., Fernández, A.: Efficient algorithms to implement unreliable failure detectors in partially synchronous systems. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 34–49. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  11. 11.
    Gummadi, K.P., Saroiu, S., Gribble, S.D.: King: Estimating Latency between Arbitrary Internet End Hosts. In: Proceedings of the SIGCOMM Internet Measurement Workshop (IMW 2002), Marseille, France (November 2002)Google Scholar
  12. 12.
    Li, J., Stribling, J., Morris, R., Kaashoek, M., Gil, T.: A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In: Proceedings of 24th IEEE INFOCOM (March 2005)Google Scholar
  13. 13.
    Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting network proximity in Peer-to-Peer overlay networks. In: International Workshp on Future Directions in Distributed Computing, FuDiCo (2002)Google Scholar
  14. 14.
    Rowstron, A., Druschel, P.: Pastry: Scalable, decentraized object location and routing for large-scale peer-to-peer systems. In: Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany ( November 2001)Google Scholar
  15. 15.
    Zhao, B.Y., Duan, Y., Huang, L., Joseph, A.D., Kubiatowicz, J.D.: Brocade: Landmark routing on overlay networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 34. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  16. 16.
    Gupta, A., Liskov, B., Rodrigues, R.: Efficient Routing for Peer-to-Peer Overlays. In: USENIX First Symposium on Nerworked Systems Design and Implementation(NSDI 2004) (March 2004)Google Scholar
  17. 17.
    Gupta, I., Birman, K., Linga, P., Demers, A., van Renesse, R.: Kelips: Building an Efficient and Stable P2P DHT Through Increased Memory and Background Overhead. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 160–169. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  18. 18.
    Ganesh, A.J., Kermarrec, A.-M., Massoulie, L.: HiScamp: self-organizing hierarchical membership protocol. In: Proceedings of the 10th European ACM SIGOPS workshop (September 2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Honghao Wang
    • 1
  • Yimingf Hu
    • 1
  1. 1.University of CincinnatiCincinnatiUSA

Personalised recommendations