@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{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{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{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{1163,
abstract = {In this paper we present two major results:
First, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in~\cite{DBLP:conf/ispan/KothapalliS05}) by presenting a self-stabilizing supervised skip ring.
Secondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system.
That is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.
},
author = {Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik},
booktitle = {Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)},
keyword = {Topological Self-stabilization, Supervised Overlay, Publish-Subscribe System},
location = {Vancouver},
publisher = {IEEE},
title = {{Self-Stabilizing Supervised Publish-Subscribe Systems}},
doi = {10.1109/IPDPS.2018.00114},
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{1164,
abstract = {We propose a distributed protocol for a queue, called Skueue, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios.
Skueuecan be used in highly dynamic environments, through the addition of join and leave requests to the standard queue operations enqueue and dequeue.
Furthermore Skueue satisfies sequential consistency in the asynchronous message passing model.
Scalability is achieved by aggregating multiple requests to a batch, which can then be processed in a distributed fashion without hurting the queue semantics.
Operations in Skueue need a logarithmic number of rounds w.h.p. until they are processed, even under a high rate of incoming requests.},
author = {Feldmann, Michael and Scheideler, Christian and Setzer, Alexander},
booktitle = {Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)},
location = {Vancouver},
publisher = {IEEE},
title = {{Skueue: A Scalable and Sequentially Consistent Distributed Queue}},
doi = {10.1109/IPDPS.2018.00113},
year = {2018},
}
@article{1796,
author = {J. Daymude, Joshua and Derakhshandeh, Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik},
journal = {Natural Computing},
number = {1},
pages = {81----96},
title = {{On the runtime of universal coating for programmable matter}},
doi = {10.1007/s11047-017-9658-6},
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},
keyword = {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},
}
@techreport{5820,
abstract = {In this paper, we investigate the use of trusted execution environments (TEEs, such as Intel's SGX) for an anonymous communication infrastructure over untrusted networks.
For this, we present the general idea of exploiting trusted execution environments for the purpose of anonymous communication, including a continuous-time security framework that models strong anonymity guarantees in the presence of an adversary that observes all network traffic and can adaptively corrupt a constant fraction of participating nodes.
In our framework, a participating node can generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms, allowing both senders and receivers of messages to remain anonymous. We introduce a concrete construction, which shows viability of our TEE-based approach to anonymous communication. The construction draws from techniques from cryptography and overlay networks.
Our techniques are very general and can be used as a basis for future constructions with similar goals.},
author = {Blömer, Johannes and Bobolz, Jan and Scheideler, Christian and Setzer, Alexander},
title = {{Provably Anonymous Communication Based on Trusted Execution Environments}},
year = {2018},
}