@inproceedings{215, abstract = {{We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems.}}, author = {{Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}}, booktitle = {{Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, pages = {{417----427}}, title = {{{Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}}}, doi = {{10.1145/2935764.2935783}}, year = {{2016}}, } @article{1835, author = {{Schmid, Stefan and Avin, Chen and Scheideler, Christian and Borokhovich, Michael and Haeupler, Bernhard and Lotker, Zvi}}, journal = {{IEEE/ACM Trans. Netw.}}, number = {{3}}, pages = {{1421----1433}}, title = {{{SplayNet: Towards Locally Self-Adjusting Networks}}}, doi = {{10.1109/TNET.2015.2410313}}, year = {{2016}}, } @inproceedings{1836, author = {{Derakhshandeh, Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}}, booktitle = {{DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings}}, pages = {{148----164}}, title = {{{On the Runtime of Universal Coating for Programmable Matter}}}, doi = {{10.1007/978-3-319-43994-5_10}}, volume = {{9818}}, year = {{2016}}, } @inproceedings{1837, author = {{Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}}, booktitle = {{Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016}}, pages = {{289----299}}, publisher = {{ACM}}, title = {{{Universal Shape Formation for Programmable Matter}}}, doi = {{10.1145/2935764.2935784}}, year = {{2016}}, } @inbook{1845, author = {{W. Richa, Andrea and Scheideler, Christian}}, booktitle = {{Encyclopedia of Algorithms}}, pages = {{999----1002}}, title = {{{Jamming-Resistant MAC Protocols for Wireless Networks}}}, doi = {{10.1007/978-1-4939-2864-4_593}}, year = {{2016}}, } @inproceedings{155, abstract = {{We present a self-stabilizing algorithm for overlay networks that, for an arbitrary metric given by a distance oracle, constructs the graph representing that metric. The graph representing a metric is the unique minimal undirected graph such that for any pair of nodes the length of a shortest path between the nodes corresponds to the distance between the nodes according to the metric. The algorithm works under both an asynchronous and a synchronous daemon. In the synchronous case, the algorithm stablizes in time O(n) and it is almost silent in that after stabilization a node sends and receives a constant number of messages per round.}}, author = {{Gmyr, Robert and Lefèvre, Jonas and Scheideler, Christian}}, booktitle = {{Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}}, pages = {{248----262}}, title = {{{Self-stabilizing Metric Graphs}}}, doi = {{10.1007/978-3-319-49259-9_20}}, year = {{2016}}, } @inproceedings{142, abstract = {{For overlay networks, the ability to recover from a variety of problems like membership changes or faults is a key element to preserve their functionality. In recent years, various self-stabilizing overlay networks have been proposed that have the advantage of being able to recover from any illegal state. However, the vast majority of these networks cannot give any guarantees on its functionality while the recovery process is going on. We are especially interested in searchability, i.e., the functionality that search messages for a specific identifier are answered successfully if a node with that identifier exists in the network. We investigate overlay networks that are not only self-stabilizing but that also ensure that monotonic 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. Monotonic searchability was recently introduced in OPODIS 2015, in which the authors provide a solution for a simple line topology.We present the first universal approach to maintain monotonic searchability that is applicable to a wide range of topologies. As the base for our approach, we introduce a set of primitives for manipulating overlay networks that allows us to maintain searchability and show how existing protocols can be transformed to use theses primitives.We complement this result with a generic search protocol that together with the use of our primitives guarantees monotonic searchability.As an additional feature, searching existing nodes with the generic search protocol is as fast as searching a node with any other fixed routing protocol once the topology has stabilized.}}, author = {{Scheideler, Christian and Setzer, Alexander and Strothmann, Thim Frederik}}, booktitle = {{Proceedings of the 30th International Symposium on Distributed Computing (DISC)}}, pages = {{71----84}}, title = {{{Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks}}}, doi = {{10.1007/978-3-662-53426-7_6}}, year = {{2016}}, } @article{3872, abstract = {{This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. So far, this problem is understood only in simplistic single-hop or unit disk graph models. We in this paper initiate the study of MAC protocols for the SINR interference model (a.k.a. physical model). This paper makes two contributions. First, we introduce a new adversarial SINR model which captures a wide range of interference phenomena. Concretely, we consider a powerful, adaptive adversary which can jam nodes at arbitrary times and which is only limited by some energy budget. Our second contribution is a distributed MAC protocol called Sade which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures that a constant fraction of the non-blocked time periods is used for successful transmissions.}}, author = {{Ogierman, Adrian and Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}}, issn = {{0178-2770}}, journal = {{Distributed Computing}}, number = {{3}}, pages = {{241--254}}, publisher = {{Springer Nature}}, title = {{{Sade: competitive MAC under adversarial SINR}}}, doi = {{10.1007/s00446-017-0307-1}}, volume = {{31}}, year = {{2017}}, } @article{1812, author = {{Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}}, journal = {{Inf. Comput.}}, pages = {{408----424}}, title = {{{Towards a universal approach for the finite departure problem in overlay networks}}}, doi = {{10.1016/j.ic.2016.12.006}}, year = {{2017}}, } @article{1813, author = {{P. Fekete, Sandor and W. Richa, Andrea and Römer, Kay and Scheideler, Christian}}, journal = {{SIGACT News}}, number = {{2}}, pages = {{87----94}}, title = {{{Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271}}}, doi = {{10.1145/3106700.3106713}}, year = {{2017}}, }