TY - CONF
AU - Castenow, Jannik
AU - Kolb, Christina
AU - Scheideler, Christian
ID - 15169
T2 - Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)
TI - A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
ER -
TY - CONF
AB - 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.
AU - Götte, Thorsten
AU - Vijayalakshmi, Vipin Ravindran
AU - Scheideler, Christian
ID - 6976
T2 - Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)
TI - Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary
ER -
TY - CONF
AU - Augustine, John
AU - Ghaffari, Mohsen
AU - Gmyr, Robert
AU - Hinnenthal, Kristian
AU - Kuhn, Fabian
AU - Li, Jason
AU - Scheideler, Christian
ID - 8871
T2 - Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures
TI - Distributed Computation in Node-Capacitated Networks
ER -
TY - CONF
AU - Hinnenthal, Kristian
AU - Scheideler, Christian
AU - Struijs, Martijn
ID - 13652
T2 - 33rd International Symposium on Distributed Computing (DISC 2019)
TI - Fast Distributed Algorithms for LP-Type Problems of Low Dimension
ER -
TY - CONF
AU - Augustine, John
AU - Hinnenthal, Kristian
AU - Kuhn, Fabian
AU - Scheideler, Christian
AU - Schneider, Philipp
ID - 15627
SN - 9781611975994
T2 - Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
TI - Shortest Paths in a Hybrid Network Model
ER -
TY - JOUR
AU - Gmyr, Robert
AU - Lefevre, Jonas
AU - Scheideler, Christian
ID - 14830
IS - 2
JF - Theory Comput. Syst.
TI - Self-Stabilizing Metric Graphs
VL - 63
ER -
TY - CONF
AB - Self-stabilizing overlay networks have the advantage of being able to recover from illegal states and faults.
However, the majority of these networks cannot give any guarantees on their functionality while the recovery process is going on.
We are especially interested in searchability, i.e., the functionality that search messages for a specific node are answered successfully if a node exists in the network.
In this paper we investigate overlay networks that ensure the maintenance of monotonic searchability while the self-stabilization is going on.
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.
We extend the existing research by focusing on skip graphs and present a solution for two scenarios: (i) the goal topology is a super graph of the perfect skip graph and (ii) the goal topology is exactly the perfect skip graph.
AU - Luo, Linghui
AU - Scheideler, Christian
AU - Strothmann, Thim Frederik
ID - 7636
T2 - Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)
TI - MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability
ER -
TY - CONF
AB - 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.
AU - Scheideler, Christian
AU - Setzer, Alexander
ID - 10586
KW - Graphs transformations
KW - NP-hardness
KW - approximation algorithms
T2 - Proceedings of the 46th International Colloquium on Automata, Languages, and Programming
TI - On the Complexity of Local Graph Transformations
VL - 132
ER -
TY - CHAP
AU - Daymude, Joshua J.
AU - Hinnenthal, Kristian
AU - Richa, Andréa W.
AU - Scheideler, Christian
ID - 9599
T2 - Distributed Computing by Mobile Entities, Current Research in Moving and Computing.
TI - Computing by Programmable Particles
ER -
TY - CONF
AU - Götte, Thorsten
AU - Hinnenthal, Kristian
AU - Scheideler, Christian
ID - 12944
T2 - Structural Information and Communication Complexity
TI - Faster Construction of Overlay Networks
ER -