@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},
}
@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{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) },
keyword = {greedy routing, ad hoc networks, convex hulls, c-competitiveness},
location = {Helsinki},
publisher = {Springer},
title = {{Competitive Routing in Hybrid Communication Networks}},
year = {2018},
}
@inproceedings{105,
abstract = {We initiate the study of network monitoring algorithms in a class of hybrid networks in which the nodes are connected by an external network and an internal network (as a short form for externally and internally controlled network). While the external network lies outside of the control of the nodes (or in our case, the monitoring protocol running in them) and might be exposed to continuous changes, the internal network is fully under the control of the nodes. As an example, consider a group of users with mobile devices having access to the cell phone infrastructure. While the network formed by the WiFi connections of the devices is an external network (as its structure is not necessarily under the control of the monitoring protocol), the connections between the devices via the cell phone infrastructure represent an internal network (as it can be controlled by the monitoring protocol). Our goal is to continuously monitor properties of the external network with the help of the internal network. We present scalable distributed algorithms that efficiently monitor the number of edges, the average node degree, the clustering coefficient, the bipartiteness, and the weight of a minimum spanning tree. Their performance bounds demonstrate that monitoring the external network state with the help of an internal network can be done much more efficiently than just using the external network, as is usually done in the literature.},
author = {Gmyr, Robert and Hinnenthal, Kristian and Scheideler, Christian and Sohler, Christian},
booktitle = {Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)},
pages = {137:1----137:15},
title = {{Distributed Monitoring of Network Properties: The Power of Hybrid Networks}},
doi = {10.4230/LIPIcs.ICALP.2017.137},
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},
}
@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},
}
@inproceedings{125,
abstract = {Searching for other participants is one of the most important operations in a distributed system.We are interested in topologies in which it is possible to route a packet in a fixed number of hops until it arrives at its destination.Given a constant $d$, this paper introduces a new self-stabilizing protocol for the $q$-ary $d$-dimensional de Bruijn graph ($q = \sqrt[d]{n}$) that is able to route any search request in at most $d$ hops w.h.p., while significantly lowering the node degree compared to the clique: We require nodes to have a degree of $\mathcal O(\sqrt[d]{n})$, which is asymptotically optimal for a fixed diameter $d$.The protocol keeps the expected amount of edge redirections per node in $\mathcal O(\sqrt[d]{n})$, when the number of nodes in the system increases by factor $2^d$.The number of messages that are periodically sent out by nodes is constant.},
author = {Feldmann, Michael and Scheideler, Christian},
booktitle = {Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)},
isbn = {978-3-319-69083-4},
pages = {250--264 },
publisher = {Springer, Cham},
title = {{A Self-Stabilizing General De Bruijn Graph}},
doi = {10.1007/978-3-319-69084-1_17},
volume = {10616},
year = {2017},
}
@article{1814,
author = {Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik},
journal = {Theor. Comput. Sci.},
pages = {56----68},
title = {{Universal coating for programmable matter}},
doi = {10.1016/j.tcs.2016.02.039},
year = {2017},
}
@inproceedings{1815,
author = {J. Daymude, Joshua and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik},
booktitle = {Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers},
pages = {127----140},
title = {{Improved Leader Election for Self-organizing Programmable Matter}},
doi = {10.1007/978-3-319-72751-6_10},
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},
}
@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{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{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},
}