Infinite Unlimited Churn (Short Paper)

Abstract : We study unlimited infinite churn in peer-to-peer overlay networks. Under this churn, arbitrary many peers may concurrently request to join or leave the overlay network; moreover these requests may never stop coming. We prove that unlimited adversarial churn, where processes may just exit the overlay network, is unsolvable. We focus on cooperative churn where exiting processes participate in the churn handling algorithm. We define the problem of unlimited infinite churn in this setting. We distinguish the fair version of the problem, where each request is eventually satisfied, from the unfair version that just guarantees progress. We focus on local solutions to the problem, and prove that a local solution to the Fair Infinite Unlimited Churn is impossible. We then present our algorithm UIUC that solves the Unfair Infinite Unlimited Churn Problem for a linearized peer-to-peer overlay network. We extend this solution to skip lists and skip graphs.
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-01491828
Contributor : Sébastien Tixeuil <>
Submitted on : Friday, March 17, 2017 - 2:16:58 PM
Last modification on : Tuesday, May 14, 2019 - 10:14:44 AM

Identifiers

Citation

Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil. Infinite Unlimited Churn (Short Paper). International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016), Nov 2016, Lyon, France. pp.148-153, ⟨10.1007/978-3-319-49259-9_12⟩. ⟨hal-01491828⟩

Share

Metrics

Record views

489