@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{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}},
}
@inbook{9599,
author = {{Daymude, Joshua J. and Hinnenthal, Kristian and Richa, Andréa W. and Scheideler, Christian}},
booktitle = {{Distributed Computing by Mobile Entities, Current Research in Moving and Computing.}},
pages = {{615--681}},
publisher = {{Springer, Cham}},
title = {{{Computing by Programmable Particles}}},
doi = {{https://doi.org/10.1007/978-3-030-11072-7_22}},
year = {{2019}},
}
@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{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}},
booktitle = {{Proceedings of the 46th International Colloquium on Automata, Languages, and Programming}},
keywords = {{Graphs transformations, NP-hardness, approximation algorithms}},
location = {{Patras, Greece}},
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{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}},
}