TY - CONF AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 2113 T2 - SPAA TI - Towards a scalable and robust DHT ER - TY - JOUR AU - Bagchi, Amitabha AU - Bhargava, Ankur AU - Chaudhary, Amitabh AU - Eppstein, David AU - Scheideler, Christian ID - 2043 IS - 6 JF - Theory Comput. Syst. TI - The Effect of Faults on Network Expansion ER - TY - CONF AU - Scheideler, Christian ID - 2213 T2 - 6th International HNI Symposium on New Trends in Parallel and Distributed Computing TI - Towards a paradigm for robust distributed algorithms and data structures ER - TY - JOUR AU - Bagchi, Amitabha AU - Chaudhary, Amitabh AU - Scheideler, Christian AU - Kolman, Petr ID - 2017 IS - 1 JF - SIAM J. Discrete Math. TI - Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks ER - TY - CONF AU - Onus, Melih AU - W. Richa, Andrea AU - Scheideler, Christian ID - 2020 SN - 978-1-61197-287-0 T2 - Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007 TI - Linearization: Locally Self-Stabilizing Sorting in Graphs ER - TY - CONF AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 2022 T2 - 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007 TI - Towards Scalable and Robust Overlay Networks ER - TY - CONF AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 2023 SN - 978-1-59593-616-5 T2 - Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007 TI - A denial-of-service resistant DHT ER - TY - CONF AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 2024 SN - 978-3-540-75141-0 T2 - Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings TI - A Denial-of-Service Resistant DHT VL - 4731 ER - TY - CHAP AU - W. Richa, Andrea AU - Scheideler, Christian ID - 2028 SN - 978-1-58488-550-4 T2 - Handbook of Approximation Algorithms and Metaheuristics. TI - Overlay Networks for Peer-to-Peer Networks ER - TY - CONF AB - We present a randomized block-level storage virtualization for arbitrary heterogeneous storage systems that can distribute data in a fair and redundant way and can adapt this distribution in an efficient way as storage devices enter or leave the system. More precisely, our virtualization strategies can distribute a set of data blocks among a set of storage devices of arbitrary non-uniform capacities so that a storage device representing x% of the capacity in the system will get x% of the data (as long as this is in principle possible) and the different copies of each data block are stored so that no two copies of a data block are located in the same device. Achieving these two properties is not easy, and no virtualization strategy has been presented so far that has been formally shown to satisfy fairness and redundancy while being time- and space-eflcient and allowing an efficient adaptation to a changing set of devices. AU - Brinkmann, André AU - Effert, Sascha AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian ID - 2214 T2 - IEEE International Conference on Distributed Computing Systems (ICDCS) TI - Dynamic and redundant data placement ER - TY - JOUR AU - Aggarwal, Vinay AU - Feldmann, Anja AU - Scheideler, Christian ID - 2209 JF - ACM Computer Commucation Review TI - Can ISPs and P2P users cooperate for improved performance? ER - TY - JOUR AU - Scheideler, Christian ID - 1937 JF - Bulletin of the EATCS TI - Algorithms for Overlay Networks ER - TY - CONF AU - Awerbuch, Baruch AU - W. Richa, Andr{\'{e}}a AU - Scheideler, Christian ID - 1938 SN - 978-1-59593-989-0 T2 - Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008 TI - A jamming-resistant MAC protocol for single-hop wireless networks ER - TY - CONF AU - Mense, Mario AU - Scheideler, Christian ID - 1940 T2 - Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008 TI - SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems ER - TY - CONF AU - Clouser, Thomas AU - Nesterenko, Mikhail AU - Scheideler, Christian ID - 1941 SN - 978-3-540-89334-9 T2 - Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings TI - Tiara: A Self-stabilizing Deterministic Skip List VL - 5340 ER - TY - CHAP AU - Scheideler, Christian ID - 1942 SN - 978-3-540-76393-2 T2 - Taschenbuch der Algorithmen TI - Broadcasting: Wie verbreite ich schnell Informationen? ER - TY - JOUR AU - D. Kleinberg, Robert AU - Scheideler, Christian ID - 1925 IS - 2 JF - Theory Comput. Syst. TI - Foreword ER - TY - JOUR AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 1927 IS - 2 JF - Theory Comput. Syst. TI - Towards a Scalable and Robust DHT ER - TY - JOUR AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 1928 IS - 6-7 JF - Theor. Comput. Sci. TI - Robust random number generation for peer-to-peer systems ER - TY - CONF AU - Scheideler, Christian AU - Schmid, Stefan ID - 1929 SN - 978-3-642-02929-5 T2 - Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II TI - A Distributed and Oblivious Heap VL - 5556 ER - TY - CONF AU - Jacob, Riko AU - Ritscher, Stephan AU - Scheideler, Christian AU - Schmid, Stefan ID - 1930 T2 - Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings TI - A Self-stabilizing and Local Delaunay Graph Construction VL - 5878 ER - TY - CONF AU - Jacob, Riko AU - W. Richa, Andrea AU - Scheideler, Christian AU - Schmid, Stefan AU - Täubig, Hanjo ID - 1932 SN - 978-1-60558-396-9 T2 - Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009 TI - A distributed polylogarithmic time algorithm for self-stabilizing skip graphs ER - TY - CONF AU - Baumgart, Matthias AU - Scheideler, Christian AU - Schmid, Stefan ID - 1933 SN - 978-1-60558-606-9 T2 - SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009 TI - A DoS-resilient information system for dynamic data management ER - TY - CONF AU - Gall, Dominik AU - Jacob, Riko AU - W. Richa, Andrea AU - Scheideler, Christian AU - Schmid, Stefan AU - Täubig, Hanjo ID - 1934 SN - 978-3-642-05117-3 T2 - Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings TI - Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization VL - 5873 ER - TY - CONF AU - Doerr, Benjamin AU - Ann Goldberg, Leslie AU - Minder, Lorenz AU - Sauerwald, Thomas AU - Scheideler, Christian ID - 1935 T2 - Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009 TI - Stabilizing Consensus with the Power of Two Choices VL - 09371 ER - TY - JOUR AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian ID - 1903 IS - 5 JF - Informatik Spektrum TI - Algorithmische Grundlagen verteilter Speichersysteme ER - TY - JOUR AU - Gavoille, Cyril AU - Patt-Shamir, Boaz AU - Scheideler, Christian ID - 1904 IS - 4 JF - Theory of Computing Systems TI - Foreword ER - TY - CONF AU - Gall, Dominik AU - Jacob, Riko AU - W. Richa, Andrea AU - Scheideler, Christian AU - Schmid, Stefan AU - Täubig, Hanjo ID - 1905 SN - 978-3-642-12199-9 T2 - LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings TI - Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization VL - 6034 ER - TY - CONF AU - Richa, Andrea W. AU - Zhang, Jin AU - Scheideler, Christian AU - Schmid, Stefan ID - 1906 SN - 978-1-60558-888-9 T2 - Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010 TI - Brief announcement: towards robust medium access in multi-hop networks ER - TY - CONF AU - Richa, Andrea W. AU - Scheideler, Christian AU - Schmid, Stefan AU - Zhang, Jin ID - 1907 SN - 978-3-642-15762-2 T2 - Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings TI - A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks VL - 6343 ER - TY - CONF AU - Doerr, Benjamin AU - Ann Goldberg, Leslie AU - Minder, Lorenz AU - Sauerwald, Thomas AU - Scheideler, Christian ID - 1908 T2 - Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings TI - Brief Announcement: Stabilizing Consensus with the Power of Two Choices VL - 6343 ER - TY - CONF AU - W. Richa, Andrea AU - Scheideler, Christian AU - Schmid, Stefan AU - Zhang, Jin ID - 1891 SN - 978-0-7695-4364-2 T2 - 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011 TI - Competitive and Fair Medium Access Despite Reactive Jamming ER - TY - CONF AU - W. Richa, Andrea AU - Scheideler, Christian AU - Schmid, Stefan AU - Zhang, Jin ID - 1892 SN - 978-1-4503-0868-7 T2 - 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 TI - Towards jamming-resistant and competitive medium access in the SINR model ER - TY - CONF AU - W. Richa, Andrea AU - Scheideler, Christian AU - Schmid, Stefan AU - Zhang, Jin ID - 1893 SN - 978-1-4503-0722-2 T2 - Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011 TI - Self-stabilizing leader election for single-hop wireless networks despite jamming ER - TY - CONF AU - Kniesburges, Sebastian AU - Koutsopoulos, Andreas AU - Scheideler, Christian ID - 1895 SN - 978-1-4503-0743-7 T2 - 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) TI - Re-Chord: a self-stabilizing chord overlay network ER - TY - CONF AU - Kniesburges, Sebastian AU - Scheideler, Christian ID - 1899 SN - 978-3-642-19093-3 T2 - WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings TI - Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems VL - 6552 ER - TY - CHAP AU - Scheideler, Christian AU - Graffi, Kalman ID - 1900 SN - 978-1-4614-1167-3 T2 - Computer Science, The Hardware, Software and Heart of It TI - Programming for Distributed Computing: From Physical to Logical Networks ER - TY - CHAP AU - Scheideler, Christian ID - 1901 SN - 978-3-642-15327-3 T2 - Algorithms Unplugged TI - Broadcasting - How Can I Quickly Disseminate Information? ER - TY - CONF AU - Kolman, Petr AU - Scheideler, Christian ID - 1924 T2 - 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany TI - Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing ER - TY - CONF AB - 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. AU - Doerr, Benjamin AU - Goldberg, Leslie Ann AU - Minder, Lorenz AU - Sauerwald, Thomas AU - Scheideler, Christian ID - 645 T2 - Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) TI - Stabilizing consensus with the power of two choices ER - TY - CONF AB - 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. AU - Richa, Andrea W. AU - Scheideler, Christian ID - 646 T2 - Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) TI - Self-Stabilizing DeBruijn Networks ER - TY - CONF AB - 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. AU - Nesterenko, Mikhail AU - Mohd, Rizal AU - Scheideler, Christian ID - 662 T2 - Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) TI - Corona: A Stabilizing Deterministic Message-Passing Skip List 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 - TY - CONF AU - Monien, Burkhard AU - Scheideler, Christian ID - 1884 SN - 978-3-642-32819-0 T2 - Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings TI - Selfish Distributed Optimization VL - 7484 ER - TY - JOUR AB - 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 AU - Jacob, Riko AU - Ritscher, Stephan AU - Scheideler, Christian AU - Schmid, Stefan ID - 570 JF - Theoretical Computer Science TI - Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs ER - TY - JOUR AB - 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. AU - Clouser, Thomas AU - Nesterenko, Mikhail AU - Scheideler, Christian ID - 574 JF - Theoretical Computer Science TI - Tiara: A self-stabilizing deterministic skip list and skip graph ER - TY - JOUR AB - 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. AU - Damerow, Valentina AU - Manthey, Bodo AU - Meyer auf der Heide, Friedhelm AU - Räcke, Harald AU - Scheideler, Christian AU - Sohler, Christian AU - Tantau, Till ID - 579 IS - 3 JF - Transactions on Algorithms TI - Smoothed analysis of left-to-right maxima with applications ER - TY - CONF AB - 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. AU - Drees, Maximilian AU - Hüllmann (married name: Eikel), Martina AU - Koutsopoulos, Andreas AU - Scheideler, Christian ID - 581 T2 - Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) TI - Self-Organizing Particle Systems ER - TY - CONF AB - 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. AU - Richa, Andrea W. AU - Scheideler, Christian AU - Schmid, Stefan AU - Zhang, Jin ID - 623 T2 - Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC) TI - Competitive and fair throughput for co-existing networks under adversarial interference ER - TY - CONF AB - 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. AU - Schmid, Stefan AU - Avin, Chen AU - Scheideler, Christian AU - Häupler, Bernhard AU - Lotker, Zvi ID - 625 T2 - Proceedings of the 26th International Symposium on Distributed Computing (DISC) TI - Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures ER -