Churn Possibilities and Impossibilities

Abstract : Churn is processes joining or leaving the peer-to-peer overlay network. We study handling of various churn variants. Cooperative churn requires leaving processes to participate in the churn algorithm while adversarial churn allows the processes to just quit. Infinite churn considers unbounded number of churning processes throughout a single computation. Unlimited churn does not place a bound on the number of concurrently churning processes. Fair churn handling requires that each churn request is eventually satisfied. A local solution involves only a limited part of the network in handing a churn request. We prove that it is impossible to handle adversarial unlimited churn. We sketch a global solution to all variants of cooperative churn and focus on local churn handling. We prove that a local fair solution to infinite churn, whether limited or unlimited, is impossible. On the constructive side, we present an algorithm that maintains a linear topology and handles the least restrictive unfair churn: infinite and unlimited. We extend this solution to a 1-2 skip list, describe enhancements for generalized skip lists and skip graphs.
Complete list of metadatas
Contributor : Sébastien Tixeuil <>
Submitted on : Friday, March 30, 2018 - 9:37:38 AM
Last modification on : Tuesday, May 14, 2019 - 10:12:50 AM


  • HAL Id : hal-01753397, version 1


Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil. Churn Possibilities and Impossibilities. [Research Report] Kent State University; Sorbonne Université, CNRS, Laboratoire d’Informatique de Paris 6, LIP6, F-75005 Paris, France. 2018. ⟨hal-01753397⟩



Record views


Files downloads