Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks

John Augustine, Gopal Pandurangan, Peter Robinson, Scott Roche, Eli Upfal

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

16 Citations (Scopus)
173 Downloads (Pure)

Abstract

Motivated by the need for designing efficient and robust fully-distributed computation in highly dynamic networks such as Peer-to-Peer (P2P) networks, we study distributed protocols for constructing and maintaining dynamic network topologies with good expansion properties. Our goal is to maintain a sparse (bounded degree) expander topology despite heavy {\em churn} (i.e., nodes joining and leaving the network continuously over time). We assume that the churn is controlled by an adversary that has complete knowledge and control of what nodes join and leave and at what time and has unlimited computational power, but is oblivious to the random choices made by the algorithm. Our main contribution is a randomized distributed protocol that guarantees with high probability the maintenance of a {\em constant} degree graph with {\em high expansion} even under {\em continuous high adversarial} churn. Our protocol can tolerate a churn rate of up to $O(n/\poly\log(n))$ per round (where $n$ is the stable network size). Our protocol is efficient, lightweight, and scalable, and it incurs only $O(\poly\log(n))$ overhead for topology maintenance: only polylogarithmic (in $n$) bits needs to be processed and sent by each node per round and any node's computation cost per round is also polylogarithmic. The given protocol is a fundamental ingredient that is needed for the design of efficient fully-distributed algorithms for solving fundamental distributed computing problems such as agreement, leader election, search, and storage in highly dynamic P2P networks and enables fast and scalable algorithms for these problems that can tolerate a large amount of churn.
Original languageEnglish
Title of host publicationProceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS 2013).
PublisherIEEE Computer Society
Pages350-369
Number of pages20
ISBN (Print)978-1-4673-8191-8
DOIs
Publication statusPublished - 17 Dec 2015

    Fingerprint

Cite this

Augustine, J., Pandurangan, G., Robinson, P., Roche, S., & Upfal, E. (2015). Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. In Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS 2013). (pp. 350-369). IEEE Computer Society. https://doi.org/10.1109/FOCS.2015.29