Towards a universal approach for the finite departure problem in overlay networks

DOI10.1016/j.ic.2016.12.006zbMath1371.68039OpenAlexW2559872809MaRDI QIDQ2013592

Andreas Koutsopoulos, Christian Scheideler, Thim Strothmann

Publication date: 8 August 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2016.12.006

zbMATH Keywords

distributed systemsself-stabilizationoverlay networksprocess departures

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)

Related Items (1)

On the Complexity of Local Graph Transformations

Cites Work

• Unnamed Item
• Unnamed Item
• Building self-stabilizing overlay networks with the transitive closure framework
• Corona: a stabilizing deterministic message-passing skip list
• Spanders: distributed spanning expanders
• Tiara: a self-stabilizing deterministic skip list and skip graph
• Re-Chord: a self-stabilizing chord overlay network
• Stabilization, safety, and security of distributed systems. 13th international symposium, SSS 2011, Grenoble, France, October 10--12, 2011. Proceedings
• Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs
• The forgiving graph: a distributed data structure for low stretch under adversarial attack
• HyperTree for self-stabilizing peer-to-peer systems
• A note on the parallel runtime of self-stabilizing graph linearization
• Towards worst-case churn resistant peer-to-peer systems
• Impossibility of distributed consensus with one faulty process
• Self-stabilizing systems in spite of distributed control
• Viceroy
• Linearization: Locally Self-Stabilizing Sorting in Graphs
• SKIP ⁺

This page was built for publication: Towards a universal approach for the finite departure problem in overlay networks