Infinite Unlimited Churn

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 and prove correct an 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

Cited literature [35 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-01350804
Contributor : Sébastien Tixeuil <>
Submitted on : Monday, August 1, 2016 - 5:39:25 PM
Last modification on : Tuesday, May 14, 2019 - 10:15:33 AM
Long-term archiving on : Tuesday, November 8, 2016 - 7:23:00 PM

Files

infinite.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License

Identifiers

  • HAL Id : hal-01350804, version 1
  • ARXIV : 1608.00726

Citation

Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil. Infinite Unlimited Churn. [Research Report] LIP6 - Laboratoire d'Informatique de Paris 6; Kent State University. 2016. ⟨hal-01350804⟩

Share

Metrics

Record views

737

Files downloads

600