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
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
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
Design and implementation of P2P protocol for mobile phones
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Improving data availability in chord p2p system
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Towards efficient replication of documents in chord: case (r,s) erasure codes
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
| Hi-index | 0.00 |
In Peer-to-Peer (P2P) networked systems, participating nodes can be frequently disconnected from the networks because of several reasons such as users' intentions, nodes' failures, and network problems. This may increase the loss-ratio of the data and some other routing information; it may spoil the reliability of the whole P2P networks. Several works have been made to improve their reliability and availability based on existing Distributed Hash Tables (DHT) schemes. However, they have some trade-off relation between the performance and the reliability of the P2P networks. In this paper, we present Chordet, which is an efficient and transparent replication scheme for Chord-based P2P networks. Chordet replicates the data stored in the participating nodes so that they are evenly distributed. Using Chordet, the nodes can reduce lookup failure rates and lookup path length. Moreover, not all nodes need to implement proposed replication algorithm. Our simulation results show that Chordet outperforms the previous schemes in terms of both performance and reliability of the whole P2P networks.