@inproceedings{6976,
abstract = {We investigate the maintenance of overlay networks under massive churn, i.e.
nodes joining and leaving the network. We assume an adversary that may churn a
constant fraction $\alpha n$ of nodes over the course of $\mathcal{O}(\log n)$
rounds. In particular, the adversary has an almost up-to-date information of
the network topology as it can observe an only slightly outdated topology that
is at least $2$ rounds old. Other than that, we only have the provably minimal
restriction that new nodes can only join the network via nodes that have taken
part in the network for at least one round.
Our contributions are as follows: First, we show that it is impossible to
maintain a connected topology if adversary has up-to-date information about the
nodes' connections. Further, we show that our restriction concerning the join
is also necessary. As our main result present an algorithm that constructs a
new overlay- completely independent of all previous overlays - every $2$
rounds. Furthermore, each node sends and receives only $\mathcal{O}(\log^3 n)$
messages each round. As part of our solution we propose the Linearized DeBruijn
Swarm (LDS), a highly churn resistant overlay, which will be maintained by the
algorithm. However, our approaches can be transferred to a variety of classical
P2P Topologies where nodes are mapped into the $[0,1)$-interval.},
author = {Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian},
booktitle = {Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)},
location = {Rio de Janeiro, Brazil},
publisher = {IEEE},
title = {{Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary}},
year = {2019},
}
@inproceedings{8871,
author = {Augustine, John and Ghaffari, Mohsen and Gmyr, Robert and Hinnenthal, Kristian and Kuhn, Fabian and Li, Jason and Scheideler, Christian},
booktitle = {Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures},
pages = {69----79},
publisher = {ACM},
title = {{Distributed Computation in Node-Capacitated Networks}},
doi = {10.1145/3323165.3323195},
year = {2019},
}
@misc{10271,
author = {N., N.},
title = {{Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves}},
year = {2019},
}
@inproceedings{10586,
abstract = {We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio.},
author = {Scheideler, Christian and Setzer, Alexander},
keyword = {Graphs transformations, NP-hardness, approximation algorithms},
pages = {150:1----150:14},
publisher = {Dagstuhl Publishing},
title = {{On the Complexity of Local Graph Transformations}},
doi = {10.4230/LIPICS.ICALP.2019.150},
volume = {132},
year = {2019},
}
@inproceedings{8534,
abstract = {We propose two protocols for distributed priority queues (denoted by 'heap' for simplicity in this paper) called SKEAP and SEAP. SKEAP realizes a distributed heap for a constant amount of priorities and SEAP one for an arbitrary amount. Both protocols build on an overlay, which induces an aggregation tree on which heap operations are aggregated in batches, ensuring that our protocols scale even for a high rate of incoming requests. As part of SEAP we provide a novel distributed protocol for the k-selection problem that runs in time O(log n) w.h.p. SKEAP guarantees sequential consistency for its heap operations, while SEAP guarantees serializability. SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations.
SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations with SEAP having to use only O(log n) bit messages.},
author = {Feldmann, Michael and Scheideler, Christian},
booktitle = {Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
pages = {287----296},
publisher = {ACM},
title = {{Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities}},
doi = {10.1145/3323165.3323193},
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)},
title = {{A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory}},
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},
keyword = {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{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},
}
@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{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{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{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{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{4375,
abstract = {We present a peer-to-peer network that supports the efficient processing of orthogonal range queries $R=\bigtimes_{i=1}^{d}[a_i,\,b_i]$ in a $d$-dimensional point space.\\
The network is the same for each dimension, namely a distance halving network like the one introduced by Naor and Wieder (ACM TALG'07).
We show how to execute such range queries using $\mathcal{O}\left(2^{d'}d\,\log m + d\,|R|\right)$ hops (and the same number of messages) in total. Here $[m]^d$ is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.
Furthermore, if the peers form a distributed network, the query can be answered in $\mathcal{O}\left(d\,\log m + d\,\sum_{i=1}^{d}(b_i-a_i+1)\right)$ communication rounds.
Our algorithms are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers.},
author = {Benter, Markus and Knollmann, Till and Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik},
booktitle = {Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)},
keyword = {Distributed Storage, Multi-Dimensional Range Queries, Peer-to-Peer, Hilbert Curve},
location = {Helsinki},
title = {{A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension}},
doi = {10.1007/978-3-030-19759-9_4},
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},
}
@proceedings{3874,
editor = {Scheideler, Christian and Fineman, Jeremy T.},
isbn = {978-1-4503-5799-9},
location = {Vienna, Austria},
publisher = {ACM},
title = {{Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures}},
year = {2018},
}
@phdthesis{1138,
author = {Gmyr, Robert},
publisher = {Universität Paderborn},
title = {{Distributed Algorithms for Overlay Networks and Programmable Matter}},
doi = {10.17619/UNIPB/1-265},
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},
}