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)
Random Subsets of the Interval and P2P Protocols
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
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
Private information retrieval with a trusted hardware unit - revisited
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
| Hi-index | 0.00 |
In this paper we analyse the uniformity of Chord P2P system and its improved versions defined in [1] - folded Chord. We are interested in the maximal and the minimal areas controlled by nodes in these systems.We recall known results for the classical Chord system and compare it with the new results for its modifications. It is known that the function n → n-2 is a threshold for a number of nodes in Chord controlling small areas (i.e. w.h.p. there exists one node controlling area of length ≤ n-2 and for every ɛ 0 there are no nodes controlling areas of size less than n-2-ɛ). We show that the function n → √2n-3/2 is a similar threshold for 2-folded Chord. We also discuss the number of nodes controlling large areas and we find upper thresholds for all these P2P systems. All modifications of Chord are very soft and flexible and can be easily applied to P2P systems which use the classical Chord protocol.