Approximate counting: a detailed analysis
BIT - Ellis Horwood series in artificial intelligence
Counting large numbers of events in small registers
Communications of the ACM
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
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Uniformity of improved versions of chord
ICICA'10 Proceedings of the First international conference on Information computing and applications
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 compare two methods for generating finite families of random subsets according to some sequence of independent random variables 茂戮驴1, ..., 茂戮驴ndistributed uniformly over the interval [0,1]. The first method called uniform splituses 茂戮驴ivalues straightforwardly to determine points of division of [0,1] into subintervals. The second method called binary splituses 茂戮驴ionly to perform subsequent divisions of already existing subintervals into exact halves. We show that the variance of lengthes of obtained intervals in the first method is approximately $\frac{1}{n^2}$ and that the variance of lengthes of obtained intervals in the second method is approximately $\frac{1}{n^2}(\frac{1}{\ln 2}-1)$.The uniform split is used in the Chord peer-to-peer protocol while the binary split is used in the CAN protocol. Therefore our analysis applies to this protocols and shows that CAN has a better probabilistic properties than Chord. We propose also a simple modification of the Chord protocol which improves its statistical properties.