[{"doi":"10.1145/2935764.2935783","date_updated":"2022-01-06T06:55:02Z","language":[{"iso":"eng"}],"title":"Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"79"},{"_id":"63"}],"_id":"215","page":"417--427","type":"conference","citation":{"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} }","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.","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.","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","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","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.","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."},"year":"2016","user_id":"14955","ddc":["040"],"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."}],"date_created":"2017-10-17T12:41:33Z","status":"public","has_accepted_license":"1","file":[{"content_type":"application/pdf","date_updated":"2018-03-21T10:41:40Z","success":1,"relation":"main_file","file_size":352996,"creator":"florida","file_id":"1518","access_level":"closed","file_name":"215-SPAA16-Drees_Gmyr_Scheideler.pdf","date_created":"2018-03-21T10:41:40Z"}],"publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2018-03-21T10:41:40Z","author":[{"first_name":"Maximilian","full_name":"Drees, Maximilian","last_name":"Drees"},{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}]},{"issue":"3","doi":"10.1109/TNET.2015.2410313","_id":"1835","date_updated":"2022-01-06T06:53:29Z","type":"journal_article","year":"2016","citation":{"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.","short":"S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, Z. Lotker, IEEE/ACM Trans. Netw. (2016) 1421--1433.","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} }","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.","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.","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","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"},"page":"1421--1433","user_id":"15504","title":"SplayNet: Towards Locally Self-Adjusting Networks","status":"public","date_created":"2018-03-27T12:40:24Z","author":[{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"first_name":"Chen","full_name":"Avin, Chen","last_name":"Avin"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Borokhovich, Michael","first_name":"Michael","last_name":"Borokhovich"},{"first_name":"Bernhard","full_name":"Haeupler, Bernhard","last_name":"Haeupler"},{"last_name":"Lotker","first_name":"Zvi","full_name":"Lotker, Zvi"}],"department":[{"_id":"79"}],"publication":"IEEE/ACM Trans. Netw."},{"title":"On the Runtime of Universal Coating for Programmable Matter","user_id":"15504","publication_identifier":{"unknown":["978-3-319-43993-8"]},"volume":9818,"date_created":"2018-03-27T12:41:45Z","status":"public","department":[{"_id":"79"}],"publication":"DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings","author":[{"last_name":"Derakhshandeh","first_name":"Zahra","full_name":"Derakhshandeh, Zahra"},{"full_name":"Gmyr, Robert","first_name":"Robert","last_name":"Gmyr"},{"full_name":"Porter, Alexandra","first_name":"Alexandra","last_name":"Porter"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik","id":"11319","last_name":"Strothmann"}],"doi":"10.1007/978-3-319-43994-5_10","intvolume":" 9818","_id":"1836","date_updated":"2022-01-06T06:53:30Z","page":"148--164","citation":{"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.","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.","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} }","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.","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.","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","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"},"year":"2016","type":"conference","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science"},{"citation":{"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.","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.","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.","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.","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","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"},"type":"conference","year":"2016","page":"289--299","language":[{"iso":"eng"}],"doi":"10.1145/2935764.2935784","_id":"1837","date_updated":"2022-01-06T06:53:30Z","publication_identifier":{"unknown":["978-1-4503-4210-0"]},"status":"public","date_created":"2018-03-27T12:44:09Z","author":[{"last_name":"Derakhshandeh","first_name":"Zahra","full_name":"Derakhshandeh, Zahra"},{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Strothmann","id":"11319","first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik"}],"publisher":"ACM","department":[{"_id":"79"}],"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","title":"Universal Shape Formation for Programmable Matter","user_id":"15504"},{"doi":"10.1007/978-1-4939-2864-4_593","_id":"1845","date_updated":"2022-01-06T06:53:32Z","page":"999--1002","type":"book_chapter","year":"2016","citation":{"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} }","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.","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.","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","ieee":"A. W. Richa and C. Scheideler, “Jamming-Resistant MAC Protocols for Wireless Networks,” in Encyclopedia of Algorithms, 2016, pp. 999--1002.","short":"A. W. Richa, C. Scheideler, in: Encyclopedia of Algorithms, 2016, pp. 999--1002."},"user_id":"15504","title":"Jamming-Resistant MAC Protocols for Wireless Networks","date_created":"2018-03-28T05:45:04Z","status":"public","department":[{"_id":"79"}],"publication":"Encyclopedia of Algorithms","author":[{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}]},{"page":"248--262","type":"conference","citation":{"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.","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.","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} }","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.","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","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","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."},"year":"2016","_id":"155","date_created":"2017-10-17T12:41:22Z","status":"public","has_accepted_license":"1","file":[{"date_updated":"2018-03-21T12:51:24Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":389136,"file_id":"1550","creator":"florida","access_level":"closed","date_created":"2018-03-21T12:51:24Z","file_name":"155-SSS16-GLS.pdf"}],"publication":"Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file_date_updated":"2018-03-21T12:51:24Z","author":[{"last_name":"Gmyr","first_name":"Robert","full_name":"Gmyr, Robert"},{"full_name":"Lefèvre, Jonas","first_name":"Jonas","last_name":"Lefèvre"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"user_id":"15504","ddc":["040"],"abstract":[{"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.","lang":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-49259-9_20","date_updated":"2022-01-06T06:52:28Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"79"}],"title":"Self-stabilizing Metric Graphs"},{"date_updated":"2022-01-06T06:51:56Z","doi":"10.1007/978-3-662-53426-7_6","series_title":"LNCS","language":[{"iso":"eng"}],"title":"Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"142","page":"71--84","citation":{"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.","short":"C. Scheideler, A. Setzer, T.F. Strothmann, 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.","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.","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","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"},"type":"conference","year":"2016","abstract":[{"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.","lang":"eng"}],"ddc":["040"],"user_id":"477","publication":"Proceedings of the 30th International Symposium on Distributed Computing (DISC)","file_date_updated":"2018-03-21T12:59:29Z","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Setzer, Alexander","first_name":"Alexander","id":"11108","last_name":"Setzer"},{"id":"11319","last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik"}],"file":[{"creator":"florida","file_id":"1558","file_size":209638,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-21T12:59:29Z","date_created":"2018-03-21T12:59:29Z","file_name":"142-SchSetStrDISC16.pdf","access_level":"closed"}],"date_created":"2017-10-17T12:41:19Z","status":"public","has_accepted_license":"1"},{"title":"Sade: competitive MAC under adversarial SINR","department":[{"_id":"79"}],"publication_status":"published","publication_identifier":{"issn":["0178-2770","1432-0452"]},"date_updated":"2022-01-06T06:59:47Z","doi":"10.1007/s00446-017-0307-1","abstract":[{"text":"This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. So far, this problem is understood only in simplistic single-hop or unit disk graph models. We in this paper initiate the study of MAC protocols for the SINR interference model (a.k.a. physical model). This paper makes 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. Our second contribution is a distributed MAC protocol called Sade 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.","lang":"eng"}],"user_id":"15504","publisher":"Springer Nature","author":[{"last_name":"Ogierman","first_name":"Adrian","full_name":"Ogierman, Adrian"},{"last_name":"Richa","first_name":"Andrea","full_name":"Richa, Andrea"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"last_name":"Zhang","full_name":"Zhang, Jin","first_name":"Jin"}],"publication":"Distributed Computing","status":"public","date_created":"2018-08-10T07:05:12Z","volume":31,"_id":"3872","intvolume":" 31","issue":"3","type":"journal_article","citation":{"mla":"Ogierman, Adrian, et al. “Sade: Competitive MAC under Adversarial SINR.” Distributed Computing, vol. 31, no. 3, Springer Nature, 2017, pp. 241–54, doi:10.1007/s00446-017-0307-1.","bibtex":"@article{Ogierman_Richa_Scheideler_Schmid_Zhang_2017, title={Sade: competitive MAC under adversarial SINR}, volume={31}, DOI={10.1007/s00446-017-0307-1}, number={3}, journal={Distributed Computing}, publisher={Springer Nature}, author={Ogierman, Adrian and Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2017}, pages={241–254} }","chicago":"Ogierman, Adrian, Andrea Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Sade: Competitive MAC under Adversarial SINR.” Distributed Computing 31, no. 3 (2017): 241–54. https://doi.org/10.1007/s00446-017-0307-1.","apa":"Ogierman, A., Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2017). Sade: competitive MAC under adversarial SINR. Distributed Computing, 31(3), 241–254. https://doi.org/10.1007/s00446-017-0307-1","ama":"Ogierman A, Richa A, Scheideler C, Schmid S, Zhang J. Sade: competitive MAC under adversarial SINR. Distributed Computing. 2017;31(3):241-254. doi:10.1007/s00446-017-0307-1","ieee":"A. Ogierman, A. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Sade: competitive MAC under adversarial SINR,” Distributed Computing, vol. 31, no. 3, pp. 241–254, 2017.","short":"A. Ogierman, A. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing 31 (2017) 241–254."},"year":"2017","page":"241-254"},{"date_updated":"2022-01-06T06:53:26Z","_id":"1812","doi":"10.1016/j.ic.2016.12.006","page":"408--424","citation":{"mla":"Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” Inf. Comput., 2017, pp. 408--424, doi:10.1016/j.ic.2016.12.006.","bibtex":"@article{Koutsopoulos_Scheideler_Strothmann_2017, title={Towards a universal approach for the finite departure problem in overlay networks}, DOI={10.1016/j.ic.2016.12.006}, journal={Inf. Comput.}, author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}, year={2017}, pages={408--424} }","chicago":"Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” Inf. Comput., 2017, 408--424. https://doi.org/10.1016/j.ic.2016.12.006.","apa":"Koutsopoulos, A., Scheideler, C., & Strothmann, T. F. (2017). Towards a universal approach for the finite departure problem in overlay networks. Inf. Comput., 408--424. https://doi.org/10.1016/j.ic.2016.12.006","ama":"Koutsopoulos A, Scheideler C, Strothmann TF. Towards a universal approach for the finite departure problem in overlay networks. Inf Comput. 2017:408--424. doi:10.1016/j.ic.2016.12.006","ieee":"A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a universal approach for the finite departure problem in overlay networks,” Inf. Comput., pp. 408--424, 2017.","short":"A. Koutsopoulos, C. Scheideler, T.F. Strothmann, Inf. Comput. (2017) 408--424."},"type":"journal_article","year":"2017","language":[{"iso":"eng"}],"title":"Towards a universal approach for the finite departure problem in overlay networks","user_id":"15504","publication":"Inf. Comput.","department":[{"_id":"79"}],"author":[{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik","id":"11319","last_name":"Strothmann"}],"date_created":"2018-03-27T11:23:36Z","status":"public"},{"year":"2017","citation":{"chicago":"P. Fekete, Sandor, Andrea W. Richa, Kay Römer, and Christian Scheideler. “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.” SIGACT News, no. 2 (2017): 87--94. https://doi.org/10.1145/3106700.3106713.","apa":"P. Fekete, S., W. Richa, A., Römer, K., & Scheideler, C. (2017). Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. SIGACT News, (2), 87--94. https://doi.org/10.1145/3106700.3106713","ama":"P. Fekete S, W. Richa A, Römer K, Scheideler C. Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. SIGACT News. 2017;(2):87--94. doi:10.1145/3106700.3106713","mla":"P. Fekete, Sandor, et al. “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.” SIGACT News, no. 2, 2017, pp. 87--94, doi:10.1145/3106700.3106713.","bibtex":"@article{P. Fekete_W. Richa_Römer_Scheideler_2017, title={Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271}, DOI={10.1145/3106700.3106713}, number={2}, journal={SIGACT News}, author={P. Fekete, Sandor and W. Richa, Andrea and Römer, Kay and Scheideler, Christian}, year={2017}, pages={87--94} }","short":"S. P. Fekete, A. W. Richa, K. Römer, C. Scheideler, SIGACT News (2017) 87--94.","ieee":"S. P. Fekete, A. W. Richa, K. Römer, and C. Scheideler, “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271,” SIGACT News, no. 2, pp. 87--94, 2017."},"type":"journal_article","page":"87--94","issue":"2","doi":"10.1145/3106700.3106713","date_updated":"2022-01-06T06:53:26Z","_id":"1813","status":"public","date_created":"2018-03-27T11:24:15Z","author":[{"first_name":"Sandor","full_name":"P. Fekete, Sandor","last_name":"P. Fekete"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"last_name":"Römer","first_name":"Kay","full_name":"Römer, Kay"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"}],"publication":"SIGACT News","user_id":"15504","title":"Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271"},{"language":[{"iso":"eng"}],"year":"2017","citation":{"ieee":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Universal coating for programmable matter,” Theor. Comput. Sci., pp. 56--68, 2017.","short":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, Theor. Comput. Sci. (2017) 56--68.","bibtex":"@article{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2017, title={Universal coating for programmable matter}, DOI={10.1016/j.tcs.2016.02.039}, journal={Theor. Comput. Sci.}, author={Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2017}, pages={56--68} }","mla":"Derakhshandeh, Zahra, et al. “Universal Coating for Programmable Matter.” Theor. Comput. Sci., 2017, pp. 56--68, doi:10.1016/j.tcs.2016.02.039.","chicago":"Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Universal Coating for Programmable Matter.” Theor. Comput. Sci., 2017, 56--68. https://doi.org/10.1016/j.tcs.2016.02.039.","apa":"Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2017). Universal coating for programmable matter. Theor. Comput. Sci., 56--68. https://doi.org/10.1016/j.tcs.2016.02.039","ama":"Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Universal coating for programmable matter. Theor Comput Sci. 2017:56--68. doi:10.1016/j.tcs.2016.02.039"},"type":"journal_article","page":"56--68","_id":"1814","date_updated":"2022-01-06T06:53:26Z","doi":"10.1016/j.tcs.2016.02.039","author":[{"full_name":"Derakhshandeh, Zahra","first_name":"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"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik","id":"11319","last_name":"Strothmann"}],"department":[{"_id":"79"}],"publication":"Theor. Comput. Sci.","status":"public","date_created":"2018-03-27T11:24:57Z","user_id":"15504","title":"Universal coating for programmable matter"},{"_id":"1815","date_updated":"2022-01-06T06:53:26Z","doi":"10.1007/978-3-319-72751-6_10","language":[{"iso":"eng"}],"page":"127--140","citation":{"ieee":"J. J. Daymude, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Improved Leader Election for Self-organizing Programmable Matter,” in Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers, 2017, pp. 127--140.","short":"J. J. Daymude, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers, 2017, pp. 127--140.","mla":"J. Daymude, Joshua, et al. “Improved Leader Election for Self-Organizing Programmable Matter.” Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers, 2017, pp. 127--140, doi:10.1007/978-3-319-72751-6_10.","bibtex":"@inproceedings{J. Daymude_Gmyr_W. Richa_Scheideler_Strothmann_2017, title={Improved Leader Election for Self-organizing Programmable Matter}, DOI={10.1007/978-3-319-72751-6_10}, booktitle={Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers}, author={J. Daymude, Joshua and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2017}, pages={127--140} }","chicago":"J. Daymude, Joshua, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Improved Leader Election for Self-Organizing Programmable Matter.” In Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers, 127--140, 2017. https://doi.org/10.1007/978-3-319-72751-6_10.","apa":"J. Daymude, J., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2017). Improved Leader Election for Self-organizing Programmable Matter. In Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers (pp. 127--140). https://doi.org/10.1007/978-3-319-72751-6_10","ama":"J. Daymude J, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Improved Leader Election for Self-organizing Programmable Matter. In: Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers. ; 2017:127--140. doi:10.1007/978-3-319-72751-6_10"},"type":"conference","year":"2017","user_id":"15504","title":"Improved Leader Election for Self-organizing Programmable Matter","department":[{"_id":"79"}],"publication":"Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers","author":[{"last_name":"J. Daymude","full_name":"J. Daymude, Joshua","first_name":"Joshua"},{"full_name":"Gmyr, Robert","first_name":"Robert","last_name":"Gmyr"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Strothmann","id":"11319","first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik"}],"date_created":"2018-03-27T11:25:58Z","status":"public"},{"_id":"105","type":"conference","citation":{"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","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","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.","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)} }","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.","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."},"year":"2017","page":"137:1--137:15","abstract":[{"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.","lang":"eng"}],"ddc":["040"],"user_id":"20792","author":[{"full_name":"Gmyr, Robert","first_name":"Robert","last_name":"Gmyr"},{"last_name":"Hinnenthal","id":"32229","first_name":"Kristian","full_name":"Hinnenthal, Kristian"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"publication":"Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)","file_date_updated":"2018-03-13T09:23:11Z","file":[{"file_size":504161,"creator":"florida","file_id":"1207","content_type":"application/pdf","date_updated":"2018-03-13T09:23:11Z","success":1,"relation":"main_file","date_created":"2018-03-13T09:23:11Z","file_name":"105-ICALP17-GHSS.pdf","access_level":"closed"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:12Z","date_updated":"2022-01-06T06:50:42Z","doi":"10.4230/LIPIcs.ICALP.2017.137","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"title":"Distributed Monitoring of Network Properties: The Power of Hybrid Networks","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}]},{"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:19Z","doi":"10.1007/978-3-319-69084-1_17","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"publication_identifier":{"isbn":["978-3-319-69083-4"]},"publication_status":"published","external_id":{"arxiv":["1708.06542"]},"title":"A Self-Stabilizing General De Bruijn Graph","citation":{"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.","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} }","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","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.","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."},"year":"2017","type":"conference","page":"250-264 ","_id":"125","intvolume":" 10616","file":[{"file_name":"Feldmann-Scheideler2017_Chapter_ASelf-stabilizingGeneralDeBrui.pdf","date_created":"2018-10-31T13:30:13Z","access_level":"closed","file_size":311204,"file_id":"5214","creator":"mfeldma2","content_type":"application/pdf","date_updated":"2018-10-31T13:30:13Z","relation":"main_file","success":1}],"publisher":"Springer, Cham","author":[{"full_name":"Feldmann, Michael","first_name":"Michael","id":"23538","last_name":"Feldmann"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file_date_updated":"2018-10-31T13:30:13Z","publication":"Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:16Z","volume":10616,"abstract":[{"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.","lang":"eng"}],"user_id":"23538","ddc":["040"]},{"date_created":"2018-07-04T08:55:45Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-10-31T13:30:40Z","keyword":["distributed consensus","randomized algorithm","adaptive adversary","complexity lower bound"],"publication":"Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","author":[{"last_name":"Robinson","first_name":"Peter","full_name":"Robinson, Peter"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Setzer, Alexander","first_name":"Alexander","id":"11108","last_name":"Setzer"}],"file":[{"file_id":"5215","creator":"asetzer","file_size":1675407,"relation":"main_file","success":1,"date_updated":"2018-10-31T13:30:40Z","content_type":"application/pdf","file_name":"p173-robinson.pdf","date_created":"2018-10-31T13:30:40Z","access_level":"closed"}],"ddc":["040"],"user_id":"11108","abstract":[{"lang":"eng","text":"We study the consensus problem in a synchronous distributed system of n nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing that any consensus algorithm that is resilient against a linear number of crash faults requires $\\tilde \\Omega(\\sqrt n)$ rounds in an n-node network against an adaptive adversary, we consider a late adaptive adversary, who has full knowledge of the network state at the beginning of the previous round and unlimited computational power, but is oblivious to the current state of the nodes. \r\n\r\nOur main contributions are randomized distributed algorithms that achieve consensus with high probability among all except a small constant fraction of the nodes (i.e., \"almost-everywhere'') against a late adaptive adversary who can block up to ε n$ nodes in each round, for a small constant ε >0$. Our first protocol achieves binary almost-everywhere consensus and also guarantees a decision on the majority input value, thus ensuring plurality consensus. We also present an algorithm that achieves the same time complexity for multi-value consensus. Both of our algorithms succeed in $O(log n)$ rounds with high probability, thus showing an exponential gap to the $\\tilde\\Omega(\\sqrt n)$ lower bound of Ben-Or and Bar-Joseph for strongly adaptive crash-failure adversaries, which can be strengthened to $\\Omega(n)$ when allowing the adversary to block nodes instead of permanently crashing them. Our algorithms are scalable to large systems as each node contacts only an (amortized) constant number of peers in each communication round. We show that our algorithms are optimal up to constant (resp.\\ sub-logarithmic) factors by proving that every almost-everywhere consensus protocol takes $\\Omega(log_d n)$ rounds in the worst case, where d is an upper bound on the number of communication requests initiated per node in each round. We complement our theoretical results with an experimental evaluation of the binary almost-everywhere consensus protocol revealing a short convergence time even against an adversary blocking a large fraction of nodes."}],"year":"2018","type":"conference","citation":{"ieee":"P. Robinson, C. Scheideler, and A. Setzer, “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary,” in Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien.","short":"P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d.","bibtex":"@inproceedings{Robinson_Scheideler_Setzer, title={Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary}, DOI={10.1145/3210377.3210399}, booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and Setzer, Alexander} }","mla":"Robinson, Peter, et al. “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), doi:10.1145/3210377.3210399.","chicago":"Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d. https://doi.org/10.1145/3210377.3210399.","apa":"Robinson, P., Scheideler, C., & Setzer, A. (n.d.). Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien. https://doi.org/10.1145/3210377.3210399","ama":"Robinson P, Scheideler C, Setzer A. Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). doi:10.1145/3210377.3210399"},"conference":{"name":"30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","start_date":"2018-07-16","location":"Wien","end_date":"2018-07-18"},"_id":"3422","publication_identifier":{"isbn":["978-1-4503-5799-9/18/07"]},"publication_status":"accepted","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"79"},{"_id":"34"},{"_id":"7"}],"title":"Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary","language":[{"iso":"eng"}],"doi":"10.1145/3210377.3210399","date_updated":"2022-01-06T06:59:16Z"},{"has_accepted_license":"1","status":"public","date_created":"2018-02-01T13:56:01Z","publisher":"IEEE","author":[{"full_name":"Feldmann, Michael","first_name":"Michael","id":"23538","last_name":"Feldmann"},{"id":"43647","last_name":"Kolb","full_name":"Kolb, Christina","first_name":"Christina"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"id":"11319","last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik"}],"file_date_updated":"2018-10-31T13:25:37Z","publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","keyword":["Topological Self-stabilization","Supervised Overlay","Publish-Subscribe System"],"file":[{"date_created":"2018-10-31T13:25:37Z","file_name":"08425258.pdf","access_level":"closed","file_size":239559,"creator":"mfeldma2","file_id":"5211","content_type":"application/pdf","date_updated":"2018-10-31T13:25:37Z","relation":"main_file","success":1}],"ddc":["040"],"user_id":"11319","abstract":[{"text":"In this paper we present two major results:\r\nFirst, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05}) by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.\r\n","lang":"eng"}],"type":"conference","year":"2018","citation":{"short":"M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018.","ieee":"M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing Supervised Publish-Subscribe Systems,” in Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018.","ama":"Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised Publish-Subscribe Systems. In: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00114","apa":"Feldmann, M., Kolb, C., Scheideler, C., & Strothmann, T. F. (2018). Self-Stabilizing Supervised Publish-Subscribe Systems. In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). Vancouver: IEEE. https://doi.org/10.1109/IPDPS.2018.00114","chicago":"Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00114.","bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing Supervised Publish-Subscribe Systems}, DOI={10.1109/IPDPS.2018.00114}, booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018} }","mla":"Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.” Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00114."},"_id":"1163","conference":{"end_date":"2018-5-24","location":"Vancouver","name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","start_date":"2018-5-22"},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"},{"_id":"66"}],"title":"Self-Stabilizing Supervised Publish-Subscribe Systems","external_id":{"arxiv":["1710.08128"]},"language":[{"iso":"eng"}],"doi":"10.1109/IPDPS.2018.00114","date_updated":"2022-01-06T06:51:05Z"},{"user_id":"23538","ddc":["040"],"abstract":[{"text":"We propose a distributed protocol for a queue, called Skueue, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios.\r\nSkueuecan be used in highly dynamic environments, through the addition of join and leave requests to the standard queue operations enqueue and dequeue.\r\nFurthermore Skueue satisfies sequential consistency in the asynchronous message passing model.\r\nScalability is achieved by aggregating multiple requests to a batch, which can then be processed in a distributed fashion without hurting the queue semantics.\r\nOperations in Skueue need a logarithmic number of rounds w.h.p. until they are processed, even under a high rate of incoming requests.","lang":"eng"}],"date_created":"2018-02-01T14:00:36Z","has_accepted_license":"1","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-10-31T13:29:26Z","creator":"mfeldma2","file_id":"5212","file_size":218420,"access_level":"closed","date_created":"2018-10-31T13:29:26Z","file_name":"08425257.pdf"}],"file_date_updated":"2018-10-31T13:29:26Z","publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","author":[{"last_name":"Feldmann","id":"23538","first_name":"Michael","full_name":"Feldmann, Michael"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Setzer","id":"11108","first_name":"Alexander","full_name":"Setzer, Alexander"}],"publisher":"IEEE","conference":{"location":"Vancouver","name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","start_date":"2018-5-22","end_date":"2018-5-24"},"_id":"1164","year":"2018","citation":{"short":"M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018.","ieee":"M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially Consistent Distributed Queue,” in Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018.","chicago":"Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00113.","ama":"Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent Distributed Queue. In: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00113","apa":"Feldmann, M., Scheideler, C., & Setzer, A. (2018). Skueue: A Scalable and Sequentially Consistent Distributed Queue. In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). Vancouver: IEEE. https://doi.org/10.1109/IPDPS.2018.00113","mla":"Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00113.","bibtex":"@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable and Sequentially Consistent Distributed Queue}, DOI={10.1109/IPDPS.2018.00113}, booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Scheideler, Christian and Setzer, Alexander}, year={2018} }"},"type":"conference","title":"Skueue: A Scalable and Sequentially Consistent Distributed Queue","external_id":{"arxiv":["1802.07504"]},"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"doi":"10.1109/IPDPS.2018.00113","date_updated":"2022-01-06T06:51:05Z","language":[{"iso":"eng"}]},{"type":"journal_article","year":"2018","citation":{"bibtex":"@article{J. Daymude_Derakhshandeh_Gmyr_Porter_W. Richa_Scheideler_Strothmann_2018, title={On the runtime of universal coating for programmable matter}, DOI={10.1007/s11047-017-9658-6}, number={1}, journal={Natural Computing}, author={J. Daymude, Joshua and Derakhshandeh, Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018}, pages={81--96} }","mla":"J. Daymude, Joshua, et al. “On the Runtime of Universal Coating for Programmable Matter.” Natural Computing, no. 1, 2018, pp. 81--96, doi:10.1007/s11047-017-9658-6.","apa":"J. Daymude, J., Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2018). On the runtime of universal coating for programmable matter. Natural Computing, (1), 81--96. https://doi.org/10.1007/s11047-017-9658-6","ama":"J. Daymude J, Derakhshandeh Z, Gmyr R, et al. On the runtime of universal coating for programmable matter. Natural Computing. 2018;(1):81--96. doi:10.1007/s11047-017-9658-6","chicago":"J. Daymude, Joshua, Zahra Derakhshandeh, Robert Gmyr, Alexandra Porter, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “On the Runtime of Universal Coating for Programmable Matter.” Natural Computing, no. 1 (2018): 81--96. https://doi.org/10.1007/s11047-017-9658-6.","ieee":"J. J. Daymude et al., “On the runtime of universal coating for programmable matter,” Natural Computing, no. 1, pp. 81--96, 2018.","short":"J. J. Daymude, Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, T.F. Strothmann, Natural Computing (2018) 81--96."},"page":"81--96","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:24Z","_id":"1796","doi":"10.1007/s11047-017-9658-6","issue":"1","author":[{"last_name":"J. Daymude","full_name":"J. Daymude, Joshua","first_name":"Joshua"},{"last_name":"Derakhshandeh","full_name":"Derakhshandeh, Zahra","first_name":"Zahra"},{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"first_name":"Alexandra","full_name":"Porter, Alexandra","last_name":"Porter"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann","id":"11319"}],"department":[{"_id":"79"},{"_id":"66"}],"publication":"Natural Computing","status":"public","date_created":"2018-03-27T06:23:58Z","title":"On the runtime of universal coating for programmable matter","user_id":"11319"},{"language":[{"iso":"eng"}],"type":"conference","year":"2018","citation":{"mla":"Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.” Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, Springer International Publishing, 2018, pp. 122–38, doi:10.1007/978-3-030-00030-1_8.","bibtex":"@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_Strothmann_2018, title={Forming Tile Shapes with Simple Robots}, DOI={10.1007/978-3-030-00030-1_8}, booktitle={Proceedings of the 24th International Conference on DNA Computing and Molecular Programming}, publisher={Springer International Publishing}, author={Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018}, pages={122–138} }","ama":"Gmyr R, Hinnenthal K, Kostitsyna I, et al. Forming Tile Shapes with Simple Robots. In: Proceedings of the 24th International Conference on DNA Computing and Molecular Programming. Springer International Publishing; 2018:122-138. doi:10.1007/978-3-030-00030-1_8","apa":"Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler, C., & Strothmann, T. F. (2018). Forming Tile Shapes with Simple Robots. In Proceedings of the 24th International Conference on DNA Computing and Molecular Programming (pp. 122–138). Springer International Publishing. https://doi.org/10.1007/978-3-030-00030-1_8","chicago":"Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler, and Thim Frederik Strothmann. “Forming Tile Shapes with Simple Robots.” In Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, 122–38. Springer International Publishing, 2018. https://doi.org/10.1007/978-3-030-00030-1_8.","ieee":"R. Gmyr et al., “Forming Tile Shapes with Simple Robots,” in Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, 2018, pp. 122–138.","short":"R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler, T.F. Strothmann, in: Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, Springer International Publishing, 2018, pp. 122–138."},"page":"122-138","date_updated":"2022-01-06T07:02:38Z","_id":"5764","doi":"10.1007/978-3-030-00030-1_8","publisher":"Springer International Publishing","author":[{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"first_name":"Kristian","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal","id":"32229"},{"last_name":"Kostitsyna","full_name":"Kostitsyna, Irina","first_name":"Irina"},{"first_name":"Fabian","full_name":"Kuhn, Fabian","last_name":"Kuhn"},{"first_name":"Dorian","full_name":"Rudolph, Dorian","last_name":"Rudolph"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann","id":"11319"}],"department":[{"_id":"79"},{"_id":"66"}],"publication":"Proceedings of the 24th International Conference on DNA Computing and Molecular Programming","status":"public","date_created":"2018-11-19T15:35:45Z","publication_status":"published","user_id":"11319","title":"Forming Tile Shapes with Simple Robots"},{"year":"2018","citation":{"short":"J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments, n.d.","ieee":"J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments. .","chicago":"Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer. Provably Anonymous Communication Based on Trusted Execution Environments, n.d.","ama":"Blömer J, Bobolz J, Scheideler C, Setzer A. Provably Anonymous Communication Based on Trusted Execution Environments.","apa":"Blömer, J., Bobolz, J., Scheideler, C., & Setzer, A. (n.d.). Provably Anonymous Communication Based on Trusted Execution Environments.","bibtex":"@book{Blömer_Bobolz_Scheideler_Setzer, title={Provably Anonymous Communication Based on Trusted Execution Environments}, author={Blömer, Johannes and Bobolz, Jan and Scheideler, Christian and Setzer, Alexander} }","mla":"Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted Execution Environments."},"type":"working_paper","language":[{"iso":"eng"}],"_id":"5820","date_updated":"2022-01-06T07:02:43Z","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"full_name":"Bobolz, Jan","first_name":"Jan","id":"27207","last_name":"Bobolz"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Setzer, Alexander","first_name":"Alexander","id":"11108","last_name":"Setzer"}],"department":[{"_id":"7"},{"_id":"64"},{"_id":"79"}],"file_date_updated":"2018-12-31T09:55:30Z","file":[{"file_size":470968,"file_id":"6435","creator":"jbobolz","content_type":"application/pdf","date_updated":"2018-12-31T09:55:30Z","relation":"main_file","success":1,"file_name":"draft-2018.pdf","date_created":"2018-12-31T09:55:30Z","access_level":"closed"}],"publication_status":"draft","status":"public","has_accepted_license":"1","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"date_created":"2018-11-25T08:08:40Z","abstract":[{"lang":"eng","text":"In this paper, we investigate the use of trusted execution environments (TEEs, such as Intel's SGX) for an anonymous communication infrastructure over untrusted networks.\r\nFor this, we present the general idea of exploiting trusted execution environments for the purpose of anonymous communication, including a continuous-time security framework that models strong anonymity guarantees in the presence of an adversary that observes all network traffic and can adaptively corrupt a constant fraction of participating nodes.\r\nIn our framework, a participating node can generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms, allowing both senders and receivers of messages to remain anonymous. We introduce a concrete construction, which shows viability of our TEE-based approach to anonymous communication. The construction draws from techniques from cryptography and overlay networks. \r\nOur techniques are very general and can be used as a basis for future constructions with similar goals."}],"ddc":["000"],"title":"Provably Anonymous Communication Based on Trusted Execution Environments","user_id":"27207"},{"user_id":"15504","ddc":["040"],"file":[{"success":1,"relation":"main_file","date_updated":"2019-01-11T10:20:16Z","content_type":"application/pdf","file_id":"6620","creator":"florida","file_size":112676,"access_level":"closed","date_created":"2019-01-11T10:20:16Z","file_name":"Preface.pdf"}],"author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"Theor. Comput. Sci.","file_date_updated":"2019-01-11T10:20:16Z","status":"public","has_accepted_license":"1","date_created":"2018-11-30T08:08:23Z","alternative_title":["Special Issue of SIROCCO 2015"],"volume":751,"intvolume":" 751","_id":"5984","type":"journal_article","year":"2018","citation":{"short":"C. Scheideler, Theor. Comput. Sci. 751 (2018) 1.","ieee":"C. Scheideler, “Preface,” Theor. Comput. Sci., vol. 751, p. 1, 2018.","chicago":"Scheideler, Christian. “Preface.” Theor. Comput. Sci. 751 (2018): 1. https://doi.org/10.1016/j.tcs.2018.11.004.","apa":"Scheideler, C. (2018). Preface. Theor. Comput. Sci., 751, 1. https://doi.org/10.1016/j.tcs.2018.11.004","ama":"Scheideler C. Preface. Theor Comput Sci. 2018;751:1. doi:10.1016/j.tcs.2018.11.004","bibtex":"@article{Scheideler_2018, title={Preface}, volume={751}, DOI={10.1016/j.tcs.2018.11.004}, journal={Theor. Comput. Sci.}, author={Scheideler, Christian}, year={2018}, pages={1} }","mla":"Scheideler, Christian. “Preface.” Theor. Comput. Sci., vol. 751, 2018, p. 1, doi:10.1016/j.tcs.2018.11.004."},"page":"1","title":"Preface","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_updated":"2022-01-06T07:02:49Z","doi":"10.1016/j.tcs.2018.11.004","language":[{"iso":"eng"}]},{"user_id":"477","ddc":["004"],"title":"Relays: Towards a Link Layer for Robust and Secure Fog Computing","file":[{"file_size":1420210,"creator":"ups","file_id":"6194","date_updated":"2018-12-12T15:12:02Z","content_type":"application/pdf","relation":"main_file","file_name":"p1-scheideler.pdf","date_created":"2018-12-12T15:12:02Z","access_level":"closed"}],"author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"}],"publication":"Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018","file_date_updated":"2018-12-12T15:12:02Z","has_accepted_license":"1","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"date_created":"2018-11-30T08:11:27Z","_id":"5985","date_updated":"2022-01-06T07:02:49Z","doi":"10.1145/3229774.3229781","language":[{"iso":"eng"}],"citation":{"chicago":"Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure Fog Computing.” In Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 1–2, 2018. https://doi.org/10.1145/3229774.3229781.","ama":"Scheideler C. Relays: Towards a Link Layer for Robust and Secure Fog Computing. In: Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018. ; 2018:1-2. doi:10.1145/3229774.3229781","apa":"Scheideler, C. (2018). Relays: Towards a Link Layer for Robust and Secure Fog Computing. In Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018 (pp. 1–2). https://doi.org/10.1145/3229774.3229781","bibtex":"@inproceedings{Scheideler_2018, title={Relays: Towards a Link Layer for Robust and Secure Fog Computing}, DOI={10.1145/3229774.3229781}, booktitle={Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018}, author={Scheideler, Christian}, year={2018}, pages={1–2} }","mla":"Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure Fog Computing.” Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 2018, pp. 1–2, doi:10.1145/3229774.3229781.","short":"C. Scheideler, in: Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 2018, pp. 1–2.","ieee":"C. Scheideler, “Relays: Towards a Link Layer for Robust and Secure Fog Computing,” in Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 2018, pp. 1–2."},"type":"conference","year":"2018","page":"1-2"},{"doi":"10.4230/LIPIcs.MFCS.2018.52","date_updated":"2022-01-06T07:02:49Z","_id":"5986","citation":{"short":"R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler, in: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15.","ieee":"R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, and C. Scheideler, “Shape Recognition by a Finite Automaton Robot,” in 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15.","ama":"Gmyr R, Hinnenthal K, Kostitsyna I, Kuhn F, Rudolph D, Scheideler C. Shape Recognition by a Finite Automaton Robot. In: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK. ; 2018:52:1-52:15. doi:10.4230/LIPIcs.MFCS.2018.52","apa":"Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., & Scheideler, C. (2018). Shape Recognition by a Finite Automaton Robot. In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK (pp. 52:1-52:15). https://doi.org/10.4230/LIPIcs.MFCS.2018.52","chicago":"Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, and Christian Scheideler. “Shape Recognition by a Finite Automaton Robot.” In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 52:1-52:15, 2018. https://doi.org/10.4230/LIPIcs.MFCS.2018.52.","bibtex":"@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_2018, title={Shape Recognition by a Finite Automaton Robot}, DOI={10.4230/LIPIcs.MFCS.2018.52}, booktitle={43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK}, author={Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian}, year={2018}, pages={52:1-52:15} }","mla":"Gmyr, Robert, et al. “Shape Recognition by a Finite Automaton Robot.” 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15, doi:10.4230/LIPIcs.MFCS.2018.52."},"type":"conference","year":"2018","page":"52:1-52:15","language":[{"iso":"eng"}],"title":"Shape Recognition by a Finite Automaton Robot","user_id":"15504","status":"public","date_created":"2018-11-30T08:13:58Z","author":[{"last_name":"Gmyr","first_name":"Robert","full_name":"Gmyr, Robert"},{"last_name":"Hinnenthal","id":"32229","first_name":"Kristian","full_name":"Hinnenthal, Kristian"},{"last_name":"Kostitsyna","first_name":"Irina","full_name":"Kostitsyna, Irina"},{"last_name":"Kuhn","full_name":"Kuhn, Fabian","first_name":"Fabian"},{"full_name":"Rudolph, Dorian","first_name":"Dorian","last_name":"Rudolph"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK","department":[{"_id":"79"}]},{"doi":"10.1007/978-3-030-03232-6_1","date_updated":"2022-01-06T07:01:02Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes of Computer Science","title":"A Self-Stabilizing Hashed Patricia Trie","external_id":{"arxiv":["1809.04923"]},"editor":[{"last_name":"Izumi","first_name":"Taisuke","full_name":"Izumi, Taisuke"},{"last_name":"Kuznetsov","first_name":"Petr","full_name":"Kuznetsov, Petr"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"63"},{"_id":"79"}],"conference":{"location":"Tokyo","name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","start_date":"2018-11-04","end_date":"2018-11-07"},"intvolume":" 11201","_id":"4411","year":"2018","type":"conference","citation":{"mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:10.1007/978-3-030-03232-6_1.","bibtex":"@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={10.1007/978-3-030-03232-6_1}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann, Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors}, year={2018}, collection={Lecture Notes of Computer Science} }","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018. https://doi.org/10.1007/978-3-030-03232-6_1.","apa":"Knollmann, T., & Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi & P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201). Tokyo: Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_1","ama":"Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:10.1007/978-3-030-03232-6_1","ieee":"T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201.","short":"T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018."},"ddc":["000"],"user_id":"39241","abstract":[{"lang":"eng","text":"While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures.\r\nConsidering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact.\r\nIn this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log |x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys."}],"volume":11201,"date_created":"2018-09-17T13:12:18Z","has_accepted_license":"1","status":"public","keyword":["Self-Stabilizing","Prefix Search","Distributed Data Structure"],"file_date_updated":"2018-11-02T14:38:37Z","publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","author":[{"full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","first_name":"Till","id":"39241","last_name":"Knollmann"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"Springer, Cham","file":[{"file_size":500005,"file_id":"5277","creator":"ups","content_type":"application/pdf","date_updated":"2018-11-02T14:38:37Z","success":1,"relation":"main_file","file_name":"ASelf-stabilizingHashedPatrici.pdf","date_created":"2018-11-02T14:38:37Z","access_level":"closed"}]},{"title":"Competitive Routing in Hybrid Communication Networks","department":[{"_id":"63"},{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_updated":"2022-01-06T07:01:11Z","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work.\r\n"}],"user_id":"38705","ddc":["000"],"file":[{"file_size":349034,"file_id":"6621","creator":"ups","date_updated":"2019-01-11T10:32:38Z","content_type":"application/pdf","success":1,"relation":"main_file","file_name":"23hybrid.pdf","date_created":"2019-01-11T10:32:38Z","access_level":"closed"}],"publisher":"Springer","author":[{"last_name":"Jung","id":"37827","first_name":"Daniel","full_name":"Jung, Daniel"},{"first_name":"Christina","full_name":"Kolb, Christina","last_name":"Kolb","id":"43647"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Jannik","full_name":"Sundermeier, Jannik","last_name":"Sundermeier","id":"38705"}],"keyword":["greedy routing","ad hoc networks","convex hulls","c-competitiveness"],"file_date_updated":"2019-01-11T10:32:38Z","publication":"Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","has_accepted_license":"1","status":"public","date_created":"2018-10-02T07:06:05Z","_id":"4563","conference":{"location":"Helsinki","name":"14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","start_date":"2018-08-23","end_date":"2018-08-24"},"type":"conference","citation":{"bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) }, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }","mla":"Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer, 2018.","apa":"Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Helsinki: Springer.","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer; 2018.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Helsinki, 2018.","short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018."},"year":"2018"},{"title":"Brief Announcement: Competitive Routing in Hybrid Communication Networks","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"publication_status":"published","publication_identifier":{"isbn":["9781450357999"]},"department":[{"_id":"63"},{"_id":"79"}],"doi":"10.1145/3210377.3210663","date_updated":"2022-01-06T07:01:12Z","language":[{"iso":"eng"}],"user_id":"38705","ddc":["000"],"date_created":"2018-10-02T07:34:47Z","status":"public","has_accepted_license":"1","file":[{"content_type":"application/pdf","date_updated":"2018-11-02T13:48:10Z","success":1,"relation":"main_file","file_size":1025077,"creator":"ups","file_id":"5254","access_level":"closed","file_name":"p231-jung-1.pdf","date_created":"2018-11-02T13:48:10Z"}],"publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2018-11-02T13:48:10Z","publisher":"ACM Press","author":[{"full_name":"Jung, Daniel","first_name":"Daniel","id":"37827","last_name":"Jung"},{"id":"43647","last_name":"Kolb","full_name":"Kolb, Christina","first_name":"Christina"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Sundermeier","id":"38705","first_name":"Jannik","full_name":"Sundermeier, Jannik"}],"conference":{"location":"Wien","name":"SPAA'18","start_date":"2018-07-17","end_date":"2018-07-18"},"_id":"4565","citation":{"short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien, 2018.","apa":"Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien: ACM Press. https://doi.org/10.1145/3210377.3210663","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, 2018. https://doi.org/10.1145/3210377.3210663.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement: Competitive Routing in Hybrid Communication Networks}, DOI={10.1145/3210377.3210663}, booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }","mla":"Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663."},"type":"conference","year":"2018"},{"_id":"4351","intvolume":" 11201","page":"16-31 ","year":"2018","citation":{"bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_2018, series={Lecture Notes in Computer Science}, title={Self-stabilizing Overlays for high-dimensional Monotonic Searchability}, volume={11201}, DOI={10.1007/978-3-030-03232-6_2}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian}, year={2018}, pages={16–31}, collection={Lecture Notes in Computer Science} }","mla":"Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol. 11201, Springer, Cham, 2018, pp. 16–31, doi:10.1007/978-3-030-03232-6_2.","apa":"Feldmann, M., Kolb, C., & Scheideler, C. (2018). Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201, pp. 16–31). Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_2","ama":"Feldmann M, Kolb C, Scheideler C. Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes in Computer Science. Springer, Cham; 2018:16-31. doi:10.1007/978-3-030-03232-6_2","chicago":"Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 11201:16–31. Lecture Notes in Computer Science. Springer, Cham, 2018. https://doi.org/10.1007/978-3-030-03232-6_2.","ieee":"M. Feldmann, C. Kolb, and C. Scheideler, “Self-stabilizing Overlays for high-dimensional Monotonic Searchability,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2018, vol. 11201, pp. 16–31.","short":"M. Feldmann, C. Kolb, C. Scheideler, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018, pp. 16–31."},"type":"conference","user_id":"23538","ddc":["040"],"abstract":[{"lang":"eng","text":"\tWe extend the concept of monotonic searchability~\\cite{DBLP:conf/opodis/ScheidelerSS15}~\\cite{DBLP:conf/wdag/ScheidelerSS16} for self-stabilizing systems from one to multiple dimensions.\r\n\tA system is self-stabilizing if it can recover to a legitimate state from any initial illegal state.\r\n\tThese kind of systems are most often used in distributed applications.\r\n\tMonotonic searchability provides guarantees when searching for nodes while the recovery process is going on.\r\n\tMore precisely, if a search request started at some node $u$ succeeds in reaching its destination $v$, then all future search requests from $u$ to $v$ succeed as well.\r\n\tAlthough there already exists a self-stabilizing protocol for a two-dimensional topology~\\cite{DBLP:journals/tcs/JacobRSS12} and an universal approach for monotonic searchability~\\cite{DBLP:conf/wdag/ScheidelerSS16}, it is not clear how both of these concepts fit together effectively.\r\n\tThe latter concept even comes with some restrictive assumptions on messages, which is not the case for our protocol.\r\n\tWe propose a simple novel protocol for a self-stabilizing two-dimensional quadtree that satisfies monotonic searchability.\r\n\tOur protocol can easily be extended to higher dimensions and offers routing in $\\mathcal O(\\log n)$ hops for any search request.\r\n"}],"date_created":"2018-09-04T14:15:39Z","has_accepted_license":"1","status":"public","volume":11201,"file":[{"success":1,"relation":"main_file","date_updated":"2018-10-31T13:24:17Z","content_type":"application/pdf","file_id":"5210","creator":"mfeldma2","file_size":329823,"access_level":"closed","date_created":"2018-10-31T13:24:17Z","file_name":"Feldmann2018_Chapter_Self-stabilizingOverlaysForHig.pdf"}],"file_date_updated":"2018-10-31T13:24:17Z","publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","publisher":"Springer, Cham","author":[{"first_name":"Michael","full_name":"Feldmann, Michael","last_name":"Feldmann","id":"23538"},{"last_name":"Kolb","id":"43647","first_name":"Christina","full_name":"Kolb, Christina"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"doi":"10.1007/978-3-030-03232-6_2","date_updated":"2022-01-06T07:00:58Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","title":"Self-stabilizing Overlays for high-dimensional Monotonic Searchability","external_id":{"arxiv":["1808.10300"]},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"publication_identifier":{"unknown":["978-3-030-03231-9"]},"department":[{"_id":"79"}]},{"title":"Relays: A New Approach for the Finite Departure Problem in Overlay Networks","department":[{"_id":"79"}],"publication_status":"published","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"date_updated":"2022-01-06T07:01:47Z","doi":"10.1007/978-3-030-03232-6_16","language":[{"iso":"eng"}],"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. To rigorously study self-stabilizing solutions to this problem, the Finite Departure Problem (FDP) has been proposed [9]. In the FDP we are given a network of processes in an arbitrary state, and the goal is to eventually arrive at (and stay in) a state in which all leaving processes irrevocably decided to leave the system while for all weakly-connected components in the initial overlay network, all staying processes in that component will still form a weakly connected component. In the standard interconnection model, the FDP is known to be unsolvable by local control protocols, so oracles have been investigated that allow the problem to be solved [9]. To avoid the use of oracles, we introduce a new interconnection model based on relays. Despite the relay model appearing to be rather restrictive, we show that it is universal, i.e., it is possible to transform any weakly-connected topology into any other weakly-connected topology, which is important for being a useful interconnection model for overlay networks. Apart from this, our model allows processes to grant and revoke access rights, which is why we believe it to be of interest beyond the scope of this paper. We show how to implement the relay layer in a self-stabilizing way and identify properties protocols need to satisfy so that the relay layer can recover while serving protocol requests."}],"ddc":["040"],"user_id":"11108","file_date_updated":"2018-10-31T16:09:48Z","publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Setzer, Alexander","first_name":"Alexander","id":"11108","last_name":"Setzer"}],"file":[{"access_level":"closed","file_name":"Scheideler-Setzer2018_Chapter_RelaysANewApproachForTheFinite.pdf","date_created":"2018-10-31T15:51:45Z","date_updated":"2018-10-31T16:09:48Z","content_type":"application/pdf","relation":"main_file","file_size":369818,"file_id":"5223","creator":"asetzer"}],"date_created":"2018-10-31T13:33:05Z","has_accepted_license":"1","status":"public","conference":{"name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","location":"Tokyo, Japan"},"_id":"5216","citation":{"apa":"Scheideler, C., & Setzer, A. (2018). Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018). Tokyo, Japan. https://doi.org/10.1007/978-3-030-03232-6_16","ama":"Scheideler C, Setzer A. Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018). ; 2018. doi:10.1007/978-3-030-03232-6_16","chicago":"Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the Finite Departure Problem in Overlay Networks.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018. https://doi.org/10.1007/978-3-030-03232-6_16.","mla":"Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the Finite Departure Problem in Overlay Networks.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018, doi:10.1007/978-3-030-03232-6_16.","bibtex":"@inproceedings{Scheideler_Setzer_2018, title={Relays: A New Approach for the Finite Departure Problem in Overlay Networks}, DOI={10.1007/978-3-030-03232-6_16}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}, author={Scheideler, Christian and Setzer, Alexander}, year={2018} }","short":"C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018.","ieee":"C. Scheideler and A. Setzer, “Relays: A New Approach for the Finite Departure Problem in Overlay Networks,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Tokyo, Japan, 2018."},"year":"2018","type":"conference"},{"ddc":["040"],"user_id":"477","abstract":[{"text":"We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an overlay edge between two nodes is the weighted length of their shortest path in the tree. We rigorously prove that our protocol works correctly under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes after O(N^2) asynchronous rounds where N is the number of nodes in the overlay. ","lang":"eng"}],"volume":11201,"status":"public","has_accepted_license":"1","date_created":"2018-10-31T15:44:30Z","author":[{"last_name":"Götte","id":"34727","first_name":"Thorsten","full_name":"Götte, Thorsten"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Alexander","full_name":"Setzer, Alexander","last_name":"Setzer","id":"11108"}],"publisher":"Springer","file_date_updated":"2018-10-31T15:59:26Z","publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","file":[{"access_level":"closed","date_created":"2018-10-31T15:59:26Z","file_name":"sss18_camera.pdf","success":1,"relation":"main_file","date_updated":"2018-10-31T15:59:26Z","content_type":"application/pdf","file_id":"5224","creator":"thgoette","file_size":367812}],"_id":"5222","intvolume":" 11201","conference":{"name":" 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","location":"Tokyo, Japan"},"type":"conference","year":"2018","citation":{"mla":"Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), vol. 11201, Springer, 2018, pp. 50–64.","bibtex":"@inproceedings{Götte_Scheideler_Setzer_2018, series={Lecture Notes in Computer Science}, title={On Underlay-Aware Self-Stabilizing Overlay Networks}, volume={11201}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}, publisher={Springer}, author={Götte, Thorsten and Scheideler, Christian and Setzer, Alexander}, year={2018}, pages={50–64}, collection={Lecture Notes in Computer Science} }","apa":"Götte, T., Scheideler, C., & Setzer, A. (2018). On Underlay-Aware Self-Stabilizing Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018) (Vol. 11201, pp. 50–64). Tokyo, Japan: Springer.","ama":"Götte T, Scheideler C, Setzer A. On Underlay-Aware Self-Stabilizing Overlay Networks. In: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018). Vol 11201. Lecture Notes in Computer Science. Springer; 2018:50-64.","chicago":"Götte, Thorsten, Christian Scheideler, and Alexander Setzer. “On Underlay-Aware Self-Stabilizing Overlay Networks.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 11201:50–64. Lecture Notes in Computer Science. Springer, 2018.","ieee":"T. Götte, C. Scheideler, and A. Setzer, “On Underlay-Aware Self-Stabilizing Overlay Networks,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Tokyo, Japan, 2018, vol. 11201, pp. 50–64.","short":"T. Götte, C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Springer, 2018, pp. 50–64."},"page":"50-64","title":"On Underlay-Aware Self-Stabilizing Overlay Networks","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"}],"date_updated":"2022-01-06T07:01:47Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science"},{"project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901","_id":"1"}],"date_created":"2019-02-12T13:39:20Z","has_accepted_license":"1","status":"public","file":[{"content_type":"application/pdf","date_updated":"2019-02-12T13:37:35Z","relation":"main_file","file_size":372026,"file_id":"7637","creator":"thim","access_level":"closed","file_name":"IPDPS_main.pdf","date_created":"2019-02-12T13:37:35Z"}],"file_date_updated":"2019-02-12T13:37:35Z","department":[{"_id":"66"}],"publication":"Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)","author":[{"full_name":"Luo, Linghui","first_name":"Linghui","last_name":"Luo"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik","id":"11319","last_name":"Strothmann"}],"user_id":"477","ddc":["006"],"title":"MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability","abstract":[{"text":"Self-stabilizing overlay networks have the advantage of being able to recover from illegal states and faults. \r\nHowever, the majority of these networks cannot give any guarantees on their functionality while the recovery process is going on. \r\nWe are especially interested in searchability, i.e., the functionality that search messages for a specific node are answered successfully if a node exists in the network. \r\nIn this paper we investigate overlay networks that ensure the maintenance of monotonic searchability while the self-stabilization is going on. \r\nMore 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.\r\nWe extend the existing research by focusing on skip graphs and present a solution for two scenarios: (i) the goal topology is a super graph of the perfect skip graph and (ii) the goal topology is exactly the perfect skip graph.\r\n","lang":"eng"}],"language":[{"iso":"eng"}],"type":"conference","year":"2019","citation":{"short":"L. Luo, C. Scheideler, T.F. Strothmann, in: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.","ieee":"L. Luo, C. Scheideler, and T. F. Strothmann, “MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability,” in Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), Rio de Janeiro, Brazil, 2019.","ama":"Luo L, Scheideler C, Strothmann TF. MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability. In: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19). ; 2019.","apa":"Luo, L., Scheideler, C., & Strothmann, T. F. (2019). MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability. In Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19). Rio de Janeiro, Brazil.","chicago":"Luo, Linghui, Christian Scheideler, and Thim Frederik Strothmann. “MultiSkipGraph: A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” In Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.","mla":"Luo, Linghui, et al. “MultiSkipGraph: A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.","bibtex":"@inproceedings{Luo_Scheideler_Strothmann_2019, title={MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability}, booktitle={Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19)}, author={Luo, Linghui and Scheideler, Christian and Strothmann, Thim Frederik}, year={2019} }"},"conference":{"location":"Rio de Janeiro, Brazil","start_date":"2019-05-20","name":"2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)","end_date":"2019-05-25"},"date_updated":"2022-01-06T07:03:42Z","_id":"7636"},{"user_id":"477","ddc":["004"],"abstract":[{"text":"We propose two protocols for distributed priority queues (denoted by 'heap' for simplicity in this paper) called SKEAP and SEAP. SKEAP realizes a distributed heap for a constant amount of priorities and SEAP one for an arbitrary amount. Both protocols build on an overlay, which induces an aggregation tree on which heap operations are aggregated in batches, ensuring that our protocols scale even for a high rate of incoming requests. As part of SEAP we provide a novel distributed protocol for the k-selection problem that runs in time O(log n) w.h.p. SKEAP guarantees sequential consistency for its heap operations, while SEAP guarantees serializability. SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations. \r\nSKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations with SEAP having to use only O(log n) bit messages.","lang":"eng"}],"has_accepted_license":"1","status":"public","date_created":"2019-03-21T14:37:26Z","file":[{"access_level":"closed","file_name":"p287-feldmann.pdf","date_created":"2019-08-26T09:14:32Z","content_type":"application/pdf","date_updated":"2019-08-26T09:14:32Z","relation":"main_file","success":1,"file_size":1295095,"file_id":"12954","creator":"ups"}],"author":[{"first_name":"Michael","full_name":"Feldmann, Michael","last_name":"Feldmann","id":"23538"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"ACM","file_date_updated":"2019-08-26T09:14:32Z","publication":"Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","_id":"8534","year":"2019","type":"conference","citation":{"bibtex":"@inproceedings{Feldmann_Scheideler_2019, title={Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities}, DOI={10.1145/3323165.3323193}, booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Scheideler, Christian}, year={2019}, pages={287--296} }","mla":"Feldmann, Michael, and Christian Scheideler. “Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.” Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296, doi:10.1145/3323165.3323193.","chicago":"Feldmann, Michael, and Christian Scheideler. “Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.” In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 287--296. ACM, 2019. https://doi.org/10.1145/3323165.3323193.","ama":"Feldmann M, Scheideler C. Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2019:287--296. doi:10.1145/3323165.3323193","apa":"Feldmann, M., & Scheideler, C. (2019). Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 287--296). ACM. https://doi.org/10.1145/3323165.3323193","ieee":"M. Feldmann and C. Scheideler, “Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities,” in Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2019, pp. 287--296.","short":"M. Feldmann, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296."},"page":"287--296","title":"Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities","external_id":{"arxiv":["1805.03472"]},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"doi":"10.1145/3323165.3323193","date_updated":"2022-01-06T07:03:56Z","language":[{"iso":"eng"}]},{"doi":"10.1145/3323165.3323195","date_updated":"2022-01-06T07:04:04Z","language":[{"iso":"eng"}],"title":"Distributed Computation in Node-Capacitated Networks","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"}],"_id":"8871","page":"69--79","citation":{"short":"J. Augustine, M. Ghaffari, R. Gmyr, K. Hinnenthal, F. Kuhn, J. Li, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 69--79.","ieee":"J. Augustine et al., “Distributed Computation in Node-Capacitated Networks,” in Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 2019, pp. 69--79.","ama":"Augustine J, Ghaffari M, Gmyr R, et al. Distributed Computation in Node-Capacitated Networks. In: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures. ACM; 2019:69--79. doi:10.1145/3323165.3323195","apa":"Augustine, J., Ghaffari, M., Gmyr, R., Hinnenthal, K., Kuhn, F., Li, J., & Scheideler, C. (2019). Distributed Computation in Node-Capacitated Networks. In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (pp. 69--79). ACM. https://doi.org/10.1145/3323165.3323195","chicago":"Augustine, John, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian Kuhn, Jason Li, and Christian Scheideler. “Distributed Computation in Node-Capacitated Networks.” In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 69--79. ACM, 2019. https://doi.org/10.1145/3323165.3323195.","mla":"Augustine, John, et al. “Distributed Computation in Node-Capacitated Networks.” Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 69--79, doi:10.1145/3323165.3323195.","bibtex":"@inproceedings{Augustine_Ghaffari_Gmyr_Hinnenthal_Kuhn_Li_Scheideler_2019, title={Distributed Computation in Node-Capacitated Networks}, DOI={10.1145/3323165.3323195}, booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures}, publisher={ACM}, author={Augustine, John and Ghaffari, Mohsen and Gmyr, Robert and Hinnenthal, Kristian and Kuhn, Fabian and Li, Jason and Scheideler, Christian}, year={2019}, pages={69--79} }"},"year":"2019","type":"conference","ddc":["004"],"user_id":"477","date_created":"2019-04-10T08:20:34Z","status":"public","has_accepted_license":"1","publication":"Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures","file_date_updated":"2019-08-26T11:17:58Z","author":[{"full_name":"Augustine, John","first_name":"John","last_name":"Augustine"},{"first_name":"Mohsen","full_name":"Ghaffari, Mohsen","last_name":"Ghaffari"},{"first_name":"Robert","full_name":"Gmyr, Robert","last_name":"Gmyr"},{"full_name":"Hinnenthal, Kristian","first_name":"Kristian","id":"32229","last_name":"Hinnenthal"},{"full_name":"Kuhn, Fabian","first_name":"Fabian","last_name":"Kuhn"},{"last_name":"Li","first_name":"Jason","full_name":"Li, Jason"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"ACM","file":[{"date_created":"2019-08-26T11:17:58Z","file_name":"p69-augustine.pdf","access_level":"closed","file_id":"12964","creator":"ups","file_size":1275192,"relation":"main_file","success":1,"date_updated":"2019-08-26T11:17:58Z","content_type":"application/pdf"}]},{"language":[{"iso":"eng"}],"citation":{"short":"J.J. Daymude, K. Hinnenthal, A.W. Richa, C. Scheideler, in: Distributed Computing by Mobile Entities, Current Research in Moving and Computing., Springer, Cham, 2019, pp. 615–681.","ieee":"J. J. Daymude, K. Hinnenthal, A. W. Richa, and C. Scheideler, “Computing by Programmable Particles,” in Distributed Computing by Mobile Entities, Current Research in Moving and Computing., Springer, Cham, 2019, pp. 615–681.","apa":"Daymude, J. J., Hinnenthal, K., Richa, A. W., & Scheideler, C. (2019). Computing by Programmable Particles. In Distributed Computing by Mobile Entities, Current Research in Moving and Computing. (pp. 615–681). Springer, Cham. https://doi.org/10.1007/978-3-030-11072-7_22","ama":"Daymude JJ, Hinnenthal K, Richa AW, Scheideler C. Computing by Programmable Particles. In: Distributed Computing by Mobile Entities, Current Research in Moving and Computing. Springer, Cham; 2019:615-681. doi:https://doi.org/10.1007/978-3-030-11072-7_22","chicago":"Daymude, Joshua J., Kristian Hinnenthal, Andréa W. Richa, and Christian Scheideler. “Computing by Programmable Particles.” In Distributed Computing by Mobile Entities, Current Research in Moving and Computing., 615–81. Springer, Cham, 2019. https://doi.org/10.1007/978-3-030-11072-7_22.","mla":"Daymude, Joshua J., et al. “Computing by Programmable Particles.” Distributed Computing by Mobile Entities, Current Research in Moving and Computing., Springer, Cham, 2019, pp. 615–81, doi:https://doi.org/10.1007/978-3-030-11072-7_22.","bibtex":"@inbook{Daymude_Hinnenthal_Richa_Scheideler_2019, title={Computing by Programmable Particles}, DOI={https://doi.org/10.1007/978-3-030-11072-7_22}, booktitle={Distributed Computing by Mobile Entities, Current Research in Moving and Computing.}, publisher={Springer, Cham}, author={Daymude, Joshua J. and Hinnenthal, Kristian and Richa, Andréa W. and Scheideler, Christian}, year={2019}, pages={615–681} }"},"type":"book_chapter","year":"2019","page":"615-681","date_updated":"2022-01-06T07:04:16Z","_id":"9599","doi":"https://doi.org/10.1007/978-3-030-11072-7_22","publisher":"Springer, Cham","author":[{"last_name":"Daymude","full_name":"Daymude, Joshua J.","first_name":"Joshua J."},{"last_name":"Hinnenthal","id":"32229","first_name":"Kristian","full_name":"Hinnenthal, Kristian"},{"last_name":"Richa","first_name":"Andréa W.","full_name":"Richa, Andréa W."},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"Distributed Computing by Mobile Entities, Current Research in Moving and Computing.","status":"public","date_created":"2019-05-02T09:38:58Z","user_id":"32229","title":"Computing by Programmable Particles"},{"title":"Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"publication_status":"accepted","date_updated":"2022-01-06T07:03:25Z","language":[{"iso":"eng"}],"abstract":[{"text":"We investigate the maintenance of overlay networks under massive churn, i.e.\r\nnodes joining and leaving the network. We assume an adversary that may churn a\r\nconstant fraction $\\alpha n$ of nodes over the course of $\\mathcal{O}(\\log n)$\r\nrounds. In particular, the adversary has an almost up-to-date information of\r\nthe network topology as it can observe an only slightly outdated topology that\r\nis at least $2$ rounds old. Other than that, we only have the provably minimal\r\nrestriction that new nodes can only join the network via nodes that have taken\r\npart in the network for at least one round.\r\n Our contributions are as follows: First, we show that it is impossible to\r\nmaintain a connected topology if adversary has up-to-date information about the\r\nnodes' connections. Further, we show that our restriction concerning the join\r\nis also necessary. As our main result present an algorithm that constructs a\r\nnew overlay- completely independent of all previous overlays - every $2$\r\nrounds. Furthermore, each node sends and receives only $\\mathcal{O}(\\log^3 n)$\r\nmessages each round. As part of our solution we propose the Linearized DeBruijn\r\nSwarm (LDS), a highly churn resistant overlay, which will be maintained by the\r\nalgorithm. However, our approaches can be transferred to a variety of classical\r\nP2P Topologies where nodes are mapped into the $[0,1)$-interval.","lang":"eng"}],"user_id":"34727","ddc":["000"],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2019-01-26T16:09:08Z","creator":"thgoette","file_id":"7007","file_size":638020,"access_level":"closed","file_name":"Always_be_Two_Steps_Ahead_of_Your_Enemy.pdf","date_created":"2019-01-26T16:09:08Z"}],"author":[{"id":"34727","last_name":"Götte","full_name":"Götte, Thorsten","first_name":"Thorsten"},{"first_name":"Vipin Ravindran","full_name":"Vijayalakshmi, Vipin Ravindran","last_name":"Vijayalakshmi"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"IEEE","publication":"Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)","file_date_updated":"2019-01-26T16:09:08Z","has_accepted_license":"1","status":"public","date_created":"2019-01-24T18:53:11Z","_id":"6976","conference":{"end_date":"24.05.19","name":"2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)","start_date":"20.05.19","location":"Rio de Janeiro, Brazil"},"year":"2019","citation":{"ieee":"T. Götte, V. R. Vijayalakshmi, and C. Scheideler, “Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary,” in Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), Rio de Janeiro, Brazil.","short":"T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), IEEE, n.d.","mla":"Götte, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), IEEE.","bibtex":"@inproceedings{Götte_Vijayalakshmi_Scheideler, title={Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary}, booktitle={Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19)}, publisher={IEEE}, author={Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian} }","chicago":"Götte, Thorsten, Vipin Ravindran Vijayalakshmi, and Christian Scheideler. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” In Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19). IEEE, n.d.","ama":"Götte T, Vijayalakshmi VR, Scheideler C. Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19). IEEE.","apa":"Götte, T., Vijayalakshmi, V. R., & Scheideler, C. (n.d.). Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19). Rio de Janeiro, Brazil: IEEE."},"type":"conference"},{"page":"150:1--150:14","year":"2019","citation":{"ieee":"C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.","short":"C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.","bibtex":"@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity of Local Graph Transformations}, volume={132}, DOI={10.4230/LIPICS.ICALP.2019.150}, booktitle={Proceedings of the 46th International Colloquium on Automata, Languages, and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs} }","mla":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:10.4230/LIPICS.ICALP.2019.150.","ama":"Scheideler C, Setzer A. On the Complexity of Local Graph Transformations. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14. doi:10.4230/LIPICS.ICALP.2019.150","apa":"Scheideler, C., & Setzer, A. (2019). On the Complexity of Local Graph Transformations. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICALP.2019.150","chicago":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 132:150:1--150:14. LIPIcs. Dagstuhl Publishing, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.150."},"type":"conference","conference":{"end_date":"2019-07-12","start_date":"2019-07-09","name":"ICALP 2019","location":"Patras, Greece"},"_id":"10586","intvolume":" 132","file":[{"relation":"main_file","success":1,"date_updated":"2019-08-26T09:21:27Z","content_type":"application/pdf","file_id":"12955","creator":"ups","file_size":537649,"access_level":"closed","date_created":"2019-08-26T09:21:27Z","file_name":"LIPIcs-ICALP-2019-150.pdf"}],"file_date_updated":"2019-08-26T09:21:27Z","keyword":["Graphs transformations","NP-hardness","approximation algorithms"],"publication":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming","author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Alexander","full_name":"Setzer, Alexander","last_name":"Setzer","id":"11108"}],"publisher":"Dagstuhl Publishing","date_created":"2019-07-08T17:19:01Z","status":"public","has_accepted_license":"1","volume":132,"abstract":[{"text":"We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio.","lang":"eng"}],"user_id":"477","ddc":["004"],"series_title":"LIPIcs","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:45Z","doi":"10.4230/LIPICS.ICALP.2019.150","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publication_status":"published","title":"On the Complexity of Local Graph Transformations"},{"user_id":"32229","title":"Faster Construction of Overlay Networks","place":"Cham","date_created":"2019-08-19T07:18:57Z","status":"public","publication_status":"published","publication":"Structural Information and Communication Complexity","author":[{"last_name":"Götte","id":"34727","first_name":"Thorsten","full_name":"Götte, Thorsten"},{"full_name":"Hinnenthal, Kristian","first_name":"Kristian","id":"32229","last_name":"Hinnenthal"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"doi":"10.1007/978-3-030-24922-9_18","_id":"12944","date_updated":"2022-01-06T06:51:27Z","language":[{"iso":"eng"}],"type":"conference","citation":{"short":"T. Götte, K. Hinnenthal, C. Scheideler, in: Structural Information and Communication Complexity, Cham, 2019.","ieee":"T. Götte, K. Hinnenthal, and C. Scheideler, “Faster Construction of Overlay Networks,” in Structural Information and Communication Complexity, 2019.","chicago":"Götte, Thorsten, Kristian Hinnenthal, and Christian Scheideler. “Faster Construction of Overlay Networks.” In Structural Information and Communication Complexity. Cham, 2019. https://doi.org/10.1007/978-3-030-24922-9_18.","ama":"Götte T, Hinnenthal K, Scheideler C. Faster Construction of Overlay Networks. In: Structural Information and Communication Complexity. Cham; 2019. doi:10.1007/978-3-030-24922-9_18","apa":"Götte, T., Hinnenthal, K., & Scheideler, C. (2019). Faster Construction of Overlay Networks. In Structural Information and Communication Complexity. Cham. https://doi.org/10.1007/978-3-030-24922-9_18","mla":"Götte, Thorsten, et al. “Faster Construction of Overlay Networks.” Structural Information and Communication Complexity, 2019, doi:10.1007/978-3-030-24922-9_18.","bibtex":"@inproceedings{Götte_Hinnenthal_Scheideler_2019, place={Cham}, title={Faster Construction of Overlay Networks}, DOI={10.1007/978-3-030-24922-9_18}, booktitle={Structural Information and Communication Complexity}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian}, year={2019} }"},"year":"2019"},{"date_updated":"2022-01-06T06:52:30Z","_id":"15627","doi":"10.1137/1.9781611975994.78","page":"1280-1299","citation":{"apa":"Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., & Schneider, P. (2019). Shortest Paths in a Hybrid Network Model. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1280–1299). Philadelphia, PA. https://doi.org/10.1137/1.9781611975994.78","ama":"Augustine J, Hinnenthal K, Kuhn F, Scheideler C, Schneider P. Shortest Paths in a Hybrid Network Model. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA; 2019:1280-1299. doi:10.1137/1.9781611975994.78","chicago":"Augustine, John, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, and Philipp Schneider. “Shortest Paths in a Hybrid Network Model.” In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1280–99. Philadelphia, PA, 2019. https://doi.org/10.1137/1.9781611975994.78.","mla":"Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, pp. 1280–99, doi:10.1137/1.9781611975994.78.","bibtex":"@inproceedings{Augustine_Hinnenthal_Kuhn_Scheideler_Schneider_2019, place={Philadelphia, PA}, title={Shortest Paths in a Hybrid Network Model}, DOI={10.1137/1.9781611975994.78}, booktitle={Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms}, author={Augustine, John and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp}, year={2019}, pages={1280–1299} }","short":"J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, 2019, pp. 1280–1299.","ieee":"J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest Paths in a Hybrid Network Model,” in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, pp. 1280–1299."},"type":"conference","year":"2019","language":[{"iso":"eng"}],"place":"Philadelphia, PA","title":"Shortest Paths in a Hybrid Network Model","user_id":"32229","publication":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":[{"last_name":"Augustine","first_name":"John","full_name":"Augustine, John"},{"last_name":"Hinnenthal","id":"32229","first_name":"Kristian","full_name":"Hinnenthal, Kristian"},{"last_name":"Kuhn","full_name":"Kuhn, Fabian","first_name":"Fabian"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schneider","first_name":"Philipp","full_name":"Schneider, Philipp"}],"publication_status":"published","publication_identifier":{"isbn":["9781611975994"]},"date_created":"2020-01-22T09:07:36Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public"},{"title":"Self-Stabilizing Metric Graphs","user_id":"15504","publication":"Theory Comput. Syst.","department":[{"_id":"79"}],"author":[{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"last_name":"Lefevre","full_name":"Lefevre, Jonas","first_name":"Jonas"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"volume":63,"date_created":"2019-11-06T10:54:58Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"status":"public","intvolume":" 63","_id":"14830","date_updated":"2022-01-06T06:52:07Z","doi":"10.1007/s00224-017-9823-4","issue":"2","page":"177-199","year":"2019","type":"journal_article","citation":{"short":"R. Gmyr, J. Lefevre, C. Scheideler, Theory Comput. Syst. 63 (2019) 177–199.","ieee":"R. Gmyr, J. Lefevre, and C. Scheideler, “Self-Stabilizing Metric Graphs,” Theory Comput. Syst., vol. 63, no. 2, pp. 177–199, 2019.","ama":"Gmyr R, Lefevre J, Scheideler C. Self-Stabilizing Metric Graphs. Theory Comput Syst. 2019;63(2):177-199. doi:10.1007/s00224-017-9823-4","apa":"Gmyr, R., Lefevre, J., & Scheideler, C. (2019). Self-Stabilizing Metric Graphs. Theory Comput. Syst., 63(2), 177–199. https://doi.org/10.1007/s00224-017-9823-4","chicago":"Gmyr, Robert, Jonas Lefevre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.” Theory Comput. Syst. 63, no. 2 (2019): 177–99. https://doi.org/10.1007/s00224-017-9823-4.","mla":"Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” Theory Comput. Syst., vol. 63, no. 2, 2019, pp. 177–99, doi:10.1007/s00224-017-9823-4.","bibtex":"@article{Gmyr_Lefevre_Scheideler_2019, title={Self-Stabilizing Metric Graphs}, volume={63}, DOI={10.1007/s00224-017-9823-4}, number={2}, journal={Theory Comput. Syst.}, author={Gmyr, Robert and Lefevre, Jonas and Scheideler, Christian}, year={2019}, pages={177–199} }"},"language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T06:52:00Z","_id":"14539","conference":{"end_date":"2019-07-04","start_date":"2019-07-01","name":"SIROCCO 2019","location":"L'Aquila, Italy"},"doi":"10.1007/978-3-030-24922-9\\_26","type":"conference","year":"2019","citation":{"chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 345–48, 2019. https://doi.org/10.1007/978-3-030-24922-9\\_26.","apa":"Castenow, J., Kolb, C., & Scheideler, C. (2019). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 345–348). L’Aquila, Italy. https://doi.org/10.1007/978-3-030-24922-9\\_26","ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO). ; 2019:345-348. doi:10.1007/978-3-030-24922-9\\_26","mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–48, doi:10.1007/978-3-030-24922-9\\_26.","bibtex":"@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, DOI={10.1007/978-3-030-24922-9\\_26}, booktitle={Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian}, year={2019}, pages={345–348} }","short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348.","ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), L’Aquila, Italy, 2019, pp. 345–348."},"page":"345-348","language":[{"iso":"eng"}],"title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","user_id":"477","author":[{"full_name":"Castenow, Jannik","first_name":"Jannik","id":"38705","last_name":"Castenow"},{"full_name":"Kolb, Christina","first_name":"Christina","id":"43647","last_name":"Kolb"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)","status":"public","date_created":"2019-11-04T10:09:35Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"abstract":[{"lang":"eng","text":"We consider congestion control in peer-to-peer distributed systems. \r\nThe problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers (called \\emph{clients} in this paper) that want to send messages to a fixed common peer (called \\emph{server} in this paper).\r\nWe assume that each client $v \\in V$ sends a message with probability $p(v) \\in [0,1)$ and the server has a capacity of $\\sigma \\in \\mathbb{N}$, i.e., it can recieve at most $\\sigma$ messages per round and excess messages are dropped.\r\nThe server can modify these probabilities when clients send messages.\r\nIdeally, we wish to converge to a state with $\\sum p(v) = \\sigma$ and $p(v) = p(w)$ for all $v,w \\in V$.\t\r\n\r\nWe propose a \\emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state. \r\nOur protocol lets the system converge from \\emph{any} initial state to a state where $\\sum p(v) \\in \\left[\\sigma \\pm \\epsilon\\right]$ and $|p(v)-p(w)| \\in O(\\frac{1}{n})$. \r\nThis property is then maintained for $\\Omega(n^{\\mathfrak{c}})$ rounds in expectation.\r\nIn particular, the initial client probabilities and server variables are not necessarily well-defined, i.e., they may have arbitrary values.\r\n\r\nOur protocol uses only $O(W + \\log n)$ bits of memory where $W$ is length of node identifiers, making it very lightweight.\r\nFinally we state a lower bound on the convergence time an see that our protocol performs asymptotically optimal (up to some polylogarithmic factor).\r\n"}],"ddc":["000"],"user_id":"23538","publication":"Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file_date_updated":"2019-09-11T11:20:16Z","author":[{"last_name":"Feldmann","id":"23538","first_name":"Michael","full_name":"Feldmann, Michael"},{"full_name":"Götte, Thorsten","first_name":"Thorsten","id":"34727","last_name":"Götte"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"Springer, Cham","file":[{"access_level":"closed","date_created":"2019-09-11T11:20:16Z","file_name":"main.pdf","date_updated":"2019-09-11T11:20:16Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":428908,"creator":"mfeldma2","file_id":"13188"}],"date_created":"2019-09-10T12:48:33Z","status":"public","has_accepted_license":"1","_id":"13182","page":"149-164","citation":{"short":"M. Feldmann, T. Götte, C. Scheideler, in: Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2019, pp. 149–164.","ieee":"M. Feldmann, T. Götte, and C. Scheideler, “A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory,” in Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2019, pp. 149–164.","chicago":"Feldmann, Michael, Thorsten Götte, and Christian Scheideler. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.” In Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 149–64. Lecture Notes in Computer Science. Springer, Cham, 2019. https://doi.org/10.1007/978-3-030-34992-9_13.","apa":"Feldmann, M., Götte, T., & Scheideler, C. (2019). A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 149–164). Springer, Cham. https://doi.org/10.1007/978-3-030-34992-9_13","ama":"Feldmann M, Götte T, Scheideler C. A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In: Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Lecture Notes in Computer Science. Springer, Cham; 2019:149-164. doi:https://doi.org/10.1007/978-3-030-34992-9_13","bibtex":"@inproceedings{Feldmann_Götte_Scheideler_2019, series={Lecture Notes in Computer Science}, title={A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory}, DOI={https://doi.org/10.1007/978-3-030-34992-9_13}, booktitle={Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Götte, Thorsten and Scheideler, Christian}, year={2019}, pages={149–164}, collection={Lecture Notes in Computer Science} }","mla":"Feldmann, Michael, et al. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.” Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2019, pp. 149–64, doi:https://doi.org/10.1007/978-3-030-34992-9_13."},"year":"2019","type":"conference","external_id":{"arxiv":["1909.04544"]},"title":"A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory","department":[{"_id":"79"}],"project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901","_id":"1"}],"date_updated":"2022-01-06T06:51:30Z","doi":"https://doi.org/10.1007/978-3-030-34992-9_13","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}]},{"_id":"13652","date_updated":"2022-01-06T06:51:41Z","doi":"10.4230/LIPICS.DISC.2019.23","language":[{"iso":"eng"}],"type":"conference","citation":{"ieee":"K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms for LP-Type Problems of Low Dimension,” in 33rd International Symposium on Distributed Computing (DISC 2019), 2019.","short":"K. Hinnenthal, C. Scheideler, M. Struijs, in: 33rd International Symposium on Distributed Computing (DISC 2019), 2019.","mla":"Hinnenthal, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.” 33rd International Symposium on Distributed Computing (DISC 2019), 2019, doi:10.4230/LIPICS.DISC.2019.23.","bibtex":"@inproceedings{Hinnenthal_Scheideler_Struijs_2019, title={Fast Distributed Algorithms for LP-Type Problems of Low Dimension}, DOI={10.4230/LIPICS.DISC.2019.23}, booktitle={33rd International Symposium on Distributed Computing (DISC 2019)}, author={Hinnenthal, Kristian and Scheideler, Christian and Struijs, Martijn}, year={2019} }","apa":"Hinnenthal, K., Scheideler, C., & Struijs, M. (2019). Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In 33rd International Symposium on Distributed Computing (DISC 2019). https://doi.org/10.4230/LIPICS.DISC.2019.23","ama":"Hinnenthal K, Scheideler C, Struijs M. Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In: 33rd International Symposium on Distributed Computing (DISC 2019). ; 2019. doi:10.4230/LIPICS.DISC.2019.23","chicago":"Hinnenthal, Kristian, Christian Scheideler, and Martijn Struijs. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.” In 33rd International Symposium on Distributed Computing (DISC 2019), 2019. https://doi.org/10.4230/LIPICS.DISC.2019.23."},"year":"2019","user_id":"32229","title":"Fast Distributed Algorithms for LP-Type Problems of Low Dimension","author":[{"last_name":"Hinnenthal","id":"32229","first_name":"Kristian","full_name":"Hinnenthal, Kristian"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Struijs, Martijn","first_name":"Martijn","last_name":"Struijs"}],"publication":"33rd International Symposium on Distributed Computing (DISC 2019)","department":[{"_id":"79"}],"status":"public","date_created":"2019-10-08T11:53:38Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}]},{"date_created":"2021-11-02T10:01:42Z","status":"public","editor":[{"last_name":"Chawla","full_name":"Chawla, Shuchi","first_name":"Shuchi"}],"publication":"Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020","publisher":"SIAM","author":[{"last_name":"Augustine","first_name":"John","full_name":"Augustine, John"},{"id":"32229","last_name":"Hinnenthal","full_name":"Hinnenthal, Kristian","first_name":"Kristian"},{"first_name":"Fabian","full_name":"Kuhn, Fabian","last_name":"Kuhn"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Philipp","full_name":"Schneider, Philipp","last_name":"Schneider"}],"user_id":"15504","title":"Shortest Paths in a Hybrid Network Model","language":[{"iso":"eng"}],"page":"1280-1299","type":"conference","citation":{"ama":"Augustine J, Hinnenthal K, Kuhn F, Scheideler C, Schneider P. Shortest Paths in a Hybrid Network Model. In: Chawla S, ed. Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. SIAM; 2020:1280-1299. doi:10.1137/1.9781611975994.78","apa":"Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., & Schneider, P. (2020). Shortest Paths in a Hybrid Network Model. In S. Chawla (Ed.), Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020 (pp. 1280–1299). SIAM. https://doi.org/10.1137/1.9781611975994.78","chicago":"Augustine, John, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, and Philipp Schneider. “Shortest Paths in a Hybrid Network Model.” In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, edited by Shuchi Chawla, 1280–99. SIAM, 2020. https://doi.org/10.1137/1.9781611975994.78.","bibtex":"@inproceedings{Augustine_Hinnenthal_Kuhn_Scheideler_Schneider_2020, title={Shortest Paths in a Hybrid Network Model}, DOI={10.1137/1.9781611975994.78}, booktitle={Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020}, publisher={SIAM}, author={Augustine, John and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp}, editor={Chawla, Shuchi}, year={2020}, pages={1280–1299} }","mla":"Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, edited by Shuchi Chawla, SIAM, 2020, pp. 1280–99, doi:10.1137/1.9781611975994.78.","short":"J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: S. Chawla (Ed.), Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, SIAM, 2020, pp. 1280–1299.","ieee":"J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest Paths in a Hybrid Network Model,” in Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, 2020, pp. 1280–1299, doi: 10.1137/1.9781611975994.78."},"year":"2020","doi":"10.1137/1.9781611975994.78","date_updated":"2022-01-06T06:57:33Z","_id":"27051"},{"volume":19,"date_created":"2020-08-11T10:57:26Z","status":"public","publication":"Nat. Comput.","author":[{"first_name":"Robert","full_name":"Gmyr, Robert","last_name":"Gmyr"},{"first_name":"Kristian","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal","id":"32229"},{"full_name":"Kostitsyna, Irina","first_name":"Irina","last_name":"Kostitsyna"},{"first_name":"Fabian","full_name":"Kuhn, Fabian","last_name":"Kuhn"},{"full_name":"Rudolph, Dorian","first_name":"Dorian","last_name":"Rudolph"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Strothmann, Thim","first_name":"Thim","last_name":"Strothmann"}],"title":"Forming tile shapes with simple robots","user_id":"15504","page":"375-390","year":"2020","citation":{"short":"R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler, T. Strothmann, Nat. Comput. 19 (2020) 375–390.","ieee":"R. Gmyr et al., “Forming tile shapes with simple robots,” Nat. Comput., vol. 19, no. 2, pp. 375–390, 2020.","chicago":"Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler, and Thim Strothmann. “Forming Tile Shapes with Simple Robots.” Nat. Comput. 19, no. 2 (2020): 375–90. https://doi.org/10.1007/s11047-019-09774-2.","ama":"Gmyr R, Hinnenthal K, Kostitsyna I, et al. Forming tile shapes with simple robots. Nat Comput. 2020;19(2):375-390. doi:10.1007/s11047-019-09774-2","apa":"Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler, C., & Strothmann, T. (2020). Forming tile shapes with simple robots. Nat. Comput., 19(2), 375–390. https://doi.org/10.1007/s11047-019-09774-2","bibtex":"@article{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_Strothmann_2020, title={Forming tile shapes with simple robots}, volume={19}, DOI={10.1007/s11047-019-09774-2}, number={2}, journal={Nat. Comput.}, author={Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian and Strothmann, Thim}, year={2020}, pages={375–390} }","mla":"Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.” Nat. Comput., vol. 19, no. 2, 2020, pp. 375–90, doi:10.1007/s11047-019-09774-2."},"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1007/s11047-019-09774-2","issue":"2","date_updated":"2022-01-06T06:53:20Z","_id":"17808","intvolume":" 19"},{"date_updated":"2022-01-06T06:54:36Z","doi":"10.4230/LIPIcs.OPODIS.2020.31","language":[{"iso":"eng"}],"external_id":{"arxiv":["2007.01191"]},"title":"Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs","department":[{"_id":"79"}],"project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901","_id":"1"}],"_id":"20755","year":"2020","type":"conference","citation":{"ieee":"M. Feldmann, K. Hinnenthal, and C. Scheideler, “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs,” in Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), 2020.","short":"M. Feldmann, K. Hinnenthal, C. Scheideler, in: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","bibtex":"@inproceedings{Feldmann_Hinnenthal_Scheideler_2020, title={Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs}, DOI={10.4230/LIPIcs.OPODIS.2020.31}, booktitle={Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian}, year={2020} }","mla":"Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2020.31.","chicago":"Feldmann, Michael, Kristian Hinnenthal, and Christian Scheideler. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” In Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31.","apa":"Feldmann, M., Hinnenthal, K., & Scheideler, C. (2020). Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31","ama":"Feldmann M, Hinnenthal K, Scheideler C. Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2020.31"},"abstract":[{"text":"We consider the problem of computing shortest paths in \\emph{hybrid networks}, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular network to solve tasks more efficiently. Like in this case, the different communication modes may differ considerably in range, bandwidth, and flexibility. We build upon the model of Augustine et al. [SODA '20], which captures these differences by a \\emph{local} and a \\emph{global} mode. Specifically, the local edges model a fixed communication network in which $O(1)$ messages of size $O(\\log n)$ can be sent over every edge in each synchronous round. The global edges form a clique, but nodes are only allowed to send and receive a total of at most $O(\\log n)$ messages over global edges, which restricts the nodes to use these edges only very sparsely.\r\n\r\nWe demonstrate the power of hybrid networks by presenting algorithms to compute Single-Source Shortest Paths and the diameter very efficiently in \\emph{sparse graphs}. Specifically, we present exact $O(\\log n)$ time algorithms for cactus graphs (i.e., graphs in which each edge is contained in at most one cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges and arboricity $O(\\log n)$. For these graph classes, our algorithms provide exponentially faster solutions than the best known algorithms for general graphs in this model.\r\nBeyond shortest paths, we also provide a variety of useful tools and techniques for hybrid networks, which may be of independent interest.\r\n","lang":"eng"}],"ddc":["000"],"user_id":"23538","publication":"Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)","file_date_updated":"2020-12-16T10:18:50Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"first_name":"Michael","full_name":"Feldmann, Michael","last_name":"Feldmann","id":"23538"},{"id":"32229","last_name":"Hinnenthal","full_name":"Hinnenthal, Kristian","first_name":"Kristian"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file":[{"date_created":"2020-12-16T10:18:50Z","file_name":"Fast_Hybrid_Network_Algorithms_for_Shortest_Paths_in_Sparse_Graphs.pdf","access_level":"closed","file_size":867373,"creator":"mfeldma2","file_id":"20756","content_type":"application/pdf","date_updated":"2020-12-16T10:18:50Z","relation":"main_file","success":1}],"date_created":"2020-12-16T10:20:18Z","status":"public","has_accepted_license":"1"},{"language":[{"iso":"eng"}],"type":"journal_article","citation":{"bibtex":"@article{Feldmann_Scheideler_Schmid_2020, title={Survey on Algorithms for Self-Stabilizing Overlay Networks}, DOI={10.1145/3397190}, journal={ACM Computing Surveys}, publisher={ACM}, author={Feldmann, Michael and Scheideler, Christian and Schmid, Stefan}, year={2020} }","mla":"Feldmann, Michael, et al. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” ACM Computing Surveys, ACM, 2020, doi:10.1145/3397190.","apa":"Feldmann, M., Scheideler, C., & Schmid, S. (2020). Survey on Algorithms for Self-Stabilizing Overlay Networks. ACM Computing Surveys. https://doi.org/10.1145/3397190","ama":"Feldmann M, Scheideler C, Schmid S. Survey on Algorithms for Self-Stabilizing Overlay Networks. ACM Computing Surveys. 2020. doi:10.1145/3397190","chicago":"Feldmann, Michael, Christian Scheideler, and Stefan Schmid. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” ACM Computing Surveys, 2020. https://doi.org/10.1145/3397190.","ieee":"M. Feldmann, C. Scheideler, and S. Schmid, “Survey on Algorithms for Self-Stabilizing Overlay Networks,” ACM Computing Surveys, 2020.","short":"M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020)."},"year":"2020","date_updated":"2022-01-06T06:52:58Z","_id":"16902","doi":"10.1145/3397190","author":[{"full_name":"Feldmann, Michael","first_name":"Michael","id":"23538","last_name":"Feldmann"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"}],"publisher":"ACM","department":[{"_id":"79"}],"publication":"ACM Computing Surveys","status":"public","date_created":"2020-04-29T07:09:50Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"abstract":[{"text":"The maintenance of efficient and robust overlay networks is one\r\nof the most fundamental and reoccurring themes in networking.\r\nThis paper presents a survey of state-of-the-art \r\nalgorithms to design and repair overlay networks in a distributed\r\nmanner. In particular, we discuss basic algorithmic primitives\r\nto preserve connectivity, review algorithms for the fundamental\r\nproblem of graph linearization, and then survey self-stabilizing\r\nalgorithms for metric and scalable topologies. \r\nWe also identify open problems and avenues for future research.\r\n","lang":"eng"}],"user_id":"23538","title":"Survey on Algorithms for Self-Stabilizing Overlay Networks"},{"title":"Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model","user_id":"23538","external_id":{"arxiv":["2005.07388"]},"abstract":[{"text":"We consider the clock synchronization problem in the (discrete) beeping model: Given a network of $n$ nodes with each node having a clock value $\\delta(v) \\in \\{0,\\ldots T-1\\}$, the goal is to synchronize the clock values of all nodes such that they have the same value in any round.\r\nAs is standard in clock synchronization, we assume \\emph{arbitrary activations} for all nodes, i.e., the nodes start their protocol at an arbitrary round (not limited to $\\{0,\\ldots,T-1\\}$).\r\nWe give an asymptotically optimal algorithm that runs in $4D + \\Bigl\\lfloor \\frac{D}{\\lfloor T/4 \\rfloor} \\Bigr \\rfloor \\cdot (T \\mod 4) = O(D)$ rounds, where $D$ is the diameter of the network.\r\nOnce all nodes are in sync, they beep at the same round every $T$ rounds.\r\nThe algorithm drastically improves on the $O(T D)$-bound of \\cite{firefly_sync} (where $T$ is required to be at least $4n$, so the bound is no better than $O(nD)$).\r\nOur algorithm is very simple as nodes only have to maintain $3$ bits in addition to the $\\lceil \\log T \\rceil$ bits needed to maintain the clock.\r\nFurthermore we investigate the complexity of \\emph{self-stabilizing} solutions for the clock synchronization problem: We first show lower bounds of $\\Omega(\\max\\{T,n\\})$ rounds on the runtime and $\\Omega(\\log(\\max\\{T,n\\}))$ bits of memory required for any such protocol.\r\nAfterwards we present a protocol that runs in $O(\\max\\{T,n\\})$ rounds using at most $O(\\log(\\max\\{T,n\\}))$ bits at each node, which is asymptotically optimal with regards to both, runtime and memory requirements.","lang":"eng"}],"project":[{"name":"Algorithmen für programmierbare Materie in einem physiologischen Medium","_id":"96"}],"date_created":"2020-04-29T07:16:35Z","status":"public","department":[{"_id":"79"}],"publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","publisher":"ACM","author":[{"first_name":"Michael","full_name":"Feldmann, Michael","last_name":"Feldmann","id":"23538"},{"full_name":"Khazraei, Ardalan","first_name":"Ardalan","last_name":"Khazraei"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"doi":"10.1145/3350755.3400246","date_updated":"2022-01-06T06:52:58Z","_id":"16903","type":"conference","citation":{"short":"M. Feldmann, A. Khazraei, C. Scheideler, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020.","ieee":"M. Feldmann, A. Khazraei, and C. Scheideler, “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020.","chicago":"Feldmann, Michael, Ardalan Khazraei, and Christian Scheideler. “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model.” In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM, 2020. https://doi.org/10.1145/3350755.3400246.","apa":"Feldmann, M., Khazraei, A., & Scheideler, C. (2020). Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM. https://doi.org/10.1145/3350755.3400246","ama":"Feldmann M, Khazraei A, Scheideler C. Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2020. doi:10.1145/3350755.3400246","mla":"Feldmann, Michael, et al. “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020, doi:10.1145/3350755.3400246.","bibtex":"@inproceedings{Feldmann_Khazraei_Scheideler_2020, title={Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model}, DOI={10.1145/3350755.3400246}, booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Khazraei, Ardalan and Scheideler, Christian}, year={2020} }"},"year":"2020","language":[{"iso":"eng"}]},{"_id":"15169","date_updated":"2022-01-06T06:52:16Z","conference":{"location":"Kolkata, Indien","name":"21st International Conference on Distributed Computing and Networking ","start_date":"04.01.2020","end_date":"07.01.2020"},"type":"conference","citation":{"ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), Kolkata, Indien.","short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.","mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM.","bibtex":"@inproceedings{Castenow_Kolb_Scheideler, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)}, publisher={ACM}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian} }","apa":"Castenow, J., Kolb, C., & Scheideler, C. (n.d.). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). Kolkata, Indien: ACM.","ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM.","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM, n.d."},"year":"2020","language":[{"iso":"eng"}],"title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","user_id":"477","publication_status":"accepted","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2019-11-25T12:18:41Z","publisher":"ACM","author":[{"last_name":"Castenow","id":"38705","first_name":"Jannik","full_name":"Castenow, Jannik"},{"first_name":"Christina","full_name":"Kolb, Christina","last_name":"Kolb","id":"43647"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)","department":[{"_id":"63"},{"_id":"79"}]},{"language":[{"iso":"eng"}],"citation":{"ieee":"J. J. Daymude, R. Gmyr, K. Hinnenthal, I. Kostitsyna, C. Scheideler, and A. W. Richa, “Convex Hull Formation for Programmable Matter,” in Proceedings of the 21st International Conference on Distributed Computing and Networking, 2020.","short":"J.J. Daymude, R. Gmyr, K. Hinnenthal, I. Kostitsyna, C. Scheideler, A.W. Richa, in: Proceedings of the 21st International Conference on Distributed Computing and Networking, 2020.","mla":"Daymude, Joshua J., et al. “Convex Hull Formation for Programmable Matter.” Proceedings of the 21st International Conference on Distributed Computing and Networking, 2020, doi:10.1145/3369740.3372916.","bibtex":"@inproceedings{Daymude_Gmyr_Hinnenthal_Kostitsyna_Scheideler_Richa_2020, title={Convex Hull Formation for Programmable Matter}, DOI={10.1145/3369740.3372916}, booktitle={Proceedings of the 21st International Conference on Distributed Computing and Networking}, author={Daymude, Joshua J. and Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Scheideler, Christian and Richa, Andréa W.}, year={2020} }","chicago":"Daymude, Joshua J., Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Christian Scheideler, and Andréa W. Richa. “Convex Hull Formation for Programmable Matter.” In Proceedings of the 21st International Conference on Distributed Computing and Networking, 2020. https://doi.org/10.1145/3369740.3372916.","ama":"Daymude JJ, Gmyr R, Hinnenthal K, Kostitsyna I, Scheideler C, Richa AW. Convex Hull Formation for Programmable Matter. In: Proceedings of the 21st International Conference on Distributed Computing and Networking. ; 2020. doi:10.1145/3369740.3372916","apa":"Daymude, J. J., Gmyr, R., Hinnenthal, K., Kostitsyna, I., Scheideler, C., & Richa, A. W. (2020). Convex Hull Formation for Programmable Matter. In Proceedings of the 21st International Conference on Distributed Computing and Networking. https://doi.org/10.1145/3369740.3372916"},"type":"conference","year":"2020","doi":"10.1145/3369740.3372916","date_updated":"2022-01-06T06:52:49Z","_id":"16346","date_created":"2020-03-26T07:33:41Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9781450377515"]},"publication":"Proceedings of the 21st International Conference on Distributed Computing and Networking","author":[{"full_name":"Daymude, Joshua J.","first_name":"Joshua J.","last_name":"Daymude"},{"first_name":"Robert","full_name":"Gmyr, Robert","last_name":"Gmyr"},{"first_name":"Kristian","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal","id":"32229"},{"first_name":"Irina","full_name":"Kostitsyna, Irina","last_name":"Kostitsyna"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Richa","first_name":"Andréa W.","full_name":"Richa, Andréa W."}],"user_id":"32229","title":"Convex Hull Formation for Programmable Matter"},{"title":"Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization","user_id":"15504","editor":[{"first_name":"Laura","full_name":"Galluccio, Laura","last_name":"Galluccio"},{"first_name":"Urbashi","full_name":"Mitra, Urbashi","last_name":"Mitra"},{"first_name":"Maurizio","full_name":"Magarini, Maurizio","last_name":"Magarini"},{"full_name":"Abada, Sergi","first_name":"Sergi","last_name":"Abada"},{"full_name":"Taynnan Barros, Michael","first_name":"Michael","last_name":"Taynnan Barros"},{"full_name":"Krishnaswamy, Bhuvana","first_name":"Bhuvana","last_name":"Krishnaswamy"}],"status":"public","date_created":"2021-09-29T09:09:58Z","author":[{"last_name":"Dolev","first_name":"Shlomi","full_name":"Dolev, Shlomi"},{"last_name":"Prasadh Narayanan","full_name":"Prasadh Narayanan, Ram","first_name":"Ram"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}],"publisher":"ACM","publication":"NANOCOM '21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021","doi":"10.1145/3477206.3477471","date_updated":"2022-01-06T06:56:51Z","_id":"25105","year":"2021","type":"conference","citation":{"ieee":"S. Dolev, R. Prasadh Narayanan, C. Scheideler, and C. Schindelhauer, “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization,” in NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, 2021, p. 30:1-30:2, doi: 10.1145/3477206.3477471.","short":"S. Dolev, R. Prasadh Narayanan, C. Scheideler, C. Schindelhauer, in: L. Galluccio, U. Mitra, M. Magarini, S. Abada, M. Taynnan Barros, B. Krishnaswamy (Eds.), NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, ACM, 2021, p. 30:1-30:2.","mla":"Dolev, Shlomi, et al. “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization.” NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, edited by Laura Galluccio et al., ACM, 2021, p. 30:1-30:2, doi:10.1145/3477206.3477471.","bibtex":"@inproceedings{Dolev_Prasadh Narayanan_Scheideler_Schindelhauer_2021, title={Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization}, DOI={10.1145/3477206.3477471}, booktitle={NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021}, publisher={ACM}, author={Dolev, Shlomi and Prasadh Narayanan, Ram and Scheideler, Christian and Schindelhauer, Christian}, editor={Galluccio, Laura and Mitra, Urbashi and Magarini, Maurizio and Abada, Sergi and Taynnan Barros, Michael and Krishnaswamy, Bhuvana}, year={2021}, pages={30:1-30:2} }","ama":"Dolev S, Prasadh Narayanan R, Scheideler C, Schindelhauer C. Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization. In: Galluccio L, Mitra U, Magarini M, Abada S, Taynnan Barros M, Krishnaswamy B, eds. NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021. ACM; 2021:30:1-30:2. doi:10.1145/3477206.3477471","apa":"Dolev, S., Prasadh Narayanan, R., Scheideler, C., & Schindelhauer, C. (2021). Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization. In L. Galluccio, U. Mitra, M. Magarini, S. Abada, M. Taynnan Barros, & B. Krishnaswamy (Eds.), NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021 (p. 30:1-30:2). ACM. https://doi.org/10.1145/3477206.3477471","chicago":"Dolev, Shlomi, Ram Prasadh Narayanan, Christian Scheideler, and Christian Schindelhauer. “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization.” In NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, edited by Laura Galluccio, Urbashi Mitra, Maurizio Magarini, Sergi Abada, Michael Taynnan Barros, and Bhuvana Krishnaswamy, 30:1-30:2. ACM, 2021. https://doi.org/10.1145/3477206.3477471."},"page":"30:1-30:2","language":[{"iso":"eng"}]},{"date_created":"2021-12-15T09:37:38Z","status":"public","volume":13046,"editor":[{"full_name":"Johnen, Colette","first_name":"Colette","last_name":"Johnen"},{"full_name":"Michael Schiller, Elad","first_name":"Elad","last_name":"Michael Schiller"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"}],"publication":"Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings","department":[{"_id":"79"}],"author":[{"last_name":"Feldmann","first_name":"Michael","full_name":"Feldmann, Michael"},{"last_name":"Padalkin","id":"88238","first_name":"Andreas","full_name":"Padalkin, Andreas"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Dolev","first_name":"Shlomi","full_name":"Dolev, Shlomi"}],"publisher":"Springer","user_id":"15504","title":"Coordinating Amoebots via Reconfigurable Circuits","language":[{"iso":"eng"}],"page":"484-488","citation":{"ama":"Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable Circuits. In: Johnen C, Michael Schiller E, Schmid S, eds. Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings. Vol 13046. Lecture Notes in Computer Science. Springer; 2021:484-488. doi:10.1007/978-3-030-91081-5\\_34","apa":"Feldmann, M., Padalkin, A., Scheideler, C., & Dolev, S. (2021). Coordinating Amoebots via Reconfigurable Circuits. In C. Johnen, E. Michael Schiller, & S. Schmid (Eds.), Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings (Vol. 13046, pp. 484–488). Springer. https://doi.org/10.1007/978-3-030-91081-5\\_34","chicago":"Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” In Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen, Elad Michael Schiller, and Stefan Schmid, 13046:484–88. Lecture Notes in Computer Science. Springer, 2021. https://doi.org/10.1007/978-3-030-91081-5\\_34.","bibtex":"@inproceedings{Feldmann_Padalkin_Scheideler_Dolev_2021, series={Lecture Notes in Computer Science}, title={Coordinating Amoebots via Reconfigurable Circuits}, volume={13046}, DOI={10.1007/978-3-030-91081-5\\_34}, booktitle={Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings}, publisher={Springer}, author={Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and Dolev, Shlomi}, editor={Johnen, Colette and Michael Schiller, Elad and Schmid, Stefan}, year={2021}, pages={484–488}, collection={Lecture Notes in Computer Science} }","mla":"Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.” Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen et al., vol. 13046, Springer, 2021, pp. 484–88, doi:10.1007/978-3-030-91081-5\\_34.","short":"M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, in: C. Johnen, E. Michael Schiller, S. Schmid (Eds.), Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, Springer, 2021, pp. 484–488.","ieee":"M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,” in Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, 2021, vol. 13046, pp. 484–488, doi: 10.1007/978-3-030-91081-5\\_34."},"type":"conference","year":"2021","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-030-91081-5\\_34","_id":"28917","date_updated":"2022-01-06T06:58:41Z","intvolume":" 13046"}]