@inproceedings{a071323d60b047f18ba96673f3dc2f46,
title = "On sampling in higher-dimensional peer-to-peer systems",
abstract = "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.",
author = "Goran Konjevod and Andrea Richa and Donglin Xia",
year = "2006",
doi = "10.1007/11682462_59",
language = "English (US)",
isbn = "354032755X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "641--652",
booktitle = "LATIN 2006",
note = "LATIN 2006: Theoretical Informatics - 7th Latin American Symposium ; Conference date: 20-03-2006 Through 24-03-2006",
}