[{"doi":"10.4230/LIPIcs.OPODIS.2020.31","author":[{"first_name":"Michael","id":"23538","full_name":"Feldmann, Michael","last_name":"Feldmann"},{"first_name":"Kristian","full_name":"Hinnenthal, Kristian","id":"32229","last_name":"Hinnenthal"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T06:54:36Z","citation":{"bibtex":"@inproceedings{Feldmann_Hinnenthal_Scheideler_2020, title={Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2020.31\">10.4230/LIPIcs.OPODIS.2020.31</a>}, booktitle={Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian}, year={2020} }","short":"M. Feldmann, K. Hinnenthal, C. Scheideler, in: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” <i>Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2020.31\">10.4230/LIPIcs.OPODIS.2020.31</a>.","apa":"Feldmann, M., Hinnenthal, K., &#38; Scheideler, C. (2020). Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In <i>Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2020.31\">https://doi.org/10.4230/LIPIcs.OPODIS.2020.31</a>","chicago":"Feldmann, Michael, Kristian Hinnenthal, and Christian Scheideler. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” In <i>Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2020.31\">https://doi.org/10.4230/LIPIcs.OPODIS.2020.31</a>.","ieee":"M. Feldmann, K. Hinnenthal, and C. Scheideler, “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs,” in <i>Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2020.","ama":"Feldmann M, Hinnenthal K, Scheideler C. Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In: <i>Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2020.31\">10.4230/LIPIcs.OPODIS.2020.31</a>"},"has_accepted_license":"1","file_date_updated":"2020-12-16T10:18:50Z","department":[{"_id":"79"}],"user_id":"23538","_id":"20755","project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901","_id":"1"}],"status":"public","type":"conference","title":"Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs","date_created":"2020-12-16T10:20:18Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2020","language":[{"iso":"eng"}],"ddc":["000"],"external_id":{"arxiv":["2007.01191"]},"file":[{"creator":"mfeldma2","date_created":"2020-12-16T10:18:50Z","date_updated":"2020-12-16T10:18:50Z","access_level":"closed","file_id":"20756","file_name":"Fast_Hybrid_Network_Algorithms_for_Shortest_Paths_in_Sparse_Graphs.pdf","file_size":867373,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","text":"We consider the problem of computing shortest paths in \\emph{hybrid networks}, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular network to solve tasks more efficiently. Like in this case, the different communication modes may differ considerably in range, bandwidth, and flexibility. We build upon the model of Augustine et al. [SODA '20], which captures these differences by a \\emph{local} and a \\emph{global} mode. Specifically, the local edges model a fixed communication network in which $O(1)$ messages of size $O(\\log n)$ can be sent over every edge in each synchronous round. The global edges form a clique, but nodes are only allowed to send and receive a total of at most $O(\\log n)$ messages over global edges, which restricts the nodes to use these edges only very sparsely.\r\n\r\nWe demonstrate the power of hybrid networks by presenting algorithms to compute Single-Source Shortest Paths and the diameter very efficiently in \\emph{sparse graphs}. Specifically, we present exact $O(\\log n)$ time algorithms for cactus graphs (i.e., graphs in which each edge is contained in at most one cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges and arboricity $O(\\log n)$. For these graph classes, our algorithms provide exponentially faster solutions than the best known algorithms for general graphs in this model.\r\nBeyond shortest paths, we also provide a variety of useful tools and techniques for hybrid networks, which may be of independent interest.\r\n"}],"publication":"Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)"},{"citation":{"ama":"Skowronek M. <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn; 2020.","chicago":"Skowronek, Michael. <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn, 2020.","ieee":"M. Skowronek, <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn, 2020.","mla":"Skowronek, Michael. <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn, 2020.","bibtex":"@book{Skowronek_2020, title={Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks}, publisher={Universität Paderborn}, author={Skowronek, Michael}, year={2020} }","short":"M. Skowronek, Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks, Universität Paderborn, 2020.","apa":"Skowronek, M. (2020). <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn."},"year":"2020","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2020-08-20T07:40:58Z","author":[{"first_name":"Michael","last_name":"Skowronek","full_name":"Skowronek, Michael"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","title":"Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks","type":"bachelorsthesis","status":"public","user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"18066","language":[{"iso":"eng"}]},{"title":"Algorithmen für selbststabilisierende Skip+-Delaunaygraphen","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2020-08-31T07:14:51Z","author":[{"last_name":"Guggenmos","full_name":"Guggenmos, Andreas","first_name":"Andreas"}],"date_updated":"2022-01-06T06:53:50Z","publisher":"Universität Paderborn","citation":{"ama":"Guggenmos A. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn; 2020.","ieee":"A. Guggenmos, <i>Algorithmen für selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn, 2020.","chicago":"Guggenmos, Andreas. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn, 2020.","apa":"Guggenmos, A. (2020). <i>Algorithmen für selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn.","mla":"Guggenmos, Andreas. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn, 2020.","bibtex":"@book{Guggenmos_2020, title={Algorithmen für selbststabilisierende Skip+-Delaunaygraphen}, publisher={Universität Paderborn}, author={Guggenmos, Andreas}, year={2020} }","short":"A. Guggenmos, Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen, Universität Paderborn, 2020."},"year":"2020","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"18648","status":"public","type":"bachelorsthesis"},{"date_updated":"2022-01-06T06:52:58Z","publisher":"ACM","author":[{"first_name":"Michael","last_name":"Feldmann","full_name":"Feldmann, Michael","id":"23538"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"}],"date_created":"2020-04-29T07:09:50Z","title":"Survey on Algorithms for Self-Stabilizing Overlay Networks","doi":"10.1145/3397190","year":"2020","citation":{"short":"M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020).","mla":"Feldmann, Michael, et al. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” <i>ACM Computing Surveys</i>, ACM, 2020, doi:<a href=\"https://doi.org/10.1145/3397190\">10.1145/3397190</a>.","bibtex":"@article{Feldmann_Scheideler_Schmid_2020, title={Survey on Algorithms for Self-Stabilizing Overlay Networks}, DOI={<a href=\"https://doi.org/10.1145/3397190\">10.1145/3397190</a>}, journal={ACM Computing Surveys}, publisher={ACM}, author={Feldmann, Michael and Scheideler, Christian and Schmid, Stefan}, year={2020} }","apa":"Feldmann, M., Scheideler, C., &#38; Schmid, S. (2020). Survey on Algorithms for Self-Stabilizing Overlay Networks. <i>ACM Computing Surveys</i>. <a href=\"https://doi.org/10.1145/3397190\">https://doi.org/10.1145/3397190</a>","ieee":"M. Feldmann, C. Scheideler, and S. Schmid, “Survey on Algorithms for Self-Stabilizing Overlay Networks,” <i>ACM Computing Surveys</i>, 2020.","chicago":"Feldmann, Michael, Christian Scheideler, and Stefan Schmid. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” <i>ACM Computing Surveys</i>, 2020. <a href=\"https://doi.org/10.1145/3397190\">https://doi.org/10.1145/3397190</a>.","ama":"Feldmann M, Scheideler C, Schmid S. Survey on Algorithms for Self-Stabilizing Overlay Networks. <i>ACM Computing Surveys</i>. 2020. doi:<a href=\"https://doi.org/10.1145/3397190\">10.1145/3397190</a>"},"_id":"16902","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"user_id":"23538","language":[{"iso":"eng"}],"publication":"ACM Computing Surveys","type":"journal_article","abstract":[{"lang":"eng","text":"The maintenance of efficient and robust overlay networks is one\r\nof the most fundamental and reoccurring themes in networking.\r\nThis paper presents a survey of state-of-the-art \r\nalgorithms to design and repair overlay networks in a distributed\r\nmanner. In particular, we discuss basic algorithmic primitives\r\nto preserve connectivity, review algorithms for the fundamental\r\nproblem of graph linearization, and then survey self-stabilizing\r\nalgorithms for metric and scalable topologies. \r\nWe also identify open problems and avenues for future research.\r\n"}],"status":"public"},{"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2020-01-24T08:19:38Z","date_created":"2020-01-24T08:19:38Z","creator":"florida","file_size":633652,"file_id":"15634","file_name":"DissertationFeldkord.pdf","access_level":"closed"}],"status":"public","type":"dissertation","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2020-01-24T08:19:38Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"15631","user_id":"15415","department":[{"_id":"63"}],"year":"2020","place":"Universität Paderborn","citation":{"apa":"Feldkord, B. (2020). <i>Mobile Resource Allocation</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-869\">https://doi.org/10.17619/UNIPB/1-869</a>","bibtex":"@book{Feldkord_2020, place={Universität Paderborn}, title={Mobile Resource Allocation}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-869\">10.17619/UNIPB/1-869</a>}, author={Feldkord, Björn}, year={2020} }","short":"B. Feldkord, Mobile Resource Allocation, Universität Paderborn, 2020.","mla":"Feldkord, Björn. <i>Mobile Resource Allocation</i>. 2020, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-869\">10.17619/UNIPB/1-869</a>.","ama":"Feldkord B. <i>Mobile Resource Allocation</i>. Universität Paderborn; 2020. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-869\">10.17619/UNIPB/1-869</a>","chicago":"Feldkord, Björn. <i>Mobile Resource Allocation</i>. Universität Paderborn, 2020. <a href=\"https://doi.org/10.17619/UNIPB/1-869\">https://doi.org/10.17619/UNIPB/1-869</a>.","ieee":"B. Feldkord, <i>Mobile Resource Allocation</i>. Universität Paderborn, 2020."},"has_accepted_license":"1","title":"Mobile Resource Allocation","doi":"10.17619/UNIPB/1-869","date_updated":"2022-01-06T06:52:31Z","supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"author":[{"last_name":"Feldkord","id":"22704","full_name":"Feldkord, Björn","first_name":"Björn"}],"date_created":"2020-01-23T14:20:25Z"},{"title":"On the complexity of local transformations in SDN overlays","date_updated":"2022-01-06T06:52:32Z","publisher":"Universität Paderborn","author":[{"last_name":"Warner","full_name":"Warner, Daniel","first_name":"Daniel"}],"supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2020-02-04T13:47:02Z","year":"2020","citation":{"mla":"Warner, Daniel. <i>On the Complexity of Local Transformations in SDN Overlays</i>. Universität Paderborn, 2020.","short":"D. Warner, On the Complexity of Local Transformations in SDN Overlays, Universität Paderborn, 2020.","bibtex":"@book{Warner_2020, title={On the complexity of local transformations in SDN overlays}, publisher={Universität Paderborn}, author={Warner, Daniel}, year={2020} }","apa":"Warner, D. (2020). <i>On the complexity of local transformations in SDN overlays</i>. Universität Paderborn.","ieee":"D. Warner, <i>On the complexity of local transformations in SDN overlays</i>. Universität Paderborn, 2020.","chicago":"Warner, Daniel. <i>On the Complexity of Local Transformations in SDN Overlays</i>. Universität Paderborn, 2020.","ama":"Warner D. <i>On the Complexity of Local Transformations in SDN Overlays</i>. Universität Paderborn; 2020."},"language":[{"iso":"eng"}],"_id":"15770","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"79"}],"user_id":"477","status":"public","type":"mastersthesis"},{"date_updated":"2022-01-06T06:52:16Z","publisher":"ACM","author":[{"full_name":"Castenow, Jannik","id":"38705","last_name":"Castenow","first_name":"Jannik"},{"full_name":"Kolb, Christina","id":"43647","last_name":"Kolb","first_name":"Christina"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2019-11-25T12:18:41Z","title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","conference":{"start_date":"04.01.2020","name":"21st International Conference on Distributed Computing and Networking ","location":"Kolkata, Indien","end_date":"07.01.2020"},"publication_status":"accepted","year":"2020","citation":{"ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>. ACM.","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>. ACM, n.d.","ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>, Kolkata, Indien.","apa":"Castenow, J., Kolb, C., &#38; Scheideler, C. (n.d.). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>. Kolkata, Indien: ACM.","bibtex":"@inproceedings{Castenow_Kolb_Scheideler, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)}, publisher={ACM}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian} }","short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.","mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>, ACM."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"15169","user_id":"477","department":[{"_id":"63"},{"_id":"79"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)","status":"public"},{"ddc":["004"],"language":[{"iso":"eng"}],"publication":"Business & Information Systems Engineering","file":[{"file_id":"15311","access_level":"closed","file_name":"Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf","file_size":454532,"date_created":"2019-12-12T10:24:47Z","creator":"ups","date_updated":"2019-12-12T10:24:47Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publisher":"Springer","date_created":"2019-10-10T13:41:06Z","title":"A Case for a New IT Ecosystem: On-The-Fly Computing","issue":"6","year":"2020","_id":"13770","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"82","name":"SFB 901 - Project Area T"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Subproject A2","_id":"6"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Subproject A4","_id":"8"},{"_id":"9","name":"SFB 901 - Subproject B1"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"15","name":"SFB 901 - Subproject C3"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"_id":"17","name":"SFB 901 - Subproject C5"},{"_id":"83","name":"SFB 901 -Subproject T1"},{"name":"SFB 901 -Subproject T2","_id":"84"},{"name":"SFB 901 -Subproject T3","_id":"107"},{"_id":"158","name":"SFB 901 - T4: SFB 901 -Subproject T4"}],"department":[{"_id":"276"},{"_id":"75"},{"_id":"63"},{"_id":"77"}],"user_id":"477","file_date_updated":"2019-12-12T10:24:47Z","type":"journal_article","status":"public","date_updated":"2022-12-02T09:27:17Z","volume":62,"author":[{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"},{"full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch","first_name":"Dennis"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"doi":"10.1007/s12599-019-00627-x","has_accepted_license":"1","publication_status":"published","intvolume":"        62","page":"467-481","citation":{"apa":"Karl, H., Kundisch, D., Meyer auf der Heide, F., &#38; Wehrheim, H. (2020). A Case for a New IT Ecosystem: On-The-Fly Computing. <i>Business &#38; Information Systems Engineering</i>, <i>62</i>(6), 467–481. <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">https://doi.org/10.1007/s12599-019-00627-x</a>","short":"H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business &#38; Information Systems Engineering 62 (2020) 467–481.","mla":"Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.” <i>Business &#38; Information Systems Engineering</i>, vol. 62, no. 6, Springer, 2020, pp. 467–81, doi:<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>.","bibtex":"@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>}, number={6}, journal={Business &#38; Information Systems Engineering}, publisher={Springer}, author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and Wehrheim, Heike}, year={2020}, pages={467–481} }","ama":"Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT Ecosystem: On-The-Fly Computing. <i>Business &#38; Information Systems Engineering</i>. 2020;62(6):467-481. doi:<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>","chicago":"Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” <i>Business &#38; Information Systems Engineering</i> 62, no. 6 (2020): 467–81. <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">https://doi.org/10.1007/s12599-019-00627-x</a>.","ieee":"H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for a New IT Ecosystem: On-The-Fly Computing,” <i>Business &#38; Information Systems Engineering</i>, vol. 62, no. 6, pp. 467–481, 2020, doi: <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>."}},{"type":"conference","publication":"Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)","abstract":[{"text":"Self-stabilizing overlay networks have the advantage of being able to recover from illegal states and faults. \r\nHowever, the majority of these networks cannot give any guarantees on their functionality while the recovery process is going on. \r\nWe are especially interested in searchability, i.e., the functionality that search messages for a specific node are answered successfully if a node exists in the network. \r\nIn this paper we investigate overlay networks that ensure the maintenance of monotonic searchability while the self-stabilization is going on. \r\nMore precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well.\r\nWe extend the existing research by focusing on skip graphs and present a solution for two scenarios: (i) the goal topology is a super graph of the perfect skip graph and (ii) the goal topology is exactly the perfect skip graph.\r\n","lang":"eng"}],"file":[{"creator":"thim","date_created":"2019-02-12T13:37:35Z","date_updated":"2019-02-12T13:37:35Z","access_level":"closed","file_id":"7637","file_name":"IPDPS_main.pdf","file_size":372026,"content_type":"application/pdf","relation":"main_file"}],"status":"public","project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901","_id":"1"}],"_id":"7636","user_id":"477","department":[{"_id":"66"}],"ddc":["006"],"language":[{"iso":"eng"}],"file_date_updated":"2019-02-12T13:37:35Z","has_accepted_license":"1","year":"2019","citation":{"ieee":"L. Luo, C. Scheideler, and T. F. Strothmann, “MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability,” in <i>Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19)</i>, Rio de Janeiro, Brazil, 2019.","chicago":"Luo, Linghui, Christian Scheideler, and Thim Frederik Strothmann. “MultiSkipGraph: A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” In <i>Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19)</i>, 2019.","ama":"Luo L, Scheideler C, Strothmann TF. MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability. In: <i>Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19)</i>. ; 2019.","apa":"Luo, L., Scheideler, C., &#38; Strothmann, T. F. (2019). MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability. In <i>Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19)</i>. Rio de Janeiro, Brazil.","mla":"Luo, Linghui, et al. “MultiSkipGraph: A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” <i>Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19)</i>, 2019.","bibtex":"@inproceedings{Luo_Scheideler_Strothmann_2019, title={MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability}, booktitle={Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19)}, author={Luo, Linghui and Scheideler, Christian and Strothmann, Thim Frederik}, year={2019} }","short":"L. Luo, C. Scheideler, T.F. Strothmann, in: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), 2019."},"date_updated":"2022-01-06T07:03:42Z","date_created":"2019-02-12T13:39:20Z","author":[{"last_name":"Luo","full_name":"Luo, Linghui","first_name":"Linghui"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"id":"11319","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann","first_name":"Thim Frederik"}],"title":"MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability","conference":{"end_date":"2019-05-25","location":"Rio de Janeiro, Brazil","name":"2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)","start_date":"2019-05-20"}},{"publication":"Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","abstract":[{"text":"We propose two protocols for distributed priority queues (denoted by 'heap' for simplicity in this paper) called SKEAP and SEAP. SKEAP realizes a distributed heap for a constant amount of priorities and SEAP one for an arbitrary amount. Both protocols build on an overlay, which induces an aggregation tree on which heap operations are aggregated in batches, ensuring that our protocols scale even for a high rate of incoming requests. As part of SEAP we provide a novel distributed protocol for the k-selection problem that runs in time O(log n) w.h.p. SKEAP guarantees sequential consistency for its heap operations, while SEAP guarantees serializability. SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations. \r\nSKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations with SEAP having to use only O(log n) bit messages.","lang":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1295095,"file_id":"12954","access_level":"closed","file_name":"p287-feldmann.pdf","date_updated":"2019-08-26T09:14:32Z","date_created":"2019-08-26T09:14:32Z","creator":"ups"}],"external_id":{"arxiv":["1805.03472"]},"ddc":["004"],"language":[{"iso":"eng"}],"year":"2019","publisher":"ACM","date_created":"2019-03-21T14:37:26Z","title":"Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities","type":"conference","status":"public","_id":"8534","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","file_date_updated":"2019-08-26T09:14:32Z","has_accepted_license":"1","page":"287--296","citation":{"ieee":"M. Feldmann and C. Scheideler, “Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities,” in <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2019, pp. 287--296.","chicago":"Feldmann, Michael, and Christian Scheideler. “Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.” In <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 287--296. ACM, 2019. <a href=\"https://doi.org/10.1145/3323165.3323193\">https://doi.org/10.1145/3323165.3323193</a>.","ama":"Feldmann M, Scheideler C. Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In: <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM; 2019:287--296. doi:<a href=\"https://doi.org/10.1145/3323165.3323193\">10.1145/3323165.3323193</a>","bibtex":"@inproceedings{Feldmann_Scheideler_2019, title={Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities}, DOI={<a href=\"https://doi.org/10.1145/3323165.3323193\">10.1145/3323165.3323193</a>}, booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Scheideler, Christian}, year={2019}, pages={287--296} }","short":"M. Feldmann, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296.","mla":"Feldmann, Michael, and Christian Scheideler. “Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.” <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM, 2019, pp. 287--296, doi:<a href=\"https://doi.org/10.1145/3323165.3323193\">10.1145/3323165.3323193</a>.","apa":"Feldmann, M., &#38; Scheideler, C. (2019). Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 287--296). ACM. <a href=\"https://doi.org/10.1145/3323165.3323193\">https://doi.org/10.1145/3323165.3323193</a>"},"date_updated":"2022-01-06T07:03:56Z","author":[{"id":"23538","full_name":"Feldmann, Michael","last_name":"Feldmann","first_name":"Michael"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"doi":"10.1145/3323165.3323193"},{"date_created":"2019-04-10T08:20:34Z","author":[{"full_name":"Augustine, John","last_name":"Augustine","first_name":"John"},{"last_name":"Ghaffari","full_name":"Ghaffari, Mohsen","first_name":"Mohsen"},{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"full_name":"Hinnenthal, Kristian","id":"32229","last_name":"Hinnenthal","first_name":"Kristian"},{"full_name":"Kuhn, Fabian","last_name":"Kuhn","first_name":"Fabian"},{"last_name":"Li","full_name":"Li, Jason","first_name":"Jason"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"publisher":"ACM","date_updated":"2022-01-06T07:04:04Z","doi":"10.1145/3323165.3323195","title":"Distributed Computation in Node-Capacitated Networks","has_accepted_license":"1","page":"69--79","citation":{"ama":"Augustine J, Ghaffari M, Gmyr R, et al. Distributed Computation in Node-Capacitated Networks. In: <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i>. ACM; 2019:69--79. doi:<a href=\"https://doi.org/10.1145/3323165.3323195\">10.1145/3323165.3323195</a>","ieee":"J. Augustine <i>et al.</i>, “Distributed Computation in Node-Capacitated Networks,” in <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2019, pp. 69--79.","chicago":"Augustine, John, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian Kuhn, Jason Li, and Christian Scheideler. “Distributed Computation in Node-Capacitated Networks.” In <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i>, 69--79. ACM, 2019. <a href=\"https://doi.org/10.1145/3323165.3323195\">https://doi.org/10.1145/3323165.3323195</a>.","apa":"Augustine, J., Ghaffari, M., Gmyr, R., Hinnenthal, K., Kuhn, F., Li, J., &#38; Scheideler, C. (2019). Distributed Computation in Node-Capacitated Networks. In <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i> (pp. 69--79). ACM. <a href=\"https://doi.org/10.1145/3323165.3323195\">https://doi.org/10.1145/3323165.3323195</a>","bibtex":"@inproceedings{Augustine_Ghaffari_Gmyr_Hinnenthal_Kuhn_Li_Scheideler_2019, title={Distributed Computation in Node-Capacitated Networks}, DOI={<a href=\"https://doi.org/10.1145/3323165.3323195\">10.1145/3323165.3323195</a>}, booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures}, publisher={ACM}, author={Augustine, John and Ghaffari, Mohsen and Gmyr, Robert and Hinnenthal, Kristian and Kuhn, Fabian and Li, Jason and Scheideler, Christian}, year={2019}, pages={69--79} }","mla":"Augustine, John, et al. “Distributed Computation in Node-Capacitated Networks.” <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i>, ACM, 2019, pp. 69--79, doi:<a href=\"https://doi.org/10.1145/3323165.3323195\">10.1145/3323165.3323195</a>.","short":"J. Augustine, M. Ghaffari, R. Gmyr, K. Hinnenthal, F. Kuhn, J. Li, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 69--79."},"year":"2019","department":[{"_id":"79"}],"user_id":"477","_id":"8871","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"language":[{"iso":"eng"}],"file_date_updated":"2019-08-26T11:17:58Z","ddc":["004"],"publication":"Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures","type":"conference","status":"public","file":[{"access_level":"closed","file_name":"p69-augustine.pdf","file_id":"12964","file_size":1275192,"date_created":"2019-08-26T11:17:58Z","creator":"ups","date_updated":"2019-08-26T11:17:58Z","relation":"main_file","success":1,"content_type":"application/pdf"}]},{"ddc":["004"],"keyword":["Graphs transformations","NP-hardness","approximation algorithms"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming","abstract":[{"lang":"eng","text":"We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2019-08-26T09:21:27Z","creator":"ups","date_updated":"2019-08-26T09:21:27Z","file_id":"12955","access_level":"closed","file_name":"LIPIcs-ICALP-2019-150.pdf","file_size":537649}],"publisher":"Dagstuhl Publishing","date_created":"2019-07-08T17:19:01Z","title":"On the Complexity of Local Graph Transformations","year":"2019","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"10586","series_title":"LIPIcs","user_id":"477","department":[{"_id":"79"}],"file_date_updated":"2019-08-26T09:21:27Z","type":"conference","status":"public","date_updated":"2022-01-06T06:50:45Z","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"}],"volume":132,"doi":"10.4230/LIPICS.ICALP.2019.150","conference":{"end_date":"2019-07-12","location":"Patras, Greece","name":"ICALP 2019","start_date":"2019-07-09"},"publication_status":"published","has_accepted_license":"1","citation":{"ama":"Scheideler C, Setzer A. On the Complexity of Local Graph Transformations. In: <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14. doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>","ieee":"C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.","chicago":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” In <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, 132:150:1--150:14. LIPIcs. Dagstuhl Publishing, 2019. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>.","apa":"Scheideler, C., &#38; Setzer, A. (2019). On the Complexity of Local Graph Transformations. In <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i> (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>","bibtex":"@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity of Local Graph Transformations}, volume={132}, DOI={<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>}, booktitle={Proceedings of the 46th International Colloquium on Automata, Languages, and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs} }","short":"C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.","mla":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>."},"intvolume":"       132","page":"150:1--150:14"},{"publication":"Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)","type":"conference","status":"public","department":[{"_id":"63"}],"user_id":"22704","external_id":{"arxiv":["1907.09834"]},"_id":"12870","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"language":[{"iso":"eng"}],"publication_status":"published","page":"120 - 137","citation":{"bibtex":"@inproceedings{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2019, title={Managing Multiple Mobile Resources}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">10.1007/978-3-030-39479-0_9</a>}, booktitle={Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2019}, pages={120–137} }","mla":"Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>, Springer, 2019, pp. 120–37, doi:<a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">10.1007/978-3-030-39479-0_9</a>.","short":"B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–137.","apa":"Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2019). Managing Multiple Mobile Resources. In <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i> (pp. 120–137). Springer. <a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">https://doi.org/10.1007/978-3-030-39479-0_9</a>","chicago":"Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.” In <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>, 120–37. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">https://doi.org/10.1007/978-3-030-39479-0_9</a>.","ieee":"B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” in <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>, 2019, pp. 120–137.","ama":"Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. In: <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>. Springer; 2019:120-137. doi:<a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">10.1007/978-3-030-39479-0_9</a>"},"year":"2019","author":[{"full_name":"Feldkord, Björn","id":"22704","last_name":"Feldkord","first_name":"Björn"},{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","first_name":"Manuel"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2019-07-22T09:00:05Z","publisher":"Springer","date_updated":"2022-01-06T06:51:20Z","doi":"10.1007/978-3-030-39479-0_9","title":"Managing Multiple Mobile Resources"},{"title":"Shortest Paths in a Hybrid Network Model","doi":"10.1137/1.9781611975994.78","date_updated":"2022-01-06T06:52:30Z","author":[{"last_name":"Augustine","full_name":"Augustine, John","first_name":"John"},{"first_name":"Kristian","last_name":"Hinnenthal","full_name":"Hinnenthal, Kristian","id":"32229"},{"first_name":"Fabian","last_name":"Kuhn","full_name":"Kuhn, Fabian"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"full_name":"Schneider, Philipp","last_name":"Schneider","first_name":"Philipp"}],"date_created":"2020-01-22T09:07:36Z","place":"Philadelphia, PA","year":"2019","citation":{"short":"J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, 2019, pp. 1280–1299.","bibtex":"@inproceedings{Augustine_Hinnenthal_Kuhn_Scheideler_Schneider_2019, place={Philadelphia, PA}, title={Shortest Paths in a Hybrid Network Model}, DOI={<a href=\"https://doi.org/10.1137/1.9781611975994.78\">10.1137/1.9781611975994.78</a>}, booktitle={Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms}, author={Augustine, John and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp}, year={2019}, pages={1280–1299} }","mla":"Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2019, pp. 1280–99, doi:<a href=\"https://doi.org/10.1137/1.9781611975994.78\">10.1137/1.9781611975994.78</a>.","apa":"Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., &#38; Schneider, P. (2019). Shortest Paths in a Hybrid Network Model. In <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1280–1299). Philadelphia, PA. <a href=\"https://doi.org/10.1137/1.9781611975994.78\">https://doi.org/10.1137/1.9781611975994.78</a>","chicago":"Augustine, John, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, and Philipp Schneider. “Shortest Paths in a Hybrid Network Model.” In <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1280–99. Philadelphia, PA, 2019. <a href=\"https://doi.org/10.1137/1.9781611975994.78\">https://doi.org/10.1137/1.9781611975994.78</a>.","ieee":"J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest Paths in a Hybrid Network Model,” in <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2019, pp. 1280–1299.","ama":"Augustine J, Hinnenthal K, Kuhn F, Scheideler C, Schneider P. Shortest Paths in a Hybrid Network Model. In: <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Philadelphia, PA; 2019:1280-1299. doi:<a href=\"https://doi.org/10.1137/1.9781611975994.78\">10.1137/1.9781611975994.78</a>"},"page":"1280-1299","publication_status":"published","publication_identifier":{"isbn":["9781611975994"]},"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"15627","user_id":"32229","status":"public","type":"conference","publication":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"publication_identifier":{"isbn":["978-1-4503-6184-2"]},"citation":{"ama":"Scheideler C, Berenbrink P, eds. <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3323165\">10.1145/3323165</a>","ieee":"C. Scheideler and P. Berenbrink, Eds., <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM, 2019.","chicago":"Scheideler, Christian, and Petra Berenbrink, eds. <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3323165\">https://doi.org/10.1145/3323165</a>.","bibtex":"@book{Scheideler_Berenbrink_2019, title={The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019}, DOI={<a href=\"https://doi.org/10.1145/3323165\">10.1145/3323165</a>}, publisher={ACM}, year={2019} }","mla":"Scheideler, Christian, and Petra Berenbrink, editors. <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3323165\">10.1145/3323165</a>.","short":"C. Scheideler, P. Berenbrink, eds., The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019, ACM, 2019.","apa":"Scheideler, C., &#38; Berenbrink, P. (Eds.). (2019). <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM. <a href=\"https://doi.org/10.1145/3323165\">https://doi.org/10.1145/3323165</a>"},"year":"2019","date_created":"2019-11-06T10:43:41Z","publisher":"ACM","date_updated":"2022-01-06T06:52:07Z","doi":"10.1145/3323165","title":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019","type":"conference_editor","status":"public","editor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"}],"department":[{"_id":"79"}],"user_id":"477","_id":"14829","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"language":[{"iso":"eng"}]},{"article_number":"14","file_date_updated":"2020-01-24T08:12:58Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"13873","user_id":"15504","department":[{"_id":"63"}],"status":"public","type":"journal_article","doi":"10.1145/3364204","date_updated":"2022-01-06T06:51:46Z","author":[{"last_name":"Feldkord","full_name":"Feldkord, Björn","id":"22704","first_name":"Björn"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"volume":6,"citation":{"ama":"Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. <i>ACM Transactions on Parallel Computing (TOPC)</i>. 2019;6(3). doi:<a href=\"https://doi.org/10.1145/3364204\">10.1145/3364204</a>","ieee":"B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” <i>ACM Transactions on Parallel Computing (TOPC)</i>, vol. 6, no. 3, 2019.","chicago":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” <i>ACM Transactions on Parallel Computing (TOPC)</i> 6, no. 3 (2019). <a href=\"https://doi.org/10.1145/3364204\">https://doi.org/10.1145/3364204</a>.","short":"B. Feldkord, F. Meyer auf der Heide, ACM Transactions on Parallel Computing (TOPC) 6 (2019).","mla":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” <i>ACM Transactions on Parallel Computing (TOPC)</i>, vol. 6, no. 3, 14, 2019, doi:<a href=\"https://doi.org/10.1145/3364204\">10.1145/3364204</a>.","bibtex":"@article{Feldkord_Meyer auf der Heide_2019, title={The Mobile Server Problem}, volume={6}, DOI={<a href=\"https://doi.org/10.1145/3364204\">10.1145/3364204</a>}, number={314}, journal={ACM Transactions on Parallel Computing (TOPC)}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm}, year={2019} }","apa":"Feldkord, B., &#38; Meyer auf der Heide, F. (2019). The Mobile Server Problem. <i>ACM Transactions on Parallel Computing (TOPC)</i>, <i>6</i>(3). <a href=\"https://doi.org/10.1145/3364204\">https://doi.org/10.1145/3364204</a>"},"intvolume":"         6","publication_status":"published","has_accepted_license":"1","ddc":["000"],"language":[{"iso":"eng"}],"file":[{"file_id":"15632","access_level":"closed","file_name":"DissertationFeldkord.pdf","file_size":633652,"creator":"florida","date_created":"2020-01-24T08:12:58Z","date_updated":"2020-01-24T08:12:58Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"ACM Transactions on Parallel Computing (TOPC)","title":"The Mobile Server Problem","date_created":"2019-10-16T07:06:22Z","year":"2019","issue":"3"},{"_id":"13942","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"63"}],"user_id":"477","language":[{"iso":"eng"}],"publication":"Proceedings of the 8th International Conference on Operations Research and Enterprise Systems","type":"conference","status":"public","date_updated":"2022-01-06T06:51:47Z","publisher":"SciTePress","date_created":"2019-10-21T13:42:50Z","author":[{"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"}],"title":"Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location","doi":"10.5220/0007369503150321","year":"2019","page":"315-321","citation":{"apa":"Markarian, C., &#38; Meyer auf der Heide, F. (2019). Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location. In <i>Proceedings of the 8th International Conference on Operations Research and Enterprise Systems</i> (pp. 315–321). SciTePress. <a href=\"https://doi.org/10.5220/0007369503150321\">https://doi.org/10.5220/0007369503150321</a>","mla":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” <i>Proceedings of the 8th International Conference on Operations Research and Enterprise Systems</i>, SciTePress, 2019, pp. 315–21, doi:<a href=\"https://doi.org/10.5220/0007369503150321\">10.5220/0007369503150321</a>.","short":"C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp. 315–321.","bibtex":"@inproceedings{Markarian_Meyer auf der Heide_2019, title={Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location}, DOI={<a href=\"https://doi.org/10.5220/0007369503150321\">10.5220/0007369503150321</a>}, booktitle={Proceedings of the 8th International Conference on Operations Research and Enterprise Systems}, publisher={SciTePress}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2019}, pages={315–321} }","ama":"Markarian C, Meyer auf der Heide F. Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location. In: <i>Proceedings of the 8th International Conference on Operations Research and Enterprise Systems</i>. SciTePress; 2019:315-321. doi:<a href=\"https://doi.org/10.5220/0007369503150321\">10.5220/0007369503150321</a>","ieee":"C. Markarian and F. Meyer auf der Heide, “Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location,” in <i>Proceedings of the 8th International Conference on Operations Research and Enterprise Systems</i>, 2019, pp. 315–321.","chicago":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” In <i>Proceedings of the 8th International Conference on Operations Research and Enterprise Systems</i>, 315–21. SciTePress, 2019. <a href=\"https://doi.org/10.5220/0007369503150321\">https://doi.org/10.5220/0007369503150321</a>."}},{"year":"2019","citation":{"apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2019). Efficient parallel algorithms for parameterized problems. <i>Theoretical Computer Science</i>, <i>786</i>, 2–12. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.006\">https://doi.org/10.1016/j.tcs.2018.11.006</a>","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 786 (2019) 2–12.","bibtex":"@article{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2019, title={Efficient parallel algorithms for parameterized problems}, volume={786}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2018.11.006\">10.1016/j.tcs.2018.11.006</a>}, journal={Theoretical Computer Science}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2019}, pages={2–12} }","mla":"Abu-Khzam, Faisal N., et al. “Efficient Parallel Algorithms for Parameterized Problems.” <i>Theoretical Computer Science</i>, vol. 786, 2019, pp. 2–12, doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.006\">10.1016/j.tcs.2018.11.006</a>.","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Efficient parallel algorithms for parameterized problems,” <i>Theoretical Computer Science</i>, vol. 786, pp. 2–12, 2019.","chicago":"Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “Efficient Parallel Algorithms for Parameterized Problems.” <i>Theoretical Computer Science</i> 786 (2019): 2–12. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.006\">https://doi.org/10.1016/j.tcs.2018.11.006</a>.","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. Efficient parallel algorithms for parameterized problems. <i>Theoretical Computer Science</i>. 2019;786:2-12. doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.006\">10.1016/j.tcs.2018.11.006</a>"},"intvolume":"       786","page":"2-12","date_updated":"2022-01-06T06:51:48Z","author":[{"first_name":"Faisal N.","last_name":"Abu-Khzam","full_name":"Abu-Khzam, Faisal N."},{"first_name":"Shouwei","full_name":"Li, Shouwei","last_name":"Li"},{"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"},{"full_name":"Podlipyan, Pavel","last_name":"Podlipyan","first_name":"Pavel"}],"date_created":"2019-10-21T13:57:06Z","volume":786,"title":"Efficient parallel algorithms for parameterized problems","doi":"10.1016/j.tcs.2018.11.006","type":"journal_article","publication":"Theoretical Computer Science","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"13946","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"year":"2019","citation":{"apa":"Castenow, J., Kolb, C., &#38; Scheideler, C. (2019). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i> (pp. 345–348). L’Aquila, Italy. <a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">https://doi.org/10.1007/978-3-030-24922-9\\_26</a>","bibtex":"@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">10.1007/978-3-030-24922-9\\_26</a>}, booktitle={Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian}, year={2019}, pages={345–348} }","short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348.","mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2019, pp. 345–48, doi:<a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">10.1007/978-3-030-24922-9\\_26</a>.","ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, L’Aquila, Italy, 2019, pp. 345–348.","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 345–48, 2019. <a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">https://doi.org/10.1007/978-3-030-24922-9\\_26</a>.","ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>. ; 2019:345-348. doi:<a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">10.1007/978-3-030-24922-9\\_26</a>"},"page":"345-348","title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","conference":{"end_date":"2019-07-04","location":"L'Aquila, Italy","name":"SIROCCO 2019","start_date":"2019-07-01"},"doi":"10.1007/978-3-030-24922-9\\_26","date_updated":"2022-01-06T06:52:00Z","date_created":"2019-11-04T10:09:35Z","author":[{"first_name":"Jannik","id":"38705","full_name":"Castenow, Jannik","last_name":"Castenow"},{"full_name":"Kolb, Christina","id":"43647","last_name":"Kolb","first_name":"Christina"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"status":"public","type":"conference","publication":"Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"14539","user_id":"477","department":[{"_id":"79"},{"_id":"63"}]},{"date_updated":"2022-01-06T06:51:30Z","author":[{"first_name":"Michael","full_name":"Feldmann, Michael","id":"23538","last_name":"Feldmann"},{"first_name":"Thorsten","last_name":"Götte","id":"34727","full_name":"Götte, Thorsten"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"doi":"https://doi.org/10.1007/978-3-030-34992-9_13","has_accepted_license":"1","page":"149-164","citation":{"ama":"Feldmann M, Götte T, Scheideler C. A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In: <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Lecture Notes in Computer Science. Springer, Cham; 2019:149-164. doi:<a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>","ieee":"M. Feldmann, T. Götte, and C. Scheideler, “A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory,” in <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2019, pp. 149–164.","chicago":"Feldmann, Michael, Thorsten Götte, and Christian Scheideler. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.” In <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 149–64. Lecture Notes in Computer Science. Springer, Cham, 2019. <a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>.","apa":"Feldmann, M., Götte, T., &#38; Scheideler, C. (2019). A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 149–164). Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>","short":"M. Feldmann, T. Götte, C. Scheideler, in: Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2019, pp. 149–164.","bibtex":"@inproceedings{Feldmann_Götte_Scheideler_2019, series={Lecture Notes in Computer Science}, title={A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>}, booktitle={Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Götte, Thorsten and Scheideler, Christian}, year={2019}, pages={149–164}, collection={Lecture Notes in Computer Science} }","mla":"Feldmann, Michael, et al. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.” <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, Springer, Cham, 2019, pp. 149–64, doi:<a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>."},"_id":"13182","project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901","_id":"1"}],"department":[{"_id":"79"}],"user_id":"23538","series_title":"Lecture Notes in Computer Science","file_date_updated":"2019-09-11T11:20:16Z","type":"conference","status":"public","publisher":"Springer, Cham","date_created":"2019-09-10T12:48:33Z","title":"A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory","year":"2019","external_id":{"arxiv":["1909.04544"]},"ddc":["000"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","abstract":[{"text":"We consider congestion control in peer-to-peer distributed systems. \r\nThe problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers (called \\emph{clients} in this paper) that want to send messages to a fixed common peer (called \\emph{server} in this paper).\r\nWe assume that each client $v \\in V$ sends a message with probability $p(v) \\in [0,1)$ and the server has a capacity of $\\sigma \\in \\mathbb{N}$, i.e., it can recieve at most $\\sigma$ messages per round and excess messages are dropped.\r\nThe server can modify these probabilities when clients send messages.\r\nIdeally, we wish to converge to a state with $\\sum p(v) = \\sigma$ and $p(v) = p(w)$ for all $v,w \\in V$.\t\r\n\r\nWe propose a \\emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state.   \r\nOur protocol lets the system converge from \\emph{any} initial state to a state where $\\sum p(v) \\in \\left[\\sigma \\pm \\epsilon\\right]$ and $|p(v)-p(w)| \\in O(\\frac{1}{n})$. \r\nThis property is then maintained for $\\Omega(n^{\\mathfrak{c}})$ rounds in expectation.\r\nIn particular, the initial client probabilities and server variables are not necessarily well-defined, i.e., they may have arbitrary values.\r\n\r\nOur protocol uses only $O(W + \\log n)$ bits of memory where $W$ is length of node identifiers, making it very lightweight.\r\nFinally we state a lower bound on the convergence time an see that our protocol performs asymptotically optimal (up to some polylogarithmic factor).\r\n","lang":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":428908,"file_id":"13188","access_level":"closed","file_name":"main.pdf","date_updated":"2019-09-11T11:20:16Z","creator":"mfeldma2","date_created":"2019-09-11T11:20:16Z"}]}]