Storage and search in dynamic peer-to-peer networks

John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal

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

24 Scopus citations

Abstract

We study robust and efficient distributed algorithms for searching, storing, and maintaining data in dynamic Peer-to-Peer (P2P) networks. P2P networks are highly dynamic networks that experience heavy node churn (i.e., nodes join and leave the network continuously over time). Our goal is to guarantee, despite high node churn rate, that a large number of nodes in the network can store, retrieve, and maintain a large number of data items. Our main contributions are fast randomized distributed algorithms that guarantee the above with high probability even under high adversarial churn. In particular, we present the following main results: 1. A randomized distributed search algorithm that with high probability guarantees that searches from as many as n - o(n) nodes (n is the stable network size) succeed in O(log n)-rounds despite 0(n/ log1+δ n) churn, for any small constant δ > 0, per round. We assume that the churn is controlled by an oblivious adversary (that has complete knowledge and control of what nodes join

Original languageEnglish (US)
Title of host publicationSPAA 2013 - Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures
PublisherAssociation for Computing Machinery
Pages53-62
Number of pages10
ISBN (Print)9781450315722
DOIs
StatePublished - 2013
Externally publishedYes
Event25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013 - Montreal, QC, Canada
Duration: Jul 23 2013Jul 25 2013

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013
Country/TerritoryCanada
CityMontreal, QC
Period7/23/137/25/13

Keywords

  • Distributed algorithm
  • Dynamic network
  • Expander graph.
  • Peer-to-peer network
  • Randomized algorithm
  • Search
  • Storage

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Storage and search in dynamic peer-to-peer networks'. Together they form a unique fingerprint.

Cite this