TY - CONF AU - Czumaj, Artur AU - Scheideler, Christian ID - 2147 T2 - SODA TI - Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma ER - TY - JOUR AU - Czumaj, Artur AU - Scheideler, Christian ID - 2148 IS - 3-4 JF - Random Struct. Algorithms TI - Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma VL - 17 ER - TY - CONF AU - Brinkmann, André AU - Salzwedel, Kay AU - Scheideler, Christian ID - 2149 T2 - SPAA TI - Efficient, distributed data placement strategies for storage area networks (extended abstract) ER - TY - CONF AU - Czumaj, Artur AU - Scheideler, Christian ID - 2150 T2 - STOC TI - A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) ER - TY - CONF AU - Czumaj, Artur AU - Scheideler, Christian ID - 2211 T2 - 32nd ACM Symposium on Theory of Computing TI - A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ER - TY - JOUR AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian ID - 2139 IS - 1 JF - Combinatorica TI - Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols VL - 21 ER - TY - CONF AU - Awerbuch, Baruch AU - Berenbrink, Petra AU - Brinkmann, André AU - Scheideler, Christian ID - 2140 T2 - FOCS TI - Simple Routing Strategies for Adversarial Systems ER - TY - CONF AU - Berenbrink, Petra AU - Brinkmann, André AU - Scheideler, Christian ID - 2141 T2 - PDP TI - SIMLAB-A Simulation Environment for Storage Area Networks ER - TY - CONF AU - Kolman, Petr AU - Scheideler, Christian ID - 2142 T2 - SPAA TI - Simple on-line algorithms for the maximum disjoint paths problem ER - TY - JOUR AU - Feige, Uriel AU - Scheideler, Christian ID - 2134 IS - 3 JF - Combinatorica TI - Improved Bounds for Acyclic Job Shop Scheduling ER - TY - CONF AU - Kolman, Petr AU - Scheideler, Christian ID - 2135 T2 - SODA TI - Improved bounds for the unsplittable flow problem ER - TY - CONF AU - Brinkmann, André AU - Salzwedel, Kay AU - Scheideler, Christian ID - 2136 T2 - SPAA TI - Compact, adaptive placement schemes for non-uniform requirements ER - TY - CONF AU - Bagchi, Amitabha AU - Chaudhary, Amitabh AU - Scheideler, Christian AU - Kolman, Petr ID - 2137 T2 - SPAA TI - Algorithms for fault-tolerant routing in circuit switched networks ER - TY - CONF AU - Scheideler, Christian ID - 2138 T2 - STACS TI - Models and Techniques for Communication in Dynamic Networks VL - 2285 ER - TY - CONF AB - The advances in Internet technology have led to tremendous improvements in business, education, and science and have changed the way we think, live, and communicate. Information exchange has become ubiquitous by the possibilities offered through modern technologies. We are able to offer information 24 hours a day through our web sites and can leave messages every time and from anywhere in the world. This change in communication has led to new challenges. Enterprises have to deal with an information amount that doubles every year. The technological foundation to cope with this information explosion is given by Storage Area Networks (SANs), which are able to connect a great number of storage systems over a fast interconnection network. However, to be able to use the benefits of a SAN, an easy-to-use and efficient management support has to be given to the storage administrator. In this paper, we will suggest new storage management concepts and we will introduce a new management environment that is able to significantly reduce management costs and increases the performance and resource utilization of the given SAN infrastructure. AU - Scheideler, Christian AU - Salzwedel, Kay AU - Meyer auf der Heide, Friedhelm AU - Brinkmann, André AU - Vodisek, Mario AU - Rückert, Ulrich ID - 19790 T2 - Proceedings of SSGRR 2003 TI - Storage Management as Means to cope with Exponential Information Growth ER - TY - CONF AU - Damerow, Valentina AU - Meyer auf der Heide, Friedhelm AU - Räcke, Harald AU - Scheideler, Christian AU - Sohler, Christian ID - 2128 T2 - ESA TI - Smoothed Motion Complexity VL - 2832 ER - TY - CONF AU - Awerbuch, Baruch AU - Brinkmann, André AU - Scheideler, Christian ID - 2129 T2 - ICALP TI - Anycasting in Adversarial Systems: Routing and Admission Control VL - 2719 ER - TY - CONF AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 2130 T2 - PODC TI - Peer-to-peer systems for prefix search ER - TY - CONF AU - Czumaj, Artur AU - Riley, Chris AU - Scheideler, Christian ID - 2131 T2 - RANDOM-APPROX TI - Perfectly Balanced Allocation VL - 2764 ER - TY - CONF AU - Jia, Lujun AU - Rajaraman, Rajmohan AU - Scheideler, Christian ID - 2132 T2 - SPAA TI - On local algorithms for topology control and routing in ad hoc networks ER - TY - CONF AU - Kothapalli, Kishore AU - Scheideler, Christian ID - 2133 T2 - SPAA TI - Information gathering in adversarial systems: lines and cycles ER - TY - JOUR AU - Kolman, Petr AU - Scheideler, Christian ID - 2119 IS - 3 JF - Algorithmica TI - Simple On-Line Algorithms for the Maximum Disjoint Paths Problem ER - TY - CONF AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 2120 T2 - ICALP TI - Group Spreading: A Protocol for Provably Secure Distributed Name Service VL - 3142 ER - TY - CONF AU - Riley, Chris AU - Scheideler, Christian ID - 2121 T2 - IPDPS TI - A Distributed Hash Table for Computational Grids ER - TY - CONF AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 2122 T2 - IPTPS TI - Robust Distributed Name Service VL - 3279 ER - TY - CONF AU - Ateniese, Giuseppe AU - Riley, Chris AU - Scheideler, Christian ID - 2123 T2 - IWIA TI - Survivable Monitoring in Dynamic Networks ER - TY - CONF AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 2124 T2 - SODA TI - The hyperring: a low-congestion deterministic data structure for distributed environments ER - TY - CONF AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 2125 T2 - SPAA TI - Consistent and compact data management in distributed storage systems ER - TY - CONF AU - Bhargava, Ankur AU - Kothapalli, Kishore AU - Riley, Chris AU - Scheideler, Christian AU - Thober, Mark ID - 2126 T2 - SPAA TI - Pagoda: a dynamic overlay network for routing, data management, and multicasting ER - TY - CONF AU - Bagchi, Amitabha AU - Bhargava, Ankur AU - Chaudhary, Amitabh AU - Eppstein, David AU - Scheideler, Christian ID - 2127 T2 - SPAA TI - The effect of faults on network expansion ER - TY - CONF AU - Korzeniowski, Miroslaw AU - Scheideler, Christian ID - 2114 T2 - ISPAN TI - Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment ER - TY - CONF AU - Kothapalli, Kishore AU - Scheideler, Christian ID - 2115 T2 - ISPAN TI - Supervised Peer-to-Peer Systems ER - TY - CONF AU - Onus, Melih AU - W. Richa, Andrea AU - Kothapalli, Kishore AU - Scheideler, Christian ID - 2116 T2 - ISPAN TI - Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks ER - TY - CONF AU - Kothapalli, Kishore AU - Scheideler, Christian AU - Onus, Melih AU - W. Richa, Andrea ID - 2117 T2 - SPAA TI - Constant density spanners for wireless ad-hoc networks ER - TY - CONF AU - Scheideler, Christian ID - 2118 T2 - STOC TI - How to spread adversarial nodes?: rotate! ER - TY - CONF AU - Scheideler, Christian ID - 2212 T2 - IMA Workshop on Wireless Communications TI - Overlay networks for wireless ad hoc networks ER - TY - JOUR AU - Kolman, Petr AU - Scheideler, Christian ID - 2029 IS - 1 JF - J. Algorithms TI - Improved bounds for the unsplittable flow problem VL - 61 ER - TY - JOUR AU - Ateniese, Giuseppe AU - Riley, Chris AU - Scheideler, Christian ID - 2110 IS - 9 JF - IEEE Trans. Mob. Comput. TI - Survivable Monitoring in Dynamic Networks ER - TY - CONF AU - Kothapalli, Kishore AU - Scheideler, Christian AU - Onus, Melih AU - Schindelhauer, Christian ID - 2111 T2 - IPDPS TI - Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds ER - TY - CONF AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 2112 T2 - OPODIS TI - Robust Random Number Generation for Peer-to-Peer Systems ER - 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 - TY - CONF AB - 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). AU - Kniesburges, Sebastian AU - Scheideler, Christian ID - 626 T2 - Proceedings of the 26th International Symposium on Distributed Computing (DISC) TI - Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems ER - TY - CONF AB - 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. AU - Kolman, Petr AU - Scheideler, Christian ID - 632 T2 - Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA) TI - Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case ER - TY - CONF AB - 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. AU - Kniesburges, Sebastian AU - Koutsopoulos, Andreas AU - Scheideler, Christian ID - 640 T2 - Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) TI - A Self-Stabilization Process for Small-World Networks 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 - 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 - 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 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 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 -