@inproceedings{2022, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007}}, title = {{{Towards Scalable and Robust Overlay Networks}}}, year = {{2007}}, } @inproceedings{2023, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007}}, isbn = {{978-1-59593-616-5}}, pages = {{370----371}}, publisher = {{ACM}}, title = {{{A denial-of-service resistant DHT}}}, doi = {{10.1145/1281100.1281178}}, year = {{2007}}, } @inproceedings{2024, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings}}, isbn = {{978-3-540-75141-0}}, pages = {{33----47}}, publisher = {{Springer}}, title = {{{A Denial-of-Service Resistant DHT}}}, doi = {{10.1007/978-3-540-75142-7_6}}, volume = {{4731}}, year = {{2007}}, } @inbook{2028, author = {{W. Richa, Andrea and Scheideler, Christian}}, booktitle = {{Handbook of Approximation Algorithms and Metaheuristics.}}, isbn = {{978-1-58488-550-4}}, title = {{{Overlay Networks for Peer-to-Peer Networks}}}, doi = {{10.1201/9781420010749.ch72}}, year = {{2007}}, } @inproceedings{2214, abstract = {{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.}}, author = {{Brinkmann, André and Effert, Sascha and Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, booktitle = {{IEEE International Conference on Distributed Computing Systems (ICDCS)}}, title = {{{Dynamic and redundant data placement}}}, year = {{2007}}, } @article{2209, author = {{Aggarwal, Vinay and Feldmann, Anja and Scheideler, Christian}}, journal = {{ACM Computer Commucation Review}}, title = {{{Can ISPs and P2P users cooperate for improved performance?}}}, doi = {{10.1145/1273445.1273449}}, year = {{2007}}, } @article{2029, author = {{Kolman, Petr and Scheideler, Christian}}, journal = {{J. Algorithms}}, number = {{1}}, pages = {{20----44}}, title = {{{Improved bounds for the unsplittable flow problem}}}, doi = {{10.1016/j.jalgor.2004.07.006}}, volume = {{61}}, year = {{2006}}, } @article{2110, author = {{Ateniese, Giuseppe and Riley, Chris and Scheideler, Christian}}, journal = {{IEEE Trans. Mob. Comput.}}, number = {{9}}, pages = {{1242----1254}}, title = {{{Survivable Monitoring in Dynamic Networks}}}, doi = {{10.1109/TMC.2006.138}}, year = {{2006}}, } @inproceedings{2111, author = {{Kothapalli, Kishore and Scheideler, Christian and Onus, Melih and Schindelhauer, Christian}}, booktitle = {{IPDPS}}, title = {{{Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds}}}, year = {{2006}}, } @inproceedings{2112, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{OPODIS}}, pages = {{275----289}}, title = {{{Robust Random Number Generation for Peer-to-Peer Systems}}}, year = {{2006}}, }