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 - 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 - 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 - 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 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 - 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 - 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 - Adler, Micah AU - Scheideler, Christian ID - 2143 IS - 5/6 JF - Theory Comput. Syst. TI - Efficient Communication Strategies for Ad Hoc Wireless Networks VL - 33 ER - TY - JOUR AU - Scheideler, Christian AU - Vöcking, Berthold ID - 2145 IS - 4 JF - SIAM J. Comput. TI - From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols VL - 30 ER - TY - CONF AU - Berenbrink, Petra AU - Brinkmann, André AU - Scheideler, Christian ID - 2146 T2 - PDPTA TI - Distributed Path Selection for Storage Networks ER - 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 -