Towards worst-case churn resistant peer-to-peer systems

DOI10.1007/s00446-010-0099-zzbMath1267.68069OpenAlexW2159863405MaRDI QIDQ2377141

Stefan Schmid, Roger Wattenhofer, Fabian Kuhn

Publication date: 28 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-010-0099-z

zbMATH Keywords

fault-tolerancedynamic networkschurnpeer-to-peeroverlay network

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (5)

Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks ⋮ Towards a universal approach for the finite departure problem in overlay networks ⋮ Towards a Universal Approach for the Finite Departure Problem in Overlay Networks ⋮ Unnamed Item ⋮ Distributed agreement in dynamic peer-to-peer networks

Uses Software

• Pastry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tiara: a self-stabilizing deterministic skip list and skip graph
• Towards a scalable and robust DHT
• A note on efficient aggregate queries in sensor networks
• Robust random number generation for peer-to-peer systems
• Deterministic SkipNet
• Group Action Graphs and Parallel Architectures
• Novel architectures for P2P applications
• How to spread adversarial nodes?
• A Self-stabilizing and Local Delaunay Graph Construction
• The Token Distribution Problem
• A group-theoretic model for symmetric interconnection networks
• Distributed Computing: A Locality-Sensitive Approach
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• Analysis of the evolution of peer-to-peer systems
• Computing separable functions via gossip
• A Distributed and Oblivious Heap
• Active and Concurrent Topology Maintenance
• Algorithms – ESA 2005

This page was built for publication: Towards worst-case churn resistant peer-to-peer systems