4 citations · 7 across the 8 of their papers we have counts for
10 papers · 1 filter
A Self-Stabilizing Hashed Patricia Trie
Till Knollmann, Christian Scheideler
While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed d…
Always be Two Steps Ahead of Your Enemy
Thorsten Götte, Vipin Ravindran Vijayalakshmi, Christian Scheideler
We investigate the maintenance of overlay networks under massive churn, i.e. nodes joining and leaving the network. We assume an adversary that may churn a constant fraction o…
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
Jannik Castenow, Christina Kolb, Christian Scheideler
In this work, we present a new approach for competitive geometric routing in wireless ad hoc networks. In general, it is well-known that any online routing strategy performs very p…
Relays: A New Approach for the Finite Departure Problem in Overlay Networks
Christian Scheideler, Alexander Setzer
A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its co…
On Underlay-Aware Self-Stabilizing Overlay Networks
Thorsten Götte, Christian Scheideler, Alexander Setzer
We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an o…
Self-stabilizing Overlays for high-dimensional Monotonic Searchability
Michael Feldmann, Christina Kolb, Christian Scheideler
We extend the concept of monotonic searchability for self-stabilizing systems from one to multiple dimensions. A system is self-stabilizing if it can recover to a legitimate state…