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

DOI10.1016/J.IC.2016.12.006MaRDI QIDQ2013592zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Towards a universal approach for the finite departure problem in overlay networks
• On Stabilizing Departures in Overlay Networks
• Relays: a new approach for the finite departure problem in overlay networks
• Building self-stabilizing overlay networks with the transitive closure framework
• Towards establishing monotonic searchability in self-stabilizing data structures

Cites work

• scientific article; zbMATH DE number 2079362 (Why is no real title available?)
• A note on the parallel runtime of self-stabilizing graph linearization
• Building self-stabilizing overlay networks with the transitive closure framework
• Corona: a stabilizing deterministic message-passing skip list
• HyperTree for self-stabilizing peer-to-peer systems
• Impossibility of distributed consensus with one faulty process
• Linearization: locally self-stabilizing sorting in graphs
• Re-Chord: a self-stabilizing chord overlay network
• Self-stabilizing systems in spite of distributed control
• Spanders: distributed spanning expanders
• Stabilization, safety, and security of distributed systems. 13th international symposium, SSS 2011, Grenoble, France, October 10--12, 2011. Proceedings
• The forgiving graph: a distributed data structure for low stretch under adversarial attack
• The hyperring: a low-congestion deterministic data structure for distributed environments
• Tiara: a self-stabilizing deterministic skip list and skip graph
• Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs
• Towards worst-case churn resistant peer-to-peer systems
• Viceroy, a scalable and dynamic emulation of the butterfly
• \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph

Cited in

(4)

• Towards a universal approach for the finite departure problem in overlay networks
• On the Complexity of Local Graph Transformations
• On Stabilizing Departures in Overlay Networks
• Relays: a new approach for the finite departure problem in overlay networks

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

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