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

DOI10.1007/S00446-010-0099-ZMaRDI QIDQ2377141zbMATH OpenOpenAlexFDO

Authors Fabian Kuhn, Stefan Schmid, Roger Wattenhofer

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

churndynamic networksfault-toleranceoverlay networkpeer-to-peer

Mathematics Subject Classification ID

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

Recommendations

• Failure recovery for structured p2p networks: protocol design and performance under churn
• Peer-to-Peer Gradient Topologies in Networks With Churn
• Distributed Computing – IWDC 2005
• Analyzing and enhancing the resilience of structured peer-to-peer systems

Cites work

• A Distributed and Oblivious Heap
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• A group-theoretic model for symmetric interconnection networks
• A note on efficient aggregate queries in sensor networks
• A self-stabilizing and local Delaunay graph construction
• Active and Concurrent Topology Maintenance
• Algorithms – ESA 2005
• Analysis of the evolution of peer-to-peer systems
• Computing separable functions via gossip
• Deterministic SkipNet
• Distributed Computing: A Locality-Sensitive Approach
• Group Action Graphs and Parallel Architectures
• How to spread adversarial nodes?
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2080852 (Why is no real title available?)
• scientific article; zbMATH DE number 1931807 (Why is no real title available?)
• scientific article; zbMATH DE number 1931813 (Why is no real title available?)
• scientific article; zbMATH DE number 2119648 (Why is no real title available?)
• Novel architectures for P2P applications: the continuous-discrete approach
• Robust random number generation for peer-to-peer systems
• The hyperring: a low-congestion deterministic data structure for distributed environments
• The Token Distribution Problem
• Tiara: a self-stabilizing deterministic skip list and skip graph
• Towards a scalable and robust DHT

Cited in

(13)

• Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
• Towards a universal approach for the finite departure problem in overlay networks
• Distributed agreement in dynamic peer-to-peer networks
• Building resilient low-diameter peer-to-peer topologies
• Analyzing and enhancing the resilience of structured peer-to-peer systems
• Failure recovery for structured p2p networks: protocol design and performance under churn
• scientific article; zbMATH DE number 1947402 (Why is no real title available?)
• Peer-to-Peer Gradient Topologies in Networks With Churn
• Analysis of the evolution of peer-to-peer systems
• Towards a universal approach for the finite departure problem in overlay networks
• Towards robust and efficient computation in dynamic peer-to-peer networks
• Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks
• Monitoring churn in wireless networks

Describes a project that uses

Uses Software

• Pastry

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377141)