Towards a Universal Approach for the Finite Departure Problem in Overlay Networks

DOI10.1007/978-3-319-21741-3_14zbMath1428.68078OpenAlexW2280742765MaRDI QIDQ5207914

Andreas Koutsopoulos, Thim Strothmann, Christian Scheideler

Publication date: 14 January 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21741-3_14

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Cites Work

• Building self-stabilizing overlay networks with the transitive closure framework
• Spanders: distributed spanning expanders
• Tiara: a self-stabilizing deterministic skip list and skip graph
• Re-Chord: a self-stabilizing chord overlay network
• Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs
• Towards a scalable and robust DHT
• The forgiving graph: a distributed data structure for low stretch under adversarial attack
• Towards worst-case churn resistant peer-to-peer systems
• Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
• How to spread adversarial nodes?
• Impossibility of distributed consensus with one faulty process
• Unreliable failure detectors for reliable distributed systems
• Skip graphs
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• Viceroy
• Unnamed Item