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
Average Case Analysis of Algorithms on Sequences
Average Case Analysis of Algorithms on Sequences
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Erasure Coding Vs. Replication: A Quantitative Comparison
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
Erasure Code Replication Revisited
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
How to Improve the Reliability of Chord?
OTM '08 Proceedings of the OTM Confederated International Workshops and Posters on On the Move to Meaningful Internet Systems: 2008 Workshops: ADI, AWeSoMe, COMBEK, EI2N, IWSSA, MONET, OnToContent + QSI, ORM, PerSys, RDDS, SEMELS, and SWWS
Proceedings of the 2010 ACM Symposium on Applied Computing
Performance comparison of erasure codes for different churn models in P2P storage systems
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
Data life time for different placement policies in P2P storage systems
Globe'10 Proceedings of the Third international conference on Data management in grid and peer-to-peer systems
Improving data availability in chord p2p system
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
| Hi-index | 0.00 |
In this article we investigate the replication mechanism, called Global Policy with (r,s) erasure codes for Chord peer-to-peer system. Each document is divided into s fragments and then is encoded into s+r fragments that can tolerate r failures. The independent hash functions: H1,…, Hr+s are used for placing fragments of documents into the Chord. In our paper we show analytical formulas describing basic probabilistic properties of the proposed scheme.