--- _id: '105' abstract: - lang: eng text: We initiate the study of network monitoring algorithms in a class of hybrid networks in which the nodes are connected by an external network and an internal network (as a short form for externally and internally controlled network). While the external network lies outside of the control of the nodes (or in our case, the monitoring protocol running in them) and might be exposed to continuous changes, the internal network is fully under the control of the nodes. As an example, consider a group of users with mobile devices having access to the cell phone infrastructure. While the network formed by the WiFi connections of the devices is an external network (as its structure is not necessarily under the control of the monitoring protocol), the connections between the devices via the cell phone infrastructure represent an internal network (as it can be controlled by the monitoring protocol). Our goal is to continuously monitor properties of the external network with the help of the internal network. We present scalable distributed algorithms that efficiently monitor the number of edges, the average node degree, the clustering coefficient, the bipartiteness, and the weight of a minimum spanning tree. Their performance bounds demonstrate that monitoring the external network state with the help of an internal network can be done much more efficiently than just using the external network, as is usually done in the literature. author: - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Gmyr R, Hinnenthal K, Scheideler C, Sohler C. Distributed Monitoring of Network Properties: The Power of Hybrid Networks. In: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP). Leibniz International Proceedings in Informatics (LIPIcs). ; 2017:137:1--137:15. doi:10.4230/LIPIcs.ICALP.2017.137' apa: 'Gmyr, R., Hinnenthal, K., Scheideler, C., & Sohler, C. (2017). Distributed Monitoring of Network Properties: The Power of Hybrid Networks. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP) (pp. 137:1--137:15). https://doi.org/10.4230/LIPIcs.ICALP.2017.137' bibtex: '@inproceedings{Gmyr_Hinnenthal_Scheideler_Sohler_2017, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Distributed Monitoring of Network Properties: The Power of Hybrid Networks}, DOI={10.4230/LIPIcs.ICALP.2017.137}, booktitle={Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)}, author={Gmyr, Robert and Hinnenthal, Kristian and Scheideler, Christian and Sohler, Christian}, year={2017}, pages={137:1--137:15}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }' chicago: 'Gmyr, Robert, Kristian Hinnenthal, Christian Scheideler, and Christian Sohler. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.” In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 137:1--137:15. Leibniz International Proceedings in Informatics (LIPIcs), 2017. https://doi.org/10.4230/LIPIcs.ICALP.2017.137.' ieee: 'R. Gmyr, K. Hinnenthal, C. Scheideler, and C. Sohler, “Distributed Monitoring of Network Properties: The Power of Hybrid Networks,” in Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, pp. 137:1--137:15.' mla: 'Gmyr, Robert, et al. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.” Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, pp. 137:1--137:15, doi:10.4230/LIPIcs.ICALP.2017.137.' short: 'R. Gmyr, K. Hinnenthal, C. Scheideler, C. Sohler, in: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, pp. 137:1--137:15.' date_created: 2017-10-17T12:41:12Z date_updated: 2022-01-06T06:50:42Z ddc: - '040' department: - _id: '79' doi: 10.4230/LIPIcs.ICALP.2017.137 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-13T09:23:11Z date_updated: 2018-03-13T09:23:11Z file_id: '1207' file_name: 105-ICALP17-GHSS.pdf file_size: 504161 relation: main_file success: 1 file_date_updated: 2018-03-13T09:23:11Z has_accepted_license: '1' language: - iso: eng page: 137:1--137:15 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 44th International Colloquium on Automata, Languages, and Programming (ICALP) series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: 'Distributed Monitoring of Network Properties: The Power of Hybrid Networks' type: conference user_id: '20792' year: '2017' ... --- _id: '125' abstract: - lang: eng text: 'Searching for other participants is one of the most important operations in a distributed system.We are interested in topologies in which it is possible to route a packet in a fixed number of hops until it arrives at its destination.Given a constant $d$, this paper introduces a new self-stabilizing protocol for the $q$-ary $d$-dimensional de Bruijn graph ($q = \sqrt[d]{n}$) that is able to route any search request in at most $d$ hops w.h.p., while significantly lowering the node degree compared to the clique: We require nodes to have a degree of $\mathcal O(\sqrt[d]{n})$, which is asymptotically optimal for a fixed diameter $d$.The protocol keeps the expected amount of edge redirections per node in $\mathcal O(\sqrt[d]{n})$, when the number of nodes in the system increases by factor $2^d$.The number of messages that are periodically sent out by nodes is constant.' author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Feldmann M, Scheideler C. A Self-Stabilizing General De Bruijn Graph. In: Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 10616. Lecture Notes in Computer Science. Springer, Cham; 2017:250-264. doi:10.1007/978-3-319-69084-1_17' apa: Feldmann, M., & Scheideler, C. (2017). A Self-Stabilizing General De Bruijn Graph. In Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 10616, pp. 250–264). Springer, Cham. https://doi.org/10.1007/978-3-319-69084-1_17 bibtex: '@inproceedings{Feldmann_Scheideler_2017, series={Lecture Notes in Computer Science}, title={A Self-Stabilizing General De Bruijn Graph}, volume={10616}, DOI={10.1007/978-3-319-69084-1_17}, booktitle={Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Scheideler, Christian}, year={2017}, pages={250–264}, collection={Lecture Notes in Computer Science} }' chicago: Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General De Bruijn Graph.” In Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 10616:250–64. Lecture Notes in Computer Science. Springer, Cham, 2017. https://doi.org/10.1007/978-3-319-69084-1_17. ieee: M. Feldmann and C. Scheideler, “A Self-Stabilizing General De Bruijn Graph,” in Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2017, vol. 10616, pp. 250–264. mla: Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General De Bruijn Graph.” Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol. 10616, Springer, Cham, 2017, pp. 250–64, doi:10.1007/978-3-319-69084-1_17. short: 'M. Feldmann, C. Scheideler, in: Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2017, pp. 250–264.' date_created: 2017-10-17T12:41:16Z date_updated: 2022-01-06T06:51:19Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-319-69084-1_17 external_id: arxiv: - '1708.06542' file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2018-10-31T13:30:13Z date_updated: 2018-10-31T13:30:13Z file_id: '5214' file_name: Feldmann-Scheideler2017_Chapter_ASelf-stabilizingGeneralDeBrui.pdf file_size: 311204 relation: main_file success: 1 file_date_updated: 2018-10-31T13:30:13Z has_accepted_license: '1' intvolume: ' 10616' language: - iso: eng page: '250-264 ' 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 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) publication_identifier: isbn: - 978-3-319-69083-4 publication_status: published publisher: Springer, Cham series_title: Lecture Notes in Computer Science status: public title: A Self-Stabilizing General De Bruijn Graph type: conference user_id: '23538' volume: 10616 year: '2017' ... --- _id: '215' abstract: - lang: eng text: 'We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems.' author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2016:417--427. doi:10.1145/2935764.2935783' apa: Drees, M., Gmyr, R., & Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427). https://doi.org/10.1145/2935764.2935783 bibtex: '@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}, DOI={10.1145/2935764.2935783}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}, year={2016}, pages={417--427} }' chicago: Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 417--427, 2016. https://doi.org/10.1145/2935764.2935783. ieee: M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427. mla: Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783. short: 'M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.' date_created: 2017-10-17T12:41:33Z date_updated: 2022-01-06T06:55:02Z ddc: - '040' department: - _id: '79' - _id: '63' doi: 10.1145/2935764.2935783 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T10:41:40Z date_updated: 2018-03-21T10:41:40Z file_id: '1518' file_name: 215-SPAA16-Drees_Gmyr_Scheideler.pdf file_size: 352996 relation: main_file success: 1 file_date_updated: 2018-03-21T10:41:40Z has_accepted_license: '1' language: - iso: eng page: 417--427 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 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) status: public title: Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration type: conference user_id: '14955' year: '2016' ... --- _id: '1835' author: - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid - first_name: Chen full_name: Avin, Chen last_name: Avin - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Michael full_name: Borokhovich, Michael last_name: Borokhovich - first_name: Bernhard full_name: Haeupler, Bernhard last_name: Haeupler - first_name: Zvi full_name: Lotker, Zvi last_name: Lotker citation: ama: 'Schmid S, Avin C, Scheideler C, Borokhovich M, Haeupler B, Lotker Z. SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Trans Netw. 2016;(3):1421--1433. doi:10.1109/TNET.2015.2410313' apa: 'Schmid, S., Avin, C., Scheideler, C., Borokhovich, M., Haeupler, B., & Lotker, Z. (2016). SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Trans. Netw., (3), 1421--1433. https://doi.org/10.1109/TNET.2015.2410313' bibtex: '@article{Schmid_Avin_Scheideler_Borokhovich_Haeupler_Lotker_2016, title={SplayNet: Towards Locally Self-Adjusting Networks}, DOI={10.1109/TNET.2015.2410313}, number={3}, journal={IEEE/ACM Trans. Netw.}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Borokhovich, Michael and Haeupler, Bernhard and Lotker, Zvi}, year={2016}, pages={1421--1433} }' chicago: 'Schmid, Stefan, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, and Zvi Lotker. “SplayNet: Towards Locally Self-Adjusting Networks.” IEEE/ACM Trans. Netw., no. 3 (2016): 1421--1433. https://doi.org/10.1109/TNET.2015.2410313.' ieee: 'S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, and Z. Lotker, “SplayNet: Towards Locally Self-Adjusting Networks,” IEEE/ACM Trans. Netw., no. 3, pp. 1421--1433, 2016.' mla: 'Schmid, Stefan, et al. “SplayNet: Towards Locally Self-Adjusting Networks.” IEEE/ACM Trans. Netw., no. 3, 2016, pp. 1421--1433, doi:10.1109/TNET.2015.2410313.' short: S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, Z. Lotker, IEEE/ACM Trans. Netw. (2016) 1421--1433. date_created: 2018-03-27T12:40:24Z date_updated: 2022-01-06T06:53:29Z department: - _id: '79' doi: 10.1109/TNET.2015.2410313 issue: '3' page: 1421--1433 publication: IEEE/ACM Trans. Netw. status: public title: 'SplayNet: Towards Locally Self-Adjusting Networks' type: journal_article user_id: '15504' year: '2016' ... --- _id: '1836' author: - first_name: Zahra full_name: Derakhshandeh, Zahra last_name: Derakhshandeh - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Alexandra full_name: Porter, Alexandra last_name: Porter - 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, Gmyr R, Porter A, W. Richa A, Scheideler C, Strothmann TF. On the Runtime of Universal Coating for Programmable Matter. In: DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings. Vol 9818. Lecture Notes in Computer Science. ; 2016:148--164. doi:10.1007/978-3-319-43994-5_10' apa: Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2016). On the Runtime of Universal Coating for Programmable Matter. In DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings (Vol. 9818, pp. 148--164). https://doi.org/10.1007/978-3-319-43994-5_10 bibtex: '@inproceedings{Derakhshandeh_Gmyr_Porter_W. Richa_Scheideler_Strothmann_2016, series={Lecture Notes in Computer Science}, title={On the Runtime of Universal Coating for Programmable Matter}, volume={9818}, DOI={10.1007/978-3-319-43994-5_10}, booktitle={DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings}, author={Derakhshandeh, Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2016}, pages={148--164}, collection={Lecture Notes in Computer Science} }' chicago: Derakhshandeh, Zahra, Robert Gmyr, Alexandra Porter, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “On the Runtime of Universal Coating for Programmable Matter.” In DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, 9818:148--164. Lecture Notes in Computer Science, 2016. https://doi.org/10.1007/978-3-319-43994-5_10. ieee: Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, and T. F. Strothmann, “On the Runtime of Universal Coating for Programmable Matter,” in DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, 2016, vol. 9818, pp. 148--164. mla: Derakhshandeh, Zahra, et al. “On the Runtime of Universal Coating for Programmable Matter.” DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, vol. 9818, 2016, pp. 148--164, doi:10.1007/978-3-319-43994-5_10. short: 'Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, T.F. Strothmann, in: DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, 2016, pp. 148--164.' date_created: 2018-03-27T12:41:45Z date_updated: 2022-01-06T06:53:30Z department: - _id: '79' doi: 10.1007/978-3-319-43994-5_10 intvolume: ' 9818' language: - iso: eng page: 148--164 publication: DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings publication_identifier: unknown: - 978-3-319-43993-8 series_title: Lecture Notes in Computer Science status: public title: On the Runtime of Universal Coating for Programmable Matter type: conference user_id: '15504' volume: 9818 year: '2016' ... --- _id: '1837' author: - first_name: Zahra full_name: Derakhshandeh, Zahra last_name: Derakhshandeh - 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, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Universal Shape Formation for Programmable Matter. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016. ACM; 2016:289--299. doi:10.1145/2935764.2935784' apa: Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2016). Universal Shape Formation for Programmable Matter. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016 (pp. 289--299). ACM. https://doi.org/10.1145/2935764.2935784 bibtex: '@inproceedings{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2016, title={Universal Shape Formation for Programmable Matter}, DOI={10.1145/2935764.2935784}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016}, publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2016}, pages={289--299} }' chicago: Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Universal Shape Formation for Programmable Matter.” In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, 289--299. ACM, 2016. https://doi.org/10.1145/2935764.2935784. ieee: Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Universal Shape Formation for Programmable Matter,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, 2016, pp. 289--299. mla: Derakhshandeh, Zahra, et al. “Universal Shape Formation for Programmable Matter.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, ACM, 2016, pp. 289--299, doi:10.1145/2935764.2935784. short: 'Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, ACM, 2016, pp. 289--299.' date_created: 2018-03-27T12:44:09Z date_updated: 2022-01-06T06:53:30Z department: - _id: '79' doi: 10.1145/2935764.2935784 language: - iso: eng page: 289--299 publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016 publication_identifier: unknown: - 978-1-4503-4210-0 publisher: ACM status: public title: Universal Shape Formation for Programmable Matter type: conference user_id: '15504' year: '2016' ... --- _id: '1845' 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 citation: ama: 'W. Richa A, Scheideler C. Jamming-Resistant MAC Protocols for Wireless Networks. In: Encyclopedia of Algorithms. ; 2016:999--1002. doi:10.1007/978-1-4939-2864-4_593' apa: W. Richa, A., & Scheideler, C. (2016). Jamming-Resistant MAC Protocols for Wireless Networks. In Encyclopedia of Algorithms (pp. 999--1002). https://doi.org/10.1007/978-1-4939-2864-4_593 bibtex: '@inbook{W. Richa_Scheideler_2016, title={Jamming-Resistant MAC Protocols for Wireless Networks}, DOI={10.1007/978-1-4939-2864-4_593}, booktitle={Encyclopedia of Algorithms}, author={W. Richa, Andrea and Scheideler, Christian}, year={2016}, pages={999--1002} }' chicago: W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols for Wireless Networks.” In Encyclopedia of Algorithms, 999--1002, 2016. https://doi.org/10.1007/978-1-4939-2864-4_593. ieee: A. W. Richa and C. Scheideler, “Jamming-Resistant MAC Protocols for Wireless Networks,” in Encyclopedia of Algorithms, 2016, pp. 999--1002. mla: W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols for Wireless Networks.” Encyclopedia of Algorithms, 2016, pp. 999--1002, doi:10.1007/978-1-4939-2864-4_593. short: 'A. W. Richa, C. Scheideler, in: Encyclopedia of Algorithms, 2016, pp. 999--1002.' date_created: 2018-03-28T05:45:04Z date_updated: 2022-01-06T06:53:32Z department: - _id: '79' doi: 10.1007/978-1-4939-2864-4_593 page: 999--1002 publication: Encyclopedia of Algorithms status: public title: Jamming-Resistant MAC Protocols for Wireless Networks type: book_chapter user_id: '15504' year: '2016' ... --- _id: '155' abstract: - lang: eng text: We present a self-stabilizing algorithm for overlay networks that, for an arbitrary metric given by a distance oracle, constructs the graph representing that metric. The graph representing a metric is the unique minimal undirected graph such that for any pair of nodes the length of a shortest path between the nodes corresponds to the distance between the nodes according to the metric. The algorithm works under both an asynchronous and a synchronous daemon. In the synchronous case, the algorithm stablizes in time O(n) and it is almost silent in that after stabilization a node sends and receives a constant number of messages per round. author: - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Jonas full_name: Lefèvre, Jonas last_name: Lefèvre - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Gmyr R, Lefèvre J, Scheideler C. Self-stabilizing Metric Graphs. In: Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). LNCS. ; 2016:248--262. doi:10.1007/978-3-319-49259-9_20' apa: Gmyr, R., Lefèvre, J., & Scheideler, C. (2016). Self-stabilizing Metric Graphs. In Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 248--262). https://doi.org/10.1007/978-3-319-49259-9_20 bibtex: '@inproceedings{Gmyr_Lefèvre_Scheideler_2016, series={LNCS}, title={Self-stabilizing Metric Graphs}, DOI={10.1007/978-3-319-49259-9_20}, booktitle={Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Gmyr, Robert and Lefèvre, Jonas and Scheideler, Christian}, year={2016}, pages={248--262}, collection={LNCS} }' chicago: Gmyr, Robert, Jonas Lefèvre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.” In Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 248--262. LNCS, 2016. https://doi.org/10.1007/978-3-319-49259-9_20. ieee: R. Gmyr, J. Lefèvre, and C. Scheideler, “Self-stabilizing Metric Graphs,” in Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, pp. 248--262. mla: Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, pp. 248--262, doi:10.1007/978-3-319-49259-9_20. short: 'R. Gmyr, J. Lefèvre, C. Scheideler, in: Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, pp. 248--262.' date_created: 2017-10-17T12:41:22Z date_updated: 2022-01-06T06:52:28Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-319-49259-9_20 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:51:24Z date_updated: 2018-03-21T12:51:24Z file_id: '1550' file_name: 155-SSS16-GLS.pdf file_size: 389136 relation: main_file success: 1 file_date_updated: 2018-03-21T12:51:24Z has_accepted_license: '1' page: 248--262 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 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) series_title: LNCS status: public title: Self-stabilizing Metric Graphs type: conference user_id: '15504' year: '2016' ... --- _id: '142' abstract: - lang: eng text: For overlay networks, the ability to recover from a variety of problems like membership changes or faults is a key element to preserve their functionality. In recent years, various self-stabilizing overlay networks have been proposed that have the advantage of being able to recover from any illegal state. However, the vast majority of these networks cannot give any guarantees on its functionality while the recovery process is going on. We are especially interested in searchability, i.e., the functionality that search messages for a specific identifier are answered successfully if a node with that identifier exists in the network. We investigate overlay networks that are not only self-stabilizing but that also ensure that monotonic searchability is maintained while the recovery process is going on, as long as there are no corrupted messages in the system. More precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well. Monotonic searchability was recently introduced in OPODIS 2015, in which the authors provide a solution for a simple line topology.We present the first universal approach to maintain monotonic searchability that is applicable to a wide range of topologies. As the base for our approach, we introduce a set of primitives for manipulating overlay networks that allows us to maintain searchability and show how existing protocols can be transformed to use theses primitives.We complement this result with a generic search protocol that together with the use of our primitives guarantees monotonic searchability.As an additional feature, searching existing nodes with the generic search protocol is as fast as searching a node with any other fixed routing protocol once the topology has stabilized. author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: 'Scheideler C, Setzer A, Strothmann TF. Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In: Proceedings of the 30th International Symposium on Distributed Computing (DISC). LNCS. ; 2016:71--84. doi:10.1007/978-3-662-53426-7_6' apa: Scheideler, C., Setzer, A., & Strothmann, T. F. (2016). Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In Proceedings of the 30th International Symposium on Distributed Computing (DISC) (pp. 71--84). https://doi.org/10.1007/978-3-662-53426-7_6 bibtex: '@inproceedings{Scheideler_Setzer_Strothmann_2016, series={LNCS}, title={Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks}, DOI={10.1007/978-3-662-53426-7_6}, booktitle={Proceedings of the 30th International Symposium on Distributed Computing (DISC)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann, Thim Frederik}, year={2016}, pages={71--84}, collection={LNCS} }' chicago: Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann. “Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks.” In Proceedings of the 30th International Symposium on Distributed Computing (DISC), 71--84. LNCS, 2016. https://doi.org/10.1007/978-3-662-53426-7_6. ieee: C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks,” in Proceedings of the 30th International Symposium on Distributed Computing (DISC), 2016, pp. 71--84. mla: Scheideler, Christian, et al. “Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks.” Proceedings of the 30th International Symposium on Distributed Computing (DISC), 2016, pp. 71--84, doi:10.1007/978-3-662-53426-7_6. short: 'C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 30th International Symposium on Distributed Computing (DISC), 2016, pp. 71--84.' date_created: 2017-10-17T12:41:19Z date_updated: 2022-01-06T06:51:56Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-662-53426-7_6 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:59:29Z date_updated: 2018-03-21T12:59:29Z file_id: '1558' file_name: 142-SchSetStrDISC16.pdf file_size: 209638 relation: main_file success: 1 file_date_updated: 2018-03-21T12:59:29Z has_accepted_license: '1' language: - iso: eng page: 71--84 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 30th International Symposium on Distributed Computing (DISC) series_title: LNCS status: public title: Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks type: conference user_id: '477' year: '2016' ... --- _id: '284' abstract: - lang: eng text: In this work, we present the first scalable distributed information system, that is, a system with low storage overhead, that is provably robust against denial-of-service (DoS) attacks by a current insider. We allow a current insider to have complete knowledge about the information system and to have the power to block any ϵ-fraction of its servers by a DoS attack, where ϵ can be chosen up to a constant. The task of the system is to serve any collection of lookup requests with at most one per nonblocked server in an efficient way despite this attack. Previously, scalable solutions were only known for DoS attacks of past insiders, where a past insider only has complete knowledge about some past time point t0 of the information system. Scheideler et al. [Awerbuch and Scheideler 2007; Baumgart et al. 2009] showed that in this case, it is possible to design an information system so that any information that was inserted or last updated after t0 is safe against a DoS attack. But their constructions would not work at all for a current insider. The key idea behind our IRIS system is to make extensive use of coding. More precisely, we present two alternative distributed coding strategies with an at most logarithmic storage 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. Transactions on Parallel Computing. 2015;(3):18:1--18:33. doi:10.1145/2809806' apa: 'Eikel, M., & Scheideler, C. (2015). IRIS: A Robust Information System Against Insider DoS Attacks. Transactions on Parallel Computing, (3), 18:1--18:33. https://doi.org/10.1145/2809806' bibtex: '@article{Eikel_Scheideler_2015, title={IRIS: A Robust Information System Against Insider DoS Attacks}, DOI={10.1145/2809806}, number={3}, journal={Transactions on Parallel Computing}, publisher={ACM}, author={Eikel, Martina and Scheideler, Christian}, year={2015}, pages={18:1--18:33} }' chicago: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS Attacks.” Transactions on Parallel Computing, no. 3 (2015): 18:1--18:33. https://doi.org/10.1145/2809806.' ieee: 'M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider DoS Attacks,” Transactions on Parallel Computing, no. 3, pp. 18:1--18:33, 2015.' mla: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS Attacks.” Transactions on Parallel Computing, no. 3, ACM, 2015, pp. 18:1--18:33, doi:10.1145/2809806.' short: M. Eikel, C. Scheideler, Transactions on Parallel Computing (2015) 18:1--18:33. date_created: 2017-10-17T12:41:47Z date_updated: 2022-01-06T06:58:03Z ddc: - '040' department: - _id: '79' doi: 10.1145/2809806 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:25:04Z date_updated: 2018-03-21T09:25:04Z file_id: '1468' file_name: 284-Eikel-Scheideler-ACM2015.pdf file_size: 651726 relation: main_file success: 1 file_date_updated: 2018-03-21T09:25:04Z has_accepted_license: '1' issue: '3' page: 18:1--18:33 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Transactions on Parallel Computing publisher: ACM status: public title: 'IRIS: A Robust Information System Against Insider DoS Attacks' type: journal_article user_id: '477' year: '2015' ... --- _id: '241' abstract: - lang: eng text: Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various problems like membership changes or faults. Various self-stabilizing overlay networks have already been proposed in recent years, which have the advantage of being able to recover from any illegal state, but none of these networks can give any guarantees on its functionality while the recovery process is going on. We initiate research on overlay networks that are not only self-stabilizing but that also ensure that searchability is maintained while the recovery process is going on, as long as there are no corrupted messages in the system. More precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well. We call this property monotonic searchability. We show that in general it is impossible to provide monotonic searchability if corrupted messages are present in the system, which justifies the restriction to system states without corrupted messages. Furthermore, we provide a self-stabilizing protocol for the line for which we can also show monotonic searchability. It turns out that even for the line it is non-trivial to achieve this property. Additionally, we extend our protocol to deal with node departures in terms of the Finite Departure Problem of Foreback et. al (SSS 2014). This makes our protocol even capable of handling node dynamics. author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: 'Scheideler C, Setzer A, Strothmann TF. Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures. In: Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS). Leibniz International Proceedings in Informatics (LIPIcs). ; 2015. doi:10.4230/LIPIcs.OPODIS.2015.24' apa: Scheideler, C., Setzer, A., & Strothmann, T. F. (2015). Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures. In Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS). https://doi.org/10.4230/LIPIcs.OPODIS.2015.24 bibtex: '@inproceedings{Scheideler_Setzer_Strothmann_2015, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures}, DOI={10.4230/LIPIcs.OPODIS.2015.24}, booktitle={Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann, Thim Frederik}, year={2015}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }' chicago: Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann. “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.” In Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS). Leibniz International Proceedings in Informatics (LIPIcs), 2015. https://doi.org/10.4230/LIPIcs.OPODIS.2015.24. ieee: C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures,” in Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015. mla: Scheideler, Christian, et al. “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.” Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015, doi:10.4230/LIPIcs.OPODIS.2015.24. short: 'C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015.' date_created: 2017-10-17T12:41:39Z date_updated: 2022-01-06T06:56:07Z ddc: - '040' department: - _id: '79' doi: 10.4230/LIPIcs.OPODIS.2015.24 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T10:28:21Z date_updated: 2018-03-21T10:28:21Z file_id: '1497' file_name: 241-ScheidelerSetzerStrothmann2015.pdf file_size: 692363 relation: main_file success: 1 file_date_updated: 2018-03-21T10:28:21Z has_accepted_license: '1' language: - iso: eng 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 19th International Conference on Principles of Distributed Systems (OPODIS) series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures type: conference user_id: '477' year: '2015' ... --- _id: '242' abstract: - lang: eng text: 'A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state, but almost no formal results are known 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 when woken up by an incoming message. We are the first to present a self-stabilizing protocol for the FDP and the FSP that can be combined with a large class of overlay maintenance protocols so that these are then guaranteed to safely exclude leaving nodes from the system from any initial state while operating as specified for the staying nodes. In order to formally define the properties these overlay maintenance protocols have to satisfy, we identify four basic primitives for manipulating edges in an overlay network that might be of independent interest.' author: - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos - 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: 'Koutsopoulos A, Scheideler C, Strothmann TF. Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In: Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Lecture Notes in Computer Science. ; 2015:201-216. doi:10.1007/978-3-319-21741-3_14' apa: Koutsopoulos, A., Scheideler, C., & Strothmann, T. F. (2015). Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 201–216). https://doi.org/10.1007/978-3-319-21741-3_14 bibtex: '@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, series={Lecture Notes in Computer Science}, title={Towards a Universal Approach for the Finite Departure Problem in Overlay Networks}, DOI={10.1007/978-3-319-21741-3_14}, booktitle={Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={201–216}, collection={Lecture Notes in Computer Science} }' chicago: Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” In Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 201–16. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-21741-3_14. ieee: A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks,” in Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–216. mla: Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–16, doi:10.1007/978-3-319-21741-3_14. short: 'A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–216.' date_created: 2017-10-17T12:41:39Z date_updated: 2022-01-06T06:56:10Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-319-21741-3_14 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:59:32Z date_updated: 2018-03-21T09:59:32Z file_id: '1496' file_name: 242-KSS-SSS2015.pdf file_size: 532792 relation: main_file success: 1 file_date_updated: 2018-03-21T09:59:32Z has_accepted_license: '1' language: - iso: eng page: 201-216 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 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) series_title: Lecture Notes in Computer Science status: public title: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks type: conference user_id: '477' year: '2015' ... --- _id: '327' 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 address 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)O(n)) or bits (O(nlog⁡n)O(nlog⁡n)) a node receives or sends coincides with the lower bound, while ensuring only a linear runtime (O(n)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. Theoretical Computer Science. 2015:67-79. doi:10.1016/j.tcs.2014.11.027 apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2015). A deterministic worst-case message complexity optimal solution for resource discovery. Theoretical Computer Science, 67–79. https://doi.org/10.1016/j.tcs.2014.11.027 bibtex: '@article{Kniesburges_Koutsopoulos_Scheideler_2015, title={A deterministic worst-case message complexity optimal solution for resource discovery}, DOI={10.1016/j.tcs.2014.11.027}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2015}, pages={67–79} }' chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” Theoretical Computer Science, 2015, 67–79. https://doi.org/10.1016/j.tcs.2014.11.027. ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A deterministic worst-case message complexity optimal solution for resource discovery,” Theoretical Computer Science, pp. 67–79, 2015. mla: Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” Theoretical Computer Science, Elsevier, 2015, pp. 67–79, doi:10.1016/j.tcs.2014.11.027. short: S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theoretical Computer Science (2015) 67–79. date_created: 2017-10-17T12:41:55Z date_updated: 2022-01-06T06:59:08Z ddc: - '040' department: - _id: '79' doi: 10.1016/j.tcs.2014.11.027 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:38:02Z date_updated: 2018-03-20T07:38:02Z file_id: '1427' file_name: 327-KKS15-TOCS_01.pdf file_size: 398044 relation: main_file success: 1 file_date_updated: 2018-03-20T07:38:02Z has_accepted_license: '1' page: 67-79 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: A deterministic worst-case message complexity optimal solution for resource discovery type: journal_article user_id: '477' year: '2015' ... --- _id: '1850' author: - first_name: Zahra full_name: Derakhshandeh, Zahra last_name: Derakhshandeh - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann - first_name: Rida full_name: A. Bazzi, Rida last_name: A. Bazzi - first_name: Andrea full_name: W. Richa, Andrea last_name: W. Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Derakhshandeh Z, Gmyr R, Strothmann TF, A. Bazzi R, W. Richa A, Scheideler C. Leader Election and Shape Formation with Self-organizing Programmable Matter. In: DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings. Vol 9211. Lecture Notes in Computer Science. ; 2015:117--132. doi:10.1007/978-3-319-21999-8_8' apa: Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A., & Scheideler, C. (2015). Leader Election and Shape Formation with Self-organizing Programmable Matter. In DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings (Vol. 9211, pp. 117--132). https://doi.org/10.1007/978-3-319-21999-8_8 bibtex: '@inproceedings{Derakhshandeh_Gmyr_Strothmann_A. Bazzi_W. Richa_Scheideler_2015, series={Lecture Notes in Computer Science}, title={Leader Election and Shape Formation with Self-organizing Programmable Matter}, volume={9211}, DOI={10.1007/978-3-319-21999-8_8}, booktitle={DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings}, author={Derakhshandeh, Zahra and Gmyr, Robert and Strothmann, Thim Frederik and A. Bazzi, Rida and W. Richa, Andrea and Scheideler, Christian}, year={2015}, pages={117--132}, collection={Lecture Notes in Computer Science} }' chicago: Derakhshandeh, Zahra, Robert Gmyr, Thim Frederik Strothmann, Rida A. Bazzi, Andrea W. Richa, and Christian Scheideler. “Leader Election and Shape Formation with Self-Organizing Programmable Matter.” In DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings, 9211:117--132. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-21999-8_8. ieee: Z. Derakhshandeh, R. Gmyr, T. F. Strothmann, R. A. Bazzi, A. W. Richa, and C. Scheideler, “Leader Election and Shape Formation with Self-organizing Programmable Matter,” in DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings, 2015, vol. 9211, pp. 117--132. mla: Derakhshandeh, Zahra, et al. “Leader Election and Shape Formation with Self-Organizing Programmable Matter.” DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings, vol. 9211, 2015, pp. 117--132, doi:10.1007/978-3-319-21999-8_8. short: 'Z. Derakhshandeh, R. Gmyr, T.F. Strothmann, R. A. Bazzi, A. W. Richa, C. Scheideler, in: DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings, 2015, pp. 117--132.' date_created: 2018-03-28T05:49:12Z date_updated: 2022-01-06T06:53:36Z department: - _id: '79' doi: 10.1007/978-3-319-21999-8_8 intvolume: ' 9211' language: - iso: eng page: 117--132 publication: DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings publication_identifier: isbn: - 978-3-319-21998-1 series_title: Lecture Notes in Computer Science status: public title: Leader Election and Shape Formation with Self-organizing Programmable Matter type: conference user_id: '15504' volume: 9211 year: '2015' ... --- _id: '1851' author: - first_name: Zahra full_name: Derakhshandeh, Zahra last_name: Derakhshandeh - 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, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems. In: Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015. ACM; 2015:21:1--21:2. doi:10.1145/2800795.2800829' apa: Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2015). An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems. In Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015 (pp. 21:1--21:2). ACM. https://doi.org/10.1145/2800795.2800829 bibtex: '@inproceedings{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2015, title={An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems}, DOI={10.1145/2800795.2800829}, booktitle={Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015}, publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={21:1--21:2} }' chicago: Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems.” In Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015, 21:1--21:2. ACM, 2015. https://doi.org/10.1145/2800795.2800829. ieee: Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems,” in Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015, 2015, pp. 21:1--21:2. mla: Derakhshandeh, Zahra, et al. “An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems.” Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015, ACM, 2015, pp. 21:1--21:2, doi:10.1145/2800795.2800829. short: 'Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015, ACM, 2015, pp. 21:1--21:2.' date_created: 2018-03-28T05:50:25Z date_updated: 2022-01-06T06:53:36Z department: - _id: '79' doi: 10.1145/2800795.2800829 language: - iso: eng page: 21:1--21:2 publication: Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM' 15, Boston, MA, USA, September 21-22, 2015 publication_identifier: isbn: - 978-1-4503-3674-1 publisher: ACM status: public title: An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems type: conference user_id: '15504' year: '2015' ... --- _id: '1852' author: - first_name: Zahra full_name: Derakhshandeh, Zahra last_name: Derakhshandeh - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann - first_name: Rida full_name: A. Bazzi, Rida last_name: A. Bazzi - first_name: Andrea full_name: W. Richa, Andrea last_name: W. Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Derakhshandeh Z, Gmyr R, Strothmann TF, A. Bazzi R, W. Richa A, Scheideler C. Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\’{a}}n, Spain, July 21 - 23, 2015. ACM; 2015:67--69. doi:10.1145/2767386.2767451' apa: 'Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A., & Scheideler, C. (2015). Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\’{a}}n, Spain, July 21 - 23, 2015 (pp. 67--69). ACM. https://doi.org/10.1145/2767386.2767451' bibtex: '@inproceedings{Derakhshandeh_Gmyr_Strothmann_A. Bazzi_W. Richa_Scheideler_2015, title={Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter}, DOI={10.1145/2767386.2767451}, booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\’{a}}n, Spain, July 21 - 23, 2015}, publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and Strothmann, Thim Frederik and A. Bazzi, Rida and W. Richa, Andrea and Scheideler, Christian}, year={2015}, pages={67--69} }' chicago: 'Derakhshandeh, Zahra, Robert Gmyr, Thim Frederik Strothmann, Rida A. Bazzi, Andrea W. Richa, and Christian Scheideler. “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.” In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\’{a}}n, Spain, July 21 - 23, 2015, 67--69. ACM, 2015. https://doi.org/10.1145/2767386.2767451.' ieee: 'Z. Derakhshandeh, R. Gmyr, T. F. Strothmann, R. A. Bazzi, A. W. Richa, and C. Scheideler, “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter,” in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\’{a}}n, Spain, July 21 - 23, 2015, 2015, pp. 67--69.' mla: 'Derakhshandeh, Zahra, et al. “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.” Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\’{a}}n, Spain, July 21 - 23, 2015, ACM, 2015, pp. 67--69, doi:10.1145/2767386.2767451.' short: 'Z. Derakhshandeh, R. Gmyr, T.F. Strothmann, R. A. Bazzi, A. W. Richa, C. Scheideler, in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\’{a}}n, Spain, July 21 - 23, 2015, ACM, 2015, pp. 67--69.' date_created: 2018-03-28T05:52:44Z date_updated: 2022-01-06T06:53:36Z department: - _id: '79' doi: 10.1145/2767386.2767451 language: - iso: eng page: 67--69 publication: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\'{a}}n, Spain, July 21 - 23, 2015 publication_identifier: isbn: - 978-1-4503-3617-8 publisher: ACM status: public title: 'Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter' type: conference user_id: '15504' year: '2015' ... --- _id: '1853' author: - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos - 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: 'Koutsopoulos A, Scheideler C, Strothmann TF. Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In: Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015. ACM; 2015:77--79. doi:10.1145/2755573.2755614' apa: 'Koutsopoulos, A., Scheideler, C., & Strothmann, T. F. (2015). Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015 (pp. 77--79). ACM. https://doi.org/10.1145/2755573.2755614' bibtex: '@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, title={Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks}, DOI={10.1145/2755573.2755614}, booktitle={Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015}, publisher={ACM}, author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={77--79} }' chicago: 'Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann. “Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, 77--79. ACM, 2015. https://doi.org/10.1145/2755573.2755614.' ieee: 'A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks,” in Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, 2015, pp. 77--79.' mla: 'Koutsopoulos, Andreas, et al. “Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, ACM, 2015, pp. 77--79, doi:10.1145/2755573.2755614.' short: 'A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, ACM, 2015, pp. 77--79.' date_created: 2018-03-28T05:57:20Z date_updated: 2022-01-06T06:53:36Z department: - _id: '79' doi: 10.1145/2755573.2755614 language: - iso: eng page: 77--79 publication: Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015 publication_identifier: isbn: - 978-1-4503-3588-1 publisher: ACM status: public title: 'Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks' type: conference user_id: '15504' year: '2015' ... --- _id: '371' abstract: - lang: eng text: In this work we present the first distributed storage system that is provably robust against crash failures issued by an adaptive adversary, i.e., for each batch of requests the adversary can decide based on the entire system state which servers will be unavailable for that batch of requests. Despite up to \gamma n^{1/\log\log n} crashed servers, with \gamma>0 constant and n denoting the number of servers, our system can correctly process any batch of lookup and write requests (with at most a polylogarithmic number of requests issued at each non-crashed server) in at most a polylogarithmic number of communication rounds, with at most polylogarithmic time and work at each server and only a logarithmic storage overhead. Our system is based on previous work by Eikel and Scheideler (SPAA 2013), who presented IRIS, a distributed information system that is provably robust against the same kind of crash failures. However, IRIS is only able to serve lookup requests. Handling both lookup and write requests has turned out to require major changes in the design of IRIS. author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer - first_name: Martina full_name: Eikel, Martina last_name: Eikel citation: ama: 'Scheideler C, Setzer A, Eikel M. RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In: Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS). LNCS. ; 2014:107--122. doi:10.1007/978-3-319-14472-6_8' apa: 'Scheideler, C., Setzer, A., & Eikel, M. (2014). RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS) (pp. 107--122). https://doi.org/10.1007/978-3-319-14472-6_8' bibtex: '@inproceedings{Scheideler_Setzer_Eikel_2014, series={LNCS}, title={RoBuSt: A Crash-Failure-Resistant Distributed Storage System}, DOI={10.1007/978-3-319-14472-6_8}, booktitle={Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Eikel, Martina}, year={2014}, pages={107--122}, collection={LNCS} }' chicago: 'Scheideler, Christian, Alexander Setzer, and Martina Eikel. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.” In Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS), 107--122. LNCS, 2014. https://doi.org/10.1007/978-3-319-14472-6_8.' ieee: 'C. Scheideler, A. Setzer, and M. Eikel, “RoBuSt: A Crash-Failure-Resistant Distributed Storage System,” in Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.' mla: 'Scheideler, Christian, et al. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.” Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122, doi:10.1007/978-3-319-14472-6_8.' short: 'C. Scheideler, A. Setzer, M. Eikel, in: Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.' date_created: 2017-10-17T12:42:04Z date_updated: 2022-01-06T06:59:31Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-319-14472-6_8 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:16:32Z date_updated: 2018-03-20T07:16:32Z file_id: '1401' file_name: 371-RoBuSt-OPODIS.pdf file_size: 269941 relation: main_file success: 1 file_date_updated: 2018-03-20T07:16:32Z has_accepted_license: '1' page: 107--122 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 18th International Conference on Principles of Distributed Systems (OPODIS) series_title: LNCS status: public title: 'RoBuSt: A Crash-Failure-Resistant Distributed Storage System' type: conference user_id: '15504' year: '2014' ... --- _id: '378' abstract: - lang: eng text: The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer systems in general. Chord, in particular, has been studied thoroughly, and many variants of Chord have been presented that optimize various criteria. Also, several implementations of Chord are available on various platforms. Though Chord is known to be very efficient and scalable and it can handle churn quite well, no protocol is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network can be recovered from any initial state in which the network is still weakly connected. This is not too surprising since it is known that the Chord network is not locally checkable for its current topology. We present a slight extension of the Chord network, called Re-Chord (reactive Chord), that turns out to be locally checkable, and we present a self-stabilizing distributed protocol for it that can recover the Re-Chord network from any initial state, in which the n peers are weakly connected, in O(nlogn) communication rounds. We also show that our protocol allows a new peer to join or an old peer to leave an already stable Re-Chord network so that within O(logn)^2) communication rounds the Re-Chord network is stable again. 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. Re-Chord: A Self-stabilizing Chord Overlay Network. Theory of Computing Systems. 2014;(3):591-612. doi:10.1007/s00224-012-9431-2' apa: 'Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2014). Re-Chord: A Self-stabilizing Chord Overlay Network. Theory of Computing Systems, (3), 591–612. https://doi.org/10.1007/s00224-012-9431-2' bibtex: '@article{Kniesburges_Koutsopoulos_Scheideler_2014, title={Re-Chord: A Self-stabilizing Chord Overlay Network}, DOI={10.1007/s00224-012-9431-2}, number={3}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2014}, pages={591–612} }' chicago: 'Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” Theory of Computing Systems, no. 3 (2014): 591–612. https://doi.org/10.1007/s00224-012-9431-2.' ieee: 'S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: A Self-stabilizing Chord Overlay Network,” Theory of Computing Systems, no. 3, pp. 591–612, 2014.' mla: 'Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” Theory of Computing Systems, no. 3, Springer, 2014, pp. 591–612, doi:10.1007/s00224-012-9431-2.' short: S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theory of Computing Systems (2014) 591–612. date_created: 2017-10-17T12:42:05Z date_updated: 2022-01-06T06:59:35Z ddc: - '040' department: - _id: '79' doi: 10.1007/s00224-012-9431-2 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:13:36Z date_updated: 2018-03-20T07:13:36Z file_id: '1396' file_name: 378-re-chord_journal.pdf file_size: 310961 relation: main_file success: 1 file_date_updated: 2018-03-20T07:13:36Z has_accepted_license: '1' issue: '3' page: 591-612 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 - _id: '2' name: SFB 901 - Project Area A publication: Theory of Computing Systems publisher: Springer status: public title: 'Re-Chord: A Self-stabilizing Chord Overlay Network' type: journal_article user_id: '477' year: '2014' ... --- _id: '387' abstract: - lang: eng text: This article studies the design of medium access control (MAC) protocols for wireless networks that are provably robust against arbitrary and unpredictable disruptions (e.g., due to unintentional external interference from co-existing networks or due to jamming). We consider a wireless network consisting of a set of n honest and reliable nodes within transmission (and interference) range of each other, and we model the external disruptions with a powerful adaptive adversary. This adversary may know the protocol and its entire history and can use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1 − )-fraction of the timesteps, for an arbitrary constant > 0 unknown to the nodes. The nodes cannot distinguish between the adversarial jamming or a collision of two or more messages that are sent at the same time. We demonstrate, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant (asymptotically optimal) throughput for the nonjammed time periods under any of the aforementioned adversarial strategies. The derived principles are also useful to build robust applications on top of the MAC layer, and we present an exemplary study for leader election, one of the most fundamental tasks in distributed computing. author: - first_name: Baruch full_name: Awerbuch, Baruch last_name: Awerbuch - 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: Awerbuch B, Richa AW, Scheideler C, Schmid S, Zhang J. Principles of Robust Medium Access and an Application to Leader Election. Transactions on Algorithms. 2014;(4). doi:10.1145/2635818 apa: Awerbuch, B., Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2014). Principles of Robust Medium Access and an Application to Leader Election. Transactions on Algorithms, (4). https://doi.org/10.1145/2635818 bibtex: '@article{Awerbuch_Richa_Scheideler_Schmid_Zhang_2014, title={Principles of Robust Medium Access and an Application to Leader Election}, DOI={10.1145/2635818}, number={4}, journal={Transactions on Algorithms}, publisher={ACM}, author={Awerbuch, Baruch and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2014} }' chicago: Awerbuch, Baruch, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Principles of Robust Medium Access and an Application to Leader Election.” Transactions on Algorithms, no. 4 (2014). https://doi.org/10.1145/2635818. ieee: B. Awerbuch, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Principles of Robust Medium Access and an Application to Leader Election,” Transactions on Algorithms, no. 4, 2014. mla: Awerbuch, Baruch, et al. “Principles of Robust Medium Access and an Application to Leader Election.” Transactions on Algorithms, no. 4, ACM, 2014, doi:10.1145/2635818. short: B. Awerbuch, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, Transactions on Algorithms (2014). date_created: 2017-10-17T12:42:07Z date_updated: 2022-01-06T06:59:47Z ddc: - '040' department: - _id: '79' doi: 10.1145/2635818 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:02:33Z date_updated: 2018-03-20T07:02:33Z file_id: '1388' file_name: 387-a24-awerbuch_2_.pdf file_size: 521454 relation: main_file success: 1 file_date_updated: 2018-03-20T07:02:33Z has_accepted_license: '1' issue: '4' project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Transactions on Algorithms publisher: ACM status: public title: Principles of Robust Medium Access and an Application to Leader Election type: journal_article user_id: '477' year: '2014' ... --- _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' ... --- _id: '579' abstract: - lang: eng text: 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. author: - first_name: Valentina full_name: Damerow, Valentina last_name: Damerow - first_name: Bodo full_name: Manthey, Bodo last_name: Manthey - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Harald full_name: Räcke, Harald last_name: Räcke - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Till full_name: Tantau, Till last_name: Tantau citation: ama: Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right maxima with applications. Transactions on Algorithms. 2012;(3):30. doi:10.1145/2229163.2229174 apa: Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C., Sohler, C., & Tantau, T. (2012). Smoothed analysis of left-to-right maxima with applications. Transactions on Algorithms, (3), 30. https://doi.org/10.1145/2229163.2229174 bibtex: '@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012, title={Smoothed analysis of left-to-right maxima with applications}, DOI={10.1145/2229163.2229174}, number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012}, pages={30} }' chicago: 'Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis of Left-to-Right Maxima with Applications.” Transactions on Algorithms, no. 3 (2012): 30. https://doi.org/10.1145/2229163.2229174.' ieee: V. Damerow et al., “Smoothed analysis of left-to-right maxima with applications,” Transactions on Algorithms, no. 3, p. 30, 2012. mla: Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with Applications.” Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174. short: V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30. date_created: 2017-10-17T12:42:45Z date_updated: 2022-01-06T07:02:41Z ddc: - '040' department: - _id: '79' - _id: '63' doi: 10.1145/2229163.2229174 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T09:04:58Z date_updated: 2018-03-15T09:04:58Z file_id: '1266' file_name: 579-a30-damerow.pdf file_size: 329282 relation: main_file success: 1 file_date_updated: 2018-03-15T09:04:58Z has_accepted_license: '1' issue: '3' page: '30' project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Transactions on Algorithms publisher: ACM status: public title: Smoothed analysis of left-to-right maxima with applications type: journal_article user_id: '477' year: '2012' ... --- _id: '581' abstract: - lang: eng text: '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.' author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees - first_name: Martina full_name: 'Hüllmann (married name: Eikel), Martina' last_name: 'Hüllmann (married name: Eikel)' - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing Particle Systems. In: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2012:1272-1283. doi:10.1109/IPDPS.2012.116' apa: 'Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., & Scheideler, C. (2012). Self-Organizing Particle Systems. In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1272–1283). https://doi.org/10.1109/IPDPS.2012.116' bibtex: '@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012, title={Self-Organizing Particle Systems}, DOI={10.1109/IPDPS.2012.116}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1272–1283} }' chicago: 'Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos, and Christian Scheideler. “Self-Organizing Particle Systems.” In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 1272–83, 2012. https://doi.org/10.1109/IPDPS.2012.116.' ieee: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler, “Self-Organizing Particle Systems,” in Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.' mla: Drees, Maximilian, et al. “Self-Organizing Particle Systems.” Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–83, doi:10.1109/IPDPS.2012.116. short: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.' date_created: 2017-10-17T12:42:45Z date_updated: 2022-01-06T07:02:42Z ddc: - '040' department: - _id: '79' - _id: '63' doi: 10.1109/IPDPS.2012.116 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:39:33Z date_updated: 2018-03-15T08:39:33Z file_id: '1263' file_name: 581-IPDPS2012-Scheideler_Huellmann.pdf file_size: 373131 relation: main_file success: 1 file_date_updated: 2018-03-15T08:39:33Z has_accepted_license: '1' language: - iso: eng page: 1272-1283 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 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) status: public title: Self-Organizing Particle Systems type: conference user_id: '14955' year: '2012' ... --- _id: '623' abstract: - lang: eng text: '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.' author: - 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: 'Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput for co-existing networks under adversarial interference. In: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC). ; 2012:291-300. doi:10.1145/2332432.2332488' apa: Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2012). Competitive and fair throughput for co-existing networks under adversarial interference. In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC) (pp. 291–300). https://doi.org/10.1145/2332432.2332488 bibtex: '@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and fair throughput for co-existing networks under adversarial interference}, DOI={10.1145/2332432.2332488}, booktitle={Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin }, year={2012}, pages={291–300} }' chicago: Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 291–300, 2012. https://doi.org/10.1145/2332432.2332488. ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair throughput for co-existing networks under adversarial interference,” in Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300. mla: Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300, doi:10.1145/2332432.2332488. short: 'A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300.' date_created: 2017-10-17T12:42:53Z date_updated: 2022-01-06T07:02:58Z ddc: - '040' department: - _id: '79' doi: 10.1145/2332432.2332488 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:45:25Z date_updated: 2018-03-15T06:45:25Z file_id: '1241' file_name: 623-PODC-2012_01.pdf file_size: 210382 relation: main_file success: 1 file_date_updated: 2018-03-15T06:45:25Z has_accepted_license: '1' page: 291-300 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 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC) status: public title: Competitive and fair throughput for co-existing networks under adversarial interference type: conference user_id: '15504' year: '2012' ... --- _id: '625' abstract: - lang: eng text: '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.' author: - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid - first_name: Chen full_name: Avin, Chen last_name: Avin - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Bernhard full_name: Häupler, Bernhard last_name: Häupler - first_name: Zvi full_name: Lotker, Zvi last_name: Lotker citation: ama: 'Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In: Proceedings of the 26th International Symposium on Distributed Computing (DISC). LNCS. ; 2012:439-440. doi:10.1007/978-3-642-33651-5_47' apa: 'Schmid, S., Avin, C., Scheideler, C., Häupler, B., & Lotker, Z. (2012). Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In Proceedings of the 26th International Symposium on Distributed Computing (DISC) (pp. 439–440). https://doi.org/10.1007/978-3-642-33651-5_47' bibtex: '@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS}, title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures}, DOI={10.1007/978-3-642-33651-5_47}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler, Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }' chicago: 'Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” In Proceedings of the 26th International Symposium on Distributed Computing (DISC), 439–40. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_47.' ieee: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures,” in Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440.' mla: 'Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–40, doi:10.1007/978-3-642-33651-5_47.' short: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440.' date_created: 2017-10-17T12:42:53Z date_updated: 2022-01-06T07:02:58Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-642-33651-5_47 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:44:09Z date_updated: 2018-03-15T06:44:09Z file_id: '1240' file_name: 625-disc12adjBAshort.pdf file_size: 717284 relation: main_file success: 1 file_date_updated: 2018-03-15T06:44:09Z has_accepted_license: '1' page: 439-440 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 26th International Symposium on Distributed Computing (DISC) series_title: LNCS status: public title: 'Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures' type: conference user_id: '15504' year: '2012' ... --- _id: '626' abstract: - lang: eng text: 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). author: - first_name: Sebastian full_name: Kniesburges, Sebastian last_name: Kniesburges - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In: Proceedings of the 26th International Symposium on Distributed Computing (DISC). LNCS. ; 2012:435-436. doi:10.1007/978-3-642-33651-5_45' apa: 'Kniesburges, S., & Scheideler, C. (2012). Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In Proceedings of the 26th International Symposium on Distributed Computing (DISC) (pp. 435–436). https://doi.org/10.1007/978-3-642-33651-5_45' bibtex: '@inproceedings{Kniesburges_Scheideler_2012, series={LNCS}, title={Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems}, DOI={10.1007/978-3-642-33651-5_45}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012}, pages={435–436}, collection={LNCS} }' chicago: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” In Proceedings of the 26th International Symposium on Distributed Computing (DISC), 435–36. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_45.' ieee: 'S. Kniesburges and C. Scheideler, “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems,” in Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436.' mla: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–36, doi:10.1007/978-3-642-33651-5_45.' short: 'S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436.' date_created: 2017-10-17T12:42:54Z date_updated: 2022-01-06T07:02:59Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-642-33651-5_45 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:42:40Z date_updated: 2018-03-15T06:42:40Z file_id: '1239' file_name: 626-Predecessor-Kniesburges_Scheideler.pdf file_size: 184095 relation: main_file success: 1 file_date_updated: 2018-03-15T06:42:40Z has_accepted_license: '1' page: 435-436 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 26th International Symposium on Distributed Computing (DISC) series_title: LNCS status: public title: 'Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems' type: conference user_id: '15504' year: '2012' ... --- _id: '632' abstract: - lang: eng text: '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.' 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. Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA). ; 2012:800-810. doi:10.1137/1.9781611973099.64' apa: 'Kolman, P., & Scheideler, C. (2012). Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA) (pp. 800–810). https://doi.org/10.1137/1.9781611973099.64' bibtex: '@inproceedings{Kolman_Scheideler_2012, title={Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case}, DOI={10.1137/1.9781611973099.64}, booktitle={Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)}, author={Kolman, Petr and Scheideler, Christian}, year={2012}, pages={800–810} }' chicago: 'Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” In Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 800–810, 2012. https://doi.org/10.1137/1.9781611973099.64.' ieee: 'P. Kolman and C. Scheideler, “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case,” in Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810.' mla: 'Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–10, doi:10.1137/1.9781611973099.64.' short: 'P. Kolman, C. Scheideler, in: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810.' date_created: 2017-10-17T12:42:55Z date_updated: 2022-01-06T07:03:01Z ddc: - '040' department: - _id: '79' doi: 10.1137/1.9781611973099.64 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:35:58Z date_updated: 2018-03-15T06:35:58Z file_id: '1234' file_name: 632-SODA2012-Scheideler_01.pdf file_size: 220213 relation: main_file success: 1 file_date_updated: 2018-03-15T06:35:58Z has_accepted_license: '1' page: 800-810 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 23th ACM SIAM Symposium on Discrete Algorithms (SODA) status: public title: 'Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case' type: conference user_id: '15504' year: '2012' ... --- _id: '640' abstract: - lang: eng text: 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. 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 Self-Stabilization Process for Small-World Networks. In: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2012:1261--1271. doi:10.1109/IPDPS.2012.115' apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2012). A Self-Stabilization Process for Small-World Networks. In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1261--1271). https://doi.org/10.1109/IPDPS.2012.115 bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2012, title={A Self-Stabilization Process for Small-World Networks}, DOI={10.1109/IPDPS.2012.115}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1261--1271} }' chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Self-Stabilization Process for Small-World Networks.” In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 1261--1271, 2012. https://doi.org/10.1109/IPDPS.2012.115. ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Self-Stabilization Process for Small-World Networks,” in Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271. mla: Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World Networks.” Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271, doi:10.1109/IPDPS.2012.115. short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.' date_created: 2017-10-17T12:42:56Z date_updated: 2022-01-06T07:03:04Z ddc: - '040' department: - _id: '79' doi: 10.1109/IPDPS.2012.115 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T14:13:13Z date_updated: 2018-03-14T14:13:13Z file_id: '1230' file_name: 640-IPDPS2012-Kniesb-Kouts-Scheideler.pdf file_size: 210176 relation: main_file success: 1 file_date_updated: 2018-03-14T14:13:13Z has_accepted_license: '1' page: 1261--1271 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 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) status: public title: A Self-Stabilization Process for Small-World Networks type: conference user_id: '15504' year: '2012' ... --- _id: '1891' 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. Competitive and Fair Medium Access Despite Reactive Jamming. In: 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011. IEEE Computer Society; 2011:507--516. doi:10.1109/ICDCS.2011.8' apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Competitive and Fair Medium Access Despite Reactive Jamming. In 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011 (pp. 507--516). IEEE Computer Society. https://doi.org/10.1109/ICDCS.2011.8 bibtex: '@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Competitive and Fair Medium Access Despite Reactive Jamming}, DOI={10.1109/ICDCS.2011.8}, booktitle={2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011}, publisher={IEEE Computer Society}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={507--516} }' chicago: W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive and Fair Medium Access Despite Reactive Jamming.” In 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, 507--516. IEEE Computer Society, 2011. https://doi.org/10.1109/ICDCS.2011.8. ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and Fair Medium Access Despite Reactive Jamming,” in 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, 2011, pp. 507--516. mla: W. Richa, Andrea, et al. “Competitive and Fair Medium Access Despite Reactive Jamming.” 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society, 2011, pp. 507--516, doi:10.1109/ICDCS.2011.8. short: 'A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society, 2011, pp. 507--516.' date_created: 2018-03-28T07:08:13Z date_updated: 2022-01-06T06:53:54Z department: - _id: '79' doi: 10.1109/ICDCS.2011.8 page: 507--516 publication: 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011 publication_identifier: isbn: - 978-0-7695-4364-2 publisher: IEEE Computer Society status: public title: Competitive and Fair Medium Access Despite Reactive Jamming type: conference user_id: '15504' year: '2011' ... --- _id: '1892' 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. Towards jamming-resistant and competitive medium access in the SINR model. In: 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. ACM; 2011:33--36. doi:10.1145/2030686.2030697' apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Towards jamming-resistant and competitive medium access in the SINR model. In 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 (pp. 33--36). ACM. https://doi.org/10.1145/2030686.2030697 bibtex: '@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Towards jamming-resistant and competitive medium access in the SINR model}, DOI={10.1145/2030686.2030697}, booktitle={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}, publisher={ACM}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={33--36} }' chicago: W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Towards Jamming-Resistant and Competitive Medium Access in the SINR Model.” In 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, 33--36. ACM, 2011. https://doi.org/10.1145/2030686.2030697. ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Towards jamming-resistant and competitive medium access in the SINR model,” in 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, 2011, pp. 33--36. mla: W. Richa, Andrea, et al. “Towards Jamming-Resistant and Competitive Medium Access in the SINR Model.” 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, ACM, 2011, pp. 33--36, doi:10.1145/2030686.2030697. short: 'A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: 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, ACM, 2011, pp. 33--36.' date_created: 2018-03-28T07:09:07Z date_updated: 2022-01-06T06:53:54Z department: - _id: '79' doi: 10.1145/2030686.2030697 page: 33--36 publication: 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 publication_identifier: isbn: - 978-1-4503-0868-7 publisher: ACM status: public title: Towards jamming-resistant and competitive medium access in the SINR model type: conference user_id: '15504' year: '2011' ... --- _id: '1893' 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. Self-stabilizing leader election for single-hop wireless networks despite jamming. In: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011. ACM; 2011:15. doi:10.1145/2107502.2107522' apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Self-stabilizing leader election for single-hop wireless networks despite jamming. In Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011 (p. 15). ACM. https://doi.org/10.1145/2107502.2107522 bibtex: '@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Self-stabilizing leader election for single-hop wireless networks despite jamming}, DOI={10.1145/2107502.2107522}, booktitle={Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011}, publisher={ACM}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={15} }' chicago: W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Self-Stabilizing Leader Election for Single-Hop Wireless Networks despite Jamming.” In Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, 15. ACM, 2011. https://doi.org/10.1145/2107502.2107522. ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Self-stabilizing leader election for single-hop wireless networks despite jamming,” in Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, 2011, p. 15. mla: W. Richa, Andrea, et al. “Self-Stabilizing Leader Election for Single-Hop Wireless Networks despite Jamming.” Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, ACM, 2011, p. 15, doi:10.1145/2107502.2107522. short: 'A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, ACM, 2011, p. 15.' date_created: 2018-03-28T07:09:54Z date_updated: 2022-01-06T06:53:54Z department: - _id: '79' doi: 10.1145/2107502.2107522 page: '15' publication: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011 publication_identifier: isbn: - 978-1-4503-0722-2 publisher: ACM status: public title: Self-stabilizing leader election for single-hop wireless networks despite jamming type: conference user_id: '15504' year: '2011' ...