@article{5984,
author = {{Scheideler, Christian}},
journal = {{Theor. Comput. Sci.}},
pages = {{1}},
title = {{{Preface}}},
doi = {{10.1016/j.tcs.2018.11.004}},
volume = {{751}},
year = {{2018}},
}
@inproceedings{5985,
author = {{Scheideler, Christian}},
booktitle = {{Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018}},
pages = {{1--2}},
title = {{{Relays: Towards a Link Layer for Robust and Secure Fog Computing}}},
doi = {{10.1145/3229774.3229781}},
year = {{2018}},
}
@inproceedings{5986,
author = {{Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian}},
booktitle = {{43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK}},
pages = {{52:1--52:15}},
title = {{{Shape Recognition by a Finite Automaton Robot}}},
doi = {{10.4230/LIPIcs.MFCS.2018.52}},
year = {{2018}},
}
@inproceedings{4411,
abstract = {{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 data structures.
Considering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact.
In this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys.
The data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table.
Especially, longest prefix matching for $x$ can be done in $\mathcal{O}(\log |x|)$ hash table read accesses.
We show how to maintain the structure in a self-stabilizing way.
Our protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys.}},
author = {{Knollmann, Till and Scheideler, Christian}},
booktitle = {{Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}},
editor = {{Izumi, Taisuke and Kuznetsov, Petr}},
keywords = {{Self-Stabilizing, Prefix Search, Distributed Data Structure}},
location = {{Tokyo}},
publisher = {{Springer, Cham}},
title = {{{A Self-Stabilizing Hashed Patricia Trie}}},
doi = {{10.1007/978-3-030-03232-6_1}},
volume = {{11201}},
year = {{2018}},
}
@inproceedings{4563,
abstract = {{Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion.
In this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\mathcal{O}\left(\log ^2 n\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work.
}},
author = {{Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}},
booktitle = {{Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) }},
keywords = {{greedy routing, ad hoc networks, convex hulls, c-competitiveness}},
location = {{Helsinki}},
publisher = {{Springer}},
title = {{{Competitive Routing in Hybrid Communication Networks}}},
year = {{2018}},
}
@inproceedings{4565,
author = {{Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}},
booktitle = {{Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)}},
isbn = {{9781450357999}},
location = {{Wien}},
publisher = {{ACM Press}},
title = {{{Brief Announcement: Competitive Routing in Hybrid Communication Networks}}},
doi = {{10.1145/3210377.3210663}},
year = {{2018}},
}
@inproceedings{4351,
abstract = {{ We extend the concept of monotonic searchability~\cite{DBLP:conf/opodis/ScheidelerSS15}~\cite{DBLP:conf/wdag/ScheidelerSS16} for self-stabilizing systems from one to multiple dimensions.
A system is self-stabilizing if it can recover to a legitimate state from any initial illegal state.
These kind of systems are most often used in distributed applications.
Monotonic searchability provides guarantees when searching for nodes while the recovery process is going on.
More precisely, if a search request started at some node $u$ succeeds in reaching its destination $v$, then all future search requests from $u$ to $v$ succeed as well.
Although there already exists a self-stabilizing protocol for a two-dimensional topology~\cite{DBLP:journals/tcs/JacobRSS12} and an universal approach for monotonic searchability~\cite{DBLP:conf/wdag/ScheidelerSS16}, it is not clear how both of these concepts fit together effectively.
The latter concept even comes with some restrictive assumptions on messages, which is not the case for our protocol.
We propose a simple novel protocol for a self-stabilizing two-dimensional quadtree that satisfies monotonic searchability.
Our protocol can easily be extended to higher dimensions and offers routing in $\mathcal O(\log n)$ hops for any search request.
}},
author = {{Feldmann, Michael and Kolb, Christina and Scheideler, Christian}},
booktitle = {{Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}},
pages = {{16--31 }},
publisher = {{Springer, Cham}},
title = {{{Self-stabilizing Overlays for high-dimensional Monotonic Searchability}}},
doi = {{10.1007/978-3-030-03232-6_2}},
volume = {{11201}},
year = {{2018}},
}
@inproceedings{5216,
abstract = {{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 connectivity. To rigorously study self-stabilizing solutions to this problem, the Finite Departure Problem (FDP) has been proposed [9]. In the FDP we are given a network of processes in an arbitrary state, and the goal is to eventually arrive at (and stay in) a state in which all leaving processes irrevocably decided to leave the system while for all weakly-connected components in the initial overlay network, all staying processes in that component will still form a weakly connected component. In the standard interconnection model, the FDP is known to be unsolvable by local control protocols, so oracles have been investigated that allow the problem to be solved [9]. To avoid the use of oracles, we introduce a new interconnection model based on relays. Despite the relay model appearing to be rather restrictive, we show that it is universal, i.e., it is possible to transform any weakly-connected topology into any other weakly-connected topology, which is important for being a useful interconnection model for overlay networks. Apart from this, our model allows processes to grant and revoke access rights, which is why we believe it to be of interest beyond the scope of this paper. We show how to implement the relay layer in a self-stabilizing way and identify properties protocols need to satisfy so that the relay layer can recover while serving protocol requests.}},
author = {{Scheideler, Christian and Setzer, Alexander}},
booktitle = {{Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}},
location = {{Tokyo, Japan}},
title = {{{Relays: A New Approach for the Finite Departure Problem in Overlay Networks}}},
doi = {{10.1007/978-3-030-03232-6_16}},
year = {{2018}},
}
@inproceedings{5222,
abstract = {{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 overlay edge between two nodes is the weighted length of their shortest path in the tree. We rigorously prove that our protocol works correctly under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes after O(N^2) asynchronous rounds where N is the number of nodes in the overlay. }},
author = {{GĂ¶tte, Thorsten and Scheideler, Christian and Setzer, Alexander}},
booktitle = {{Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}},
location = {{Tokyo, Japan}},
pages = {{50--64}},
publisher = {{Springer}},
title = {{{On Underlay-Aware Self-Stabilizing Overlay Networks}}},
volume = {{11201}},
year = {{2018}},
}
@inproceedings{7636,
abstract = {{Self-stabilizing overlay networks have the advantage of being able to recover from illegal states and faults.
However, the majority of these networks cannot give any guarantees on their functionality while the recovery process is going on.
We are especially interested in searchability, i.e., the functionality that search messages for a specific node are answered successfully if a node exists in the network.
In this paper we investigate overlay networks that ensure the maintenance of monotonic searchability while the self-stabilization is going on.
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 extend the existing research by focusing on skip graphs and present a solution for two scenarios: (i) the goal topology is a super graph of the perfect skip graph and (ii) the goal topology is exactly the perfect skip graph.
}},
author = {{Luo, Linghui and Scheideler, Christian and Strothmann, Thim Frederik}},
booktitle = {{Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)}},
location = {{Rio de Janeiro, Brazil}},
title = {{{MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability}}},
year = {{2019}},
}