Storage and Search in Dynamic Peer-to-Peer Networks
The authors 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). Their 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. Their main contributions are fast randomized distributed algorithms that guarantee the above with high probability even under high adversarial churn.