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
Brocade: Landmark Routing on Overlay Networks
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
Jelly: A Dynamic Hierarchical P2P Overlay Network with Load Balance and Locality
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
FS-Chord: A New P2P Model with Fractional Steps Joining
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
A structured hierarchical P2P model based on a rigorous binary tree code algorithm
Future Generation Computer Systems - Special section: Information engineering and enterprise architecture in distributed computing environments
L-Chord: Routing Model for Chord Based on Layer-Dividing
CIS '07 Proceedings of the 2007 International Conference on Computational Intelligence and Security
Hi-index | 0.00 |
It is common that members of a peer-to-peer network join and leave the system at any time. But in a structured peer-to-peer network, frequent joining and leaving may cause huge maintenance overhead. To deal with this churn problem, we proposed a two-tier architecture called adaptive sector-based routing model (ASBRM). In ASBRM the key space is divided into several sectors and each one has a super peer who plays the role of the relay proxy of the sector. When the number of peer members in a sector exceeds a predefined threshold, it will split into two sectors so that the traffic and computational overhead of the super peer can be kept within an acceptable range. For the convenience of explanation, we combine ASBRM with Chord and perform a series of simulations. Both analysis and simulation results show that ASBRM achieves lower communication cost of members' joining and leaving while at the same time the message routing path length is also shortened.