Infinite Unlimited Churn

08/02/2016
by   Dianne Foreback, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/07/2019

Random Gossip Processes in Smartphone Peer-to-Peer Networks

In this paper, we study random gossip processes in communication models ...
research
09/26/2011

Distributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web

In a peer-to-peer inference system, each peer can reason locally but can...
research
01/27/2022

On the Anonymity of Peer-To-Peer Network Anonymity Schemes Used by Cryptocurrencies

Cryptocurrency systems can be subject to deanonymization attacks by expl...
research
06/16/2018

On Strategyproof Conference Peer Review

We consider peer review in a conference setting where there is typically...
research
04/18/2023

Peer-to-Peer Network: Kantian Cooperation Discourage Free Riding

The problem of how to achieve cooperation among rational peers in order ...
research
10/23/2017

Self-Stabilizing Supervised Publish-Subscribe Systems

In this paper we present two major results: First, we introduce the firs...
research
03/18/2019

Interlaced: Fully decentralized churn stabilization for Skip Graph-based DHTs

As a distributed hash table (DHT) routing overlay, Skip Graph is used in...

Please sign up or login with your details

Forgot password? Click here to reset