Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement

Storage and Search in Dynamic Peer-to-Peer Networks

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 (whp) even under high adversarial churn: 1. A …

基于读/写操作的可读写快照

Read-Modify-Writable Snapshots from Read/Write operations

本文提出两种仅使用读/写操作的可读写快照算法，分别适用于有限和无限并发性模型。