TY - GEN

T1 - Storage and search in dynamic peer-to-peer networks

AU - Augustine, John

AU - Molla, Anisur Rahaman

AU - Morsy, Ehab

AU - Pandurangan, Gopal

AU - Robinson, Peter

AU - Upfal, Eli

PY - 2013

Y1 - 2013

N2 - 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

AB - 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

KW - Distributed algorithm

KW - Dynamic network

KW - Expander graph.

KW - Peer-to-peer network

KW - Randomized algorithm

KW - Search

KW - Storage

UR - http://www.scopus.com/inward/record.url?scp=84883500874&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883500874&partnerID=8YFLogxK

U2 - 10.1145/2486159.2486170

DO - 10.1145/2486159.2486170

M3 - Conference contribution

AN - SCOPUS:84883500874

SN - 9781450315722

T3 - Annual ACM Symposium on Parallelism in Algorithms and Architectures

SP - 53

EP - 62

BT - SPAA 2013 - Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures

PB - Association for Computing Machinery

T2 - 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013

Y2 - 23 July 2013 through 25 July 2013

ER -