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 - JOUR
AU - W. Richa, Andr{\'{e}}a
AU - Scheideler, Christian
AU - Schmid, Stefan
AU - Zhang, Jin
ID - 1868
IS - 3
JF - Distributed Computing
TI - Competitive throughput in multi-hop wireless networks despite adaptive jamming
ER -
TY - JOUR
AU - Mohd Nor, Rizal
AU - Nesterenko, Mikhail
AU - Scheideler, Christian
ID - 1870
JF - Theor. Comput. Sci.
TI - Corona: A stabilizing deterministic message-passing skip list
ER -
TY - CONF
AB - We consider the problem of managing a dynamic heterogeneous storagesystem in a distributed way so that the amount of data assigned to a hostin that system is related to its capacity. Two central problems have to be solvedfor this: (1) organizing the hosts in an overlay network with low degree and diameterso that one can efficiently check the correct distribution of the data androute between any two hosts, and (2) distributing the data among the hosts so thatthe distribution respects the capacities of the hosts and can easily be adapted asthe set of hosts or their capacities change. We present distributed protocols forthese problems that are self-stabilizing and that do not need any global knowledgeabout the system such as the number of nodes or the overall capacity of thesystem. Prior to this work no solution was known satisfying these properties.
AU - Kniesburges, Sebastian
AU - Koutsopoulos, Andreas
AU - Scheideler, Christian
ID - 542
T2 - Proceedings of the 27th International Symposium on Distributed Computing (DISC)
TI - CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system
ER -
TY - JOUR
AU - W. Richa, Andrea
AU - Scheideler, Christian
AU - Schmid, Stefan
AU - Zhang, Jin
ID - 1871
IS - 3
JF - IEEE/ACM Trans. Netw.
TI - An Efficient and Fair MAC Protocol Robust to Reactive Interference
ER -
TY - CONF
AB - This paper initiates the study of self-adjusting networks (or distributed data structures) whose topologies dynamically adapt to a communication pattern $\sigma$. We present a fully decentralized self-adjusting solution called SplayNet. A SplayNet is a distributed generalization of the classic splay tree concept. It ensures short paths (which can be found using local-greedy routing) between communication partners while minimizing topological rearrangements. We derive an upper bound for the amortized communication cost of a SplayNet based on empirical entropies of $\sigma$, and show that SplayNets have several interesting convergence properties. For instance, SplayNets features a provable online optimality under special requests scenarios. We also investigate the optimal static network and prove different lower bounds for the average communication cost based on graph cuts and on the empirical entropy of the communication pattern $\sigma$. From these lower bounds it follows, e.g., that SplayNets are optimal in scenarios where the requests follow a product distribution as well. Finally, this paper shows that in contrast to the Minimum Linear Arrangement problem which is generally NP-hard, the optimal static tree network can be computed in polynomial time for any guest graph, despite the exponentially large graph family. We complement our formal analysis with a small simulation study on a Facebook graph.
AU - Avin, Chen
AU - Häupler, Bernhard
AU - Lotker, Zvi
AU - Scheideler, Christian
AU - Schmid, Stefan
ID - 513
T2 - Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)
TI - Locally Self-Adjusting Tree Networks
ER -
TY - CONF
AB - In this work we present the first scalable distributed information system,i.e., a system with low storage overhead, that is provably robust againstDenial-of-Service (DoS) attacks by a current insider. We allow acurrent insider to have complete knowledge about the information systemand to have the power to block any \epsilon-fraction of its serversby a DoS-attack, where \epsilon can be chosen up to a constant. The taskof the system is to serve any collection of lookup requests with at most oneper non-blocked server in an efficient way despite this attack. Previously,scalable solutions were only known for DoS-attacks of past insiders, where apast insider only has complete knowledge about some past time pointt_0 of the information system. Scheideler et al. (DISC 2007, SPAA 2009) showedthat in this case it is possible to design an information system so that anyinformation that was inserted or last updated after t_0 is safe against a DoS-attack. But their constructions would not work at all for a current insider. The key idea behindour IRIS system is to make extensive use of coding. More precisely, we presenttwo alternative distributed coding strategies with an at most logarithmicstorage overhead that can handle up to a constant fraction of blocked servers.
AU - Eikel, Martina
AU - Scheideler, Christian
ID - 519
T2 - Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
TI - IRIS: A Robust Information System Against Insider DoS-Attacks
ER -
TY - CONF
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 add ress 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)) or bits (O(nlogn)) a node receives or sendscoincides with the lower bound, while ensuring only a linearruntime (O(n)) on the number of rounds.
AU - Kniesburges, Sebastian
AU - Koutsopoulos, Andreas
AU - Scheideler, Christian
ID - 564
T2 - Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)
TI - A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
ER -
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 - JOUR
AU - Dolev, Shlomi
AU - Scheideler, Christian
ID - 1882
JF - Theor. Comput. Sci.
TI - Editorial for Algorithmic Aspects of Wireless Sensor Networks
ER -