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

  • Honghao Wang
  • Yimingf Hu
Conference paper

DOI: 10.1007/11596042_79

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3823)
Cite this paper as:
Wang H., Hu Y. (2005) Building a Peer-to-Peer Overlay for Efficient Routing and Low Maintenance. In: Enokido T., Yan L., Xiao B., Kim D., Dai Y., Yang L.T. (eds) Embedded and Ubiquitous Computing – EUC 2005 Workshops. EUC 2005. Lecture Notes in Computer Science, vol 3823. Springer, Berlin, Heidelberg


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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

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

Personalised recommendations