On sampling in higher-dimensional peer-to-peer systems

Goran Konjevod, Andrea Richa, Donglin Xia

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationLATIN 2006
Subtitle of host publicationTheoretical Informatics - 7th Latin American Symposium, Proceedings
Pages641-652
Number of pages12
DOIs
StatePublished - Jul 10 2006
EventLATIN 2006: Theoretical Informatics - 7th Latin American Symposium - Valdivia, Chile
Duration: Mar 20 2006Mar 24 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3887 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherLATIN 2006: Theoretical Informatics - 7th Latin American Symposium
CountryChile
CityValdivia
Period3/20/063/24/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On sampling in higher-dimensional peer-to-peer systems'. Together they form a unique fingerprint.

Cite this