[{"author":[{"first_name":"Zahra","last_name":"Derakhshandeh","full_name":"Derakhshandeh, Zahra"},{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Strothmann, Thim Frederik","last_name":"Strothmann","first_name":"Thim Frederik","id":"11319"}],"publication_identifier":{"unknown":["978-1-4503-4210-0"]},"status":"public","title":"Universal Shape Formation for Programmable Matter","year":"2016","date_updated":"2022-01-06T06:53:30Z","publisher":"ACM","_id":"1837","language":[{"iso":"eng"}],"page":"289--299","user_id":"15504","doi":"10.1145/2935764.2935784","citation":{"apa":"Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &#38; Strothmann, T. F. (2016). Universal Shape Formation for Programmable Matter. In <i>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</i> (pp. 289--299). ACM. <a href=\"https://doi.org/10.1145/2935764.2935784\">https://doi.org/10.1145/2935764.2935784</a>","ieee":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Universal Shape Formation for Programmable Matter,” in <i>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</i>, 2016, pp. 289--299.","chicago":"Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Universal Shape Formation for Programmable Matter.” In <i>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</i>, 289--299. ACM, 2016. <a href=\"https://doi.org/10.1145/2935764.2935784\">https://doi.org/10.1145/2935764.2935784</a>.","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.” <i>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</i>, ACM, 2016, pp. 289--299, doi:<a href=\"https://doi.org/10.1145/2935764.2935784\">10.1145/2935764.2935784</a>.","ama":"Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Universal Shape Formation for Programmable Matter. In: <i>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</i>. ACM; 2016:289--299. doi:<a href=\"https://doi.org/10.1145/2935764.2935784\">10.1145/2935764.2935784</a>","bibtex":"@inproceedings{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2016, title={Universal Shape Formation for Programmable Matter}, DOI={<a href=\"https://doi.org/10.1145/2935764.2935784\">10.1145/2935764.2935784</a>}, 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} }"},"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","date_created":"2018-03-27T12:44:09Z","department":[{"_id":"79"}],"type":"conference"},{"publication_identifier":{"isbn":["978-1-4503-4210-0"]},"title":"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","status":"public","year":"2016","date_updated":"2022-01-06T06:53:32Z","_id":"1844","editor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"full_name":"Gilbert, Seth","first_name":"Seth","last_name":"Gilbert"}],"doi":"10.1145/2935764","user_id":"15504","citation":{"mla":"Scheideler, Christian, and Seth Gilbert, editors. <i>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</i>. 2016, doi:<a href=\"https://doi.org/10.1145/2935764\">10.1145/2935764</a>.","bibtex":"@book{Scheideler_Gilbert_2016, title={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}, DOI={<a href=\"https://doi.org/10.1145/2935764\">10.1145/2935764</a>}, year={2016} }","ama":"Scheideler C, Gilbert S, eds. <i>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</i>.; 2016. doi:<a href=\"https://doi.org/10.1145/2935764\">10.1145/2935764</a>","ieee":"C. Scheideler and S. Gilbert, Eds., <i>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</i>. 2016.","apa":"Scheideler, C., &#38; Gilbert, S. (Eds.). (2016). <i>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</i>. <a href=\"https://doi.org/10.1145/2935764\">https://doi.org/10.1145/2935764</a>","short":"C. Scheideler, S. Gilbert, eds., 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.","chicago":"Scheideler, Christian, and Seth Gilbert, eds. <i>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</i>, 2016. <a href=\"https://doi.org/10.1145/2935764\">https://doi.org/10.1145/2935764</a>."},"date_created":"2018-03-28T05:44:12Z","department":[{"_id":"79"}],"type":"conference_editor"},{"citation":{"bibtex":"@inbook{W. Richa_Scheideler_2016, title={Jamming-Resistant MAC Protocols for Wireless Networks}, DOI={<a href=\"https://doi.org/10.1007/978-1-4939-2864-4_593\">10.1007/978-1-4939-2864-4_593</a>}, booktitle={Encyclopedia of Algorithms}, author={W. Richa, Andrea and Scheideler, Christian}, year={2016}, pages={999--1002} }","short":"A. W. Richa, C. Scheideler, in: Encyclopedia of Algorithms, 2016, pp. 999--1002.","ama":"W. Richa A, Scheideler C. Jamming-Resistant MAC Protocols for Wireless Networks. In: <i>Encyclopedia of Algorithms</i>. ; 2016:999--1002. doi:<a href=\"https://doi.org/10.1007/978-1-4939-2864-4_593\">10.1007/978-1-4939-2864-4_593</a>","chicago":"W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols for Wireless Networks.” In <i>Encyclopedia of Algorithms</i>, 999--1002, 2016. <a href=\"https://doi.org/10.1007/978-1-4939-2864-4_593\">https://doi.org/10.1007/978-1-4939-2864-4_593</a>.","ieee":"A. W. Richa and C. Scheideler, “Jamming-Resistant MAC Protocols for Wireless Networks,” in <i>Encyclopedia of Algorithms</i>, 2016, pp. 999--1002.","apa":"W. Richa, A., &#38; Scheideler, C. (2016). Jamming-Resistant MAC Protocols for Wireless Networks. In <i>Encyclopedia of Algorithms</i> (pp. 999--1002). <a href=\"https://doi.org/10.1007/978-1-4939-2864-4_593\">https://doi.org/10.1007/978-1-4939-2864-4_593</a>","mla":"W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols for Wireless Networks.” <i>Encyclopedia of Algorithms</i>, 2016, pp. 999--1002, doi:<a href=\"https://doi.org/10.1007/978-1-4939-2864-4_593\">10.1007/978-1-4939-2864-4_593</a>."},"publication":"Encyclopedia of Algorithms","department":[{"_id":"79"}],"type":"book_chapter","date_created":"2018-03-28T05:45:04Z","date_updated":"2022-01-06T06:53:32Z","author":[{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"title":"Jamming-Resistant MAC Protocols for Wireless Networks","year":"2016","status":"public","user_id":"15504","doi":"10.1007/978-1-4939-2864-4_593","_id":"1845","page":"999--1002"},{"date_created":"2017-10-17T12:41:35Z","file":[{"file_id":"1510","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T10:35:39Z","file_name":"223-MasterarbeitHinnenthal.pdf","access_level":"closed","file_size":1127144,"date_created":"2018-03-21T10:35:39Z","creator":"florida"}],"department":[{"_id":"79"}],"type":"mastersthesis","citation":{"bibtex":"@book{Hinnenthal_2016, title={Aggregation in Overlay Networks}, publisher={Universität Paderborn}, author={Hinnenthal, Kristian}, year={2016} }","ama":"Hinnenthal K. <i>Aggregation in Overlay Networks</i>. Universität Paderborn; 2016.","short":"K. Hinnenthal, Aggregation in Overlay Networks, Universität Paderborn, 2016.","chicago":"Hinnenthal, Kristian. <i>Aggregation in Overlay Networks</i>. Universität Paderborn, 2016.","ieee":"K. Hinnenthal, <i>Aggregation in Overlay Networks</i>. Universität Paderborn, 2016.","apa":"Hinnenthal, K. (2016). <i>Aggregation in Overlay Networks</i>. Universität Paderborn.","mla":"Hinnenthal, Kristian. <i>Aggregation in Overlay Networks</i>. Universität Paderborn, 2016."},"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"file_date_updated":"2018-03-21T10:35:39Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"abstract":[{"lang":"eng","text":"We consider the problem of aggregation in overlay networks. We use a synchronous time model in which each node has polylogarithmic memory and can send at most a polylogarithmic number of messages per round. We investigate how to quickly compute the result of an aggregate functionf over elements that are distributed among the nodes of the network such that the result is eventually known by a selected root node. We show how to compute distributive aggregate functions such as SUM, MAX, and OR in time $O(\\log n / \\log\\log n)$ using a tree that is created in a pre-processing phase. If only a polylogarithmic number of data items need to be aggregated, we show how to compute the result in time $O(\\sqrt{\\log n / \\log\\log n})$. Furthermore, we show how to compute holistic aggregate functions such as DISTINCT, SMALLEST(k) and MODE(k) in time $O(\\log n / \\log\\log n)$. Finally, we show a lower bound of $\\Omega(\\sqrt{\\log n / \\log\\log n})$ for deterministic algorithms that compute any of the aggregate functions in the scope of the thesis."}],"_id":"223","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"15504","ddc":["040"],"author":[{"id":"32229","first_name":"Kristian","last_name":"Hinnenthal","full_name":"Hinnenthal, Kristian"}],"title":"Aggregation in Overlay Networks","status":"public","year":"2016","has_accepted_license":"1","date_updated":"2022-01-06T06:55:30Z"},{"file_date_updated":"2018-11-27T11:58:08Z","citation":{"apa":"Strothmann, T. F. (2016). The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree. <i>Journal of Graph Algorithms and Applications</i>, <i>20</i>(1), 79–100. <a href=\"https://doi.org/10.7155/jgaa.00385\">https://doi.org/10.7155/jgaa.00385</a>","ieee":"T. F. Strothmann, “The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree,” <i>Journal of Graph Algorithms and Applications</i>, vol. 20, no. 1, pp. 79–100, 2016.","chicago":"Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree.” <i>Journal of Graph Algorithms and Applications</i> 20, no. 1 (2016): 79–100. <a href=\"https://doi.org/10.7155/jgaa.00385\">https://doi.org/10.7155/jgaa.00385</a>.","short":"T.F. Strothmann, Journal of Graph Algorithms and Applications 20 (2016) 79–100.","mla":"Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree.” <i>Journal of Graph Algorithms and Applications</i>, vol. 20, no. 1, Journal of Graph Algorithms and Applications, 2016, pp. 79–100, doi:<a href=\"https://doi.org/10.7155/jgaa.00385\">10.7155/jgaa.00385</a>.","ama":"Strothmann TF. The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree. <i>Journal of Graph Algorithms and Applications</i>. 2016;20(1):79-100. doi:<a href=\"https://doi.org/10.7155/jgaa.00385\">10.7155/jgaa.00385</a>","bibtex":"@article{Strothmann_2016, title={The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree}, volume={20}, DOI={<a href=\"https://doi.org/10.7155/jgaa.00385\">10.7155/jgaa.00385</a>}, number={1}, journal={Journal of Graph Algorithms and Applications}, publisher={Journal of Graph Algorithms and Applications}, author={Strothmann, Thim Frederik}, year={2016}, pages={79–100} }"},"quality_controlled":"1","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"page":"79-100","_id":"5762","publisher":"Journal of Graph Algorithms and Applications","user_id":"477","ddc":["040"],"volume":20,"status":"public","has_accepted_license":"1","file":[{"access_level":"closed","file_size":2324066,"file_name":"Strothmann2016.20.1.pdf","date_updated":"2018-11-27T11:58:08Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"5912","creator":"thim","date_created":"2018-11-27T11:58:08Z"}],"date_created":"2018-11-19T15:33:50Z","type":"journal_article","department":[{"_id":"79"}],"publication":"Journal of Graph Algorithms and Applications","issue":"1","abstract":[{"lang":"eng","text":"This paper introduces the problem of communication pattern adaption for a distributed self-adjusting binary search tree. We propose a simple local algorithm that is closely related to the over thirty-year-old idea of splay trees and evaluate its adaption performance in the distributed scenario if different communication patterns are provided. \r\nTo do so, the process of self-adjustment is modeled similarly to a basic network creation game in which the nodes want to communicate with only a certain subset of all nodes. \r\nWe show that, in general, the game (i.e., the process of local adjustments) does not converge, and that convergence is related to certain structures of the communication interests, which we call conflicts. \r\nWe classify conflicts and show that for two communication scenarios in which convergence is guaranteed, the self-adjusting tree performs well. \r\nFurthermore, we investigate the different classes of conflicts separately and show that, for a certain class of conflicts, the performance of the tree network is asymptotically as good as the performance for converging instances.\r\nHowever, for the other conflict classes, a distributed self-adjusting binary search tree adapts poorly."}],"language":[{"iso":"eng"}],"doi":"10.7155/jgaa.00385","title":"The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree","year":"2016","publication_identifier":{"issn":["1526-1719"]},"author":[{"full_name":"Strothmann, Thim Frederik","last_name":"Strothmann","first_name":"Thim Frederik","id":"11319"}],"publication_status":"published","date_updated":"2022-01-06T07:02:38Z","intvolume":"        20"},{"user_id":"15504","ddc":["040"],"_id":"155","page":"248--262","has_accepted_license":"1","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"ama":"Gmyr R, Lefèvre J, Scheideler C. Self-stabilizing Metric Graphs. In: <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. LNCS. ; 2016:248--262. doi:<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>","bibtex":"@inproceedings{Gmyr_Lefèvre_Scheideler_2016, series={LNCS}, title={Self-stabilizing Metric Graphs}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>}, 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.” <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2016, pp. 248--262, doi:<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>.","chicago":"Gmyr, Robert, Jonas Lefèvre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.” In <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 248--262. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">https://doi.org/10.1007/978-3-319-49259-9_20</a>.","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.","apa":"Gmyr, R., Lefèvre, J., &#38; Scheideler, C. (2016). Self-stabilizing Metric Graphs. In <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 248--262). <a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">https://doi.org/10.1007/978-3-319-49259-9_20</a>","ieee":"R. Gmyr, J. Lefèvre, and C. Scheideler, “Self-stabilizing Metric Graphs,” in <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2016, pp. 248--262."},"file_date_updated":"2018-03-21T12:51:24Z","doi":"10.1007/978-3-319-49259-9_20","series_title":"LNCS","date_updated":"2022-01-06T06:52:28Z","author":[{"first_name":"Robert","last_name":"Gmyr","full_name":"Gmyr, Robert"},{"last_name":"Lefèvre","first_name":"Jonas","full_name":"Lefèvre, Jonas"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"year":"2016","title":"Self-stabilizing Metric Graphs","department":[{"_id":"79"}],"type":"conference","date_created":"2017-10-17T12:41:22Z","file":[{"file_size":389136,"access_level":"closed","file_name":"155-SSS16-GLS.pdf","date_updated":"2018-03-21T12:51:24Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1550","creator":"florida","date_created":"2018-03-21T12:51:24Z"}],"abstract":[{"lang":"eng","text":"We present a self-stabilizing algorithm for overlay networks that, for an arbitrary metric given by a distance oracle, constructs the graph representing that metric. The graph representing a metric is the unique minimal undirected graph such that for any pair of nodes the length of a shortest path between the nodes corresponds to the distance between the nodes according to the metric. The algorithm works under both an asynchronous and a synchronous daemon. In the synchronous case, the algorithm stablizes in time O(n) and it is almost silent in that after stabilization a node sends and receives a constant number of messages per round."}],"publication":"Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)"},{"date_created":"2017-10-17T12:41:19Z","file":[{"success":1,"content_type":"application/pdf","file_id":"1558","file_size":209638,"access_level":"closed","file_name":"142-SchSetStrDISC16.pdf","date_updated":"2018-03-21T12:59:29Z","relation":"main_file","date_created":"2018-03-21T12:59:29Z","creator":"florida"}],"department":[{"_id":"79"}],"type":"conference","publication":"Proceedings of the 30th International Symposium on Distributed Computing (DISC)","abstract":[{"lang":"eng","text":"For overlay networks, the ability to recover from a variety of problems like membership changes or faults is a key element to preserve their functionality. In recent years, various self-stabilizing overlay networks have been proposed that have the advantage of being able to recover from any illegal state. However, the vast majority of these networks cannot give any guarantees on its functionality while the recovery process is going on. We are especially interested in searchability, i.e., the functionality that search messages for a specific identifier are answered successfully if a node with that identifier exists in the network. We investigate overlay networks that are not only self-stabilizing but that also ensure that monotonic searchability is maintained while the recovery process is going on, as long as there are no corrupted messages in the system. More precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well. Monotonic searchability was recently introduced in OPODIS 2015, in which the authors provide a solution for a simple line topology.We present the first universal approach to maintain monotonic searchability that is applicable to a wide range of topologies. As the base for our approach, we introduce a set of primitives for manipulating overlay networks that allows us to maintain searchability and show how existing protocols can be transformed to use theses primitives.We complement this result with a generic search protocol that together with the use of our primitives guarantees monotonic searchability.As an additional feature, searching existing nodes with the generic search protocol is as fast as searching a node with any other fixed routing protocol once the topology has stabilized."}],"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-662-53426-7_6","author":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Alexander","last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108"},{"id":"11319","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann","first_name":"Thim Frederik"}],"year":"2016","title":"Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks","date_updated":"2022-01-06T06:51:56Z","citation":{"mla":"Scheideler, Christian, et al. “Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks.” <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>, 2016, pp. 71--84, doi:<a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">10.1007/978-3-662-53426-7_6</a>.","bibtex":"@inproceedings{Scheideler_Setzer_Strothmann_2016, series={LNCS}, title={Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">10.1007/978-3-662-53426-7_6</a>}, 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} }","ama":"Scheideler C, Setzer A, Strothmann TF. Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In: <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2016:71--84. doi:<a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">10.1007/978-3-662-53426-7_6</a>","ieee":"C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks,” in <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>, 2016, pp. 71--84.","apa":"Scheideler, C., Setzer, A., &#38; Strothmann, T. F. (2016). Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i> (pp. 71--84). <a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">https://doi.org/10.1007/978-3-662-53426-7_6</a>","chicago":"Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann. “Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks.” In <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>, 71--84. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">https://doi.org/10.1007/978-3-662-53426-7_6</a>.","short":"C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 30th International Symposium on Distributed Computing (DISC), 2016, pp. 71--84."},"file_date_updated":"2018-03-21T12:59:29Z","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","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1"},{"ddc":["040"],"user_id":"14052","volume":28,"page":"1655-1677","_id":"145","publisher":"Wiley Online Library","has_accepted_license":"1","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-21T12:57:57Z","citation":{"apa":"Feldotto, M., &#38; Graffi, K. (2016). Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. <i>Concurrency and Computation: Practice and Experience</i>, <i>28</i>(5), 1655–1677. <a href=\"https://doi.org/10.1002/cpe.3716\">https://doi.org/10.1002/cpe.3716</a>","mla":"Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” <i>Concurrency and Computation: Practice and Experience</i>, vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:<a href=\"https://doi.org/10.1002/cpe.3716\">10.1002/cpe.3716</a>.","ieee":"M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM,” <i>Concurrency and Computation: Practice and Experience</i>, vol. 28, no. 5, pp. 1655–1677, 2016.","short":"M. Feldotto, K. Graffi, Concurrency and Computation: Practice and Experience 28 (2016) 1655–1677.","ama":"Feldotto M, Graffi K. Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. <i>Concurrency and Computation: Practice and Experience</i>. 2016;28(5):1655-1677. doi:<a href=\"https://doi.org/10.1002/cpe.3716\">10.1002/cpe.3716</a>","chicago":"Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” <i>Concurrency and Computation: Practice and Experience</i> 28, no. 5 (2016): 1655–77. <a href=\"https://doi.org/10.1002/cpe.3716\">https://doi.org/10.1002/cpe.3716</a>.","bibtex":"@article{Feldotto_Graffi_2016, title={Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM}, volume={28}, DOI={<a href=\"https://doi.org/10.1002/cpe.3716\">10.1002/cpe.3716</a>}, number={5}, journal={Concurrency and Computation: Practice and Experience}, publisher={Wiley Online Library}, author={Feldotto, Matthias and Graffi, Kalman}, year={2016}, pages={1655–1677} }"},"doi":"10.1002/cpe.3716","date_updated":"2022-01-06T06:52:00Z","publication_status":"published","intvolume":"        28","title":"Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM","year":"2016","author":[{"id":"14052","full_name":"Feldotto, Matthias","first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516"},{"last_name":"Graffi","first_name":"Kalman","full_name":"Graffi, Kalman"}],"type":"journal_article","department":[{"_id":"79"},{"_id":"63"},{"_id":"541"}],"file":[{"creator":"florida","date_created":"2018-03-21T12:57:57Z","file_name":"145-Feldotto_et_al-2016-Concurrency_and_Computation-_Practice_and_Experience.pdf","file_size":3121363,"access_level":"closed","relation":"main_file","date_updated":"2018-03-21T12:57:57Z","file_id":"1556","success":1,"content_type":"application/pdf"}],"date_created":"2017-10-17T12:41:20Z","abstract":[{"text":"Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we present the peer-to-peer system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM comes with an extensive layer model to support various facets and protocols of peer-to-peer networking. In this article, we describe PeerfactSim.KOM and show how it can be used for detailed measurements of large-scale peer-to-peer networks. We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated, and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems. An immediate comparison of different configurations and overlays under different aspects is possible directly after the execution without any manual post-processing. ","lang":"eng"}],"issue":"5","publication":"Concurrency and Computation: Practice and Experience"},{"date_updated":"2022-01-06T06:50:30Z","has_accepted_license":"1","title":"Insider-resistent Distributed Storage Systems","year":"2016","status":"public","author":[{"first_name":"Martina","last_name":"Eikel","full_name":"Eikel, Martina"}],"user_id":"477","ddc":["000"],"_id":"10136","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"file_date_updated":"2019-06-07T06:39:13Z","citation":{"mla":"Eikel, Martina. <i>Insider-Resistent Distributed Storage Systems</i>. Universität Paderborn, 2016.","bibtex":"@book{Eikel_2016, title={Insider-resistent Distributed Storage Systems}, publisher={Universität Paderborn}, author={Eikel, Martina}, year={2016} }","ama":"Eikel M. <i>Insider-Resistent Distributed Storage Systems</i>. Universität Paderborn; 2016.","ieee":"M. Eikel, <i>Insider-resistent Distributed Storage Systems</i>. Universität Paderborn, 2016.","apa":"Eikel, M. (2016). <i>Insider-resistent Distributed Storage Systems</i>. Universität Paderborn.","short":"M. Eikel, Insider-Resistent Distributed Storage Systems, Universität Paderborn, 2016.","chicago":"Eikel, Martina. <i>Insider-Resistent Distributed Storage Systems</i>. Universität Paderborn, 2016."},"supervisor":[{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"type":"dissertation","department":[{"_id":"79"}],"file":[{"relation":"main_file","date_updated":"2019-06-07T06:39:13Z","file_name":"DissertationEikel.pdf","file_size":1605187,"access_level":"closed","file_id":"10137","content_type":"application/pdf","success":1,"creator":"florida","date_created":"2019-06-07T06:39:13Z"}],"date_created":"2019-06-07T06:37:37Z"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"mla":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS Attacks.” <i>Transactions on Parallel Computing</i>, no. 3, ACM, 2015, pp. 18:1--18:33, doi:<a href=\"https://doi.org/10.1145/2809806\">10.1145/2809806</a>.","bibtex":"@article{Eikel_Scheideler_2015, title={IRIS: A Robust Information System Against Insider DoS Attacks}, DOI={<a href=\"https://doi.org/10.1145/2809806\">10.1145/2809806</a>}, number={3}, journal={Transactions on Parallel Computing}, publisher={ACM}, author={Eikel, Martina and Scheideler, Christian}, year={2015}, pages={18:1--18:33} }","ama":"Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS Attacks. <i>Transactions on Parallel Computing</i>. 2015;(3):18:1--18:33. doi:<a href=\"https://doi.org/10.1145/2809806\">10.1145/2809806</a>","ieee":"M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider DoS Attacks,” <i>Transactions on Parallel Computing</i>, no. 3, pp. 18:1--18:33, 2015.","apa":"Eikel, M., &#38; Scheideler, C. (2015). IRIS: A Robust Information System Against Insider DoS Attacks. <i>Transactions on Parallel Computing</i>, (3), 18:1--18:33. <a href=\"https://doi.org/10.1145/2809806\">https://doi.org/10.1145/2809806</a>","short":"M. Eikel, C. Scheideler, Transactions on Parallel Computing (2015) 18:1--18:33.","chicago":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS Attacks.” <i>Transactions on Parallel Computing</i>, no. 3 (2015): 18:1--18:33. <a href=\"https://doi.org/10.1145/2809806\">https://doi.org/10.1145/2809806</a>."},"file_date_updated":"2018-03-21T09:25:04Z","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"477","_id":"284","publisher":"ACM","page":"18:1--18:33","abstract":[{"text":"In this work, we present the first scalable distributed information system, that is, a system with low storage overhead, that is provably robust against denial-of-service (DoS) attacks by a current insider. We allow a current insider to have complete knowledge about the information system and to have the power to block any ϵ-fraction of its servers by a DoS attack, where ϵ can be chosen up to a constant. The task of the system is to serve any collection of lookup requests with at most one per nonblocked server in an efficient way despite this attack. Previously, scalable solutions were only known for DoS attacks of past insiders, where a past insider only has complete knowledge about some past time point t0 of the information system. Scheideler et al. [Awerbuch and Scheideler 2007; Baumgart et al. 2009] showed that in this case, it is possible to design an information system so that any information that was inserted or last updated after t0 is safe against a DoS attack. But their constructions would not work at all for a current insider. The key idea behind our IRIS system is to make extensive use of coding. More precisely, we present two alternative distributed coding strategies with an at most logarithmic storage overhead that can handle up to a constant fraction of blocked servers.","lang":"eng"}],"issue":"3","publication":"Transactions on Parallel Computing","department":[{"_id":"79"}],"type":"journal_article","date_created":"2017-10-17T12:41:47Z","file":[{"date_created":"2018-03-21T09:25:04Z","creator":"florida","file_id":"1468","success":1,"content_type":"application/pdf","file_name":"284-Eikel-Scheideler-ACM2015.pdf","file_size":651726,"access_level":"closed","relation":"main_file","date_updated":"2018-03-21T09:25:04Z"}],"date_updated":"2022-01-06T06:58:03Z","author":[{"first_name":"Martina","last_name":"Eikel","full_name":"Eikel, Martina"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"title":"IRIS: A Robust Information System Against Insider DoS Attacks","year":"2015","doi":"10.1145/2809806"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"apa":"Scheideler, C., Setzer, A., &#38; Strothmann, T. F. (2015). Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures. In <i>Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2015.24\">https://doi.org/10.4230/LIPIcs.OPODIS.2015.24</a>","ieee":"C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures,” in <i>Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2015.","chicago":"Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann. “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.” In <i>Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>. Leibniz International Proceedings in Informatics (LIPIcs), 2015. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2015.24\">https://doi.org/10.4230/LIPIcs.OPODIS.2015.24</a>.","short":"C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015.","mla":"Scheideler, Christian, et al. “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.” <i>Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2015, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2015.24\">10.4230/LIPIcs.OPODIS.2015.24</a>.","ama":"Scheideler C, Setzer A, Strothmann TF. Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures. In: <i>Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>. Leibniz International Proceedings in Informatics (LIPIcs). ; 2015. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2015.24\">10.4230/LIPIcs.OPODIS.2015.24</a>","bibtex":"@inproceedings{Scheideler_Setzer_Strothmann_2015, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2015.24\">10.4230/LIPIcs.OPODIS.2015.24</a>}, booktitle={Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann, Thim Frederik}, year={2015}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }"},"file_date_updated":"2018-03-21T10:28:21Z","user_id":"477","ddc":["040"],"_id":"241","has_accepted_license":"1","status":"public","department":[{"_id":"79"}],"type":"conference","date_created":"2017-10-17T12:41:39Z","file":[{"file_id":"1497","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T10:28:21Z","file_name":"241-ScheidelerSetzerStrothmann2015.pdf","file_size":692363,"access_level":"closed","date_created":"2018-03-21T10:28:21Z","creator":"florida"}],"abstract":[{"text":"Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various problems like membership changes or faults. Various self-stabilizing overlay networks have already been proposed in recent years, which have the advantage of being able to recover from any illegal state, but none of these networks can give any guarantees on its functionality while the recovery process is going on. We initiate research on overlay networks that are not only self-stabilizing but that also ensure that searchability is maintained while the recovery process is going on, as long as there are no corrupted messages in the system. More precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well. We call this property monotonic searchability. We show that in general it is impossible to provide monotonic searchability if corrupted messages are present in the system, which justifies the restriction to system states without corrupted messages. Furthermore, we provide a self-stabilizing protocol for the line for which we can also show monotonic searchability. It turns out that even for the line it is non-trivial to achieve this property. Additionally, we extend our protocol to deal with node departures in terms of the Finite Departure Problem of Foreback et. al (SSS 2014). This makes our protocol even capable of handling node dynamics.","lang":"eng"}],"publication":"Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)","doi":"10.4230/LIPIcs.OPODIS.2015.24","language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","date_updated":"2022-01-06T06:56:07Z","author":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Setzer, Alexander","last_name":"Setzer","first_name":"Alexander","id":"11108"},{"id":"11319","full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik","last_name":"Strothmann"}],"title":"Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures","year":"2015"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"ama":"Koutsopoulos A, Scheideler C, Strothmann TF. Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In: <i>Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Lecture Notes in Computer Science. ; 2015:201-216. doi:<a href=\"https://doi.org/10.1007/978-3-319-21741-3_14\">10.1007/978-3-319-21741-3_14</a>","bibtex":"@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, series={Lecture Notes in Computer Science}, title={Towards a Universal Approach for the Finite Departure Problem in Overlay Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-21741-3_14\">10.1007/978-3-319-21741-3_14</a>}, booktitle={Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={201–216}, collection={Lecture Notes in Computer Science} }","mla":"Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” <i>Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2015, pp. 201–16, doi:<a href=\"https://doi.org/10.1007/978-3-319-21741-3_14\">10.1007/978-3-319-21741-3_14</a>.","chicago":"Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” In <i>Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 201–16. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21741-3_14\">https://doi.org/10.1007/978-3-319-21741-3_14</a>.","short":"A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–216.","apa":"Koutsopoulos, A., Scheideler, C., &#38; Strothmann, T. F. (2015). Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In <i>Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 201–216). <a href=\"https://doi.org/10.1007/978-3-319-21741-3_14\">https://doi.org/10.1007/978-3-319-21741-3_14</a>","ieee":"A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks,” in <i>Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2015, pp. 201–216."},"file_date_updated":"2018-03-21T09:59:32Z","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"477","_id":"242","page":"201-216","abstract":[{"text":"A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state, but almost no formal results are known for the case in which the overlay network is in an arbitrary initial state, i.e., when looking for a self-stabilizing solution for excluding leaving nodes. We study this problem in two variants: the Finite Departure Problem (FDP) and the Finite Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when it is safe to leave the network, whereas in the FSP, this leaving decision does not have to be final: the nodes may resume computation when woken up by an incoming message. We are the first to present a self-stabilizing protocol for the FDP and the FSP that can be combined with a large class of overlay maintenance protocols so that these are then guaranteed to safely exclude leaving nodes from the system from any initial state while operating as specified for the staying nodes. In order to formally define the properties these overlay maintenance protocols have to satisfy, we identify four basic primitives for manipulating edges in an overlay network that might be of independent interest.","lang":"eng"}],"publication":"Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","department":[{"_id":"79"}],"type":"conference","date_created":"2017-10-17T12:41:39Z","file":[{"success":1,"content_type":"application/pdf","file_id":"1496","date_updated":"2018-03-21T09:59:32Z","relation":"main_file","file_size":532792,"access_level":"closed","file_name":"242-KSS-SSS2015.pdf","date_created":"2018-03-21T09:59:32Z","creator":"florida"}],"date_updated":"2022-01-06T06:56:10Z","author":[{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Strothmann","first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik","id":"11319"}],"title":"Towards a Universal Approach for the Finite Departure Problem in Overlay Networks","year":"2015","doi":"10.1007/978-3-319-21741-3_14","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science"},{"citation":{"ieee":"T. F. Strothmann, “The impact of communication patterns on distributed locally self-adjusting binary search trees,” in <i>Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)</i>, 2015, pp. 175--186.","apa":"Strothmann, T. F. (2015). The impact of communication patterns on distributed locally self-adjusting binary search trees. In <i>Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)</i> (pp. 175--186). <a href=\"https://doi.org/10.1007/978-3-319-15612-5_16\">https://doi.org/10.1007/978-3-319-15612-5_16</a>","short":"T.F. Strothmann, in: Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186.","chicago":"Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed Locally Self-Adjusting Binary Search Trees.” In <i>Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)</i>, 175--186. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-319-15612-5_16\">https://doi.org/10.1007/978-3-319-15612-5_16</a>.","mla":"Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed Locally Self-Adjusting Binary Search Trees.” <i>Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)</i>, 2015, pp. 175--186, doi:<a href=\"https://doi.org/10.1007/978-3-319-15612-5_16\">10.1007/978-3-319-15612-5_16</a>.","bibtex":"@inproceedings{Strothmann_2015, series={LNCS}, title={The impact of communication patterns on distributed locally self-adjusting binary search trees}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-15612-5_16\">10.1007/978-3-319-15612-5_16</a>}, booktitle={Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)}, author={Strothmann, Thim Frederik}, year={2015}, pages={175--186}, collection={LNCS} }","ama":"Strothmann TF. The impact of communication patterns on distributed locally self-adjusting binary search trees. In: <i>Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)</i>. LNCS. ; 2015:175--186. doi:<a href=\"https://doi.org/10.1007/978-3-319-15612-5_16\">10.1007/978-3-319-15612-5_16</a>"},"file_date_updated":"2018-03-21T09:59:00Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"243","page":"175--186","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:39Z","file":[{"file_id":"1495","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T09:59:00Z","file_name":"243-Strothmann-Walcom2015.pdf","file_size":1003113,"access_level":"closed","date_created":"2018-03-21T09:59:00Z","creator":"florida"}],"department":[{"_id":"79"}],"type":"conference","publication":"Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)","abstract":[{"lang":"eng","text":"This paper introduces the problem of communication pattern adaption for a distributed self-adjusting binary search tree. We propose a simple local algorithm, which is closely related to the nearly thirty-year-old idea of splay trees and evaluate its adaption performance in the distributed scenario if different communication patterns are provided.To do so, the process of self-adjustment is modeled similarly to a basic network creation game, in which the nodes want to communicate with only a certain subset of all nodes. We show that, in general, the game (i.e., the process of local adjustments) does not converge, and convergence is related to certain structures of the communication interests, which we call conflicts.We classify conflicts and show that for two communication scenarios in which convergence is guaranteed, the self-adjusting tree performs well.Furthermore, we investigate the different classes of conflicts separately and show that, for a certain class of conflicts, the performance of the tree network is asymptotically as good as the performance for converging instances. However, for the other conflict classes, a distributed self-adjusting binary search tree adapts poorly."}],"series_title":"LNCS","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-15612-5_16","author":[{"last_name":"Strothmann","first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik","id":"11319"}],"year":"2015","title":"The impact of communication patterns on distributed locally self-adjusting binary search trees","date_updated":"2022-01-06T06:56:17Z"},{"citation":{"ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A deterministic worst-case message complexity optimal solution for resource discovery,” <i>Theoretical Computer Science</i>, pp. 67–79, 2015.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2015). A deterministic worst-case message complexity optimal solution for resource discovery. <i>Theoretical Computer Science</i>, 67–79. <a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">https://doi.org/10.1016/j.tcs.2014.11.027</a>","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” <i>Theoretical Computer Science</i>, 2015, 67–79. <a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">https://doi.org/10.1016/j.tcs.2014.11.027</a>.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theoretical Computer Science (2015) 67–79.","mla":"Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” <i>Theoretical Computer Science</i>, Elsevier, 2015, pp. 67–79, doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>.","bibtex":"@article{Kniesburges_Koutsopoulos_Scheideler_2015, title={A deterministic worst-case message complexity optimal solution for resource discovery}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2015}, pages={67–79} }","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A deterministic worst-case message complexity optimal solution for resource discovery. <i>Theoretical Computer Science</i>. 2015:67-79. doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>"},"file_date_updated":"2018-03-20T07:38:02Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publisher":"Elsevier","_id":"327","page":"67-79","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:55Z","file":[{"creator":"florida","date_created":"2018-03-20T07:38:02Z","file_name":"327-KKS15-TOCS_01.pdf","file_size":398044,"access_level":"closed","relation":"main_file","date_updated":"2018-03-20T07:38:02Z","file_id":"1427","content_type":"application/pdf","success":1}],"department":[{"_id":"79"}],"type":"journal_article","publication":"Theoretical Computer Science","abstract":[{"text":"We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the address of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)O(n)) or bits (O(nlog⁡n)O(nlog⁡n)) a node receives or sends coincides with the lower bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds.","lang":"eng"}],"doi":"10.1016/j.tcs.2014.11.027","author":[{"full_name":"Kniesburges, Sebastian","first_name":"Sebastian","last_name":"Kniesburges"},{"full_name":"Koutsopoulos, Andreas","first_name":"Andreas","last_name":"Koutsopoulos"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"title":"A deterministic worst-case message complexity optimal solution for resource discovery","year":"2015","date_updated":"2022-01-06T06:59:08Z"},{"publisher":"Universität Paderborn","_id":"304","user_id":"15504","ddc":["040"],"status":"public","title":"Dynamics and Efficiency in Topological Self-Stabilization","year":"2015","author":[{"full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos","first_name":"Andreas"}],"date_updated":"2022-01-06T06:58:53Z","has_accepted_license":"1","file":[{"file_name":"304-Dissertation_-_Koutsopoulos.pdf","access_level":"closed","file_size":2275834,"relation":"main_file","date_updated":"2018-03-20T07:46:19Z","file_id":"1441","content_type":"application/pdf","success":1,"creator":"florida","date_created":"2018-03-20T07:46:19Z"}],"date_created":"2017-10-17T12:41:51Z","type":"dissertation","department":[{"_id":"79"}],"file_date_updated":"2018-03-20T07:46:19Z","citation":{"short":"A. Koutsopoulos, Dynamics and Efficiency in Topological Self-Stabilization, Universität Paderborn, 2015.","chicago":"Koutsopoulos, Andreas. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn, 2015.","ieee":"A. Koutsopoulos, <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn, 2015.","apa":"Koutsopoulos, A. (2015). <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn.","bibtex":"@book{Koutsopoulos_2015, title={Dynamics and Efficiency in Topological Self-Stabilization}, publisher={Universität Paderborn}, author={Koutsopoulos, Andreas}, year={2015} }","ama":"Koutsopoulos A. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn; 2015.","mla":"Koutsopoulos, Andreas. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn, 2015."},"supervisor":[{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"year":"2015","title":"Distributed Data Structures and the Power of topological Self-Stabilization","status":"public","author":[{"full_name":"Kniesburges, Sebastian","first_name":"Sebastian","last_name":"Kniesburges"}],"date_updated":"2022-01-06T06:58:54Z","has_accepted_license":"1","publisher":"Universität Paderborn","_id":"305","user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-13T09:14:43Z","citation":{"ama":"Kniesburges S. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn; 2015.","bibtex":"@book{Kniesburges_2015, title={Distributed Data Structures and the Power of topological Self-Stabilization}, publisher={Universität Paderborn}, author={Kniesburges, Sebastian}, year={2015} }","mla":"Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn, 2015.","chicago":"Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn, 2015.","short":"S. Kniesburges, Distributed Data Structures and the Power of Topological Self-Stabilization, Universität Paderborn, 2015.","apa":"Kniesburges, S. (2015). <i>Distributed Data Structures and the Power of topological Self-Stabilization</i>. Universität Paderborn.","ieee":"S. Kniesburges, <i>Distributed Data Structures and the Power of topological Self-Stabilization</i>. Universität Paderborn, 2015."},"supervisor":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"file":[{"file_id":"1206","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-13T09:14:43Z","file_name":"305-Dissertation_-_Kniesburges.pdf","file_size":1709094,"access_level":"closed","date_created":"2018-03-13T09:14:43Z","creator":"florida"}],"date_created":"2017-10-17T12:41:51Z","type":"dissertation","department":[{"_id":"79"}]},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"apa":"Feldmann, M. (2015). <i>Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs</i>. Universität Paderborn.","ieee":"M. Feldmann, <i>Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs</i>. Universität Paderborn, 2015.","chicago":"Feldmann, Michael. <i>Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs</i>. Universität Paderborn, 2015.","short":"M. Feldmann, Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs, Universität Paderborn, 2015.","mla":"Feldmann, Michael. <i>Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs</i>. Universität Paderborn, 2015.","ama":"Feldmann M. <i>Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs</i>. Universität Paderborn; 2015.","bibtex":"@book{Feldmann_2015, title={Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs}, publisher={Universität Paderborn}, author={Feldmann, Michael}, year={2015} }"},"supervisor":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"type":"mastersthesis","department":[{"_id":"79"}],"date_created":"2017-10-17T12:41:46Z","date_updated":"2022-01-06T06:57:45Z","status":"public","title":"Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs","year":"2015","author":[{"full_name":"Feldmann, Michael","last_name":"Feldmann","first_name":"Michael","id":"23538"}],"user_id":"477","_id":"278","language":[{"iso":"eng"}],"publisher":"Universität Paderborn"},{"_id":"18003","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477","author":[{"full_name":"Götte, Thorsten","last_name":"Götte","first_name":"Thorsten","id":"34727"}],"title":"Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot","year":"2015","status":"public","date_updated":"2022-01-06T06:53:25Z","date_created":"2020-08-17T08:18:04Z","department":[{"_id":"79"}],"type":"bachelorsthesis","citation":{"bibtex":"@book{Götte_2015, title={Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot}, publisher={Universität Paderborn}, author={Götte, Thorsten}, year={2015} }","ama":"Götte T. <i>Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot</i>. Universität Paderborn; 2015.","mla":"Götte, Thorsten. <i>Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot</i>. Universität Paderborn, 2015.","short":"T. Götte, Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot, Universität Paderborn, 2015.","chicago":"Götte, Thorsten. <i>Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot</i>. Universität Paderborn, 2015.","ieee":"T. Götte, <i>Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot</i>. Universität Paderborn, 2015.","apa":"Götte, T. (2015). <i>Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot</i>. Universität Paderborn."},"supervisor":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}]},{"supervisor":[{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"citation":{"mla":"Isenberg, Daniel. <i>3D-Nesting in Der SLM-Technologie</i>. 2015.","apa":"Isenberg, D. (2015). <i>3D-Nesting in der SLM-Technologie</i>.","ieee":"D. Isenberg, <i>3D-Nesting in der SLM-Technologie</i>. 2015.","short":"D. Isenberg, 3D-Nesting in Der SLM-Technologie, 2015.","ama":"Isenberg D. <i>3D-Nesting in Der SLM-Technologie</i>.; 2015.","chicago":"Isenberg, Daniel. <i>3D-Nesting in Der SLM-Technologie</i>, 2015.","bibtex":"@book{Isenberg_2015, title={3D-Nesting in der SLM-Technologie}, author={Isenberg, Daniel}, year={2015} }"},"date_created":"2020-08-17T08:18:44Z","type":"bachelorsthesis","department":[{"_id":"79"}],"title":"3D-Nesting in der SLM-Technologie","status":"public","year":"2015","author":[{"last_name":"Isenberg","first_name":"Daniel","full_name":"Isenberg, Daniel"}],"date_updated":"2022-01-06T06:53:25Z","_id":"18004","language":[{"iso":"eng"}],"user_id":"15504"},{"citation":{"short":"C. Korfmacher, Implementierung Und Analyse von Cone-DHT, Universität Paderborn, 2015.","chicago":"Korfmacher, Christian. <i>Implementierung Und Analyse von Cone-DHT</i>. Universität Paderborn, 2015.","apa":"Korfmacher, C. (2015). <i>Implementierung und Analyse von Cone-DHT</i>. Universität Paderborn.","ieee":"C. Korfmacher, <i>Implementierung und Analyse von Cone-DHT</i>. Universität Paderborn, 2015.","ama":"Korfmacher C. <i>Implementierung Und Analyse von Cone-DHT</i>. Universität Paderborn; 2015.","bibtex":"@book{Korfmacher_2015, title={Implementierung und Analyse von Cone-DHT}, publisher={Universität Paderborn}, author={Korfmacher, Christian}, year={2015} }","mla":"Korfmacher, Christian. <i>Implementierung Und Analyse von Cone-DHT</i>. Universität Paderborn, 2015."},"supervisor":[{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2020-08-17T08:19:47Z","department":[{"_id":"79"}],"type":"bachelorsthesis","author":[{"full_name":"Korfmacher, Christian","last_name":"Korfmacher","first_name":"Christian"}],"title":"Implementierung und Analyse von Cone-DHT","status":"public","year":"2015","date_updated":"2022-01-06T06:53:25Z","_id":"18005","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"477"}]