Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks

Augustine, John; Pandurangan, Gopal; Robinson, Peter; Upfal, Eli

doi:10.1137/1.9781611973099.47

Cited by 66 publications

(114 citation statements)

References 35 publications

(62 reference statements)

Supporting

Mentioning

112

Contrasting

Order By: Relevance

“…Note that our model is quite general in the sense that we only assume that the topology is an expander at every step; no other special properties are assumed. Indeed, expanders have been used extensively to model dynamic P2P networks ‡ in which the expander property is preserved under insertions and deletions of nodes (e.g., [2,35,44]). Since we do not make assumptions on how the topology is preserved, our model is applicable to all such expander-based networks.…”

Section: Our Main Resultsmentioning

confidence: 99%

Storage and search in dynamic peer-to-peer networks

Augustine

Molla

Morsy

et al. 2013

Proceedings of the Twenty-Fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures

Self Cite

View full text Add to dashboard Cite

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 O(n/ log 1+δ 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 and leave and at what time and has unlimited computational power, but is oblivious to the random choices made by the algorithm).2. A storage and maintenance algorithm that guarantees, with high probability, data items can be efficiently stored (with only Θ(log n) copies of each data item) and maintained in a dynamic P2P network with churn rate up to O(n/ log 1+δ n) per round. Our search algorithm together with our storage and maintenance algorithm guarantees that as many as n − o(n) nodes can efficiently store, maintain, and search even under O(n/ log 1+δ n) churn per round. Our algorithms require only polylogarithmic in n bits to be processed and sent (per round) by each node.To the best of our knowledge, our algorithms are the first-known, fully-distributed storage and search algorithms that provably work under highly dynamic settings (i.e., high churn rates per step). Furthermore, they are localized (i.e., do not require any global topological knowledge) and scalable. A technical contribution of this paper, which may be of independent interest, is

show abstract

Section: Our Main Resultsmentioning

confidence: 99%

Storage and search in dynamic peer-to-peer networks

Augustine

Molla

Morsy

et al. 2013

Proceedings of the Twenty-Fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures

Self Cite

View full text Add to dashboard Cite

show abstract

“…The protocol serves as a building block for enabling algorithms for fundamental distributed computing problems such as agreement, search and storage, and leader election in dynamic P2P networks. In particular, the expander maintenance protocol in conjunction with the protocols for agreement [19], and search and storage [22] enables a fully-distributed and autonomous protocol for these problems.…”

Section: A Our Main Resultsmentioning

confidence: 99%

“…The work of [19] studies the fundamental distributed agreement problem in dynamic P2P networks with churn. Its main contribution is an efficient and scalable randomized distributed algorithm (i.e., each node processes and sends only polylogarithmic messages per round, and local computation per node is also lightweight) that guarantees stable almosteverywhere agreement 1 with high probability even under very high adversarial churn rate (up to linear in n per round, where n is the network size) in a polylogarithmic number of rounds.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Augustine

Pandurangan

Robinson

et al. 2015

2015 IEEE 56th Annual Symposium on Foundations of Computer Science

Self Cite

View full text Add to dashboard Cite

“…Recent interest in studying distributed algorithms in dynamic networks was sparked by Kuhn et al [10]. Many different problems and dynamic network models have since been proposed; e.g., [11,8,6,3,1,5,13,7] (see [9] for a survey). The dynamic random walk lower bound we study was first proposed by Avin et al [2], while the dynamic aggregation lower bound we study was first proposed by Cornejo et al [4].…”

Section: Introductionmentioning

confidence: 99%

Smoothed analysis of dynamic networks

et al. 2017

View full text Add to dashboard Cite

We generalize the technique of smoothed analysis to distributed algorithms in dynamic network models. Whereas standard smoothed analysis studies the impact of small random perturbations of input values on algorithm performance metrics, dynamic graph smoothed analysis studies the impact of random perturbations of the underlying changing network graph topologies. Similar to the original application of smoothed analysis, our goal is to study whether known strong lower bounds in dynamic network models are robust or fragile: do they withstand small (random) perturbations, or do such deviations push the graphs far enough from a precise pathological instance to enable much better performance? Fragile lower bounds are likely not relevant for real-world deployment, while robust lower bounds represent a true difficulty caused by dynamic behavior. We apply this technique to three standard dynamic network problems with known strong worst-case lower bounds: random walks, flooding, and aggregation. We prove that these bounds provide a spectrum of robustness when subjected to smoothing-some are extremely fragile (random walks), some are moderately fragile / robust (flooding), and some are extremely robust (aggregation).

show abstract

Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks

Abstract: Towards robust and efficient computation in dynamic peer-to-peer networks. SODA '12 Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms, 551-569.

Cited by 66 publications

References 35 publications

Storage and search in dynamic peer-to-peer networks

Storage and search in dynamic peer-to-peer networks

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

Smoothed analysis of dynamic networks

Contact Info

Product

Resources

About