Towards establishing monotonic searchability in self-stabilizing data structures

DOI10.4230/LIPICS.OPODIS.2015.24MaRDI QIDQ5363815zbMATH OpenOpenAlexFDO

Authors Alexander Setzer, Thim Strothmann, Christian Scheideler

Publication date 29 September 2017

Full work available at URL https://arxiv.org/abs/1512.06593

zbMATH Keywords

monotonic searchabilitynode departurestopological self-stabilization

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Data structures (68P05)

Abstract: Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various problems like membership changes or faults. Various self-stabilizing overlay networks have already been proposed in recent years, which have the advantage of being able to recover from any illegal state, but none of these networks can give any guarantees on its functionality while the recovery process is going on. We initiate research on overlay networks that are not only self-stabilizing but that also ensure that searchability is maintained while the recovery process is going on, as long as there are no corrupted messages in the system. More precisely, once a search message from node $u$ to another node $v$ is successfully delivered, all future search messages from $u$ to $v$ succeed as well. We call this property monotonic searchability. We show that in general it is impossible to provide monotonic searchability if corrupted messages are present in the system, which justifies the restriction to system states without corrupted messages. Furthermore, we provide a self-stabilizing protocol for the line for which we can also show monotonic searchability. It turns out that even for the line it is non-trivial to achieve this property. Additionally, we extend our protocol to deal with node departures in terms of the Finite Departure Problem of Foreback et. al (SSS 2014). This makes our protocol even capable of handling node dynamics. This is the full version of a correspondent paper published at OPODIS'15.

Recommendations

• Towards a universal approach for monotonic searchability in self-stabilizing overlay networks
• Self-stabilizing overlays for high-dimensional monotonic searchability
• Self-stabilizing prefix tree based overlay networks
• Building self-stabilizing overlay networks with the transitive closure framework
• Network Scaffolding for Efficient Stabilization of the Chord Overlay Network

Cited in

(6)

• Towards a universal approach for monotonic searchability in self-stabilizing overlay networks
• Towards a universal approach for the finite departure problem in overlay networks
• A self-stabilizing hashed Patricia trie
• Self-stabilizing prefix tree based overlay networks
• A self-stabilizing hashed Patricia trie
• Self-stabilizing overlays for high-dimensional monotonic searchability

This page was built for publication: Towards establishing monotonic searchability in self-stabilizing data structures

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