--- _id: '1858' author: - first_name: Riko full_name: Jacob, Riko last_name: Jacob - first_name: Andrea full_name: W. Richa, Andrea last_name: W. Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid - first_name: Hanjo full_name: Täubig, Hanjo last_name: Täubig citation: ama: 'Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. SKIP*: A Self-Stabilizing Skip Graph. J ACM. 2014;(6):36:1--36:26. doi:10.1145/2629695' apa: 'Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2014). SKIP*: A Self-Stabilizing Skip Graph. J. ACM, (6), 36:1--36:26. https://doi.org/10.1145/2629695' bibtex: '@article{Jacob_W. Richa_Scheideler_Schmid_Täubig_2014, title={SKIP*: A Self-Stabilizing Skip Graph}, DOI={10.1145/2629695}, number={6}, journal={J. ACM}, author={Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2014}, pages={36:1--36:26} }' chicago: 'Jacob, Riko, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “SKIP*: A Self-Stabilizing Skip Graph.” J. ACM, no. 6 (2014): 36:1--36:26. https://doi.org/10.1145/2629695.' ieee: 'R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “SKIP*: A Self-Stabilizing Skip Graph,” J. ACM, no. 6, pp. 36:1--36:26, 2014.' mla: 'Jacob, Riko, et al. “SKIP*: A Self-Stabilizing Skip Graph.” J. ACM, no. 6, 2014, pp. 36:1--36:26, doi:10.1145/2629695.' short: R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, J. ACM (2014) 36:1--36:26. date_created: 2018-03-28T06:17:25Z date_updated: 2022-01-06T06:53:40Z department: - _id: '79' doi: 10.1145/2629695 issue: '6' page: 36:1--36:26 publication: J. ACM status: public title: 'SKIP*: A Self-Stabilizing Skip Graph' type: journal_article user_id: '15504' year: '2014' ... --- _id: '1863' author: - first_name: Zahra full_name: Derakhshandeh, Zahra last_name: Derakhshandeh - first_name: Shlomi full_name: Dolev, Shlomi last_name: Dolev - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Andrea full_name: W. Richa, Andrea last_name: W. Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: 'Derakhshandeh Z, Dolev S, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Brief announcement: amoebot - a new model for programmable matter. In: 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014. ACM; 2014:220--222. doi:10.1145/2612669.2612712' apa: 'Derakhshandeh, Z., Dolev, S., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2014). Brief announcement: amoebot - a new model for programmable matter. In 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014 (pp. 220--222). ACM. https://doi.org/10.1145/2612669.2612712' bibtex: '@inproceedings{Derakhshandeh_Dolev_Gmyr_W. Richa_Scheideler_Strothmann_2014, title={Brief announcement: amoebot - a new model for programmable matter}, DOI={10.1145/2612669.2612712}, booktitle={26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014}, publisher={ACM}, author={Derakhshandeh, Zahra and Dolev, Shlomi and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2014}, pages={220--222} }' chicago: 'Derakhshandeh, Zahra, Shlomi Dolev, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Brief Announcement: Amoebot - a New Model for Programmable Matter.” In 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, 220--222. ACM, 2014. https://doi.org/10.1145/2612669.2612712.' ieee: 'Z. Derakhshandeh, S. Dolev, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Brief announcement: amoebot - a new model for programmable matter,” in 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, 2014, pp. 220--222.' mla: 'Derakhshandeh, Zahra, et al. “Brief Announcement: Amoebot - a New Model for Programmable Matter.” 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, ACM, 2014, pp. 220--222, doi:10.1145/2612669.2612712.' short: 'Z. Derakhshandeh, S. Dolev, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, ACM, 2014, pp. 220--222.' date_created: 2018-03-28T06:24:00Z date_updated: 2022-01-06T06:53:47Z department: - _id: '79' doi: 10.1145/2612669.2612712 language: - iso: eng page: 220--222 publication: 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'14, Prague, Czech Republic - June 23 - 25, 2014 publication_identifier: isbn: - 978-1-4503-2821-0 publisher: ACM status: public title: 'Brief announcement: amoebot - a new model for programmable matter' type: conference user_id: '15504' year: '2014' ... --- _id: '446' abstract: - lang: eng text: 'This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. While this problem has already been studied intensively for simplistic single-hop or unit disk graph models, we make a leap forward and study MAC protocols for the SINR interference model (a.k.a. the physical model). We make two contributions. First, we introduce a new adversarial SINR model which captures a wide range of interference phenomena. Concretely, we consider a powerful, adaptive adversary which can jam nodes at arbitrary times and which is only limited by some energy budget. The second contribution of this paper is a distributed MAC protocol which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures that a constant fraction of the non-blocked time periods is used for successful transmissions.' author: - first_name: Adrian full_name: Ogierman, Adrian last_name: Ogierman - first_name: Andrea W. full_name: Richa, Andrea W. last_name: Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid - first_name: Jin full_name: Zhang, Jin last_name: Zhang citation: ama: 'Ogierman A, Richa AW, Scheideler C, Schmid S, Zhang J. Competitive MAC under adversarial SINR. In: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM). ; 2014:2751--2759. doi:10.1109/INFOCOM.2014.6848224' apa: Ogierman, A., Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2014). Competitive MAC under adversarial SINR. In Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM) (pp. 2751--2759). https://doi.org/10.1109/INFOCOM.2014.6848224 bibtex: '@inproceedings{Ogierman_Richa_Scheideler_Schmid_Zhang_2014, title={Competitive MAC under adversarial SINR}, DOI={10.1109/INFOCOM.2014.6848224}, booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM)}, author={Ogierman, Adrian and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2014}, pages={2751--2759} }' chicago: Ogierman, Adrian, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive MAC under Adversarial SINR.” In Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM), 2751--2759, 2014. https://doi.org/10.1109/INFOCOM.2014.6848224. ieee: A. Ogierman, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive MAC under adversarial SINR,” in Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759. mla: Ogierman, Adrian, et al. “Competitive MAC under Adversarial SINR.” Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759, doi:10.1109/INFOCOM.2014.6848224. short: 'A. Ogierman, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759.' date_created: 2017-10-17T12:42:18Z date_updated: 2022-01-06T07:01:05Z ddc: - '040' department: - _id: '79' doi: 10.1109/INFOCOM.2014.6848224 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-16T11:27:04Z date_updated: 2018-03-16T11:27:04Z file_id: '1348' file_name: 446-infocom14_01.pdf file_size: 378095 relation: main_file success: 1 file_date_updated: 2018-03-16T11:27:04Z has_accepted_license: '1' page: 2751--2759 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM) status: public title: Competitive MAC under adversarial SINR type: conference user_id: '15504' year: '2014' ... --- _id: '459' abstract: - lang: eng text: In this survey article, we discuss two algorithmic research areas that emerge from problems that arise when resources are offered in the cloud. The first area, online leasing, captures problems arising from the fact that resources in the cloud are not bought, but leased by cloud vendors. The second area, Distributed Storage Systems, deals with problems arising from so-called cloud federations, i.e., when several cloud providers are needed to fulfill a given task. author: - first_name: Sebastian full_name: Kniesburges, Sebastian last_name: Kniesburges - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic Aspects of Resource Management in the Cloud. In: Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO). LNCS. ; 2014:1-13. doi:10.1007/978-3-319-09620-9_1' apa: Kniesburges, S., Markarian, C., Meyer auf der Heide, F., & Scheideler, C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 1–13). https://doi.org/10.1007/978-3-319-09620-9_1 bibtex: '@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014, series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud}, DOI={10.1007/978-3-319-09620-9_1}, booktitle={Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2014}, pages={1–13}, collection={LNCS} }' chicago: Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.” In Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 1–13. LNCS, 2014. https://doi.org/10.1007/978-3-319-09620-9_1. ieee: S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic Aspects of Resource Management in the Cloud,” in Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13. mla: Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.” Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1. short: 'S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler, in: Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13.' date_created: 2017-10-17T12:42:21Z date_updated: 2022-01-06T07:01:14Z ddc: - '040' department: - _id: '79' - _id: '63' doi: 10.1007/978-3-319-09620-9_1 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-16T11:21:54Z date_updated: 2018-03-16T11:21:54Z file_id: '1338' file_name: 459-SIROCCO2014.pdf file_size: 274496 relation: main_file success: 1 file_date_updated: 2018-03-16T11:21:54Z has_accepted_license: '1' page: 1-13 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO) series_title: LNCS status: public title: Algorithmic Aspects of Resource Management in the Cloud type: conference user_id: '477' year: '2014' ... --- _id: '464' abstract: - lang: eng text: Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful network topologies. The goal is to devise distributed algorithms where nodes forward, insert, and delete links to neighboring nodes, and that converge quickly to such a desirable topology, independently of the initial network configuration. This article proposes a new model to study the parallel convergence time. Our model sheds light on the achievable parallelism by avoiding bottlenecks of existing models that can yield a distorted picture. As a case study, we consider local graph linearization—i.e., how to build a sorted list of the nodes of a connected graph in a distributed and self-stabilizing manner. In order to study the main structure and properties of our model, we propose two variants of a most simple local linearization algorithm. For each of these variants, we present analyses of the worst-case and bestcase parallel time complexities, as well as the performance under a greedy selection of the actions to be executed. It turns out that the analysis is non-trivial despite the simple setting, and to complement our formal insights we report on our experiments which indicate that the runtimes may be better in the average case. author: - first_name: Dominik full_name: Gall, Dominik last_name: Gall - first_name: Riko full_name: Jacob, Riko last_name: Jacob - first_name: Andrea W. full_name: Richa, Andrea W. last_name: Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid - first_name: 'Hanjo ' full_name: 'Täubig, Hanjo ' last_name: Täubig citation: ama: Gall D, Jacob R, Richa AW, Scheideler C, Schmid S, Täubig H. A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. Theory of Computing Systems. 2014;(1):110-135. doi:10.1007/s00224-013-9504-x apa: Gall, D., Jacob, R., Richa, A. W., Scheideler, C., Schmid, S., & Täubig, H. (2014). A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. Theory of Computing Systems, (1), 110–135. https://doi.org/10.1007/s00224-013-9504-x bibtex: '@article{Gall_Jacob_Richa_Scheideler_Schmid_Täubig_2014, title={A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization}, DOI={10.1007/s00224-013-9504-x}, number={1}, journal={Theory of Computing Systems}, publisher={Springer}, author={Gall, Dominik and Jacob, Riko and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo }, year={2014}, pages={110–135} }' chicago: 'Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.” Theory of Computing Systems, no. 1 (2014): 110–35. https://doi.org/10.1007/s00224-013-9504-x.' ieee: D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization,” Theory of Computing Systems, no. 1, pp. 110–135, 2014. mla: Gall, Dominik, et al. “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.” Theory of Computing Systems, no. 1, Springer, 2014, pp. 110–35, doi:10.1007/s00224-013-9504-x. short: D. Gall, R. Jacob, A.W. Richa, C. Scheideler, S. Schmid, H. Täubig, Theory of Computing Systems (2014) 110–135. date_created: 2017-10-17T12:42:22Z date_updated: 2022-01-06T07:01:16Z ddc: - '040' department: - _id: '79' doi: 10.1007/s00224-013-9504-x file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-16T11:19:45Z date_updated: 2018-03-16T11:19:45Z file_id: '1334' file_name: 464-GJRSST2014.pdf file_size: 947484 relation: main_file success: 1 file_date_updated: 2018-03-16T11:19:45Z has_accepted_license: '1' issue: '1' page: 110-135 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Theory of Computing Systems publisher: Springer status: public title: A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization type: journal_article user_id: '477' year: '2014' ... --- _id: '393' abstract: - lang: eng text: 'A fundamental problem for peer-to-peer systems is to maintain connectivity while nodes are leaving, i.e., the nodes requesting to leave the peer-to-peer system are excluded from the overlay network without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state initially. Surprisingly, the problem is not formally studied yet for the case in which the overlay network is in an arbitrary initial state, i.e., when looking for a self-stabilizing solution for excluding leaving nodes. We study this problem in two variants: the Finite Departure Problem (FDP) ) and the Finite Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when it is safe to leave the network, whereas in the FSP, this leaving decision does not have to be final: the nodes may resume computation if necessary. We show that there is no self-stabilizing distributed algorithm for the FDP, even in a synchronous message passing model. To allow a solution, we introduce an oracle called NIDEC and show that it is sufficient even for the asynchronous message passing model by proposing an algorithm that can solve the FDP using NIDEC. We also show that a solution to the FSP does not require an oracle.' author: - first_name: Dianne full_name: Foreback, Dianne last_name: Foreback - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos - first_name: Mikhail full_name: Nesterenko, Mikhail last_name: Nesterenko - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: 'Foreback D, Koutsopoulos A, Nesterenko M, Scheideler C, Strothmann TF. On Stabilizing Departures in Overlay Networks. In: Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems. LNCS. ; 2014:48--62. doi:10.1007/978-3-319-11764-5_4' apa: Foreback, D., Koutsopoulos, A., Nesterenko, M., Scheideler, C., & Strothmann, T. F. (2014). On Stabilizing Departures in Overlay Networks. In Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (pp. 48--62). https://doi.org/10.1007/978-3-319-11764-5_4 bibtex: '@inproceedings{Foreback_Koutsopoulos_Nesterenko_Scheideler_Strothmann_2014, series={LNCS}, title={On Stabilizing Departures in Overlay Networks}, DOI={10.1007/978-3-319-11764-5_4}, booktitle={Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems}, author={Foreback, Dianne and Koutsopoulos, Andreas and Nesterenko, Mikhail and Scheideler, Christian and Strothmann, Thim Frederik}, year={2014}, pages={48--62}, collection={LNCS} }' chicago: Foreback, Dianne, Andreas Koutsopoulos, Mikhail Nesterenko, Christian Scheideler, and Thim Frederik Strothmann. “On Stabilizing Departures in Overlay Networks.” In Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 48--62. LNCS, 2014. https://doi.org/10.1007/978-3-319-11764-5_4. ieee: D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, and T. F. Strothmann, “On Stabilizing Departures in Overlay Networks,” in Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62. mla: Foreback, Dianne, et al. “On Stabilizing Departures in Overlay Networks.” Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62, doi:10.1007/978-3-319-11764-5_4. short: 'D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, T.F. Strothmann, in: Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62.' date_created: 2017-10-17T12:42:08Z date_updated: 2022-01-06T06:59:56Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-319-11764-5_4 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:00:28Z date_updated: 2018-03-20T07:00:28Z file_id: '1384' file_name: 393-departures.pdf file_size: 287539 relation: main_file success: 1 file_date_updated: 2018-03-20T07:00:28Z has_accepted_license: '1' language: - iso: eng page: 48--62 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems series_title: LNCS status: public title: On Stabilizing Departures in Overlay Networks type: conference user_id: '477' year: '2014' ... --- _id: '397' abstract: - lang: eng text: We present a factor $14D^2$ approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where $D$ is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time $O(|E|)$ and is very easy to implement. Its divide-and-conquer approach allows for an effective parallelization. Note that a suitable decomposition can also be computed in time $O(|E|\log{|E|})$ (or even $O(\log{|E|}\log^*{|E|})$ on an EREW PRAM using $O(|E|)$ processors). For the proof of the approximation ratio, we use a sophisticated charging method that uses techniques similar to amortized analysis in advanced data structures. On general graphs, the minimum linear arrangement problem is known to be NP-hard. To the best of our knowledge, the minimum linear arrangement problem on series-parallel graphs has not been studied before. author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Martina full_name: Eikel, Martina last_name: Eikel - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer citation: ama: 'Scheideler C, Eikel M, Setzer A. Minimum Linear Arrangement of Series-Parallel Graphs. In: Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA). LNCS. ; 2014:168--180.' apa: Scheideler, C., Eikel, M., & Setzer, A. (2014). Minimum Linear Arrangement of Series-Parallel Graphs. In Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA) (pp. 168--180). bibtex: '@inproceedings{Scheideler_Eikel_Setzer_2014, series={LNCS}, title={Minimum Linear Arrangement of Series-Parallel Graphs}, booktitle={Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)}, author={Scheideler, Christian and Eikel, Martina and Setzer, Alexander}, year={2014}, pages={168--180}, collection={LNCS} }' chicago: Scheideler, Christian, Martina Eikel, and Alexander Setzer. “Minimum Linear Arrangement of Series-Parallel Graphs.” In Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 168--180. LNCS, 2014. ieee: C. Scheideler, M. Eikel, and A. Setzer, “Minimum Linear Arrangement of Series-Parallel Graphs,” in Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180. mla: Scheideler, Christian, et al. “Minimum Linear Arrangement of Series-Parallel Graphs.” Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180. short: 'C. Scheideler, M. Eikel, A. Setzer, in: Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.' date_created: 2017-10-17T12:42:09Z date_updated: 2022-01-06T07:00:02Z ddc: - '040' department: - _id: '79' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T06:58:44Z date_updated: 2018-03-20T06:58:44Z file_id: '1381' file_name: 397-WAOA14_01.pdf file_size: 365818 relation: main_file success: 1 file_date_updated: 2018-03-20T06:58:44Z has_accepted_license: '1' page: 168--180 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA) series_title: LNCS status: public title: Minimum Linear Arrangement of Series-Parallel Graphs type: conference user_id: '15504' year: '2014' ... --- _id: '412' abstract: - lang: eng text: In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Kalman full_name: Graffi, Kalman last_name: Graffi citation: ama: 'Feldotto M, Scheideler C, Graffi K. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In: Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P). ; 2014:1-10. doi:10.1109/P2P.2014.6934300' apa: 'Feldotto, M., Scheideler, C., & Graffi, K. (2014). HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P) (pp. 1–10). https://doi.org/10.1109/P2P.2014.6934300' bibtex: '@inproceedings{Feldotto_Scheideler_Graffi_2014, title={HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}, DOI={10.1109/P2P.2014.6934300}, booktitle={Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)}, author={Feldotto, Matthias and Scheideler, Christian and Graffi, Kalman}, year={2014}, pages={1–10} }' chicago: 'Feldotto, Matthias, Christian Scheideler, and Kalman Graffi. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” In Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 1–10, 2014. https://doi.org/10.1109/P2P.2014.6934300.' ieee: 'M. Feldotto, C. Scheideler, and K. Graffi, “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths,” in Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.' mla: 'Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10, doi:10.1109/P2P.2014.6934300.' short: 'M. Feldotto, C. Scheideler, K. Graffi, in: Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.' date_created: 2017-10-17T12:42:12Z date_updated: 2022-01-06T07:00:20Z ddc: - '040' department: - _id: '79' - _id: '63' - _id: '541' doi: 10.1109/P2P.2014.6934300 external_id: arxiv: - '1408.0395' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-16T11:34:00Z date_updated: 2018-03-16T11:34:00Z file_id: '1361' file_name: 412-FSG2014P2P.pdf file_size: 472321 relation: main_file success: 1 file_date_updated: 2018-03-16T11:34:00Z has_accepted_license: '1' page: 1-10 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P) status: public title: 'HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths' type: conference user_id: '14052' year: '2014' ... --- _id: '1868' author: - first_name: Andr{\'{e}}a full_name: W. Richa, Andr{\'{e}}a last_name: W. Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid - first_name: Jin full_name: Zhang, Jin last_name: Zhang citation: ama: W. Richa A, Scheideler C, Schmid S, Zhang J. Competitive throughput in multi-hop wireless networks despite adaptive jamming. Distributed Computing. 2013;(3):159--171. doi:10.1007/s00446-012-0180-x apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2013). Competitive throughput in multi-hop wireless networks despite adaptive jamming. Distributed Computing, (3), 159--171. https://doi.org/10.1007/s00446-012-0180-x bibtex: '@article{W. Richa_Scheideler_Schmid_Zhang_2013, title={Competitive throughput in multi-hop wireless networks despite adaptive jamming}, DOI={10.1007/s00446-012-0180-x}, number={3}, journal={Distributed Computing}, author={W. Richa, Andr{\’{e}}a and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2013}, pages={159--171} }' chicago: 'W. Richa, Andr{\’{e}}a, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive Throughput in Multi-Hop Wireless Networks despite Adaptive Jamming.” Distributed Computing, no. 3 (2013): 159--171. https://doi.org/10.1007/s00446-012-0180-x.' ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive throughput in multi-hop wireless networks despite adaptive jamming,” Distributed Computing, no. 3, pp. 159--171, 2013. mla: W. Richa, Andr{\’{e}}a, et al. “Competitive Throughput in Multi-Hop Wireless Networks despite Adaptive Jamming.” Distributed Computing, no. 3, 2013, pp. 159--171, doi:10.1007/s00446-012-0180-x. short: A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing (2013) 159--171. date_created: 2018-03-28T06:31:02Z date_updated: 2022-01-06T06:53:50Z department: - _id: '79' doi: 10.1007/s00446-012-0180-x issue: '3' page: 159--171 publication: Distributed Computing status: public title: Competitive throughput in multi-hop wireless networks despite adaptive jamming type: journal_article user_id: '15504' year: '2013' ... --- _id: '1870' author: - first_name: Rizal full_name: Mohd Nor, Rizal last_name: Mohd Nor - first_name: Mikhail full_name: Nesterenko, Mikhail last_name: Nesterenko - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: Mohd Nor R, Nesterenko M, Scheideler C. Corona:  A stabilizing deterministic message-passing skip list. Theor Comput Sci. 2013:119--129. doi:10.1016/j.tcs.2012.08.029 apa: Mohd Nor, R., Nesterenko, M., & Scheideler, C. (2013). Corona:  A stabilizing deterministic message-passing skip list. Theor. Comput. Sci., 119--129. https://doi.org/10.1016/j.tcs.2012.08.029 bibtex: '@article{Mohd Nor_Nesterenko_Scheideler_2013, title={Corona:  A stabilizing deterministic message-passing skip list}, DOI={10.1016/j.tcs.2012.08.029}, journal={Theor. Comput. Sci.}, author={Mohd Nor, Rizal and Nesterenko, Mikhail and Scheideler, Christian}, year={2013}, pages={119--129} }' chicago: Mohd Nor, Rizal, Mikhail Nesterenko, and Christian Scheideler. “Corona:  A Stabilizing Deterministic Message-Passing Skip List.” Theor. Comput. Sci., 2013, 119--129. https://doi.org/10.1016/j.tcs.2012.08.029. ieee: R. Mohd Nor, M. Nesterenko, and C. Scheideler, “Corona:  A stabilizing deterministic message-passing skip list,” Theor. Comput. Sci., pp. 119--129, 2013. mla: Mohd Nor, Rizal, et al. “Corona:  A Stabilizing Deterministic Message-Passing Skip List.” Theor. Comput. Sci., 2013, pp. 119--129, doi:10.1016/j.tcs.2012.08.029. short: R. Mohd Nor, M. Nesterenko, C. Scheideler, Theor. Comput. Sci. (2013) 119--129. date_created: 2018-03-28T06:32:26Z date_updated: 2022-01-06T06:53:51Z department: - _id: '79' doi: 10.1016/j.tcs.2012.08.029 page: 119--129 publication: Theor. Comput. Sci. status: public title: 'Corona: A stabilizing deterministic message-passing skip list' type: journal_article user_id: '15504' year: '2013' ... --- _id: '1871' author: - first_name: Andrea full_name: W. Richa, Andrea last_name: W. Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid - first_name: Jin full_name: Zhang, Jin last_name: Zhang citation: ama: W. Richa A, Scheideler C, Schmid S, Zhang J. An Efficient and Fair MAC Protocol Robust to Reactive Interference. IEEE/ACM Trans Netw. 2013;(3):760--771. doi:10.1109/TNET.2012.2210241 apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2013). An Efficient and Fair MAC Protocol Robust to Reactive Interference. IEEE/ACM Trans. Netw., (3), 760--771. https://doi.org/10.1109/TNET.2012.2210241 bibtex: '@article{W. Richa_Scheideler_Schmid_Zhang_2013, title={An Efficient and Fair MAC Protocol Robust to Reactive Interference}, DOI={10.1109/TNET.2012.2210241}, number={3}, journal={IEEE/ACM Trans. Netw.}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2013}, pages={760--771} }' chicago: 'W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “An Efficient and Fair MAC Protocol Robust to Reactive Interference.” IEEE/ACM Trans. Netw., no. 3 (2013): 760--771. https://doi.org/10.1109/TNET.2012.2210241.' ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “An Efficient and Fair MAC Protocol Robust to Reactive Interference,” IEEE/ACM Trans. Netw., no. 3, pp. 760--771, 2013. mla: W. Richa, Andrea, et al. “An Efficient and Fair MAC Protocol Robust to Reactive Interference.” IEEE/ACM Trans. Netw., no. 3, 2013, pp. 760--771, doi:10.1109/TNET.2012.2210241. short: A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, IEEE/ACM Trans. Netw. (2013) 760--771. date_created: 2018-03-28T06:32:59Z date_updated: 2022-01-06T06:53:51Z department: - _id: '79' doi: 10.1109/TNET.2012.2210241 issue: '3' page: 760--771 publication: IEEE/ACM Trans. Netw. status: public title: An Efficient and Fair MAC Protocol Robust to Reactive Interference type: journal_article user_id: '15504' year: '2013' ... --- _id: '476' abstract: - lang: eng text: '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.' author: - first_name: Petr full_name: Kolman, Petr last_name: Kolman - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Kolman P, Scheideler C. Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. Theory of Computing Systems. 2013;(2):341-363. doi:10.1007/s00224-013-9454-3' apa: 'Kolman, P., & Scheideler, C. (2013). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. Theory of Computing Systems, (2), 341–363. https://doi.org/10.1007/s00224-013-9454-3' bibtex: '@article{Kolman_Scheideler_2013, title={Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={10.1007/s00224-013-9454-3}, number={2}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kolman, Petr and Scheideler, Christian}, year={2013}, pages={341–363} }' chicago: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” Theory of Computing Systems, no. 2 (2013): 341–63. https://doi.org/10.1007/s00224-013-9454-3.' ieee: 'P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing,” Theory of Computing Systems, no. 2, pp. 341–363, 2013.' mla: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” Theory of Computing Systems, no. 2, Springer, 2013, pp. 341–63, doi:10.1007/s00224-013-9454-3.' short: P. Kolman, C. Scheideler, Theory of Computing Systems (2013) 341–363. date_created: 2017-10-17T12:42:24Z date_updated: 2022-01-06T07:01:21Z ddc: - '040' department: - _id: '79' doi: 10.1007/s00224-013-9454-3 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T14:07:18Z date_updated: 2018-03-15T14:07:18Z file_id: '1326' file_name: 476-tocsrevised3b.pdf file_size: 264308 relation: main_file success: 1 file_date_updated: 2018-03-15T14:07:18Z has_accepted_license: '1' issue: '2' page: 341-363 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Theory of Computing Systems publisher: Springer status: public title: 'Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing' type: journal_article user_id: '477' year: '2013' ... --- _id: '513' abstract: - lang: eng text: 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. author: - first_name: Chen full_name: Avin, Chen last_name: Avin - first_name: Bernhard full_name: Häupler, Bernhard last_name: Häupler - first_name: Zvi full_name: Lotker, Zvi last_name: Lotker - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: 'Avin C, Häupler B, Lotker Z, Scheideler C, Schmid S. Locally Self-Adjusting Tree Networks. In: Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2013:395-406. doi:10.1109/IPDPS.2013.40' apa: Avin, C., Häupler, B., Lotker, Z., Scheideler, C., & Schmid, S. (2013). Locally Self-Adjusting Tree Networks. In Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 395–406). https://doi.org/10.1109/IPDPS.2013.40 bibtex: '@inproceedings{Avin_Häupler_Lotker_Scheideler_Schmid_2013, title={Locally Self-Adjusting Tree Networks}, DOI={10.1109/IPDPS.2013.40}, booktitle={Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Avin, Chen and Häupler, Bernhard and Lotker, Zvi and Scheideler, Christian and Schmid, Stefan}, year={2013}, pages={395–406} }' chicago: Avin, Chen, Bernhard Häupler, Zvi Lotker, Christian Scheideler, and Stefan Schmid. “Locally Self-Adjusting Tree Networks.” In Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 395–406, 2013. https://doi.org/10.1109/IPDPS.2013.40. ieee: C. Avin, B. Häupler, Z. Lotker, C. Scheideler, and S. Schmid, “Locally Self-Adjusting Tree Networks,” in Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406. mla: Avin, Chen, et al. “Locally Self-Adjusting Tree Networks.” Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406, doi:10.1109/IPDPS.2013.40. short: 'C. Avin, B. Häupler, Z. Lotker, C. Scheideler, S. Schmid, in: Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406.' date_created: 2017-10-17T12:42:32Z date_updated: 2022-01-06T07:01:38Z ddc: - '040' department: - _id: '79' doi: 10.1109/IPDPS.2013.40 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:45:15Z date_updated: 2018-03-15T10:45:15Z file_id: '1303' file_name: 513-ipdps13_01.pdf file_size: 518804 relation: main_file success: 1 file_date_updated: 2018-03-15T10:45:15Z has_accepted_license: '1' page: 395-406 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS) status: public title: Locally Self-Adjusting Tree Networks type: conference user_id: '15504' year: '2013' ... --- _id: '519' abstract: - lang: eng text: 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. author: - first_name: Martina full_name: Eikel, Martina last_name: Eikel - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS-Attacks. In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2013:119-129. doi:10.1145/2486159.2486186' apa: 'Eikel, M., & Scheideler, C. (2013). IRIS: A Robust Information System Against Insider DoS-Attacks. In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 119–129). https://doi.org/10.1145/2486159.2486186' bibtex: '@inproceedings{Eikel_Scheideler_2013, title={IRIS: A Robust Information System Against Insider DoS-Attacks}, DOI={10.1145/2486159.2486186}, booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Eikel, Martina and Scheideler, Christian}, year={2013}, pages={119–129} }' chicago: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 119–29, 2013. https://doi.org/10.1145/2486159.2486186.' ieee: 'M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider DoS-Attacks,” in Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–129.' mla: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–29, doi:10.1145/2486159.2486186.' short: 'M. Eikel, C. Scheideler, in: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–129.' date_created: 2017-10-17T12:42:33Z date_updated: 2022-01-06T07:01:42Z ddc: - '040' department: - _id: '79' doi: 10.1145/2486159.2486186 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:38:34Z date_updated: 2018-03-15T10:38:34Z file_id: '1299' file_name: 519-iris-spaa2013_01.pdf file_size: 554618 relation: main_file success: 1 file_date_updated: 2018-03-15T10:38:34Z has_accepted_license: '1' page: 119-129 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) status: public title: 'IRIS: A Robust Information System Against Insider DoS-Attacks' type: conference user_id: '15504' year: '2013' ... --- _id: '542' abstract: - lang: eng text: '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.' author: - first_name: Sebastian full_name: Kniesburges, Sebastian last_name: Kniesburges - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In: Proceedings of the 27th International Symposium on Distributed Computing (DISC). LNCS. ; 2013:537-549. doi:10.1007/978-3-642-41527-2_37' apa: 'Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2013). CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In Proceedings of the 27th International Symposium on Distributed Computing (DISC) (pp. 537–549). https://doi.org/10.1007/978-3-642-41527-2_37' bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={LNCS}, title={CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system}, DOI={10.1007/978-3-642-41527-2_37}, booktitle={Proceedings of the 27th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2013}, pages={537–549}, collection={LNCS} }' chicago: 'Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” In Proceedings of the 27th International Symposium on Distributed Computing (DISC), 537–49. LNCS, 2013. https://doi.org/10.1007/978-3-642-41527-2_37.' ieee: 'S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system,” in Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.' mla: 'Kniesburges, Sebastian, et al. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–49, doi:10.1007/978-3-642-41527-2_37.' short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.' date_created: 2017-10-17T12:42:38Z date_updated: 2022-01-06T07:01:53Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-642-41527-2_37 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:32:48Z date_updated: 2018-03-15T10:32:48Z file_id: '1289' file_name: 542-CONE-DHT_A_distributed_self-stabilizing_algorithm_for_a_heterogeneous_storage_system.pdf file_size: 262302 relation: main_file success: 1 file_date_updated: 2018-03-15T10:32:48Z has_accepted_license: '1' page: 537-549 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 27th International Symposium on Distributed Computing (DISC) series_title: LNCS status: public title: 'CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system' type: conference user_id: '15504' year: '2013' ... --- _id: '564' abstract: - lang: eng text: We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the add ress of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)) or bits (O(nlogn)) a node receives or sendscoincides with the lower bound, while ensuring only a linearruntime (O(n)) on the number of rounds. author: - first_name: Sebastian full_name: Kniesburges, Sebastian last_name: Kniesburges - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery. In: Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO). Lecture Notes in Computer Science. ; 2013:165-176. doi:10.1007/978-3-319-03578-9_14' apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2013). A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery. In Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO) (pp. 165–176). https://doi.org/10.1007/978-3-319-03578-9_14 bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={Lecture Notes in Computer Science}, title={A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery}, DOI={10.1007/978-3-319-03578-9_14}, booktitle={Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2013}, pages={165–176}, collection={Lecture Notes in Computer Science} }' chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” In Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 165–76. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-319-03578-9_14. ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery,” in Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2013, pp. 165–176. mla: Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2013, pp. 165–76, doi:10.1007/978-3-319-03578-9_14. short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2013, pp. 165–176.' date_created: 2017-10-17T12:42:42Z date_updated: 2022-01-06T07:02:17Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-319-03578-9_14 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:24:40Z date_updated: 2018-03-15T10:24:40Z file_id: '1277' file_name: 564-SIROCCO13.pdf file_size: 168884 relation: main_file success: 1 file_date_updated: 2018-03-15T10:24:40Z has_accepted_license: '1' page: 165-176 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO) series_title: Lecture Notes in Computer Science status: public title: A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery type: conference user_id: '15504' year: '2013' ... --- _id: '1882' author: - first_name: Shlomi full_name: Dolev, Shlomi last_name: Dolev - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: Dolev S, Scheideler C. Editorial for Algorithmic Aspects of Wireless Sensor Networks. Theor Comput Sci. 2012:1. doi:10.1016/j.tcs.2012.07.012 apa: Dolev, S., & Scheideler, C. (2012). Editorial for Algorithmic Aspects of Wireless Sensor Networks. Theor. Comput. Sci., 1. https://doi.org/10.1016/j.tcs.2012.07.012 bibtex: '@article{Dolev_Scheideler_2012, title={Editorial for Algorithmic Aspects of Wireless Sensor Networks}, DOI={10.1016/j.tcs.2012.07.012}, journal={Theor. Comput. Sci.}, author={Dolev, Shlomi and Scheideler, Christian}, year={2012}, pages={1} }' chicago: Dolev, Shlomi, and Christian Scheideler. “Editorial for Algorithmic Aspects of Wireless Sensor Networks.” Theor. Comput. Sci., 2012, 1. https://doi.org/10.1016/j.tcs.2012.07.012. ieee: S. Dolev and C. Scheideler, “Editorial for Algorithmic Aspects of Wireless Sensor Networks,” Theor. Comput. Sci., p. 1, 2012. mla: Dolev, Shlomi, and Christian Scheideler. “Editorial for Algorithmic Aspects of Wireless Sensor Networks.” Theor. Comput. Sci., 2012, p. 1, doi:10.1016/j.tcs.2012.07.012. short: S. Dolev, C. Scheideler, Theor. Comput. Sci. (2012) 1. date_created: 2018-03-28T06:44:05Z date_updated: 2022-01-06T06:53:52Z department: - _id: '79' doi: 10.1016/j.tcs.2012.07.012 page: '1' publication: Theor. Comput. Sci. status: public title: Editorial for Algorithmic Aspects of Wireless Sensor Networks type: journal_article user_id: '15504' year: '2012' ... --- _id: '1884' author: - first_name: Burkhard full_name: Monien, Burkhard last_name: Monien - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Monien B, Scheideler C. Selfish Distributed Optimization. In: Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings. Vol 7484. Lecture Notes in Computer Science. Springer; 2012:1--2. doi:10.1007/978-3-642-32820-6_1' apa: Monien, B., & Scheideler, C. (2012). Selfish Distributed Optimization. In Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings (Vol. 7484, pp. 1--2). Springer. https://doi.org/10.1007/978-3-642-32820-6_1 bibtex: '@inproceedings{Monien_Scheideler_2012, series={Lecture Notes in Computer Science}, title={Selfish Distributed Optimization}, volume={7484}, DOI={10.1007/978-3-642-32820-6_1}, booktitle={Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings}, publisher={Springer}, author={Monien, Burkhard and Scheideler, Christian}, year={2012}, pages={1--2}, collection={Lecture Notes in Computer Science} }' chicago: Monien, Burkhard, and Christian Scheideler. “Selfish Distributed Optimization.” In Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, 7484:1--2. Lecture Notes in Computer Science. Springer, 2012. https://doi.org/10.1007/978-3-642-32820-6_1. ieee: B. Monien and C. Scheideler, “Selfish Distributed Optimization,” in Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, 2012, vol. 7484, pp. 1--2. mla: Monien, Burkhard, and Christian Scheideler. “Selfish Distributed Optimization.” Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, vol. 7484, Springer, 2012, pp. 1--2, doi:10.1007/978-3-642-32820-6_1. short: 'B. Monien, C. Scheideler, in: Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, Springer, 2012, pp. 1--2.' date_created: 2018-03-28T06:44:57Z date_updated: 2022-01-06T06:53:52Z department: - _id: '79' doi: 10.1007/978-3-642-32820-6_1 intvolume: ' 7484' page: 1--2 publication: Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings publication_identifier: isbn: - 978-3-642-32819-0 publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Selfish Distributed Optimization type: conference user_id: '15504' volume: 7484 year: '2012' ... --- _id: '570' abstract: - lang: eng text: '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' author: - first_name: Riko full_name: Jacob, Riko last_name: Jacob - first_name: Stephan full_name: Ritscher, Stephan last_name: Ritscher - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: 'Jacob R, Ritscher S, Scheideler C, Schmid S. Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. Theoretical Computer Science. 2012:137-148. doi:10.1016/j.tcs.2012.07.029' apa: 'Jacob, R., Ritscher, S., Scheideler, C., & Schmid, S. (2012). Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. Theoretical Computer Science, 137–148. https://doi.org/10.1016/j.tcs.2012.07.029' bibtex: '@article{Jacob_Ritscher_Scheideler_Schmid_2012, title={Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs}, DOI={10.1016/j.tcs.2012.07.029}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}, year={2012}, pages={137–148} }' chicago: 'Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid. “Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm for Delaunay Graphs.” Theoretical Computer Science, 2012, 137–48. https://doi.org/10.1016/j.tcs.2012.07.029.' ieee: 'R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs,” Theoretical Computer Science, pp. 137–148, 2012.' mla: 'Jacob, Riko, et al. “Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm for Delaunay Graphs.” Theoretical Computer Science, Elsevier, 2012, pp. 137–48, doi:10.1016/j.tcs.2012.07.029.' short: R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, Theoretical Computer Science (2012) 137–148. date_created: 2017-10-17T12:42:43Z date_updated: 2022-01-06T07:02:36Z ddc: - '040' department: - _id: '79' doi: 10.1016/j.tcs.2012.07.029 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:16:20Z date_updated: 2018-03-15T10:16:20Z file_id: '1272' file_name: 570-Delaunay-Journal.pdf file_size: 250051 relation: main_file success: 1 file_date_updated: 2018-03-15T10:16:20Z has_accepted_license: '1' page: 137-148 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Theoretical Computer Science publisher: Elsevier status: public title: 'Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs' type: journal_article user_id: '477' year: '2012' ... --- _id: '574' abstract: - lang: eng text: '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.' author: - first_name: Thomas full_name: Clouser, Thomas last_name: Clouser - first_name: Mikhail full_name: Nesterenko, Mikhail last_name: Nesterenko - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Clouser T, Nesterenko M, Scheideler C. Tiara: A self-stabilizing deterministic skip list and skip graph. Theoretical Computer Science. 2012:18-35. doi:10.1016/j.tcs.2011.12.079' apa: 'Clouser, T., Nesterenko, M., & Scheideler, C. (2012). Tiara: A self-stabilizing deterministic skip list and skip graph. Theoretical Computer Science, 18–35. https://doi.org/10.1016/j.tcs.2011.12.079' bibtex: '@article{Clouser_Nesterenko_Scheideler_2012, title={Tiara: A self-stabilizing deterministic skip list and skip graph}, DOI={10.1016/j.tcs.2011.12.079}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2012}, pages={18–35} }' chicago: 'Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” Theoretical Computer Science, 2012, 18–35. https://doi.org/10.1016/j.tcs.2011.12.079.' ieee: 'T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A self-stabilizing deterministic skip list and skip graph,” Theoretical Computer Science, pp. 18–35, 2012.' mla: 'Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” Theoretical Computer Science, Elsevier, 2012, pp. 18–35, doi:10.1016/j.tcs.2011.12.079.' short: T. Clouser, M. Nesterenko, C. Scheideler, Theoretical Computer Science (2012) 18–35. date_created: 2017-10-17T12:42:44Z date_updated: 2022-01-06T07:02:38Z ddc: - '040' department: - _id: '79' doi: 10.1016/j.tcs.2011.12.079 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T09:09:29Z date_updated: 2018-03-15T09:09:29Z file_id: '1268' file_name: 574-tiara.pdf file_size: 315843 relation: main_file success: 1 file_date_updated: 2018-03-15T09:09:29Z has_accepted_license: '1' page: 18-35 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Theoretical Computer Science publisher: Elsevier status: public title: 'Tiara: A self-stabilizing deterministic skip list and skip graph' type: journal_article user_id: '477' year: '2012' ...