[{"user_id":"32229","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"13652","language":[{"iso":"eng"}],"type":"conference","publication":"33rd International Symposium on Distributed Computing (DISC 2019)","status":"public","author":[{"id":"32229","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal","first_name":"Kristian"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Struijs, Martijn","last_name":"Struijs","first_name":"Martijn"}],"date_created":"2019-10-08T11:53:38Z","date_updated":"2022-01-06T06:51:41Z","doi":"10.4230/LIPICS.DISC.2019.23","title":"Fast Distributed Algorithms for LP-Type Problems of Low Dimension","citation":{"apa":"Hinnenthal, K., Scheideler, C., &#38; Struijs, M. (2019). Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>. <a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">https://doi.org/10.4230/LIPICS.DISC.2019.23</a>","mla":"Hinnenthal, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.” <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">10.4230/LIPICS.DISC.2019.23</a>.","bibtex":"@inproceedings{Hinnenthal_Scheideler_Struijs_2019, title={Fast Distributed Algorithms for LP-Type Problems of Low Dimension}, DOI={<a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">10.4230/LIPICS.DISC.2019.23</a>}, booktitle={33rd International Symposium on Distributed Computing (DISC 2019)}, author={Hinnenthal, Kristian and Scheideler, Christian and Struijs, Martijn}, year={2019} }","short":"K. Hinnenthal, C. Scheideler, M. Struijs, in: 33rd International Symposium on Distributed Computing (DISC 2019), 2019.","ieee":"K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms for LP-Type Problems of Low Dimension,” in <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>, 2019.","chicago":"Hinnenthal, Kristian, Christian Scheideler, and Martijn Struijs. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.” In <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>, 2019. <a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">https://doi.org/10.4230/LIPICS.DISC.2019.23</a>.","ama":"Hinnenthal K, Scheideler C, Struijs M. Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In: <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>. ; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">10.4230/LIPICS.DISC.2019.23</a>"},"year":"2019"},{"ddc":["000"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["1711.01231"]},"abstract":[{"lang":"eng","text":"We study the classic bin packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio while repacking items sparingly between updates. Formally, each item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur a movement cost gamma * c_i, either in the worst case, or in an amortized sense, for alpha, gamma as small as possible. We call gamma the recourse of the algorithm. This is motivated by cloud storage applications, where fully-dynamic bin packing models the problem of data backup to minimize the number of disks used, as well as communication incurred in moving file backups between disks. Since the set of files changes over time, we could recompute a solution periodically from scratch, but this would give a high number of disk rewrites, incurring a high energy cost and possible wear and tear of the disks. In this work, we present optimal tradeoffs between number of bins used and number of items repacked, as well as natural extensions of the latter measure."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5227","access_level":"closed","file_name":"LIPIcs-ICALP-2018-51.pdf","file_size":723824,"date_created":"2018-10-31T16:58:18Z","creator":"feldi","date_updated":"2018-10-31T16:58:18Z"}],"publication":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","title":"Fully-Dynamic Bin Packing with Little Repacking","publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","date_created":"2018-04-24T15:21:56Z","year":"2018","file_date_updated":"2018-10-31T16:58:18Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"2484","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"14052","department":[{"_id":"541"},{"_id":"63"}],"editor":[{"first_name":"Ioannis","last_name":"Chatzigiannakis","full_name":"Chatzigiannakis, Ioannis"},{"full_name":"Kaklamanis, Christos","last_name":"Kaklamanis","first_name":"Christos"},{"first_name":"Dániel","full_name":"Marx, Dániel","last_name":"Marx"},{"first_name":"Donald","full_name":"Sannella, Donald","last_name":"Sannella"}],"status":"public","type":"conference","doi":"10.4230/LIPIcs.ICALP.2018.51","conference":{"end_date":"2018-07-13","location":"Prag","name":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","start_date":"2018-07-10"},"date_updated":"2022-01-06T06:56:39Z","author":[{"first_name":"Björn","last_name":"Feldkord","full_name":"Feldkord, Björn","id":"22704"},{"first_name":"Matthias","id":"14052","full_name":"Feldotto, Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516"},{"first_name":"Anupam","full_name":"Gupta, Anupam","last_name":"Gupta"},{"full_name":"Guruganesh, Guru","last_name":"Guruganesh","first_name":"Guru"},{"first_name":"Amit ","last_name":"Kumar","full_name":"Kumar, Amit "},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"},{"last_name":"Wajc","full_name":"Wajc, David","first_name":"David"}],"volume":107,"place":"Dagstuhl, Germany","citation":{"apa":"Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers, S., &#38; Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, &#38; D. Sannella (Eds.), <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i> (Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">https://doi.org/10.4230/LIPIcs.ICALP.2018.51</a>","mla":"Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.” <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>, edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 51:1-51:24, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">10.4230/LIPIcs.ICALP.2018.51</a>.","bibtex":"@inproceedings{Feldkord_Feldotto_Gupta_Guruganesh_Kumar_Riechers_Wajc_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fully-Dynamic Bin Packing with Little Repacking}, volume={107}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">10.4230/LIPIcs.ICALP.2018.51</a>}, booktitle={45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh, Guru and Kumar, Amit  and Riechers, Sören and Wajc, David}, editor={Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, DonaldEditors}, year={2018}, pages={51:1-51:24}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","short":"B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers, D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp. 51:1-51:24.","chicago":"Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit  Kumar, Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.” In <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>, edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">https://doi.org/10.4230/LIPIcs.ICALP.2018.51</a>.","ieee":"B. Feldkord <i>et al.</i>, “Fully-Dynamic Bin Packing with Little Repacking,” in <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>, Prag, 2018, vol. 107, pp. 51:1-51:24.","ama":"Feldkord B, Feldotto M, Gupta A, et al. Fully-Dynamic Bin Packing with Little Repacking. In: Chatzigiannakis I, Kaklamanis C, Marx D, Sannella D, eds. <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>. Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">10.4230/LIPIcs.ICALP.2018.51</a>"},"page":"51:1-51:24","intvolume":"       107","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-076-7"]}},{"file_date_updated":"2018-11-02T14:42:33Z","user_id":"477","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"2485","status":"public","type":"conference","doi":"10.1145/3210377.3210389","conference":{"location":"Wien","name":"SPAA'18"},"author":[{"first_name":"Björn","last_name":"Feldkord","full_name":"Feldkord, Björn","id":"22704"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:56:39Z","citation":{"chicago":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.” In <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 373–81. ACM, 2018. <a href=\"https://doi.org/10.1145/3210377.3210389\">https://doi.org/10.1145/3210377.3210389</a>.","ieee":"B. Feldkord and F. Meyer auf der Heide, “Online Facility Location with Mobile Facilities,” in <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien, 2018, pp. 373–381.","ama":"Feldkord B, Meyer auf der Heide F. Online Facility Location with Mobile Facilities. In: <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM; 2018:373-381. doi:<a href=\"https://doi.org/10.1145/3210377.3210389\">10.1145/3210377.3210389</a>","bibtex":"@inproceedings{Feldkord_Meyer auf der Heide_2018, title={Online Facility Location with Mobile Facilities}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210389\">10.1145/3210377.3210389</a>}, booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm}, year={2018}, pages={373–381} }","mla":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.” <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM, 2018, pp. 373–81, doi:<a href=\"https://doi.org/10.1145/3210377.3210389\">10.1145/3210377.3210389</a>.","short":"B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–381.","apa":"Feldkord, B., &#38; Meyer auf der Heide, F. (2018). Online Facility Location with Mobile Facilities. In <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 373–381). Wien: ACM. <a href=\"https://doi.org/10.1145/3210377.3210389\">https://doi.org/10.1145/3210377.3210389</a>"},"page":"373 - 381 ","publication_status":"published","has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["000"],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1207546,"file_id":"5280","access_level":"closed","file_name":"p373-feldkord.pdf","date_updated":"2018-11-02T14:42:33Z","date_created":"2018-11-02T14:42:33Z","creator":"ups"}],"publication":"Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","title":"Online Facility Location with Mobile Facilities","date_created":"2018-04-25T08:49:43Z","publisher":"ACM","year":"2018"},{"citation":{"ieee":"F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,” <i>Theory of Computing Systems</i>, 2018.","chicago":"Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide, and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” <i>Theory of Computing Systems</i>, 2018. <a href=\"https://doi.org/10.1007/s00224-017-9836-z\">https://doi.org/10.1007/s00224-017-9836-z</a>.","ama":"Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. <i>Theory of Computing Systems</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s00224-017-9836-z\">10.1007/s00224-017-9836-z</a>","apa":"Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., &#38; Schubert, M. (2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. <i>Theory of Computing Systems</i>. <a href=\"https://doi.org/10.1007/s00224-017-9836-z\">https://doi.org/10.1007/s00224-017-9836-z</a>","short":"F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory of Computing Systems (2018).","bibtex":"@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2018, title={Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks}, DOI={<a href=\"https://doi.org/10.1007/s00224-017-9836-z\">10.1007/s00224-017-9836-z</a>}, journal={Theory of Computing Systems}, publisher={Springer}, author={Abu-Khzam, Faisal N.  and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2018} }","mla":"Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” <i>Theory of Computing Systems</i>, Springer, 2018, doi:<a href=\"https://doi.org/10.1007/s00224-017-9836-z\">10.1007/s00224-017-9836-z</a>."},"year":"2018","has_accepted_license":"1","publication_identifier":{"unknown":["1432-4350"]},"doi":"10.1007/s00224-017-9836-z","title":"Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks","author":[{"first_name":"Faisal N. ","last_name":"Abu-Khzam","full_name":"Abu-Khzam, Faisal N. "},{"last_name":"Markarian","id":"37612","full_name":"Markarian, Christine","first_name":"Christine"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Schubert","full_name":"Schubert, Michael","first_name":"Michael"}],"date_created":"2018-05-24T08:39:15Z","publisher":"Springer","date_updated":"2022-01-06T06:58:06Z","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"5301","file_name":"ApproximationAndHeuristicAlgor.pdf","file_size":1371624,"creator":"ups","date_created":"2018-11-02T15:24:32Z","date_updated":"2018-11-02T15:24:32Z"}],"status":"public","type":"journal_article","publication":"Theory of Computing Systems","language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T15:24:32Z","ddc":["000"],"user_id":"477","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"2849"},{"language":[{"iso":"eng"}],"file_date_updated":"2018-11-13T13:15:19Z","ddc":["000"],"user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"2850","file":[{"file_size":554298,"access_level":"closed","file_name":"LIPIcs-FUN-2018-22.pdf","file_id":"5536","date_updated":"2018-11-13T13:15:19Z","creator":"feldi","date_created":"2018-11-13T13:15:19Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Ninth International Conference on Fun with Algorithms (FUN)","doi":"10.4230/LIPIcs.FUN.2018.22","title":"Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets","date_created":"2018-05-24T08:41:48Z","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"first_name":"Christine","id":"37612","full_name":"Markarian, Christine","last_name":"Markarian"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Mostafa","last_name":"Wahby","full_name":"Wahby, Mostafa"}],"date_updated":"2022-01-06T06:58:07Z","citation":{"ama":"Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In: <i>Ninth International Conference on Fun with Algorithms (FUN)</i>. ; 2018. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">10.4230/LIPIcs.FUN.2018.22</a>","ieee":"H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets,” in <i>Ninth International Conference on Fun with Algorithms (FUN)</i>, 2018.","chicago":"Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and Mostafa Wahby. “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” In <i>Ninth International Conference on Fun with Algorithms (FUN)</i>, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>.","bibtex":"@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">10.4230/LIPIcs.FUN.2018.22</a>}, booktitle={Ninth International Conference on Fun with Algorithms (FUN)}, author={Hamann, Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa}, year={2018} }","mla":"Hamann, Heiko, et al. “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” <i>Ninth International Conference on Fun with Algorithms (FUN)</i>, 2018, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">10.4230/LIPIcs.FUN.2018.22</a>.","short":"H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International Conference on Fun with Algorithms (FUN), 2018.","apa":"Hamann, H., Markarian, C., Meyer auf der Heide, F., &#38; Wahby, M. (2018). Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In <i>Ninth International Conference on Fun with Algorithms (FUN)</i>. <a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>"},"year":"2018","has_accepted_license":"1"},{"year":"2018","citation":{"ama":"Gmyr R. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>","ieee":"R. Gmyr, <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018.","chicago":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>.","mla":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>.","bibtex":"@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and Programmable Matter}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>}, publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }","short":"R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter, Universität Paderborn, 2018.","apa":"Gmyr, R. (2018). <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>"},"title":"Distributed Algorithms for Overlay Networks and Programmable Matter","doi":"10.17619/UNIPB/1-265","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:51:00Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"author":[{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"}],"date_created":"2018-01-31T06:04:03Z","status":"public","type":"dissertation","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"1138","user_id":"477","department":[{"_id":"79"}]},{"publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","abstract":[{"lang":"eng","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"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":239559,"file_name":"08425258.pdf","file_id":"5211","access_level":"closed","date_updated":"2018-10-31T13:25:37Z","creator":"mfeldma2","date_created":"2018-10-31T13:25:37Z"}],"external_id":{"arxiv":["1710.08128"]},"keyword":["Topological Self-stabilization","Supervised Overlay","Publish-Subscribe System"],"ddc":["040"],"language":[{"iso":"eng"}],"year":"2018","publisher":"IEEE","date_created":"2018-02-01T13:56:01Z","title":"Self-Stabilizing Supervised Publish-Subscribe Systems","type":"conference","status":"public","_id":"1163","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"}],"user_id":"11319","file_date_updated":"2018-10-31T13:25:37Z","has_accepted_license":"1","citation":{"mla":"Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.” <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>.","bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing Supervised Publish-Subscribe Systems}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>}, booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018} }","short":"M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS), IEEE, 2018.","apa":"Feldmann, M., Kolb, C., Scheideler, C., &#38; Strothmann, T. F. (2018). Self-Stabilizing Supervised Publish-Subscribe Systems. In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">https://doi.org/10.1109/IPDPS.2018.00114</a>","chicago":"Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">https://doi.org/10.1109/IPDPS.2018.00114</a>.","ieee":"M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing Supervised Publish-Subscribe Systems,” in <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.","ama":"Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised Publish-Subscribe Systems. In: <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>"},"date_updated":"2022-01-06T06:51:05Z","author":[{"first_name":"Michael","id":"23538","full_name":"Feldmann, Michael","last_name":"Feldmann"},{"last_name":"Kolb","id":"43647","full_name":"Kolb, Christina","first_name":"Christina"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319","first_name":"Thim Frederik"}],"doi":"10.1109/IPDPS.2018.00114","conference":{"location":"Vancouver","end_date":"2018-5-24","start_date":"2018-5-22","name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)"}},{"publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","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"}],"file":[{"file_size":218420,"file_id":"5212","file_name":"08425257.pdf","access_level":"closed","date_updated":"2018-10-31T13:29:26Z","creator":"mfeldma2","date_created":"2018-10-31T13:29:26Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"external_id":{"arxiv":["1802.07504"]},"ddc":["040"],"language":[{"iso":"eng"}],"year":"2018","publisher":"IEEE","date_created":"2018-02-01T14:00:36Z","title":"Skueue: A Scalable and Sequentially Consistent Distributed Queue","type":"conference","status":"public","_id":"1164","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"}],"user_id":"23538","file_date_updated":"2018-10-31T13:29:26Z","has_accepted_license":"1","citation":{"ama":"Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent Distributed Queue. In: <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>","ieee":"M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially Consistent Distributed Queue,” in <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.","chicago":"Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">https://doi.org/10.1109/IPDPS.2018.00113</a>.","apa":"Feldmann, M., Scheideler, C., &#38; Setzer, A. (2018). Skueue: A Scalable and Sequentially Consistent Distributed Queue. In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">https://doi.org/10.1109/IPDPS.2018.00113</a>","bibtex":"@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable and Sequentially Consistent Distributed Queue}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>}, booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Scheideler, Christian and Setzer, Alexander}, year={2018} }","mla":"Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>.","short":"M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS), IEEE, 2018."},"date_updated":"2022-01-06T06:51:05Z","author":[{"first_name":"Michael","last_name":"Feldmann","full_name":"Feldmann, Michael","id":"23538"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander","first_name":"Alexander"}],"conference":{"start_date":"2018-5-22","name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","location":"Vancouver","end_date":"2018-5-24"},"doi":"10.1109/IPDPS.2018.00113"},{"date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"author":[{"last_name":"N.","full_name":"N., N.","first_name":"N."}],"date_created":"2020-08-18T08:44:22Z","title":"Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten","year":"2018","citation":{"ama":"N. N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn; 2018.","ieee":"N. N., <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn, 2018.","chicago":"N., N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","apa":"N., N. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn.","mla":"N., N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","bibtex":"@book{N._2018, title={Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität Paderborn}, author={N., N.}, year={2018} }","short":"N. N., Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018."},"_id":"18030","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"user_id":"477","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"type":"bachelorsthesis","status":"public","user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"18033","language":[{"iso":"eng"}],"citation":{"short":"R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken, Universität Paderborn, 2018.","bibtex":"@book{Wulfes_2018, title={Load-Balanced Routing in Hybriden Kommunikationsnetzwerken}, publisher={Universität Paderborn}, author={Wulfes, Robin}, year={2018} }","mla":"Wulfes, Robin. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn, 2018.","apa":"Wulfes, R. (2018). <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn.","ama":"Wulfes R. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn; 2018.","chicago":"Wulfes, Robin. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn, 2018.","ieee":"R. Wulfes, <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn, 2018."},"year":"2018","date_created":"2020-08-18T08:46:50Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"author":[{"first_name":"Robin","last_name":"Wulfes","full_name":"Wulfes, Robin"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","title":"Load-Balanced Routing in Hybriden Kommunikationsnetzwerken"},{"alternative_title":["Special Issue of SIROCCO 2015"],"file_date_updated":"2019-01-11T10:20:16Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"5984","user_id":"15504","department":[{"_id":"79"}],"status":"public","type":"journal_article","doi":"10.1016/j.tcs.2018.11.004","date_updated":"2022-01-06T07:02:49Z","author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"volume":751,"citation":{"ama":"Scheideler C. Preface. <i>Theor Comput Sci</i>. 2018;751:1. doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">10.1016/j.tcs.2018.11.004</a>","ieee":"C. Scheideler, “Preface,” <i>Theor. Comput. Sci.</i>, vol. 751, p. 1, 2018.","chicago":"Scheideler, Christian. “Preface.” <i>Theor. Comput. Sci.</i> 751 (2018): 1. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">https://doi.org/10.1016/j.tcs.2018.11.004</a>.","mla":"Scheideler, Christian. “Preface.” <i>Theor. Comput. Sci.</i>, vol. 751, 2018, p. 1, doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">10.1016/j.tcs.2018.11.004</a>.","bibtex":"@article{Scheideler_2018, title={Preface}, volume={751}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">10.1016/j.tcs.2018.11.004</a>}, journal={Theor. Comput. Sci.}, author={Scheideler, Christian}, year={2018}, pages={1} }","short":"C. Scheideler, Theor. Comput. Sci. 751 (2018) 1.","apa":"Scheideler, C. (2018). Preface. <i>Theor. Comput. Sci.</i>, <i>751</i>, 1. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">https://doi.org/10.1016/j.tcs.2018.11.004</a>"},"page":"1","intvolume":"       751","has_accepted_license":"1","ddc":["040"],"language":[{"iso":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":112676,"access_level":"closed","file_name":"Preface.pdf","file_id":"6620","date_updated":"2019-01-11T10:20:16Z","creator":"florida","date_created":"2019-01-11T10:20:16Z"}],"publication":"Theor. Comput. Sci.","title":"Preface","date_created":"2018-11-30T08:08:23Z","year":"2018"},{"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","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."}],"file":[{"date_updated":"2018-11-02T14:38:37Z","date_created":"2018-11-02T14:38:37Z","creator":"ups","file_size":500005,"file_name":"ASelf-stabilizingHashedPatrici.pdf","access_level":"closed","file_id":"5277","content_type":"application/pdf","success":1,"relation":"main_file"}],"external_id":{"arxiv":["1809.04923"]},"keyword":["Self-Stabilizing","Prefix Search","Distributed Data Structure"],"ddc":["000"],"language":[{"iso":"eng"}],"year":"2018","publisher":"Springer, Cham","date_created":"2018-09-17T13:12:18Z","title":"A Self-Stabilizing Hashed Patricia Trie","type":"conference","editor":[{"last_name":"Izumi","full_name":"Izumi, Taisuke","first_name":"Taisuke"},{"full_name":"Kuznetsov, Petr","last_name":"Kuznetsov","first_name":"Petr"}],"status":"public","_id":"4411","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"63"},{"_id":"79"}],"series_title":"Lecture Notes of Computer Science","user_id":"39241","file_date_updated":"2018-11-02T14:38:37Z","has_accepted_license":"1","intvolume":"     11201","citation":{"bibtex":"@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>}, 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} }","mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>.","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.","apa":"Knollmann, T., &#38; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi &#38; P. Kuznetsov (Eds.), <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (Vol. 11201). Tokyo: Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>.","ieee":"T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, Tokyo, 2018, vol. 11201.","ama":"Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>"},"date_updated":"2022-01-06T07:01:02Z","volume":11201,"author":[{"first_name":"Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696","id":"39241","full_name":"Knollmann, Till"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"conference":{"location":"Tokyo","end_date":"2018-11-07","start_date":"2018-11-04","name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)"},"doi":"10.1007/978-3-030-03232-6_1"},{"title":"Competitive Routing in Hybrid Communication Networks","conference":{"start_date":"2018-08-23","name":"14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","location":"Helsinki","end_date":"2018-08-24"},"publisher":"Springer","date_updated":"2022-01-06T07:01:11Z","date_created":"2018-10-02T07:06:05Z","author":[{"last_name":"Jung","id":"37827","full_name":"Jung, Daniel","first_name":"Daniel"},{"first_name":"Christina","id":"43647","full_name":"Kolb, Christina","last_name":"Kolb"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"id":"38705","full_name":"Sundermeier, Jannik","last_name":"Sundermeier","first_name":"Jannik"}],"year":"2018","citation":{"chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer, 2018.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>, Helsinki, 2018.","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer; 2018.","mla":"Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>, Springer, 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.","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} }","apa":"Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Helsinki: Springer."},"has_accepted_license":"1","ddc":["000"],"keyword":["greedy routing","ad hoc networks","convex hulls","c-competitiveness"],"language":[{"iso":"eng"}],"file_date_updated":"2019-01-11T10:32:38Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"4563","user_id":"38705","department":[{"_id":"63"},{"_id":"79"}],"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"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":349034,"access_level":"closed","file_name":"23hybrid.pdf","file_id":"6621","date_updated":"2019-01-11T10:32:38Z","date_created":"2019-01-11T10:32:38Z","creator":"ups"}],"status":"public","type":"conference","publication":"Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) "},{"status":"public","file":[{"access_level":"closed","file_name":"p231-jung-1.pdf","file_id":"5254","file_size":1025077,"date_created":"2018-11-02T13:48:10Z","creator":"ups","date_updated":"2018-11-02T13:48:10Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference","ddc":["000"],"file_date_updated":"2018-11-02T13:48:10Z","language":[{"iso":"eng"}],"_id":"4565","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"63"},{"_id":"79"}],"user_id":"38705","year":"2018","citation":{"chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3210377.3210663\">https://doi.org/10.1145/3210377.3210663</a>.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien, 2018.","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>","apa":"Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. Wien: ACM Press. <a href=\"https://doi.org/10.1145/3210377.3210663\">https://doi.org/10.1145/3210377.3210663</a>","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement: Competitive Routing in Hybrid Communication Networks}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>}, 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} }","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.","mla":"Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>."},"has_accepted_license":"1","publication_identifier":{"isbn":["9781450357999"]},"publication_status":"published","title":"Brief Announcement: Competitive Routing in Hybrid Communication Networks","conference":{"location":"Wien","end_date":"2018-07-18","start_date":"2018-07-17","name":"SPAA'18"},"doi":"10.1145/3210377.3210663","publisher":"ACM Press","date_updated":"2022-01-06T07:01:12Z","date_created":"2018-10-02T07:34:47Z","author":[{"last_name":"Jung","full_name":"Jung, Daniel","id":"37827","first_name":"Daniel"},{"id":"43647","full_name":"Kolb, Christina","last_name":"Kolb","first_name":"Christina"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Sundermeier, Jannik","id":"38705","last_name":"Sundermeier","first_name":"Jannik"}]},{"doi":"10.1145/3210377.3210662","conference":{"end_date":"2018-07-18","location":"Vienna","name":"30th Symposium on Parallelism in Algorithms and Architectures","start_date":"2018-07-16"},"date_updated":"2022-01-06T07:03:40Z","author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Johannes Sebastian","full_name":"Schaefer, Johannes Sebastian","id":"30291","last_name":"Schaefer"}],"citation":{"apa":"Meyer auf der Heide, F., &#38; Schaefer, J. S. (2018). Brief Announcement: Communication in Systems of Home Based Mobile Agents. In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>. Vienna: ACM Press. <a href=\"https://doi.org/10.1145/3210377.3210662\">https://doi.org/10.1145/3210377.3210662</a>","bibtex":"@inproceedings{Meyer auf der Heide_Schaefer_2018, title={Brief Announcement: Communication in Systems of Home Based Mobile Agents}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210662\">10.1145/3210377.3210662</a>}, booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18}, publisher={ACM Press}, author={Meyer auf der Heide, Friedhelm and Schaefer, Johannes Sebastian}, year={2018} }","short":"F. Meyer auf der Heide, J.S. Schaefer, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018.","mla":"Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3210377.3210662\">10.1145/3210377.3210662</a>.","ieee":"F. Meyer auf der Heide and J. S. Schaefer, “Brief Announcement: Communication in Systems of Home Based Mobile Agents,” in <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>, Vienna, 2018.","chicago":"Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3210377.3210662\">https://doi.org/10.1145/3210377.3210662</a>.","ama":"Meyer auf der Heide F, Schaefer JS. Brief Announcement: Communication in Systems of Home Based Mobile Agents. In: <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3210377.3210662\">10.1145/3210377.3210662</a>"},"has_accepted_license":"1","publication_identifier":{"isbn":["9781450357999"]},"publication_status":"published","file_date_updated":"2019-02-06T14:18:35Z","_id":"7570","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"}],"user_id":"30291","status":"public","type":"conference","title":"Brief Announcement: Communication in Systems of Home Based Mobile Agents","publisher":"ACM Press","date_created":"2019-02-06T14:16:19Z","year":"2018","ddc":["000"],"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2019-02-06T14:18:35Z","creator":"jschaef","date_created":"2019-02-06T14:18:35Z","file_size":1504739,"file_name":"p359-meyer-auf-der-heide.pdf","access_level":"closed","file_id":"7576"}],"publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA '18"},{"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file":[{"date_updated":"2018-10-31T13:24:17Z","creator":"mfeldma2","date_created":"2018-10-31T13:24:17Z","file_size":329823,"file_name":"Feldmann2018_Chapter_Self-stabilizingOverlaysForHig.pdf","access_level":"closed","file_id":"5210","content_type":"application/pdf","success":1,"relation":"main_file"}],"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"}],"external_id":{"arxiv":["1808.10300"]},"language":[{"iso":"eng"}],"ddc":["040"],"year":"2018","date_created":"2018-09-04T14:15:39Z","publisher":"Springer, Cham","title":"Self-stabilizing Overlays for high-dimensional Monotonic Searchability","type":"conference","status":"public","department":[{"_id":"79"}],"user_id":"23538","series_title":"Lecture Notes in Computer Science","_id":"4351","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"file_date_updated":"2018-10-31T13:24:17Z","publication_identifier":{"unknown":["978-3-030-03231-9"]},"has_accepted_license":"1","page":"16-31 ","intvolume":"     11201","citation":{"apa":"Feldmann, M., Kolb, C., &#38; Scheideler, C. (2018). Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (Vol. 11201, pp. 16–31). Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">https://doi.org/10.1007/978-3-030-03232-6_2</a>","bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_2018, series={Lecture Notes in Computer Science}, title={Self-stabilizing Overlays for high-dimensional Monotonic Searchability}, volume={11201}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">10.1007/978-3-030-03232-6_2</a>}, 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} }","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.","mla":"Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, vol. 11201, Springer, Cham, 2018, pp. 16–31, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">10.1007/978-3-030-03232-6_2</a>.","chicago":"Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 11201:16–31. Lecture Notes in Computer Science. Springer, Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">https://doi.org/10.1007/978-3-030-03232-6_2</a>.","ieee":"M. Feldmann, C. Kolb, and C. Scheideler, “Self-stabilizing Overlays for high-dimensional Monotonic Searchability,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2018, vol. 11201, pp. 16–31.","ama":"Feldmann M, Kolb C, Scheideler C. Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In: <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes in Computer Science. Springer, Cham; 2018:16-31. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">10.1007/978-3-030-03232-6_2</a>"},"volume":11201,"author":[{"first_name":"Michael","last_name":"Feldmann","id":"23538","full_name":"Feldmann, Michael"},{"first_name":"Christina","id":"43647","full_name":"Kolb, Christina","last_name":"Kolb"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T07:00:58Z","doi":"10.1007/978-3-030-03232-6_2"},{"conference":{"location":"Helsinki","end_date":"2018-08-21","start_date":"2018-08-20","name":"4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)"},"doi":"10.1007/978-3-030-19759-9_4","title":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension","author":[{"first_name":"Markus","full_name":"Benter, Markus","last_name":"Benter"},{"first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer","first_name":"Alexander"},{"full_name":"Sundermeier, Jannik","id":"38705","last_name":"Sundermeier","first_name":"Jannik"}],"date_created":"2018-09-11T05:26:59Z","date_updated":"2022-01-06T07:01:00Z","citation":{"ieee":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier, “A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension,” in <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, Helsinki, 2018.","chicago":"Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>.","ama":"Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In: <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>","apa":"Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., &#38; Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. Helsinki. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>","bibtex":"@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018, title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>}, booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik}, year={2018} }","mla":"Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>.","short":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018."},"year":"2018","has_accepted_license":"1","file_date_updated":"2018-11-27T10:03:33Z","language":[{"iso":"eng"}],"keyword":["Distributed Storage","Multi-Dimensional Range Queries","Peer-to-Peer","Hilbert Curve"],"ddc":["000"],"department":[{"_id":"63"},{"_id":"79"}],"user_id":"14955","_id":"4375","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","file":[{"date_created":"2018-11-27T10:03:33Z","creator":"tillk","date_updated":"2018-11-27T10:03:33Z","file_name":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf","file_id":"5863","access_level":"closed","file_size":1122875,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"text":"We present a peer-to-peer network that supports the efficient processing of orthogonal range queries $R=\\bigtimes_{i=1}^{d}[a_i,\\,b_i]$ in a $d$-dimensional point space.\\\\\r\nThe  network is the same for each dimension, namely a distance halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe show how to execute such range queries using $\\mathcal{O}\\left(2^{d'}d\\,\\log m + d\\,|R|\\right)$ hops (and the same number of messages) in total. Here $[m]^d$ is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.\r\nFurthermore, if the peers form a distributed network, the query can be answered in $\\mathcal{O}\\left(d\\,\\log m + d\\,\\sum_{i=1}^{d}(b_i-a_i+1)\\right)$ communication rounds.\r\nOur algorithms are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers.","lang":"eng"}],"publication":"Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","type":"conference"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"5222","series_title":"Lecture Notes in Computer Science","user_id":"477","department":[{"_id":"79"}],"file_date_updated":"2018-10-31T15:59:26Z","type":"conference","status":"public","date_updated":"2022-01-06T07:01:47Z","author":[{"full_name":"Götte, Thorsten","id":"34727","last_name":"Götte","first_name":"Thorsten"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Alexander","last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander"}],"volume":11201,"conference":{"location":"Tokyo, Japan","name":" 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)"},"has_accepted_license":"1","citation":{"ama":"Götte T, Scheideler C, Setzer A. On Underlay-Aware Self-Stabilizing Overlay Networks. In: <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>. 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 <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, 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 <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, Tokyo, Japan, 2018, vol. 11201, pp. 50–64.","apa":"Götte, T., Scheideler, C., &#38; Setzer, A. (2018). On Underlay-Aware Self-Stabilizing Overlay Networks. In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i> (Vol. 11201, pp. 50–64). Tokyo, Japan: Springer.","mla":"Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, 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} }","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","intvolume":"     11201","ddc":["040"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","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"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":367812,"file_name":"sss18_camera.pdf","access_level":"closed","file_id":"5224","date_updated":"2018-10-31T15:59:26Z","creator":"thgoette","date_created":"2018-10-31T15:59:26Z"}],"publisher":"Springer","date_created":"2018-10-31T15:44:30Z","title":"On Underlay-Aware Self-Stabilizing Overlay Networks","year":"2018"},{"type":"bachelorsthesis","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"5368","user_id":"477","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"year":"2018","citation":{"apa":"Jochmaring, M. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn.","bibtex":"@book{Jochmaring_2018, title={Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität Paderborn}, author={Jochmaring, Moritz}, year={2018} }","short":"M. Jochmaring, Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.","mla":"Jochmaring, Moritz. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","chicago":"Jochmaring, Moritz. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","ieee":"M. Jochmaring, <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn, 2018.","ama":"Jochmaring M. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn; 2018."},"date_updated":"2022-01-06T07:01:50Z","publisher":"Universität Paderborn","author":[{"last_name":"Jochmaring","full_name":"Jochmaring, Moritz","first_name":"Moritz"}],"supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2018-11-06T06:21:37Z","title":"Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten"},{"citation":{"chicago":"Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","ieee":"M. Geromel, <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","ama":"Geromel M. <i>Mobile Facility Leasing</i>. Universität Paderborn; 2018.","apa":"Geromel, M. (2018). <i>Mobile Facility Leasing</i>. Universität Paderborn.","short":"M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.","mla":"Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","bibtex":"@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität Paderborn}, author={Geromel, Marcel}, year={2018} }"},"year":"2018","title":"Mobile Facility Leasing","date_created":"2018-11-07T09:20:59Z","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"author":[{"first_name":"Marcel","last_name":"Geromel","full_name":"Geromel, Marcel"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:51Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"5403"}]