@misc{15770,
author = {Warner, Daniel},
title = {{On the complexity of local transformations in SDN overlays}},
year = {2020},
}
@proceedings{17839,
editor = {Scheideler, Christian and Spear, Michael},
isbn = {978-1-4503-6935-0},
publisher = {ACM},
title = {{SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020}},
doi = {10.1145/3350755},
year = {2020},
}
@article{16902,
abstract = {The maintenance of efficient and robust overlay networks is one
of the most fundamental and reoccurring themes in networking.
This paper presents a survey of state-of-the-art
algorithms to design and repair overlay networks in a distributed
manner. In particular, we discuss basic algorithmic primitives
to preserve connectivity, review algorithms for the fundamental
problem of graph linearization, and then survey self-stabilizing
algorithms for metric and scalable topologies.
We also identify open problems and avenues for future research.
},
author = {Feldmann, Michael and Scheideler, Christian and Schmid, Stefan},
journal = {ACM Computing Surveys},
publisher = {ACM},
title = {{Survey on Algorithms for Self-Stabilizing Overlay Networks}},
doi = {10.1145/3397190},
year = {2020},
}
@inproceedings{15169,
author = {Castenow, Jannik and Kolb, Christina and Scheideler, Christian},
booktitle = {Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)},
location = {Kolkata, Indien},
publisher = {ACM},
title = {{A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}},
year = {2020},
}
@inproceedings{16903,
abstract = {We consider the clock synchronization problem in the (discrete) beeping model: Given a network of $n$ nodes with each node having a clock value $\delta(v) \in \{0,\ldots T-1\}$, the goal is to synchronize the clock values of all nodes such that they have the same value in any round.
As is standard in clock synchronization, we assume \emph{arbitrary activations} for all nodes, i.e., the nodes start their protocol at an arbitrary round (not limited to $\{0,\ldots,T-1\}$).
We give an asymptotically optimal algorithm that runs in $4D + \Bigl\lfloor \frac{D}{\lfloor T/4 \rfloor} \Bigr \rfloor \cdot (T \mod 4) = O(D)$ rounds, where $D$ is the diameter of the network.
Once all nodes are in sync, they beep at the same round every $T$ rounds.
The algorithm drastically improves on the $O(T D)$-bound of \cite{firefly_sync} (where $T$ is required to be at least $4n$, so the bound is no better than $O(nD)$).
Our algorithm is very simple as nodes only have to maintain $3$ bits in addition to the $\lceil \log T \rceil$ bits needed to maintain the clock.
Furthermore we investigate the complexity of \emph{self-stabilizing} solutions for the clock synchronization problem: We first show lower bounds of $\Omega(\max\{T,n\})$ rounds on the runtime and $\Omega(\log(\max\{T,n\}))$ bits of memory required for any such protocol.
Afterwards we present a protocol that runs in $O(\max\{T,n\})$ rounds using at most $O(\log(\max\{T,n\}))$ bits at each node, which is asymptotically optimal with regards to both, runtime and memory requirements.},
author = {Feldmann, Michael and Khazraei, Ardalan and Scheideler, Christian},
booktitle = {Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
publisher = {ACM},
title = {{Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model}},
doi = {10.1145/3350755.3400246},
year = {2020},
}
@proceedings{17836,
editor = {Werneck Richa, Andrea and Scheideler, Christian},
isbn = {978-3-030-54920-6},
publisher = {Springer},
title = {{Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings}},
doi = {10.1007/978-3-030-54921-3},
volume = {12156},
year = {2020},
}
@inproceedings{13652,
author = {Hinnenthal, Kristian and Scheideler, Christian and Struijs, Martijn},
booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)},
title = {{Fast Distributed Algorithms for LP-Type Problems of Low Dimension}},
doi = {10.4230/LIPICS.DISC.2019.23},
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{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},
}
@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},
}