TY - JOUR
AB - An elementary h-route ow, for an integer h 1, is a set of h edge- disjoint paths between a source and a sink, each path carrying a unit of ow, and an h-route ow is a non-negative linear combination of elementary h-routeows. An h-route cut is a set of edges whose removal decreases the maximum h-route ow between a given source-sink pair (or between every source-sink pair in the multicommodity setting) to zero. The main result of this paper is an approximate duality theorem for multicommodity h-route cuts and ows, for h 3: The size of a minimum h-route cut is at least f=h and at most O(log4 k f) where f is the size of the maximum h-routeow and k is the number of commodities. The main step towards the proof of this duality is the design and analysis of a polynomial-time approximation algorithm for the minimum h-route cut problem for h = 3 that has an approximation ratio of O(log4 k). Previously, polylogarithmic approximation was known only for h-route cuts for h 2. A key ingredient of our algorithm is a novel rounding technique that we call multilevel ball-growing. Though the proof of the duality relies on this algorithm, it is not a straightforward corollary of it as in the case of classical multicommodity ows and cuts. Similar results are shown also for the sparsest multiroute cut problem.
AU - Kolman, Petr
AU - Scheideler, Christian
ID - 476
IS - 2
JF - Theory of Computing Systems
TI - Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing
ER -
TY - CONF
AU - Derakhshandeh, Zahra
AU - Dolev, Shlomi
AU - Gmyr, Robert
AU - W. Richa, Andrea
AU - Scheideler, Christian
AU - Strothmann, Thim Frederik
ID - 1863
SN - 978-1-4503-2821-0
T2 - 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'14, Prague, Czech Republic - June 23 - 25, 2014
TI - Brief announcement: amoebot - a new model for programmable matter
ER -
TY - CONF
AB - In this work we present the first distributed storage system that is provably robust against crash failures issued by an adaptive adversary, i.e., for each batch of requests the adversary can decide based on the entire system state which servers will be unavailable for that batch of requests. Despite up to \gamma n^{1/\log\log n} crashed servers, with \gamma>0 constant and n denoting the number of servers, our system can correctly process any batch of lookup and write requests (with at most a polylogarithmic number of requests issued at each non-crashed server) in at most a polylogarithmic number of communication rounds, with at most polylogarithmic time and work at each server and only a logarithmic storage overhead. Our system is based on previous work by Eikel and Scheideler (SPAA 2013), who presented IRIS, a distributed information system that is provably robust against the same kind of crash failures. However, IRIS is only able to serve lookup requests. Handling both lookup and write requests has turned out to require major changes in the design of IRIS.
AU - Scheideler, Christian
AU - Setzer, Alexander
AU - Eikel, Martina
ID - 371
T2 - Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)
TI - RoBuSt: A Crash-Failure-Resistant Distributed Storage System
ER -
TY - CONF
AB - This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. While this problem has already been studied intensively for simplistic single-hop or unit disk graph models, we make a leap forward and study MAC protocols for the SINR interference model (a.k.a. the physical model). We make 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. The second contribution of this paper is a distributed MAC protocol 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.
AU - Ogierman, Adrian
AU - Richa, Andrea W.
AU - Scheideler, Christian
AU - Schmid, Stefan
AU - Zhang, Jin
ID - 446
T2 - Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM)
TI - Competitive MAC under adversarial SINR
ER -
TY - CONF
AB - In this survey article, we discuss two algorithmic research areas that emerge from problems that arise when resources are offered in the cloud. The first area, online leasing, captures problems arising from the fact that resources in the cloud are not bought, but leased by cloud vendors. The second area, Distributed Storage Systems, deals with problems arising from so-called cloud federations, i.e., when several cloud providers are needed to fulfill a given task.
AU - Kniesburges, Sebastian
AU - Markarian, Christine
AU - Meyer auf der Heide, Friedhelm
AU - Scheideler, Christian
ID - 459
T2 - Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)
TI - Algorithmic Aspects of Resource Management in the Cloud
ER -
TY - JOUR
AU - Jacob, Riko
AU - W. Richa, Andrea
AU - Scheideler, Christian
AU - Schmid, Stefan
AU - Täubig, Hanjo
ID - 1858
IS - 6
JF - J. ACM
TI - SKIP*: A Self-Stabilizing Skip Graph
ER -
TY - CONF
AB - In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates.
AU - Feldotto, Matthias
AU - Scheideler, Christian
AU - Graffi, Kalman
ID - 412
T2 - Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)
TI - HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths
ER -
TY - CONF
AB - We present a factor $14D^2$ approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where $D$ is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time $O(|E|)$ and is very easy to implement. Its divide-and-conquer approach allows for an effective parallelization. Note that a suitable decomposition can also be computed in time $O(|E|\log{|E|})$ (or even $O(\log{|E|}\log^*{|E|})$ on an EREW PRAM using $O(|E|)$ processors). For the proof of the approximation ratio, we use a sophisticated charging method that uses techniques similar to amortized analysis in advanced data structures. On general graphs, the minimum linear arrangement problem is known to be NP-hard. To the best of our knowledge, the minimum linear arrangement problem on series-parallel graphs has not been studied before.
AU - Scheideler, Christian
AU - Eikel, Martina
AU - Setzer, Alexander
ID - 397
T2 - Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)
TI - Minimum Linear Arrangement of Series-Parallel Graphs
ER -
TY - JOUR
AB - The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer systems in general. Chord, in particular, has been studied thoroughly, and many variants of Chord have been presented that optimize various criteria. Also, several implementations of Chord are available on various platforms. Though Chord is known to be very efficient and scalable and it can handle churn quite well, no protocol is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network can be recovered from any initial state in which the network is still weakly connected. This is not too surprising since it is known that the Chord network is not locally checkable for its current topology. We present a slight extension of the Chord network, called Re-Chord (reactive Chord), that turns out to be locally checkable, and we present a self-stabilizing distributed protocol for it that can recover the Re-Chord network from any initial state, in which the n peers are weakly connected, in O(nlogn) communication rounds. We also show that our protocol allows a new peer to join or an old peer to leave an already stable Re-Chord network so that within O(logn)^2) communication rounds the Re-Chord network is stable again.
AU - Kniesburges, Sebastian
AU - Koutsopoulos, Andreas
AU - Scheideler, Christian
ID - 378
IS - 3
JF - Theory of Computing Systems
TI - Re-Chord: A Self-stabilizing Chord Overlay Network
ER -
TY - CONF
AB - A fundamental problem for peer-to-peer systems is to maintain connectivity while nodes are leaving, i.e., the nodes requesting to leave the peer-to-peer system are excluded from the overlay network without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state initially. Surprisingly, the problem is not formally studied yet for the case in which the overlay network is in an arbitrary initial state, i.e., when looking for a self-stabilizing solution for excluding leaving nodes. We study this problem in two variants: the Finite Departure Problem (FDP) ) and the Finite Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when it is safe to leave the network, whereas in the FSP, this leaving decision does not have to be final: the nodes may resume computation if necessary. We show that there is no self-stabilizing distributed algorithm for the FDP, even in a synchronous message passing model. To allow a solution, we introduce an oracle called NIDEC and show that it is sufficient even for the asynchronous message passing model by proposing an algorithm that can solve the FDP using NIDEC. We also show that a solution to the FSP does not require an oracle.
AU - Foreback, Dianne
AU - Koutsopoulos, Andreas
AU - Nesterenko, Mikhail
AU - Scheideler, Christian
AU - Strothmann, Thim Frederik
ID - 393
T2 - Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems
TI - On Stabilizing Departures in Overlay Networks
ER -
TY - JOUR
AB - This article studies the design of medium access control (MAC) protocols for wireless networks that are provably robust against arbitrary and unpredictable disruptions (e.g., due to unintentional external interference from co-existing networks or due to jamming). We consider a wireless network consisting of a set of n honest and reliable nodes within transmission (and interference) range of each other, and we model the external disruptions with a powerful adaptive adversary. This adversary may know the protocol and its entire history and can use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1 − )-fraction of the timesteps, for an arbitrary constant > 0 unknown to the nodes. The nodes cannot distinguish between the adversarial jamming or a collision of two or more messages that are sent at the same time. We demonstrate, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant (asymptotically optimal) throughput for the nonjammed time periods under any of the aforementioned adversarial strategies. The derived principles are also useful to build robust applications on top of the MAC layer, and we present an exemplary study for leader election, one of the most fundamental tasks in distributed computing.
AU - Awerbuch, Baruch
AU - Richa, Andrea W.
AU - Scheideler, Christian
AU - Schmid, Stefan
AU - Zhang, Jin
ID - 387
IS - 4
JF - Transactions on Algorithms
TI - Principles of Robust Medium Access and an Application to Leader Election
ER -
TY - JOUR
AB - Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful network topologies. The goal is to devise distributed algorithms where nodes forward, insert, and delete links to neighboring nodes, and that converge quickly to such a desirable topology, independently of the initial network configuration. This article proposes a new model to study the parallel convergence time. Our model sheds light on the achievable parallelism by avoiding bottlenecks of existing models that can yield a distorted picture. As a case study, we consider local graph linearization—i.e., how to build a sorted list of the nodes of a connected graph in a distributed and self-stabilizing manner. In order to study the main structure and properties of our model, we propose two variants of a most simple local linearization algorithm. For each of these variants, we present analyses of the worst-case and bestcase parallel time complexities, as well as the performance under a greedy selection of the actions to be executed. It turns out that the analysis is non-trivial despite the simple setting, and to complement our formal insights we report on our experiments which indicate that the runtimes may be better in the average case.
AU - Gall, Dominik
AU - Jacob, Riko
AU - Richa, Andrea W.
AU - Scheideler, Christian
AU - Schmid, Stefan
AU - Täubig, Hanjo
ID - 464
IS - 1
JF - Theory of Computing Systems
TI - A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization
ER -
TY - CONF
AU - Derakhshandeh, Zahra
AU - Gmyr, Robert
AU - W. Richa, Andrea
AU - Scheideler, Christian
AU - Strothmann, Thim Frederik
ID - 1851
SN - 978-1-4503-3674-1
T2 - Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM' 15, Boston, MA, USA, September 21-22, 2015
TI - An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems
ER -
TY - CONF
AU - Derakhshandeh, Zahra
AU - Gmyr, Robert
AU - Strothmann, Thim Frederik
AU - A. Bazzi, Rida
AU - W. Richa, Andrea
AU - Scheideler, Christian
ID - 1852
SN - 978-1-4503-3617-8
T2 - Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\'{a}}n, Spain, July 21 - 23, 2015
TI - Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter
ER -
TY - JOUR
AB - We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the address of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)O(n)) or bits (O(nlogn)O(nlogn)) a node receives or sends coincides with the lower bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds.
AU - Kniesburges, Sebastian
AU - Koutsopoulos, Andreas
AU - Scheideler, Christian
ID - 327
JF - Theoretical Computer Science
TI - A deterministic worst-case message complexity optimal solution for resource discovery
ER -
TY - CONF
AB - Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various problems like membership changes or faults. Various self-stabilizing overlay networks have already been proposed in recent years, which have the advantage of being able to recover from any illegal state, but none of these networks can give any guarantees on its functionality while the recovery process is going on. We initiate research on overlay networks that are not only self-stabilizing but that also ensure that searchability is maintained while the recovery process is going on, as long as there are no corrupted messages in the system. 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 call this property monotonic searchability. We show that in general it is impossible to provide monotonic searchability if corrupted messages are present in the system, which justifies the restriction to system states without corrupted messages. Furthermore, we provide a self-stabilizing protocol for the line for which we can also show monotonic searchability. It turns out that even for the line it is non-trivial to achieve this property. Additionally, we extend our protocol to deal with node departures in terms of the Finite Departure Problem of Foreback et. al (SSS 2014). This makes our protocol even capable of handling node dynamics.
AU - Scheideler, Christian
AU - Setzer, Alexander
AU - Strothmann, Thim Frederik
ID - 241
T2 - Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)
TI - Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures
ER -
TY - CONF
AU - Koutsopoulos, Andreas
AU - Scheideler, Christian
AU - Strothmann, Thim Frederik
ID - 1853
SN - 978-1-4503-3588-1
T2 - Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015
TI - Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks
ER -
TY - JOUR
AB - In this work, we present the first scalable distributed information system, that is, a system with low storage overhead, that is provably robust against denial-of-service (DoS) attacks by a current insider. We allow a current insider to have complete knowledge about the information system and to have the power to block any ϵ-fraction of its servers by a DoS attack, where ϵ can be chosen up to a constant. The task of the system is to serve any collection of lookup requests with at most one per nonblocked server in an efficient way despite this attack. Previously, scalable solutions were only known for DoS attacks of past insiders, where a past insider only has complete knowledge about some past time point t0 of the information system. Scheideler et al. [Awerbuch and Scheideler 2007; Baumgart et al. 2009] showed that in this case, it is possible to design an information system so that any information that was inserted or last updated after t0 is safe against a DoS attack. But their constructions would not work at all for a current insider. The key idea behind our IRIS system is to make extensive use of coding. More precisely, we present two alternative distributed coding strategies with an at most logarithmic storage overhead that can handle up to a constant fraction of blocked servers.
AU - Eikel, Martina
AU - Scheideler, Christian
ID - 284
IS - 3
JF - Transactions on Parallel Computing
TI - IRIS: A Robust Information System Against Insider DoS Attacks
ER -
TY - CONF
AB - 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. There are a number of studies for safe node exclusion if the overlay is in a well-defined state, but almost no formal results are known for the case in which the overlay network is in an arbitrary initial state, i.e., when looking for a self-stabilizing solution for excluding leaving nodes. We study this problem in two variants: the Finite Departure Problem (FDP) and the Finite Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when it is safe to leave the network, whereas in the FSP, this leaving decision does not have to be final: the nodes may resume computation when woken up by an incoming message. We are the first to present a self-stabilizing protocol for the FDP and the FSP that can be combined with a large class of overlay maintenance protocols so that these are then guaranteed to safely exclude leaving nodes from the system from any initial state while operating as specified for the staying nodes. In order to formally define the properties these overlay maintenance protocols have to satisfy, we identify four basic primitives for manipulating edges in an overlay network that might be of independent interest.
AU - Koutsopoulos, Andreas
AU - Scheideler, Christian
AU - Strothmann, Thim Frederik
ID - 242
T2 - Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
TI - Towards a Universal Approach for the Finite Departure Problem in Overlay Networks
ER -
TY - CONF
AU - Derakhshandeh, Zahra
AU - Gmyr, Robert
AU - Strothmann, Thim Frederik
AU - A. Bazzi, Rida
AU - W. Richa, Andrea
AU - Scheideler, Christian
ID - 1850
SN - 978-3-319-21998-1
T2 - DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings
TI - Leader Election and Shape Formation with Self-organizing Programmable Matter
VL - 9211
ER -
TY - CONF
AB - 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.
AU - Gmyr, Robert
AU - Lefèvre, Jonas
AU - Scheideler, Christian
ID - 155
T2 - Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
TI - Self-stabilizing Metric Graphs
ER -
TY - CONF
AU - Derakhshandeh, Zahra
AU - Gmyr, Robert
AU - W. Richa, Andrea
AU - Scheideler, Christian
AU - Strothmann, Thim Frederik
ID - 1837
T2 - 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
TI - Universal Shape Formation for Programmable Matter
ER -
TY - CHAP
AU - W. Richa, Andrea
AU - Scheideler, Christian
ID - 1845
T2 - Encyclopedia of Algorithms
TI - Jamming-Resistant MAC Protocols for Wireless Networks
ER -
TY - CONF
AB - 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.
AU - Drees, Maximilian
AU - Gmyr, Robert
AU - Scheideler, Christian
ID - 215
T2 - Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
TI - Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
ER -
TY - JOUR
AU - Schmid, Stefan
AU - Avin, Chen
AU - Scheideler, Christian
AU - Borokhovich, Michael
AU - Haeupler, Bernhard
AU - Lotker, Zvi
ID - 1835
IS - 3
JF - IEEE/ACM Trans. Netw.
TI - SplayNet: Towards Locally Self-Adjusting Networks
ER -
TY - CONF
AB - For overlay networks, the ability to recover from a variety of problems like membership changes or faults is a key element to preserve their functionality. In recent years, various self-stabilizing overlay networks have been proposed that have the advantage of being able to recover from any illegal state. However, the vast majority of these networks cannot give any guarantees on its functionality while the recovery process is going on. We are especially interested in searchability, i.e., the functionality that search messages for a specific identifier are answered successfully if a node with that identifier exists in the network. We investigate overlay networks that are not only self-stabilizing but that also ensure that monotonic searchability is maintained while the recovery process is going on, as long as there are no corrupted messages in the system. 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. Monotonic searchability was recently introduced in OPODIS 2015, in which the authors provide a solution for a simple line topology.We present the first universal approach to maintain monotonic searchability that is applicable to a wide range of topologies. As the base for our approach, we introduce a set of primitives for manipulating overlay networks that allows us to maintain searchability and show how existing protocols can be transformed to use theses primitives.We complement this result with a generic search protocol that together with the use of our primitives guarantees monotonic searchability.As an additional feature, searching existing nodes with the generic search protocol is as fast as searching a node with any other fixed routing protocol once the topology has stabilized.
AU - Scheideler, Christian
AU - Setzer, Alexander
AU - Strothmann, Thim Frederik
ID - 142
T2 - Proceedings of the 30th International Symposium on Distributed Computing (DISC)
TI - Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks
ER -
TY - CONF
AU - Derakhshandeh, Zahra
AU - Gmyr, Robert
AU - Porter, Alexandra
AU - W. Richa, Andrea
AU - Scheideler, Christian
AU - Strothmann, Thim Frederik
ID - 1836
T2 - DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings
TI - On the Runtime of Universal Coating for Programmable Matter
VL - 9818
ER -
TY - CONF
AB - 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.
AU - Gmyr, Robert
AU - Hinnenthal, Kristian
AU - Scheideler, Christian
AU - Sohler, Christian
ID - 105
T2 - Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)
TI - Distributed Monitoring of Network Properties: The Power of Hybrid Networks
ER -
TY - JOUR
AU - P. Fekete, Sandor
AU - W. Richa, Andrea
AU - Römer, Kay
AU - Scheideler, Christian
ID - 1813
IS - 2
JF - SIGACT News
TI - Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271
ER -
TY - CONF
AB - 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.
AU - Feldmann, Michael
AU - Scheideler, Christian
ID - 125
SN - 978-3-319-69083-4
T2 - Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
TI - A Self-Stabilizing General De Bruijn Graph
VL - 10616
ER -
TY - JOUR
AU - Derakhshandeh, Zahra
AU - Gmyr, Robert
AU - W. Richa, Andrea
AU - Scheideler, Christian
AU - Strothmann, Thim Frederik
ID - 1814
JF - Theor. Comput. Sci.
TI - Universal coating for programmable matter
ER -
TY - JOUR
AB - 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.
AU - Ogierman, Adrian
AU - Richa, Andrea
AU - Scheideler, Christian
AU - Schmid, Stefan
AU - Zhang, Jin
ID - 3872
IS - 3
JF - Distributed Computing
SN - 0178-2770
TI - Sade: competitive MAC under adversarial SINR
VL - 31
ER -
TY - CONF
AU - J. Daymude, Joshua
AU - Gmyr, Robert
AU - W. Richa, Andrea
AU - Scheideler, Christian
AU - Strothmann, Thim Frederik
ID - 1815
T2 - 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
TI - Improved Leader Election for Self-organizing Programmable Matter
ER -
TY - JOUR
AU - Koutsopoulos, Andreas
AU - Scheideler, Christian
AU - Strothmann, Thim Frederik
ID - 1812
JF - Inf. Comput.
TI - Towards a universal approach for the finite departure problem in overlay networks
ER -
TY - CONF
AB - 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.
AU - Robinson, Peter
AU - Scheideler, Christian
AU - Setzer, Alexander
ID - 3422
KW - distributed consensus
KW - randomized algorithm
KW - adaptive adversary
KW - complexity lower bound
SN - 978-1-4503-5799-9/18/07
T2 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
TI - Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary
ER -
TY - CONF
AU - Gmyr, Robert
AU - Hinnenthal, Kristian
AU - Kostitsyna, Irina
AU - Kuhn, Fabian
AU - Rudolph, Dorian
AU - Scheideler, Christian
AU - Strothmann, Thim Frederik
ID - 5764
T2 - Proceedings of the 24th International Conference on DNA Computing and Molecular Programming
TI - Forming Tile Shapes with Simple Robots
ER -
TY - CONF
AU - Scheideler, Christian
ID - 5985
T2 - 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
TI - Relays: Towards a Link Layer for Robust and Secure Fog Computing
ER -
TY - CONF
AB - 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.
AU - Feldmann, Michael
AU - Kolb, Christina
AU - Scheideler, Christian
ID - 4351
T2 - Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
TI - Self-stabilizing Overlays for high-dimensional Monotonic Searchability
VL - 11201
ER -
TY - CONF
AB - 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.
AU - Götte, Thorsten
AU - Scheideler, Christian
AU - Setzer, Alexander
ID - 5222
T2 - Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)
TI - On Underlay-Aware Self-Stabilizing Overlay Networks
VL - 11201
ER -
TY - CONF
AU - Gmyr, Robert
AU - Hinnenthal, Kristian
AU - Kostitsyna, Irina
AU - Kuhn, Fabian
AU - Rudolph, Dorian
AU - Scheideler, Christian
ID - 5986
T2 - 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK
TI - Shape Recognition by a Finite Automaton Robot
ER -
TY - CONF
AU - Jung, Daniel
AU - Kolb, Christina
AU - Scheideler, Christian
AU - Sundermeier, Jannik
ID - 4565
SN - 9781450357999
T2 - Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)
TI - Brief Announcement: Competitive Routing in Hybrid Communication Networks
ER -
TY - CONF
AB - 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.
AU - Feldmann, Michael
AU - Kolb, Christina
AU - Scheideler, Christian
AU - Strothmann, Thim Frederik
ID - 1163
KW - Topological Self-stabilization
KW - Supervised Overlay
KW - Publish-Subscribe System
T2 - Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)
TI - Self-Stabilizing Supervised Publish-Subscribe Systems
ER -
TY - CONF
AB - 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.
AU - Scheideler, Christian
AU - Setzer, Alexander
ID - 5216
T2 - Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)
TI - Relays: A New Approach for the Finite Departure Problem in Overlay Networks
ER -
TY - CONF
AB - 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.
AU - Feldmann, Michael
AU - Scheideler, Christian
AU - Setzer, Alexander
ID - 1164
T2 - Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)
TI - Skueue: A Scalable and Sequentially Consistent Distributed Queue
ER -
TY - JOUR
AU - J. Daymude, Joshua
AU - Derakhshandeh, Zahra
AU - Gmyr, Robert
AU - Porter, Alexandra
AU - W. Richa, Andrea
AU - Scheideler, Christian
AU - Strothmann, Thim Frederik
ID - 1796
IS - 1
JF - Natural Computing
TI - On the runtime of universal coating for programmable matter
ER -
TY - CONF
AB - 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.
AU - Knollmann, Till
AU - Scheideler, Christian
ED - Izumi, Taisuke
ED - Kuznetsov, Petr
ID - 4411
KW - Self-Stabilizing
KW - Prefix Search
KW - Distributed Data Structure
T2 - Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
TI - A Self-Stabilizing Hashed Patricia Trie
VL - 11201
ER -
TY - GEN
AB - 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.
AU - Blömer, Johannes
AU - Bobolz, Jan
AU - Scheideler, Christian
AU - Setzer, Alexander
ID - 5820
TI - Provably Anonymous Communication Based on Trusted Execution Environments
ER -
TY - JOUR
AU - Scheideler, Christian
ID - 5984
JF - Theor. Comput. Sci.
TI - Preface
VL - 751
ER -
TY - CONF
AB - 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.
AU - Jung, Daniel
AU - Kolb, Christina
AU - Scheideler, Christian
AU - Sundermeier, Jannik
ID - 4563
KW - greedy routing
KW - ad hoc networks
KW - convex hulls
KW - c-competitiveness
T2 - Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)
TI - Competitive Routing in Hybrid Communication 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 - 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 - 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 - 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 - 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 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).
AU - Feldmann, Michael
AU - Götte, Thorsten
AU - Scheideler, Christian
ID - 13182
T2 - Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
TI - A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory
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 -
TY - CONF
AU - Castenow, Jannik
AU - Kolb, Christina
AU - Scheideler, Christian
ID - 14539
T2 - Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)
TI - A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
ER -
TY - CONF
AB - 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.
AU - Feldmann, Michael
AU - Scheideler, Christian
ID - 8534
T2 - Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
TI - Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities
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 - Daymude, Joshua J.
AU - Gmyr, Robert
AU - Hinnenthal, Kristian
AU - Kostitsyna, Irina
AU - Scheideler, Christian
AU - Richa, Andréa W.
ID - 16346
SN - 9781450377515
T2 - Proceedings of the 21st International Conference on Distributed Computing and Networking
TI - Convex Hull Formation for Programmable Matter
ER -
TY - JOUR
AU - Gmyr, Robert
AU - Hinnenthal, Kristian
AU - Kostitsyna, Irina
AU - Kuhn, Fabian
AU - Rudolph, Dorian
AU - Scheideler, Christian
AU - Strothmann, Thim
ID - 17808
IS - 2
JF - Nat. Comput.
TI - Forming tile shapes with simple robots
VL - 19
ER -
TY - CONF
AB - We consider the problem of computing shortest paths in \emph{hybrid networks}, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular network to solve tasks more efficiently. Like in this case, the different communication modes may differ considerably in range, bandwidth, and flexibility. We build upon the model of Augustine et al. [SODA '20], which captures these differences by a \emph{local} and a \emph{global} mode. Specifically, the local edges model a fixed communication network in which $O(1)$ messages of size $O(\log n)$ can be sent over every edge in each synchronous round. The global edges form a clique, but nodes are only allowed to send and receive a total of at most $O(\log n)$ messages over global edges, which restricts the nodes to use these edges only very sparsely.
We demonstrate the power of hybrid networks by presenting algorithms to compute Single-Source Shortest Paths and the diameter very efficiently in \emph{sparse graphs}. Specifically, we present exact $O(\log n)$ time algorithms for cactus graphs (i.e., graphs in which each edge is contained in at most one cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges and arboricity $O(\log n)$. For these graph classes, our algorithms provide exponentially faster solutions than the best known algorithms for general graphs in this model.
Beyond shortest paths, we also provide a variety of useful tools and techniques for hybrid networks, which may be of independent interest.
AU - Feldmann, Michael
AU - Hinnenthal, Kristian
AU - Scheideler, Christian
ID - 20755
T2 - Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)
TI - Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
ER -
TY - JOUR
AB - 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.
AU - Feldmann, Michael
AU - Scheideler, Christian
AU - Schmid, Stefan
ID - 16902
JF - ACM Computing Surveys
TI - Survey on Algorithms for Self-Stabilizing Overlay Networks
ER -
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 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.
AU - Feldmann, Michael
AU - Khazraei, Ardalan
AU - Scheideler, Christian
ID - 16903
T2 - Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
TI - Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model
ER -
TY - CONF
AB - We show how to construct an overlay network of constant degree and diameter $O(\log n)$ in time $O(\log n)$ starting from an arbitrary weakly connected graph.
We assume a synchronous communication network in which nodes can send messages to nodes they know the identifier of and establish new connections by sending node identifiers.
If the initial network's graph is weakly connected and has constant degree, then our algorithm constructs the desired topology with each node sending and receiving only $O(\log n)$ messages in each round in time $O(\log n)$, w.h.p., which beats the currently best $O(\log^{3/2} n)$ time algorithm of [Götte et al., SIROCCO'19].
Since the problem cannot be solved faster than by using pointer jumping for $O(\log n)$ rounds (which would even require each node to communicate $\Omega(n)$ bits), our algorithm is asymptotically optimal.
We achieve this speedup by using short random walks to repeatedly establish random connections between the nodes that quickly reduce the conductance of the graph using an observation of [Kwok and Lau, APPROX'14].
Additionally, we show how our algorithm can be used to efficiently solve graph problems in \emph{hybrid networks} [Augustine et al., SODA'20].
Motivated by the idea that nodes possess two different modes of communication, we assume that communication of the \emph{initial} edges is unrestricted. In contrast, only polylogarithmically many messages can be communicated over edges that have been established throughout an algorithm's execution.
For an (undirected) graph $G$ with arbitrary degree, we show how to compute connected components, a spanning tree, and biconnected components in time $O(\log n)$, w.h.p.
Furthermore, we show how to compute an MIS in time $O(\log d + \log \log n)$, w.h.p., where $d$ is the initial degree of $G$.
AU - Götte, Thorsten
AU - Hinnenthal, Kristian
AU - Scheideler, Christian
AU - Werthmann, Julian
ED - Censor-Hillel, Keren
ID - 22283
T2 - Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21)
TI - Time-Optimal Construction of Overlays
ER -
TY - JOUR
AB - While many 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. However, when peers in peer-to-peer networks crash, a distributed data structure may not remain intact. 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 many applications 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 O(log |x|) hash table read accesses. We show how to maintain the structure in a self-stabilizing way, while assuring a low overhead in a legal state and an asymptotically optimal memory demand of O(d) bits, where d is the number of bits needed for storing all keys.
AU - Knollmann, Till
AU - Scheideler, Christian
ID - 21096
JF - Information and Computation
SN - 0890-5401
TI - A self-stabilizing Hashed Patricia Trie
ER -