Implementing Chord for HP2P Network

  • Yang Cao
  • Zhenhua Duan
  • Jian-Jun Qi
  • Zhuo Peng
  • Ertao Lv
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4278)


We propose a two-layer hybrid P2P network (HP2P), in which the upper layer is structured Chord network, and the lower layer is unstructured flooding network. HP2P benefits from the advantages of both structured and unstructured networks and significantly improves the performance such as stability, scalability and lookup latency of the network. In this paper, the Chord overlay algorithm is formalized. The data structure, node joining, node leaving, routing table stabilizing and lookup services are introduced in detail. Further the caching mechanism is employed to accelerate lookup services. In particular, the analysis shows that the stability of Chord overlay in HP2P network has been enhanced indeed.


Distribute Hash Table Virtual Node Query Message Neighborhood Peer Lookup Service 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord:A scalable peerto- peer lookup service for internet applications. In: Proceedings of the 2001 ACM SIGCOMM Conference (2001)Google Scholar
  2. 2.
    Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of SIGCOMM 2001 (August 2001)Google Scholar
  3. 3.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing, Tech. Rep. UCB/CSD-01-1141, Computer Science Division, University of California, Berkeley (April 2001)Google Scholar
  5. 5.
    Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Un- structured Peer-to-Peer Networks. In: Proc. Of the ACM ICS (2002)Google Scholar
  6. 6.
    Peng, Z., Duan, Z., Qi, J., Cao, Y., Lv, E.: HP2P: A Two-Layer Hybrid P2P Network. TR, No 2 Institute of Computing Theory and Technology, Xidian University (May, 2006),
  7. 7.
    Considine, J.: Cluster-based Optimizations for Distributed Hash Tables, Tech. rep., Computer Science Department, Boston University, November 1 (2002)Google Scholar
  8. 8.
    Ganesan, P., Gummadi, K., Garcia-Molina, H.: Canon in G Major: Designing DHTs with Hierarchical Structure. In: Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004). IEEE, Los Alamitos (2004), 1063-6927/04Google Scholar
  9. 9.
  10. 10.
    The KaZaA Overlay: A Measurement Study,
  11. 11.
    Yang, B., Garcia-Molina, H.: Designing a super-peer network[A]. In: 19th International Conference on Data Engineering, Bangalore, India, March 5-March 8, pp. 3–6. IEEE computer society[C], Los Alamitos (2003)Google Scholar
  12. 12.
    Doyen, G., Nataf, E., Festor, O.: A Hierarchical Architecture for a Distributed Management of P2P Networks and Services. In: IFIP nternational Federation for Information Processing 2005 (2005)Google Scholar
  13. 13.
    Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., Panigrahy, R.: Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 654–663.Google Scholar
  14. 14.
    FIPS 180-1. Secure Hash Standard, U.S. Department of Commerce/NIST, National Technical Information Service, Springfield, VA (April 1995)Google Scholar
  15. 15.
    Ratnasamy, S., Shenker, S., Stoica, I.: Routing algorithms for dHTs: Some open questions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 45. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yang Cao
    • 1
  • Zhenhua Duan
    • 1
  • Jian-Jun Qi
    • 1
  • Zhuo Peng
    • 1
  • Ertao Lv
    • 1
  1. 1.Institute of Computing Theory and Technology, School of Computer Science and TechnologyXidian UniversityXi’anP.R. China

Personalised recommendations