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
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
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
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 |
In a structured peer-to-peer network, frequent join and leave of peer members cause huge maintenance overhead. To deal with this churn problem, we proposed a sector-based routing model (SBRM). The key space is divided into several sectors and each sector has a peer member acting as the relay proxy of the sector. Then the cost of join and leave can be greatly reduced. In this paper we choose Chord as the underlying structured network and perform a series of simulation. Analysis and simulation results show that SBRM achieve lower communication cost when a member joined or left the system, and message routing path length is also shortened.