@inproceedings{1930,
author = {Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan},
booktitle = {Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
pages = {771----780},
publisher = {Springer},
title = {{A Self-stabilizing and Local Delaunay Graph Construction}},
doi = {10.1007/978-3-642-10631-6_78},
volume = {5878},
year = {2009},
}
@inproceedings{1935,
author = {Doerr, Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian},
booktitle = {Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany},
title = {{Stabilizing Consensus with the Power of Two Choices}},
doi = {10.1145/1989493.1989516},
volume = {09371},
year = {2009},
}
@inproceedings{1929,
author = {Scheideler, Christian and Schmid, Stefan},
booktitle = {Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II},
isbn = {978-3-642-02929-5},
pages = {571----582},
publisher = {Springer},
title = {{A Distributed and Oblivious Heap}},
doi = {10.1007/978-3-642-02930-1_47},
volume = {5556},
year = {2009},
}
@article{1925,
author = {D. Kleinberg, Robert and Scheideler, Christian},
journal = {Theory Comput. Syst.},
number = {2},
pages = {187},
title = {{Foreword}},
doi = {10.1007/s00224-009-9202-x},
year = {2009},
}
@inproceedings{1932,
author = {Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo},
booktitle = {Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009},
isbn = {978-1-60558-396-9},
pages = {131----140},
title = {{A distributed polylogarithmic time algorithm for self-stabilizing skip graphs}},
doi = {10.1145/1582716.1582741},
year = {2009},
}
@inproceedings{1907,
author = {Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin},
booktitle = {Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings},
isbn = {978-3-642-15762-2},
pages = {179----193},
publisher = {Springer},
title = {{A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks}},
doi = {10.1007/978-3-642-15763-9_17},
volume = {6343},
year = {2010},
}
@inproceedings{1908,
author = {Doerr, Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian},
booktitle = {Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings},
pages = {528----530},
publisher = {Springer},
title = {{Brief Announcement: Stabilizing Consensus with the Power of Two Choices}},
doi = {10.1007/978-3-642-15763-9_50},
volume = {6343},
year = {2010},
}
@article{1903,
author = {Meyer auf der Heide, Friedhelm and Scheideler, Christian},
journal = {Informatik Spektrum},
number = {5},
pages = {468----474},
title = {{Algorithmische Grundlagen verteilter Speichersysteme}},
doi = {10.1007/s00287-010-0470-2},
year = {2010},
}
@article{1904,
author = {Gavoille, Cyril and Patt-Shamir, Boaz and Scheideler, Christian},
journal = {Theory of Computing Systems},
number = {4},
pages = {809----810},
title = {{Foreword}},
doi = {10.1007/s00224-010-9284-5},
year = {2010},
}
@inproceedings{1905,
author = {Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo},
booktitle = {LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings},
isbn = {978-3-642-12199-9},
pages = {294----305},
publisher = {Springer},
title = {{Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization}},
doi = {10.1007/978-3-642-12200-2_27},
volume = {6034},
year = {2010},
}
@inproceedings{1906,
author = {Richa, Andrea W. and Zhang, Jin and Scheideler, Christian and Schmid, Stefan},
booktitle = {Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010},
isbn = {978-1-60558-888-9},
pages = {114----115},
publisher = {ACM},
title = {{Brief announcement: towards robust medium access in multi-hop networks}},
doi = {10.1145/1835698.1835726},
year = {2010},
}
@inproceedings{1899,
author = {Kniesburges, Sebastian and Scheideler, Christian},
booktitle = {WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings},
isbn = {978-3-642-19093-3},
pages = {170----181},
publisher = {Springer},
title = {{Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems}},
doi = {10.1007/978-3-642-19094-0_18},
volume = {6552},
year = {2011},
}
@inproceedings{662,
abstract = {We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in message-passing system can be constructed. The conditions require that initial state information has to form a weakly connected graph and it should only contain identiers that are present in the system. We formally describe Corona and rigorously prove that it stabilizes from an arbitrary initial state subject to the necessary conditions. We extend Corona to construct a skip graph.},
author = {Nesterenko, Mikhail and Mohd, Rizal and Scheideler, Christian},
booktitle = {Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)},
pages = {356----370},
title = {{Corona: A Stabilizing Deterministic Message-Passing Skip List}},
doi = {10.1007/978-3-642-24550-3_27},
year = {2011},
}
@inproceedings{1895,
author = {Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian},
booktitle = {SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)},
isbn = {978-1-4503-0743-7},
pages = {235----244},
title = {{Re-Chord: a self-stabilizing chord overlay network}},
doi = {10.1145/1989493.1989527},
year = {2011},
}
@inproceedings{1891,
author = {W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin},
booktitle = {2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011},
isbn = {978-0-7695-4364-2},
pages = {507----516},
publisher = {IEEE Computer Society},
title = {{Competitive and Fair Medium Access Despite Reactive Jamming}},
doi = {10.1109/ICDCS.2011.8},
year = {2011},
}
@inproceedings{645,
abstract = {In the standard consensus problem there are n processes with possibly di®erent input values and the goal is to eventually reach a point at which all processes commit to exactly one of these values. We are studying a slight variant of the consensus problem called the stabilizing consensus problem [2]. In this problem, we do not require that each process commits to a ¯nal value at some point, but that eventually they arrive at a common, stable value without necessarily being aware of that. This should work irrespective of the states in which the processes are starting. Our main result is a simple randomized algorithm called median rule that, with high probability, just needs O(logmlog log n + log n) time and work per process to arrive at an almost stable consensus for any set of m legal values as long as an adversary can corrupt the states of at most p n processes at any time. Without adversarial involvement, just O(log n) time and work is needed for a stable consensus, with high probability. As a by-product, we obtain a simple distributed algorithm for approximating the median of n numbers in time O(logmlog log n + log n) under adversarial presence.},
author = {Doerr, Benjamin and Goldberg, Leslie Ann and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian},
booktitle = {Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
pages = {149--158},
title = {{Stabilizing consensus with the power of two choices}},
doi = {10.1145/1989493.1989516},
year = {2011},
}
@inproceedings{1892,
author = {W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin},
booktitle = {Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011},
isbn = {978-1-4503-0868-7},
pages = {33----36},
publisher = {ACM},
title = {{Towards jamming-resistant and competitive medium access in the SINR model}},
doi = {10.1145/2030686.2030697},
year = {2011},
}
@inbook{1900,
author = {Scheideler, Christian and Graffi, Kalman},
booktitle = {Computer Science, The Hardware, Software and Heart of It},
isbn = {978-1-4614-1167-3},
pages = {155----168},
publisher = {Springer},
title = {{Programming for Distributed Computing: From Physical to Logical Networks}},
doi = {10.1007/978-1-4614-1168-0_9},
year = {2011},
}
@inproceedings{1924,
author = {Kolman, Petr and Scheideler, Christian},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany},
pages = {129----140},
title = {{Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}},
doi = {10.4230/LIPIcs.STACS.2011.129},
year = {2011},
}
@inproceedings{646,
abstract = {This paper presents a dynamic overlay network based on the De Bruijn graph which we call Linearized De Bruijn (LDB) network. The LDB network has the advantage that it has a guaranteed constant node degree and that the routing between any two nodes takes at most O(log n) hops with high probability. Also, we show that there is a simple local-control algorithm that can recover the LDB network from any network topology that is weakly connected.},
author = {Richa, Andrea W. and Scheideler, Christian},
booktitle = {Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)},
pages = {416--430},
title = {{Self-Stabilizing DeBruijn Networks}},
doi = {10.1007/978-3-642-24550-3_31},
year = {2011},
}
@inproceedings{1893,
author = {W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin},
booktitle = {Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011},
isbn = {978-1-4503-0722-2},
pages = {15},
publisher = {ACM},
title = {{Self-stabilizing leader election for single-hop wireless networks despite jamming}},
doi = {10.1145/2107502.2107522},
year = {2011},
}
@inbook{1901,
author = {Scheideler, Christian},
booktitle = {Algorithms Unplugged},
isbn = {978-3-642-15327-3},
pages = {223----229},
publisher = {Springer},
title = {{Broadcasting - How Can I Quickly Disseminate Information?}},
doi = {10.1007/978-3-642-15328-0_22},
year = {2011},
}
@article{1882,
author = {Dolev, Shlomi and Scheideler, Christian},
journal = {Theor. Comput. Sci.},
pages = {1},
title = {{Editorial for Algorithmic Aspects of Wireless Sensor Networks}},
doi = {10.1016/j.tcs.2012.07.012},
year = {2012},
}
@article{574,
abstract = {We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization.},
author = {Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian},
journal = {Theoretical Computer Science},
pages = {18--35},
publisher = {Elsevier},
title = {{Tiara: A self-stabilizing deterministic skip list and skip graph}},
doi = {10.1016/j.tcs.2011.12.079},
year = {2012},
}
@article{579,
abstract = {A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space.},
author = {Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till},
journal = {Transactions on Algorithms},
number = {3},
pages = {30},
publisher = {ACM},
title = {{Smoothed analysis of left-to-right maxima with applications}},
doi = {10.1145/2229163.2229174},
year = {2012},
}
@inproceedings{625,
abstract = {This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties.},
author = {Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler, Bernhard and Lotker, Zvi},
booktitle = {Proceedings of the 26th International Symposium on Distributed Computing (DISC)},
pages = {439--440},
title = {{Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures}},
doi = {10.1007/978-3-642-33651-5_47},
year = {2012},
}
@inproceedings{632,
abstract = {Given an integer h, a graph G = (V;E) with arbitrary positive edge capacities and k pairs of vertices (s1; t1); (s2; t2); : : : ; (sk; tk), called terminals, an h-route cut is a set F µ E of edges such that after the removal of the edges in F no pair si ¡ ti is connected by h edge-disjoint paths (i.e., the connectivity of every si ¡ ti pair is at most h ¡ 1 in (V;E n F)). The h-route cut is a natural generalization of the classical cut problem for multicommodity °ows (take h = 1). The main result of this paper is an O(h722h log2 k)-approximation algorithm for the minimum h-route cut problem in the case that s1 = s2 = ¢ ¢ ¢ = sk, called the single source case. As a corollary of it we obtain an approximate duality theorem for multiroute multicom-modity °ows and cuts with a single source. This partially answers an open question posted in several previous papers dealing with cuts for multicommodity multiroute problems.},
author = {Kolman, Petr and Scheideler, Christian},
booktitle = {Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)},
pages = {800--810},
title = {{Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case}},
doi = {10.1137/1.9781611973099.64},
year = {2012},
}
@inproceedings{581,
abstract = {Nanoparticles are getting more and more in the focus of the scientic community since the potential for the development of very small particles interacting with each other and completing medical and other tasks is getting bigger year by year. In this work we introduce a distributed local algorithm for arranging a set of nanoparticles on the discrete plane into specic geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the following restrictions: it can only view the state of robots it is physically connected to, is anonymous, has only a constant size memory, can only move by using other particles as an anchor point on which it pulls itself alongside, and it operates in Look-Compute-Move cycles. The main result of this work is the presentation of a random distributed local algorithm which transforms any given connected set of particles into a particular geometric shape. As an example we provide a version of this algorithm for forming a rectangle with an arbitrary predened aspect ratio. To the best of our knowledge this is the rst work that considers arrangement problems for these types of robots.},
author = {Drees, Maximilian and Hüllmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian},
booktitle = {Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
pages = {1272--1283},
title = {{Self-Organizing Particle Systems}},
doi = {10.1109/IPDPS.2012.116},
year = {2012},
}
@inproceedings{1884,
author = {Monien, Burkhard and Scheideler, Christian},
booktitle = {Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings},
isbn = {978-3-642-32819-0},
pages = {1----2},
publisher = {Springer},
title = {{Selfish Distributed Optimization}},
doi = {10.1007/978-3-642-32820-6_1},
volume = {7484},
year = {2012},
}
@article{570,
abstract = {This article studies the construction of self-stabilizing topologies for distributed systems. While recent research has focused on chain topologies where nodes need to be linearized with respect to their identiers, we explore a natural and relevant 2-dimensional generalization. In particular, we present a local self-stabilizing algorithm DStab which is based on the concept of \local Delaunay graphs" and which forwards temporary edges in greedy fashion reminiscent of compass routing. DStab constructs a Delaunay graph from any initial connected topology and in a distributed manner in time O(n3) in the worst-case; if the initial network contains the Delaunay graph, the convergence time is only O(n) rounds. DStab also ensures that individual node joins and leaves aect a small part of the network only. Such self-stabilizing Delaunay networks have interesting applications and our construction gives insights into the necessary geometric reasoning that is required for higherdimensional linearization problems.Keywords: Distributed Algorithms, Topology Control, Social Networks},
author = {Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan},
journal = {Theoretical Computer Science},
pages = {137--148},
publisher = {Elsevier},
title = {{Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs}},
doi = {10.1016/j.tcs.2012.07.029},
year = {2012},
}
@inproceedings{626,
abstract = {The design of ecient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this announcement we address the problem of nding the predecessor in a key set and present an ecient data structure called hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses when u is the size of the universe of the keys. That is the costs only depend on u and not the size of the data structure. One feature of our approach is that it only uses the lookup interface of the hash table and therefore hash table accesses may be realized by any distributed hash table (DHT).},
author = {Kniesburges, Sebastian and Scheideler, Christian},
booktitle = {Proceedings of the 26th International Symposium on Distributed Computing (DISC)},
pages = {435--436},
title = {{Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems}},
doi = {10.1007/978-3-642-33651-5_45},
year = {2012},
}
@inproceedings{640,
abstract = {Small-world networks have received significant attention because of their potential as models for the interaction networks of complex systems. Specifically, neither random networks nor regular lattices seem to be an adequate framework within which to study real-world complex systems such as chemical-reaction networks, neural networks, food webs, social networks, scientific-collaboration networks, and computer networks. Small-world networks provide some desired properties like an expected polylogarithmic distance between two processes in the network, which allows routing in polylogarithmic hops by simple greedy routing, and robustness against attacks or failures. By these properties, small-world networks are possible solutions for large overlay networks comparable to structured overlay networks like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to their uniform structure, structured overlay networks are more vulnerable to attacks or failures. In this paper we bring together a randomized process converging to a small-world network and a self-stabilization process so that a small-world network is formed out of any weakly connected initial state. To the best of our knowledge this is the first distributed self-stabilization process for building a small-world network.},
author = {Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian},
booktitle = {Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
pages = {1261----1271},
title = {{A Self-Stabilization Process for Small-World Networks}},
doi = {10.1109/IPDPS.2012.115},
year = {2012},
}
@inproceedings{623,
abstract = {This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed.},
author = {Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin },
booktitle = {Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)},
pages = {291--300},
title = {{Competitive and fair throughput for co-existing networks under adversarial interference}},
doi = {10.1145/2332432.2332488},
year = {2012},
}
@article{1868,
author = {W. Richa, Andr{\'{e}}a and Scheideler, Christian and Schmid, Stefan and Zhang, Jin},
journal = {Distributed Computing},
number = {3},
pages = {159----171},
title = {{Competitive throughput in multi-hop wireless networks despite adaptive jamming}},
doi = {10.1007/s00446-012-0180-x},
year = {2013},
}
@article{1870,
author = {Mohd Nor, Rizal and Nesterenko, Mikhail and Scheideler, Christian},
journal = {Theor. Comput. Sci.},
pages = {119----129},
title = {{Corona: A stabilizing deterministic message-passing skip list}},
doi = {10.1016/j.tcs.2012.08.029},
year = {2013},
}
@inproceedings{542,
abstract = {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.},
author = {Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian},
booktitle = {Proceedings of the 27th International Symposium on Distributed Computing (DISC)},
pages = {537--549},
title = {{CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system}},
doi = {10.1007/978-3-642-41527-2_37},
year = {2013},
}
@article{1871,
author = {W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin},
journal = {IEEE/ACM Trans. Netw.},
number = {3},
pages = {760----771},
title = {{An Efficient and Fair MAC Protocol Robust to Reactive Interference}},
doi = {10.1109/TNET.2012.2210241},
year = {2013},
}
@inproceedings{513,
abstract = {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.},
author = {Avin, Chen and Häupler, Bernhard and Lotker, Zvi and Scheideler, Christian and Schmid, Stefan},
booktitle = {Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
pages = {395--406},
title = {{Locally Self-Adjusting Tree Networks}},
doi = {10.1109/IPDPS.2013.40},
year = {2013},
}
@inproceedings{519,
abstract = {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.},
author = {Eikel, Martina and Scheideler, Christian},
booktitle = {Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
pages = {119--129},
title = {{IRIS: A Robust Information System Against Insider DoS-Attacks}},
doi = {10.1145/2486159.2486186},
year = {2013},
}
@inproceedings{564,
abstract = {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.},
author = {Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian},
booktitle = {Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)},
pages = {165--176},
title = {{A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery}},
doi = {10.1007/978-3-319-03578-9_14},
year = {2013},
}
@article{476,
abstract = {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.},
author = {Kolman, Petr and Scheideler, Christian},
journal = {Theory of Computing Systems},
number = {2},
pages = {341--363},
publisher = {Springer},
title = {{Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}},
doi = {10.1007/s00224-013-9454-3},
year = {2013},
}
@inproceedings{1863,
author = {Derakhshandeh, Zahra and Dolev, Shlomi and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik},
booktitle = {26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'14, Prague, Czech Republic - June 23 - 25, 2014},
isbn = {978-1-4503-2821-0},
pages = {220----222},
publisher = {ACM},
title = {{Brief announcement: amoebot - a new model for programmable matter}},
doi = {10.1145/2612669.2612712},
year = {2014},
}
@inproceedings{371,
abstract = {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.},
author = {Scheideler, Christian and Setzer, Alexander and Eikel, Martina},
booktitle = {Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)},
pages = {107----122},
title = {{RoBuSt: A Crash-Failure-Resistant Distributed Storage System}},
doi = {10.1007/978-3-319-14472-6_8},
year = {2014},
}
@inproceedings{446,
abstract = {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.},
author = {Ogierman, Adrian and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin},
booktitle = {Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM)},
pages = {2751----2759},
title = {{Competitive MAC under adversarial SINR}},
doi = {10.1109/INFOCOM.2014.6848224},
year = {2014},
}
@inproceedings{459,
abstract = {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.},
author = {Kniesburges, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian},
booktitle = {Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
pages = {1--13},
title = {{Algorithmic Aspects of Resource Management in the Cloud}},
doi = {10.1007/978-3-319-09620-9_1},
year = {2014},
}
@article{1858,
author = {Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo},
journal = {J. ACM},
number = {6},
pages = {36:1----36:26},
title = {{SKIP*: A Self-Stabilizing Skip Graph}},
doi = {10.1145/2629695},
year = {2014},
}
@inproceedings{412,
abstract = {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.},
author = {Feldotto, Matthias and Scheideler, Christian and Graffi, Kalman},
booktitle = {Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)},
pages = {1--10},
title = {{HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}},
doi = {10.1109/P2P.2014.6934300},
year = {2014},
}
@inproceedings{397,
abstract = {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.},
author = {Scheideler, Christian and Eikel, Martina and Setzer, Alexander},
booktitle = {Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)},
pages = {168----180},
title = {{Minimum Linear Arrangement of Series-Parallel Graphs}},
year = {2014},
}
@article{378,
abstract = {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.},
author = {Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian},
journal = {Theory of Computing Systems},
number = {3},
pages = {591--612},
publisher = {Springer},
title = {{Re-Chord: A Self-stabilizing Chord Overlay Network}},
doi = {10.1007/s00224-012-9431-2},
year = {2014},
}
@inproceedings{393,
abstract = {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.},
author = {Foreback, Dianne and Koutsopoulos, Andreas and Nesterenko, Mikhail and Scheideler, Christian and Strothmann, Thim Frederik},
booktitle = {Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems},
pages = {48----62},
title = {{On Stabilizing Departures in Overlay Networks}},
doi = {10.1007/978-3-319-11764-5_4},
year = {2014},
}