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 -