@inproceedings{12944,
author = {{Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian}},
booktitle = {{Structural Information and Communication Complexity}},
title = {{{Faster Construction of Overlay Networks}}},
doi = {{10.1007/978-3-030-24922-9_18}},
year = {{2019}},
}
@inproceedings{15627,
author = {{Augustine, John and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp}},
booktitle = {{Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms}},
isbn = {{9781611975994}},
pages = {{1280--1299}},
title = {{{Shortest Paths in a Hybrid Network Model}}},
doi = {{10.1137/1.9781611975994.78}},
year = {{2019}},
}
@article{14830,
author = {{Gmyr, Robert and Lefevre, Jonas and Scheideler, Christian}},
journal = {{Theory Comput. Syst.}},
number = {{2}},
pages = {{177--199}},
title = {{{Self-Stabilizing Metric Graphs}}},
doi = {{10.1007/s00224-017-9823-4}},
volume = {{63}},
year = {{2019}},
}
@inproceedings{14539,
author = {{Castenow, Jannik and Kolb, Christina and Scheideler, Christian}},
booktitle = {{Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}},
location = {{L'Aquila, Italy}},
pages = {{345--348}},
title = {{{A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}}},
doi = {{10.1007/978-3-030-24922-9\_26}},
year = {{2019}},
}
@inproceedings{13182,
abstract = {{We consider congestion control in peer-to-peer distributed systems.
The problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers (called \emph{clients} in this paper) that want to send messages to a fixed common peer (called \emph{server} in this paper).
We assume that each client $v \in V$ sends a message with probability $p(v) \in [0,1)$ and the server has a capacity of $\sigma \in \mathbb{N}$, i.e., it can recieve at most $\sigma$ messages per round and excess messages are dropped.
The server can modify these probabilities when clients send messages.
Ideally, we wish to converge to a state with $\sum p(v) = \sigma$ and $p(v) = p(w)$ for all $v,w \in V$.
We propose a \emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state.
Our protocol lets the system converge from \emph{any} initial state to a state where $\sum p(v) \in \left[\sigma \pm \epsilon\right]$ and $|p(v)-p(w)| \in O(\frac{1}{n})$.
This property is then maintained for $\Omega(n^{\mathfrak{c}})$ rounds in expectation.
In particular, the initial client probabilities and server variables are not necessarily well-defined, i.e., they may have arbitrary values.
Our protocol uses only $O(W + \log n)$ bits of memory where $W$ is length of node identifiers, making it very lightweight.
Finally we state a lower bound on the convergence time an see that our protocol performs asymptotically optimal (up to some polylogarithmic factor).
}},
author = {{Feldmann, Michael and Götte, Thorsten and Scheideler, Christian}},
booktitle = {{Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}},
pages = {{149--164}},
publisher = {{Springer, Cham}},
title = {{{A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory}}},
doi = {{https://doi.org/10.1007/978-3-030-34992-9_13}},
year = {{2019}},
}
@inproceedings{13652,
author = {{Hinnenthal, Kristian and Scheideler, Christian and Struijs, Martijn}},
booktitle = {{33rd International Symposium on Distributed Computing (DISC 2019)}},
title = {{{Fast Distributed Algorithms for LP-Type Problems of Low Dimension}}},
doi = {{10.4230/LIPICS.DISC.2019.23}},
year = {{2019}},
}
@inproceedings{3422,
abstract = {{We study the consensus problem in a synchronous distributed system of n nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing that any consensus algorithm that is resilient against a linear number of crash faults requires $\tilde \Omega(\sqrt n)$ rounds in an n-node network against an adaptive adversary, we consider a late adaptive adversary, who has full knowledge of the network state at the beginning of the previous round and unlimited computational power, but is oblivious to the current state of the nodes.
Our main contributions are randomized distributed algorithms that achieve consensus with high probability among all except a small constant fraction of the nodes (i.e., "almost-everywhere'') against a late adaptive adversary who can block up to ε n$ nodes in each round, for a small constant ε >0$. Our first protocol achieves binary almost-everywhere consensus and also guarantees a decision on the majority input value, thus ensuring plurality consensus. We also present an algorithm that achieves the same time complexity for multi-value consensus. Both of our algorithms succeed in $O(log n)$ rounds with high probability, thus showing an exponential gap to the $\tilde\Omega(\sqrt n)$ lower bound of Ben-Or and Bar-Joseph for strongly adaptive crash-failure adversaries, which can be strengthened to $\Omega(n)$ when allowing the adversary to block nodes instead of permanently crashing them. Our algorithms are scalable to large systems as each node contacts only an (amortized) constant number of peers in each communication round. We show that our algorithms are optimal up to constant (resp.\ sub-logarithmic) factors by proving that every almost-everywhere consensus protocol takes $\Omega(log_d n)$ rounds in the worst case, where d is an upper bound on the number of communication requests initiated per node in each round. We complement our theoretical results with an experimental evaluation of the binary almost-everywhere consensus protocol revealing a short convergence time even against an adversary blocking a large fraction of nodes.}},
author = {{Robinson, Peter and Scheideler, Christian and Setzer, Alexander}},
booktitle = {{Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}},
isbn = {{978-1-4503-5799-9/18/07}},
keywords = {{distributed consensus, randomized algorithm, adaptive adversary, complexity lower bound}},
location = {{Wien}},
title = {{{Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary}}},
doi = {{10.1145/3210377.3210399}},
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)}},
keywords = {{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{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{5764,
author = {{Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian and Strothmann, Thim Frederik}},
booktitle = {{Proceedings of the 24th International Conference on DNA Computing and Molecular Programming}},
pages = {{122--138}},
publisher = {{Springer International Publishing}},
title = {{{Forming Tile Shapes with Simple Robots}}},
doi = {{10.1007/978-3-030-00030-1_8}},
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}},
}
@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}},
}