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
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
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
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
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
Analytic Combinatorics
Proceedings of the 2010 ACM Symposium on Applied Computing
SChord: handling churn in chord by exploiting node session time
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
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 this paper we investigate the information availability in the direct union of 2 copies of chord which is the improved version of popular P2P Chord system. We present precise asymptotic formula describing the resistance to the loss of documents stored in them. After unexpected departures of $k=o(\sqrt{n})$ nodes from the system no information disappears with high probability probability and $\sqrt{n}=o(k)$ unexpected departures lead to loss some data with high probability. Our modification of Chord is very soft and requires only a small interference in the programming code of the original Chord protocol.