Implementing chord for HP2P network

Authors:
Yang Cao;Zhenhua Duan;Jian-Jun Qi;Zhuo Peng;Ertao Lv
Affiliations:
Institute of Computing Theory and Technology, School of Computer Science and Technology, Xidian University, Xi'an, P.R China;Institute of Computing Theory and Technology, School of Computer Science and Technology, Xidian University, Xi'an, P.R China;Institute of Computing Theory and Technology, School of Computer Science and Technology, Xidian University, Xi'an, P.R China;Institute of Computing Theory and Technology, School of Computer Science and Technology, Xidian University, Xi'an, P.R China;Institute of Computing Theory and Technology, School of Computer Science and Technology, Xidian University, Xi'an, P.R China
Venue:
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
Year:
2006

Citing 8
Cited 0

Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Routing Algorithms for DHTs: Some Open Questions

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Canon in G Major: Designing DHTs with Hierarchical Structure

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.