Infinite Unlimited Churn
| Autor: | Foreback, Dianne, Nesterenko, Mikhail, Tixeuil, S��bastien |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2016 |
| Předmět: |
Networking and Internet Architecture (cs.NI)
FOS: Computer and information sciences Computer Science - Performance ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Performance (cs.PF) Computer Science::Performance Computer Science - Networking and Internet Architecture Computer Science - Distributed Parallel and Cluster Computing Computer Science - Data Structures and Algorithms Computer Science::Networking and Internet Architecture Data Structures and Algorithms (cs.DS) Distributed Parallel and Cluster Computing (cs.DC) Computer Science::Distributed Parallel and Cluster Computing MathematicsofComputing_DISCRETEMATHEMATICS |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|