We present fully distributed algorithms for random sampling of nodes in peer-to-peer systems, extending and generalizing the work of King and Saia [Proceedings of PODC 2004] from simple Chord-like distributed hash tables to systems based on higher-dimensional hierarchical constructions, like Content Addressable Networks (CAN). We also show preliminary results on the generalization of the problem to biased sampling. In addition, we provide an extension of CAN that requires only O(1) space per node and achieves O(log n) lookup latency and message complexities. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Konjevod, G., Richa, A. W., & Xia, D. (2006). On sampling in higher-dimensional peer-to-peer systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3887 LNCS, pp. 641–652). https://doi.org/10.1007/11682462_59
Mendeley helps you to discover research relevant for your work.