[{"abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>Consider a set of jobs connected to a directed acyclic task graph with a fixed source and sink. The edges of this graph model precedence constraints and the jobs have to be scheduled with respect to those. We introduce the server cloud scheduling problem, in which the jobs have to be processed either on a single local machine or on one of infinitely many cloud machines. For each job, processing times both on the server and in the cloud are given. Furthermore, for each edge in the task graph, a communication delay is included in the input and has to be taken into account if one of the two jobs is scheduled on the server and the other in the cloud. The server processes jobs sequentially, whereas the cloud can serve as many as needed in parallel, but induces costs. We consider both makespan and cost minimization. The main results are an FPTAS for the makespan objective for graphs with a constant source and sink dividing cut and strong hardness for the case with unit processing times and delays.</jats:p>","lang":"eng"}],"status":"public","type":"journal_article","publication":"Algorithmica","keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"extern":"1","language":[{"iso":"eng"}],"project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","grant_number":"160364472"}],"_id":"50458","user_id":"44428","department":[{"_id":"63"}],"year":"2023","citation":{"ieee":"M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,” <i>Algorithmica</i>, 2023, doi: <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>.","chicago":"Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server Cloud Scheduling.” <i>Algorithmica</i>, 2023. <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">https://doi.org/10.1007/s00453-023-01189-x</a>.","ama":"Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. <i>Algorithmica</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>","bibtex":"@article{Maack_Meyer auf der Heide_Pukrop_2023, title={Server Cloud Scheduling}, DOI={<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2023} }","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).","mla":"Maack, Marten, et al. “Server Cloud Scheduling.” <i>Algorithmica</i>, Springer Science and Business Media LLC, 2023, doi:<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>.","apa":"Maack, M., Meyer auf der Heide, F., &#38; Pukrop, S. (2023). Server Cloud Scheduling. <i>Algorithmica</i>. <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">https://doi.org/10.1007/s00453-023-01189-x</a>"},"publication_status":"published","publication_identifier":{"issn":["0178-4617","1432-0541"]},"title":"Server Cloud Scheduling","doi":"10.1007/s00453-023-01189-x","publisher":"Springer Science and Business Media LLC","date_updated":"2024-01-11T11:19:33Z","author":[{"first_name":"Marten","id":"88252","full_name":"Maack, Marten","last_name":"Maack"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Simon","id":"44428","full_name":"Pukrop, Simon","last_name":"Pukrop"}],"date_created":"2024-01-11T11:10:53Z"},{"language":[{"iso":"eng"}],"_id":"50460","project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","grant_number":"160364472"}],"department":[{"_id":"63"}],"user_id":"44428","status":"public","publication":"2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","type":"conference","title":"Scheduling with Many Shared Resources","doi":"10.1109/ipdps54959.2023.00049","date_updated":"2024-01-11T11:31:11Z","publisher":"IEEE","date_created":"2024-01-11T11:30:14Z","author":[{"first_name":"Max A.","full_name":"Deppert, Max A.","last_name":"Deppert"},{"last_name":"Jansen","full_name":"Jansen, Klaus","first_name":"Klaus"},{"id":"88252","full_name":"Maack, Marten","last_name":"Maack","first_name":"Marten"},{"first_name":"Simon","last_name":"Pukrop","id":"44428","full_name":"Pukrop, Simon"},{"first_name":"Malin","last_name":"Rau","full_name":"Rau, Malin"}],"year":"2023","citation":{"apa":"Deppert, M. A., Jansen, K., Maack, M., Pukrop, S., &#38; Rau, M. (2023). Scheduling with Many Shared Resources. <i>2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. <a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">https://doi.org/10.1109/ipdps54959.2023.00049</a>","bibtex":"@inproceedings{Deppert_Jansen_Maack_Pukrop_Rau_2023, title={Scheduling with Many Shared Resources}, DOI={<a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">10.1109/ipdps54959.2023.00049</a>}, booktitle={2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Deppert, Max A. and Jansen, Klaus and Maack, Marten and Pukrop, Simon and Rau, Malin}, year={2023} }","mla":"Deppert, Max A., et al. “Scheduling with Many Shared Resources.” <i>2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, IEEE, 2023, doi:<a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">10.1109/ipdps54959.2023.00049</a>.","short":"M.A. Deppert, K. Jansen, M. Maack, S. Pukrop, M. Rau, in: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2023.","ama":"Deppert MA, Jansen K, Maack M, Pukrop S, Rau M. Scheduling with Many Shared Resources. In: <i>2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE; 2023. doi:<a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">10.1109/ipdps54959.2023.00049</a>","chicago":"Deppert, Max A., Klaus Jansen, Marten Maack, Simon Pukrop, and Malin Rau. “Scheduling with Many Shared Resources.” In <i>2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE, 2023. <a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">https://doi.org/10.1109/ipdps54959.2023.00049</a>.","ieee":"M. A. Deppert, K. Jansen, M. Maack, S. Pukrop, and M. Rau, “Scheduling with Many Shared Resources,” 2023, doi: <a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">10.1109/ipdps54959.2023.00049</a>."},"publication_status":"published"},{"user_id":"1112","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","department":[{"_id":"7"},{"_id":"78"},{"_id":"26"}],"project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","_id":"5","grant_number":"160364472"},{"name":"SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation (Subproject A3)","_id":"7","grant_number":"160364472"},{"name":"SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen (Subproject A4)","_id":"8","grant_number":"160364472"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)","grant_number":"160364472"},{"name":"SFB 901 - B2: Konfiguration und Bewertung (B02)","_id":"10","grant_number":"160364472"},{"name":"SFB 901 - B3: SFB 901 - Subproject B3","_id":"11"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1","grant_number":"160364472"},{"name":"SFB 901 - C2: SFB 901 - On-The-Fly Compute Centers I: Heterogene Ausführungsumgebungen (Subproject C2)","_id":"14","grant_number":"160364472"},{"grant_number":"160364472","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","_id":"16"},{"_id":"17","name":"SFB 901 - C5: SFB 901 - Subproject C5"},{"_id":"83","name":"SFB 901 - T1: SFB 901 -Subproject T1"},{"grant_number":"160364472","_id":"84","name":"SFB 901 - T2: SFB 901 -Subproject T2"}],"_id":"45863","alternative_title":["Collaborative Research Centre 901 (2011 – 2023)"],"file_date_updated":"2023-07-05T07:19:14Z","type":"book","status":"public","author":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801","first_name":"Claus-Jochen"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"first_name":"Henning","id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"volume":412,"oa":"1","date_updated":"2024-07-12T12:07:59Z","doi":"10.17619/UNIPB/1-1797","publication_identifier":{"unknown":["978-3-947647-31-6"]},"has_accepted_license":"1","citation":{"short":"C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim, On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023.","bibtex":"@book{Haake_Meyer auf der Heide_Platzner_Wachsmuth_Wehrheim_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, volume={412}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","mla":"Haake, Claus-Jochen, et al. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Heinz Nixdorf Institut, Universität Paderborn, 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>.","apa":"Haake, C.-J., Meyer auf der Heide, F., Platzner, M., Wachsmuth, H., &#38; Wehrheim, H. (2023). <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-1797\">https://doi.org/10.17619/UNIPB/1-1797</a>","ama":"Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Heinz Nixdorf Institut, Universität Paderborn; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>","ieee":"C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023.","chicago":"Haake, Claus-Jochen, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol. 412. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1797\">https://doi.org/10.17619/UNIPB/1-1797</a>."},"page":"247","intvolume":"       412","place":"Paderborn","language":[{"iso":"eng"}],"ddc":["000"],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":15480050,"file_name":"SFB-Buch-Final.pdf","access_level":"open_access","file_id":"45864","date_updated":"2023-07-05T07:19:14Z","creator":"ups","date_created":"2023-07-05T07:15:55Z"}],"abstract":[{"lang":"eng","text":"In the proposal for our CRC in 2011, we formulated a vision of markets for\r\nIT services that describes an approach to the provision of such services\r\nthat was novel at that time and, to a large extent, remains so today:\r\n„Our vision of on-the-fly computing is that of IT services individually and\r\nautomatically configured and brought to execution from flexibly combinable\r\nservices traded on markets. At the same time, we aim at organizing\r\nmarkets whose participants maintain a lively market of services through\r\nappropriate entrepreneurial actions.“\r\nOver the last 12 years, we have developed methods and techniques to\r\naddress problems critical to the convenient, efficient, and secure use of\r\non-the-fly computing. Among other things, we have made the description\r\nof services more convenient by allowing natural language input,\r\nincreased the quality of configured services through (natural language)\r\ninteraction and more efficient configuration processes and analysis\r\nprocedures, made the quality of (the products of) providers in the\r\nmarketplace transparent through reputation systems, and increased the\r\nresource efficiency of execution through reconfigurable heterogeneous\r\ncomputing nodes and an integrated treatment of service description and\r\nconfiguration. We have also developed network infrastructures that have\r\na high degree of adaptivity, scalability, efficiency, and reliability, and\r\nprovide cryptographic guarantees of anonymity and security for market\r\nparticipants and their products and services.\r\nTo demonstrate the pervasiveness of the OTF computing approach, we\r\nhave implemented a proof-of-concept for OTF computing that can run\r\ntypical scenarios of an OTF market. We illustrated the approach using\r\na cutting-edge application scenario – automated machine learning (AutoML).\r\nFinally, we have been pushing our work for the perpetuation of\r\nOn-The-Fly Computing beyond the SFB and sharing the expertise gained\r\nin the SFB in events with industry partners as well as transfer projects.\r\nThis work required a broad spectrum of expertise. Computer scientists\r\nand economists with research interests such as computer networks and\r\ndistributed algorithms, security and cryptography, software engineering\r\nand verification, configuration and machine learning, computer engineering\r\nand HPC, microeconomics and game theory, business informatics\r\nand management have successfully collaborated here."}],"date_created":"2023-07-05T07:16:51Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","title":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","year":"2023"},{"publication":"Operations Research Letters","type":"journal_article","status":"public","_id":"44077","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"}],"department":[{"_id":"63"}],"user_id":"88252","keyword":["Applied Mathematics","Industrial and Manufacturing Engineering","Management Science and Operations Research","Software"],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0167-6377"]},"issue":"3","year":"2023","page":"220-225","intvolume":"        51","citation":{"bibtex":"@article{Maack_2023, title={Online load balancing on uniform machines with limited migration}, volume={51}, DOI={<a href=\"https://doi.org/10.1016/j.orl.2023.02.013\">10.1016/j.orl.2023.02.013</a>}, number={3}, journal={Operations Research Letters}, publisher={Elsevier BV}, author={Maack, Marten}, year={2023}, pages={220–225} }","mla":"Maack, Marten. “Online Load Balancing on Uniform Machines with Limited Migration.” <i>Operations Research Letters</i>, vol. 51, no. 3, Elsevier BV, 2023, pp. 220–25, doi:<a href=\"https://doi.org/10.1016/j.orl.2023.02.013\">10.1016/j.orl.2023.02.013</a>.","short":"M. Maack, Operations Research Letters 51 (2023) 220–225.","apa":"Maack, M. (2023). Online load balancing on uniform machines with limited migration. <i>Operations Research Letters</i>, <i>51</i>(3), 220–225. <a href=\"https://doi.org/10.1016/j.orl.2023.02.013\">https://doi.org/10.1016/j.orl.2023.02.013</a>","ama":"Maack M. Online load balancing on uniform machines with limited migration. <i>Operations Research Letters</i>. 2023;51(3):220-225. doi:<a href=\"https://doi.org/10.1016/j.orl.2023.02.013\">10.1016/j.orl.2023.02.013</a>","chicago":"Maack, Marten. “Online Load Balancing on Uniform Machines with Limited Migration.” <i>Operations Research Letters</i> 51, no. 3 (2023): 220–25. <a href=\"https://doi.org/10.1016/j.orl.2023.02.013\">https://doi.org/10.1016/j.orl.2023.02.013</a>.","ieee":"M. Maack, “Online load balancing on uniform machines with limited migration,” <i>Operations Research Letters</i>, vol. 51, no. 3, pp. 220–225, 2023, doi: <a href=\"https://doi.org/10.1016/j.orl.2023.02.013\">10.1016/j.orl.2023.02.013</a>."},"publisher":"Elsevier BV","date_updated":"2023-04-21T07:53:42Z","volume":51,"date_created":"2023-04-20T08:59:14Z","author":[{"first_name":"Marten","last_name":"Maack","full_name":"Maack, Marten"}],"title":"Online load balancing on uniform machines with limited migration","doi":"10.1016/j.orl.2023.02.013"},{"has_accepted_license":"1","citation":{"chicago":"Karl, Holger, Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop, and Adrian Redder. “On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:183–202. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8068664\">https://doi.org/10.5281/zenodo.8068664</a>.","ieee":"H. Karl, M. Maack, F. Meyer auf der Heide, S. Pukrop, and A. Redder, “On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 183–202.","ama":"Karl H, Maack M, Meyer auf der Heide F, Pukrop S, Redder A. On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:183-202. doi:<a href=\"https://doi.org/10.5281/zenodo.8068664\">10.5281/zenodo.8068664</a>","apa":"Karl, H., Maack, M., Meyer auf der Heide, F., Pukrop, S., &#38; Redder, A. (2023). On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 183–202). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068664\">https://doi.org/10.5281/zenodo.8068664</a>","bibtex":"@inbook{Karl_Maack_Meyer auf der Heide_Pukrop_Redder_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8068664\">10.5281/zenodo.8068664</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Karl, Holger and Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon and Redder, Adrian}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={183–202}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","mla":"Karl, Holger, et al. “On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 183–202, doi:<a href=\"https://doi.org/10.5281/zenodo.8068664\">10.5281/zenodo.8068664</a>.","short":"H. Karl, M. Maack, F. Meyer auf der Heide, S. Pukrop, A. Redder, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 183–202."},"intvolume":"       412","page":"183-202","place":"Paderborn","author":[{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"},{"first_name":"Marten","id":"88252","full_name":"Maack, Marten","last_name":"Maack"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Pukrop, Simon","id":"44428","last_name":"Pukrop","first_name":"Simon"},{"last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","id":"52265","full_name":"Redder, Adrian","first_name":"Adrian"}],"volume":412,"date_updated":"2023-07-07T11:16:53Z","oa":"1","doi":"10.5281/zenodo.8068664","type":"book_chapter","status":"public","editor":[{"full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Marco","full_name":"Platzner, Marco","last_name":"Platzner"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"477","department":[{"_id":"7"}],"project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","grant_number":"160364472"}],"_id":"45895","file_date_updated":"2023-07-07T11:16:52Z","year":"2023","date_created":"2023-07-07T08:24:28Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","title":"On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file":[{"relation":"main_file","content_type":"application/pdf","file_size":1803186,"access_level":"open_access","file_name":"C4-Chapter-SFB-Buch-Final.pdf","file_id":"45896","date_updated":"2023-07-07T11:16:52Z","creator":"florida","date_created":"2023-07-07T08:24:20Z"}],"language":[{"iso":"eng"}],"ddc":["004"]},{"status":"public","type":"dissertation","language":[{"iso":"eng"}],"_id":"45781","project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","_id":"16","grant_number":"160364472"}],"department":[{"_id":"63"}],"user_id":"15504","year":"2023","citation":{"bibtex":"@book{Pukrop_2023, title={On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1768 \">10.17619/UNIPB/1-1768 </a>}, author={Pukrop, Simon}, year={2023} }","short":"S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling, 2023.","mla":"Pukrop, Simon. <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>. 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1768 \">10.17619/UNIPB/1-1768 </a>.","apa":"Pukrop, S. (2023). <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1768 \">https://doi.org/10.17619/UNIPB/1-1768 </a>","ama":"Pukrop S. <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>.; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1768 \">10.17619/UNIPB/1-1768 </a>","chicago":"Pukrop, Simon. <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1768 \">https://doi.org/10.17619/UNIPB/1-1768 </a>.","ieee":"S. Pukrop, <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>. 2023."},"title":"On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling","doi":"10.17619/UNIPB/1-1768 ","date_updated":"2023-07-14T09:27:44Z","date_created":"2023-06-27T05:24:19Z","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"author":[{"full_name":"Pukrop, Simon","id":"44428","last_name":"Pukrop","first_name":"Simon"}]},{"doi":"10.17619/UNIPB/1-1276 ","title":"Network and Service Coordination: Conventional and Machine Learning Approaches\"","date_created":"2022-01-31T07:08:47Z","author":[{"orcid":"0000-0001-8210-4011","last_name":"Schneider","id":"35343","full_name":"Schneider, Stefan Balthasar","first_name":"Stefan Balthasar"}],"supervisor":[{"full_name":"Holger, Karl","last_name":"Holger","first_name":"Karl"}],"date_updated":"2022-02-18T08:17:36Z","citation":{"chicago":"Schneider, Stefan Balthasar. <i>Network and Service Coordination: Conventional and Machine Learning Approaches\"</i>, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1276 \">https://doi.org/10.17619/UNIPB/1-1276 </a>.","ieee":"S. B. Schneider, <i>Network and Service Coordination: Conventional and Machine Learning Approaches\"</i>. 2022.","ama":"Schneider SB. <i>Network and Service Coordination: Conventional and Machine Learning Approaches\"</i>.; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1276 \">10.17619/UNIPB/1-1276 </a>","apa":"Schneider, S. B. (2022). <i>Network and Service Coordination: Conventional and Machine Learning Approaches\"</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1276 \">https://doi.org/10.17619/UNIPB/1-1276 </a>","mla":"Schneider, Stefan Balthasar. <i>Network and Service Coordination: Conventional and Machine Learning Approaches\"</i>. 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1276 \">10.17619/UNIPB/1-1276 </a>.","bibtex":"@book{Schneider_2022, title={Network and Service Coordination: Conventional and Machine Learning Approaches\"}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1276 \">10.17619/UNIPB/1-1276 </a>}, author={Schneider, Stefan Balthasar}, year={2022} }","short":"S.B. Schneider, Network and Service Coordination: Conventional and Machine Learning Approaches\", 2022."},"year":"2022","language":[{"iso":"eng"}],"department":[{"_id":"75"}],"user_id":"15504","_id":"29672","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"}],"status":"public","type":"dissertation"},{"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"}],"_id":"30236","user_id":"35343","department":[{"_id":"75"}],"file_date_updated":"2022-03-10T18:25:41Z","type":"conference","status":"public","date_updated":"2022-03-10T18:28:19Z","oa":"1","author":[{"first_name":"Stefan Balthasar","last_name":"Schneider","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","id":"35343"},{"first_name":"Stefan","full_name":"Werner, Stefan","last_name":"Werner"},{"first_name":"Ramin","full_name":"Khalili, Ramin","last_name":"Khalili"},{"last_name":"Hecker","full_name":"Hecker, Artur","first_name":"Artur"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"conference":{"start_date":"2022-04-25","name":"IEEE/IFIP Network Operations and Management Symposium (NOMS)","location":"Budapest","end_date":"2022-04-29"},"has_accepted_license":"1","citation":{"apa":"Schneider, S. B., Werner, S., Khalili, R., Hecker, A., &#38; Karl, H. (2022). mobile-env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks. <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE/IFIP Network Operations and Management Symposium (NOMS), Budapest.","short":"S.B. Schneider, S. Werner, R. Khalili, A. Hecker, H. Karl, in: IEEE/IFIP Network Operations and Management Symposium (NOMS), IEEE, 2022.","mla":"Schneider, Stefan Balthasar, et al. “Mobile-Env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks.” <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>, IEEE, 2022.","bibtex":"@inproceedings{Schneider_Werner_Khalili_Hecker_Karl_2022, title={mobile-env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks}, booktitle={IEEE/IFIP Network Operations and Management Symposium (NOMS)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Werner, Stefan and Khalili, Ramin and Hecker, Artur and Karl, Holger}, year={2022} }","ama":"Schneider SB, Werner S, Khalili R, Hecker A, Karl H. mobile-env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks. In: <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE; 2022.","chicago":"Schneider, Stefan Balthasar, Stefan Werner, Ramin Khalili, Artur Hecker, and Holger Karl. “Mobile-Env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks.” In <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE, 2022.","ieee":"S. B. Schneider, S. Werner, R. Khalili, A. Hecker, and H. Karl, “mobile-env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks,” presented at the IEEE/IFIP Network Operations and Management Symposium (NOMS), Budapest, 2022."},"ddc":["004"],"keyword":["wireless mobile networks","network management","continuous control","cognitive networks","autonomous coordination","reinforcement learning","gym environment","simulation","open source"],"language":[{"iso":"eng"}],"publication":"IEEE/IFIP Network Operations and Management Symposium (NOMS)","abstract":[{"lang":"eng","text":"Recent reinforcement learning approaches for continuous control in wireless mobile networks have shown impressive\r\nresults. But due to the lack of open and compatible simulators, authors typically create their own simulation environments for training and evaluation. This is cumbersome and time-consuming for authors and limits reproducibility and comparability, ultimately impeding progress in the field.\r\n\r\nTo this end, we propose mobile-env, a simple and open platform for training, evaluating, and comparing reinforcement learning and conventional approaches for continuous control in mobile wireless networks. mobile-env is lightweight and implements the common OpenAI Gym interface and additional wrappers, which allows connecting virtually any single-agent or multi-agent reinforcement learning framework to the environment. While mobile-env provides sensible default values and can be used out of the box, it also has many configuration options and is easy to extend. We therefore believe mobile-env to be a valuable platform for driving meaningful progress in autonomous coordination of\r\nwireless mobile networks."}],"file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"30237","file_name":"author_version.pdf","file_size":223412,"date_created":"2022-03-10T18:25:41Z","creator":"stschn","date_updated":"2022-03-10T18:25:41Z"}],"publisher":"IEEE","date_created":"2022-03-10T18:28:14Z","title":"mobile-env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks","quality_controlled":"1","year":"2022"},{"status":"public","editor":[{"first_name":"Petra","last_name":"Berenbrink","full_name":"Berenbrink, Petra"},{"first_name":"Benjamin","full_name":"Monmege, Benjamin","last_name":"Monmege"}],"type":"conference","publication":"39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)","language":[{"iso":"eng"}],"series_title":"LIPIcs","user_id":"88252","department":[{"_id":"63"}],"project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"_id":"33085","citation":{"apa":"Epstein, L., Lassota, A., Levin, A., Maack, M., &#38; Rohwedder, L. (2022). Cardinality Constrained Scheduling in Online Models. In P. Berenbrink &#38; B. Monmege (Eds.), <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i> (Vol. 219, p. 28:1–28:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">https://doi.org/10.4230/LIPIcs.STACS.2022.28</a>","short":"L. Epstein, A. Lassota, A. Levin, M. Maack, L. Rohwedder, in: P. Berenbrink, B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15.","bibtex":"@inproceedings{Epstein_Lassota_Levin_Maack_Rohwedder_2022, series={LIPIcs}, title={Cardinality Constrained Scheduling in Online Models}, volume={219}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>}, booktitle={39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Epstein, Leah and Lassota, Alexandra and Levin, Asaf and Maack, Marten and Rohwedder, Lars}, editor={Berenbrink, Petra and Monmege, Benjamin}, year={2022}, pages={28:1–28:15}, collection={LIPIcs} }","mla":"Epstein, Leah, et al. “Cardinality Constrained Scheduling in Online Models.” <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>, edited by Petra Berenbrink and Benjamin Monmege, vol. 219, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>.","ama":"Epstein L, Lassota A, Levin A, Maack M, Rohwedder L. Cardinality Constrained Scheduling in Online Models. In: Berenbrink P, Monmege B, eds. <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>. Vol 219. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:28:1–28:15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>","chicago":"Epstein, Leah, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder. “Cardinality Constrained Scheduling in Online Models.” In <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>, edited by Petra Berenbrink and Benjamin Monmege, 219:28:1–28:15. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">https://doi.org/10.4230/LIPIcs.STACS.2022.28</a>.","ieee":"L. Epstein, A. Lassota, A. Levin, M. Maack, and L. Rohwedder, “Cardinality Constrained Scheduling in Online Models,” in <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>, 2022, vol. 219, p. 28:1–28:15, doi: <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>."},"page":"28:1–28:15","intvolume":"       219","year":"2022","doi":"10.4230/LIPIcs.STACS.2022.28","title":"Cardinality Constrained Scheduling in Online Models","date_created":"2022-08-23T08:10:36Z","author":[{"full_name":"Epstein, Leah","last_name":"Epstein","first_name":"Leah"},{"first_name":"Alexandra","last_name":"Lassota","full_name":"Lassota, Alexandra"},{"first_name":"Asaf","last_name":"Levin","full_name":"Levin, Asaf"},{"last_name":"Maack","full_name":"Maack, Marten","id":"88252","first_name":"Marten"},{"first_name":"Lars","full_name":"Rohwedder, Lars","last_name":"Rohwedder"}],"volume":219,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2022-11-08T16:34:32Z"},{"ddc":["000"],"language":[{"iso":"eng"}],"project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"_id":"32811","user_id":"477","department":[{"_id":"75"}],"abstract":[{"lang":"eng","text":"The decentralized nature of multi-agent systems requires continuous data exchange to achieve global objectives. In such scenarios, Age of Information (AoI) has become an important metric of the freshness of exchanged data due to the error-proneness and delays of communication systems. Communication systems usually possess dependencies: the process describing the success or failure of communication is highly correlated when these attempts are ``close'' in some domain (e.g. in time, frequency, space or code as in wireless communication) and is, in general, non-stationary. To study AoI in such scenarios, we consider an abstract event-based AoI process $\\Delta(n)$, expressing time since the last update: If, at time $n$, a monitoring node receives a status update from a source node (event $A(n-1)$ occurs), then $\\Delta(n)$ is reset to one; otherwise, $\\Delta(n)$ grows linearly in time. This AoI process can thus be viewed as a special random walk with resets. The event process $A(n)$ may be nonstationary and we merely assume that its temporal dependencies decay sufficiently, described by $\\alpha$-mixing. We calculate moment bounds for the resulting AoI process as a function of the mixing rate of $A(n)$. Furthermore, we prove that the AoI process $\\Delta(n)$ is itself $\\alpha$-mixing from which we conclude a strong law of large numbers for $\\Delta(n)$. These results are new, since AoI processes have not been studied so far in this general strongly mixing setting. This opens up future work on renewal processes with non-independent interarrival times."}],"status":"public","type":"conference","publication":"Proceedings of the 58th Allerton Conference on Communication, Control, and Computing","title":"Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law","conference":{"name":"58th Allerton Conference on Communication, Control, and Computing"},"date_updated":"2022-11-18T09:31:19Z","author":[{"first_name":"Adrian","orcid":"https://orcid.org/0000-0001-7391-4688","last_name":"Redder","full_name":"Redder, Adrian","id":"52265"},{"full_name":"Ramaswamy, Arunselvan","id":"66937","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","first_name":"Arunselvan"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_created":"2022-08-15T09:59:17Z","year":"2022","citation":{"apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law. <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>. 58th Allerton Conference on Communication, Control, and Computing.","mla":"Redder, Adrian, et al. “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law.” <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>, 2022.","bibtex":"@inproceedings{Redder_Ramaswamy_Karl_2022, title={Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law}, booktitle={Proceedings of the 58th Allerton Conference on Communication, Control, and Computing}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","short":"A. Redder, A. Ramaswamy, H. Karl, in: Proceedings of the 58th Allerton Conference on Communication, Control, and Computing, 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law.” In <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>, 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law,” presented at the 58th Allerton Conference on Communication, Control, and Computing, 2022.","ama":"Redder A, Ramaswamy A, Karl H. Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law. In: <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>. ; 2022."},"has_accepted_license":"1"},{"type":"conference","publication":"Proceedings of the 14th International Conference on Agents and Artificial Intelligence","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2022-08-31T07:10:13Z","creator":"aredder","date_updated":"2022-08-31T07:10:13Z","file_name":"ICCART2022.pdf","file_id":"33237","access_level":"closed","file_size":298926}],"status":"public","project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"24","name":"NICCI-CN: Netzgewahre Regelung & regelungsgewahre Netze"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"_id":"30793","user_id":"477","department":[{"_id":"75"}],"ddc":["006"],"file_date_updated":"2022-08-31T07:10:13Z","language":[{"iso":"eng"}],"publication_status":"published","has_accepted_license":"1","year":"2022","citation":{"apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication. <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. <a href=\"https://doi.org/10.5220/0010845400003116\">https://doi.org/10.5220/0010845400003116</a>","mla":"Redder, Adrian, et al. “Multi-Agent Policy Gradient Algorithms for Cyber-Physical Systems with Lossy Communication.” <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>, SCITEPRESS - Science and Technology Publications, 2022, doi:<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>.","bibtex":"@inproceedings{Redder_Ramaswamy_Karl_2022, title={Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication}, DOI={<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>}, booktitle={Proceedings of the 14th International Conference on Agents and Artificial Intelligence}, publisher={SCITEPRESS - Science and Technology Publications}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","short":"A. Redder, A. Ramaswamy, H. Karl, in: Proceedings of the 14th International Conference on Agents and Artificial Intelligence, SCITEPRESS - Science and Technology Publications, 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication,” 2022, doi: <a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Multi-Agent Policy Gradient Algorithms for Cyber-Physical Systems with Lossy Communication.” In <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. SCITEPRESS - Science and Technology Publications, 2022. <a href=\"https://doi.org/10.5220/0010845400003116\">https://doi.org/10.5220/0010845400003116</a>.","ama":"Redder A, Ramaswamy A, Karl H. Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication. In: <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. SCITEPRESS - Science and Technology Publications; 2022. doi:<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>"},"date_updated":"2022-11-18T09:32:14Z","publisher":"SCITEPRESS - Science and Technology Publications","date_created":"2022-04-06T07:18:36Z","author":[{"last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","id":"52265","full_name":"Redder, Adrian","first_name":"Adrian"},{"first_name":"Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","id":"66937","full_name":"Ramaswamy, Arunselvan"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"title":"Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication","doi":"10.5220/0010845400003116"},{"title":"Distributed gradient-based optimization in the presence of dependent  aperiodic communication","date_created":"2022-04-06T06:53:38Z","author":[{"last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","full_name":"Redder, Adrian","id":"52265","first_name":"Adrian"},{"first_name":"Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy","full_name":"Ramaswamy, Arunselvan","id":"66937"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"date_updated":"2022-11-18T09:33:01Z","citation":{"ama":"Redder A, Ramaswamy A, Karl H. Distributed gradient-based optimization in the presence of dependent  aperiodic communication. <i>arXiv:220111343</i>. Published online 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Distributed gradient-based optimization in the presence of dependent  aperiodic communication,” <i>arXiv:2201.11343</i>. 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Distributed Gradient-Based Optimization in the Presence of Dependent  Aperiodic Communication.” <i>ArXiv:2201.11343</i>, 2022.","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Distributed gradient-based optimization in the presence of dependent  aperiodic communication}, journal={arXiv:2201.11343}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","mla":"Redder, Adrian, et al. “Distributed Gradient-Based Optimization in the Presence of Dependent  Aperiodic Communication.” <i>ArXiv:2201.11343</i>, 2022.","short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.11343 (2022).","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Distributed gradient-based optimization in the presence of dependent  aperiodic communication. In <i>arXiv:2201.11343</i>."},"year":"2022","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"75"}],"project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"_id":"30790","external_id":{"arxiv":["2201.11343"]},"status":"public","abstract":[{"text":"Iterative distributed optimization algorithms involve multiple agents that\r\ncommunicate with each other, over time, in order to minimize/maximize a global\r\nobjective. In the presence of unreliable communication networks, the\r\nAge-of-Information (AoI), which measures the freshness of data received, may be\r\nlarge and hence hinder algorithmic convergence. In this paper, we study the\r\nconvergence of general distributed gradient-based optimization algorithms in\r\nthe presence of communication that neither happens periodically nor at\r\nstochastically independent points in time. We show that convergence is\r\nguaranteed provided the random variables associated with the AoI processes are\r\nstochastically dominated by a random variable with finite first moment. This\r\nimproves on previous requirements of boundedness of more than the first moment.\r\nWe then introduce stochastically strongly connected (SSC) networks, a new\r\nstochastic form of strong connectedness for time-varying networks. We show: If\r\nfor any $p \\ge0$ the processes that describe the success of communication\r\nbetween agents in a SSC network are $\\alpha$-mixing with $n^{p-1}\\alpha(n)$\r\nsummable, then the associated AoI processes are stochastically dominated by a\r\nrandom variable with finite $p$-th moment. In combination with our first\r\ncontribution, this implies that distributed stochastic gradient descend\r\nconverges in the presence of AoI, if $\\alpha(n)$ is summable.","lang":"eng"}],"type":"preprint","publication":"arXiv:2201.11343"},{"language":[{"iso":"eng"}],"department":[{"_id":"75"}],"user_id":"477","_id":"30791","external_id":{"arxiv":["2201.00570"]},"project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"status":"public","abstract":[{"lang":"eng","text":"We present sufficient conditions that ensure convergence of the multi-agent\r\nDeep Deterministic Policy Gradient (DDPG) algorithm. It is an example of one of\r\nthe most popular paradigms of Deep Reinforcement Learning (DeepRL) for tackling\r\ncontinuous action spaces: the actor-critic paradigm. In the setting considered\r\nherein, each agent observes a part of the global state space in order to take\r\nlocal actions, for which it receives local rewards. For every agent, DDPG\r\ntrains a local actor (policy) and a local critic (Q-function). The analysis\r\nshows that multi-agent DDPG using neural networks to approximate the local\r\npolicies and critics converge to limits with the following properties: The\r\ncritic limits minimize the average squared Bellman loss; the actor limits\r\nparameterize a policy that maximizes the local critic's approximation of\r\n$Q_i^*$, where $i$ is the agent index. The averaging is with respect to a\r\nprobability distribution over the global state-action space. It captures the\r\nasymptotics of all local training processes. Finally, we extend the analysis to\r\na fully decentralized setting where agents communicate over a wireless network\r\nprone to delays and losses; a typical scenario in, e.g., robotic applications."}],"publication":"arXiv:2201.00570","type":"preprint","title":"Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms","date_created":"2022-04-06T06:53:52Z","author":[{"last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","full_name":"Redder, Adrian","id":"52265","first_name":"Adrian"},{"first_name":"Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","full_name":"Ramaswamy, Arunselvan","id":"66937"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"date_updated":"2022-11-18T09:33:42Z","citation":{"apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms. In <i>arXiv:2201.00570</i>.","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms}, journal={arXiv:2201.00570}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.00570 (2022).","mla":"Redder, Adrian, et al. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms.” <i>ArXiv:2201.00570</i>, 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms.” <i>ArXiv:2201.00570</i>, 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms,” <i>arXiv:2201.00570</i>. 2022.","ama":"Redder A, Ramaswamy A, Karl H. Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms. <i>arXiv:220100570</i>. Published online 2022."},"year":"2022"},{"has_accepted_license":"1","citation":{"ama":"Redder A, Ramaswamy A, Karl H. Practical Network Conditions for the Convergence of Distributed Optimization. <i>IFAC-PapersOnLine</i>. 2022;55(13):133–138.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Practical Network Conditions for the Convergence of Distributed Optimization.” <i>IFAC-PapersOnLine</i> 55, no. 13 (2022): 133–138.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Practical Network Conditions for the Convergence of Distributed Optimization,” <i>IFAC-PapersOnLine</i>, vol. 55, no. 13, pp. 133–138, 2022.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Practical Network Conditions for the Convergence of Distributed Optimization. <i>IFAC-PapersOnLine</i>, <i>55</i>(13), 133–138.","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Practical Network Conditions for the Convergence of Distributed Optimization}, volume={55}, number={13}, journal={IFAC-PapersOnLine}, publisher={Elsevier}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022}, pages={133–138} }","mla":"Redder, Adrian, et al. “Practical Network Conditions for the Convergence of Distributed Optimization.” <i>IFAC-PapersOnLine</i>, vol. 55, no. 13, Elsevier, 2022, pp. 133–138.","short":"A. Redder, A. Ramaswamy, H. Karl, IFAC-PapersOnLine 55 (2022) 133–138."},"intvolume":"        55","page":"133–138","author":[{"first_name":"Adrian","full_name":"Redder, Adrian","id":"52265","orcid":"https://orcid.org/0000-0001-7391-4688","last_name":"Redder"},{"first_name":"Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","full_name":"Ramaswamy, Arunselvan","id":"66937"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"volume":55,"date_updated":"2022-11-18T10:05:14Z","conference":{"name":"IFAC Conference on Networked Systems"},"type":"journal_article","status":"public","user_id":"477","department":[{"_id":"75"}],"project":[{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"_id":"32854","file_date_updated":"2022-08-31T07:06:30Z","issue":"13","year":"2022","date_created":"2022-08-16T09:12:55Z","publisher":"Elsevier","title":"Practical Network Conditions for the Convergence of Distributed Optimization","publication":"IFAC-PapersOnLine","file":[{"date_updated":"2022-08-31T07:06:30Z","date_created":"2022-08-31T07:06:30Z","creator":"aredder","file_size":298395,"file_name":"NecSys2022____Practical_Conditions_for_Conv.pdf","file_id":"33236","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"language":[{"iso":"eng"}],"ddc":["006"]},{"status":"public","editor":[{"full_name":"Chechik, Shiri","last_name":"Chechik","first_name":"Shiri"},{"first_name":"Gonzalo","last_name":"Navarro","full_name":"Navarro, Gonzalo"},{"first_name":"Eva","last_name":"Rotenberg","full_name":"Rotenberg, Eva"},{"first_name":"Grzegorz","last_name":"Herman","full_name":"Herman, Grzegorz"}],"type":"conference","publication":"30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany","language":[{"iso":"eng"}],"user_id":"477","series_title":"LIPIcs","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"_id":"33491","citation":{"apa":"Maack, M., Pukrop, S., &#38; Rasmussen, A. R. (2022). (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik, G. Navarro, E. Rotenberg, &#38; G. Herman (Eds.), <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i> (Vol. 244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>","bibtex":"@inproceedings{Maack_Pukrop_Rasmussen_2022, series={LIPIcs}, title={(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling}, volume={244}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>}, booktitle={30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez}, editor={Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, year={2022}, pages={77:1–77:13}, collection={LIPIcs} }","mla":"Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>.","short":"M. Maack, S. Pukrop, A.R. Rasmussen, in: S. Chechik, G. Navarro, E. Rotenberg, G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13.","ama":"Maack M, Pukrop S, Rasmussen AR. (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In: Chechik S, Navarro G, Rotenberg E, Herman G, eds. <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>. Vol 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:77:1–77:13. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>","ieee":"M. Maack, S. Pukrop, and A. R. Rasmussen, “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling,” in <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, 2022, vol. 244, p. 77:1–77:13, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>.","chicago":"Maack, Marten, Simon Pukrop, and Anna Rodriguez Rasmussen. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” In <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman, 244:77:1–77:13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>."},"intvolume":"       244","page":"77:1–77:13","year":"2022","doi":"10.4230/LIPIcs.ESA.2022.77","title":"(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling","date_created":"2022-09-27T13:06:05Z","author":[{"first_name":"Marten","id":"88252","full_name":"Maack, Marten","last_name":"Maack"},{"last_name":"Pukrop","full_name":"Pukrop, Simon","id":"44428","first_name":"Simon"},{"first_name":"Anna Rodriguez","full_name":"Rasmussen, Anna Rodriguez","last_name":"Rasmussen"}],"volume":244,"date_updated":"2022-11-18T10:14:14Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"file_date_updated":"2022-01-11T08:39:57Z","department":[{"_id":"75"}],"user_id":"35343","_id":"29220","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"}],"status":"public","type":"conference","conference":{"start_date":"2022-04-25","name":"IEEE/IFIP Network Operations and Management Symposium (NOMS)","location":"Budapest","end_date":"2022-04-29"},"author":[{"first_name":"Stefan","last_name":"Werner","full_name":"Werner, Stefan"},{"first_name":"Stefan Balthasar","last_name":"Schneider","orcid":"0000-0001-8210-4011","id":"35343","full_name":"Schneider, Stefan Balthasar"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"date_updated":"2022-01-11T08:44:04Z","oa":"1","citation":{"chicago":"Werner, Stefan, Stefan Balthasar Schneider, and Holger Karl. “Use What You Know: Network and Service Coordination Beyond Certainty.” In <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE, 2022.","ieee":"S. Werner, S. B. Schneider, and H. Karl, “Use What You Know: Network and Service Coordination Beyond Certainty,” presented at the IEEE/IFIP Network Operations and Management Symposium (NOMS), Budapest, 2022.","ama":"Werner S, Schneider SB, Karl H. Use What You Know: Network and Service Coordination Beyond Certainty. In: <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE; 2022.","bibtex":"@inproceedings{Werner_Schneider_Karl_2022, title={Use What You Know: Network and Service Coordination Beyond Certainty}, booktitle={IEEE/IFIP Network Operations and Management Symposium (NOMS)}, publisher={IEEE}, author={Werner, Stefan and Schneider, Stefan Balthasar and Karl, Holger}, year={2022} }","mla":"Werner, Stefan, et al. “Use What You Know: Network and Service Coordination Beyond Certainty.” <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>, IEEE, 2022.","short":"S. Werner, S.B. Schneider, H. Karl, in: IEEE/IFIP Network Operations and Management Symposium (NOMS), IEEE, 2022.","apa":"Werner, S., Schneider, S. B., &#38; Karl, H. (2022). Use What You Know: Network and Service Coordination Beyond Certainty. <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE/IFIP Network Operations and Management Symposium (NOMS), Budapest."},"has_accepted_license":"1","language":[{"iso":"eng"}],"keyword":["network management","service management","AI","Monte Carlo Tree Search","model-based","QoS"],"ddc":["004"],"file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2022-01-11T08:39:57Z","creator":"stschn","date_updated":"2022-01-11T08:39:57Z","file_name":"author_version.pdf","access_level":"open_access","file_id":"29222","file_size":528653}],"abstract":[{"lang":"eng","text":"Modern services often comprise several components, such as chained virtual network functions, microservices, or\r\nmachine learning functions. Providing such services requires to decide how often to instantiate each component, where to place these instances in the network, how to chain them and route traffic through them. \r\nTo overcome limitations of conventional, hardwired heuristics, deep reinforcement learning (DRL) approaches for self-learning network and service management have emerged recently. These model-free DRL approaches are more flexible but typically learn tabula rasa, i.e., disregard existing understanding of networks, services, and their coordination. \r\n\r\nInstead, we propose FutureCoord, a novel model-based AI approach that leverages existing understanding of networks and services for more efficient and effective coordination without time-intensive training. FutureCoord combines Monte Carlo Tree Search with a stochastic traffic model. This allows FutureCoord to estimate the impact of future incoming traffic and effectively optimize long-term effects, taking fluctuating demand and Quality of Service (QoS) requirements into account. Our extensive evaluation based on real-world network topologies, services, and traffic traces indicates that FutureCoord clearly outperforms state-of-the-art model-free and model-based approaches with up to 51% higher flow success ratios."}],"publication":"IEEE/IFIP Network Operations and Management Symposium (NOMS)","title":"Use What You Know: Network and Service Coordination Beyond Certainty","date_created":"2022-01-11T08:43:26Z","publisher":"IEEE","year":"2022","quality_controlled":"1"},{"title":"Server Cloud Scheduling","doi":"10.1007/978-3-030-92702-8_10","date_updated":"2022-09-27T15:03:13Z","publisher":"Springer International Publishing","date_created":"2022-02-18T09:31:54Z","author":[{"id":"88252","full_name":"Maack, Marten","last_name":"Maack","first_name":"Marten"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Pukrop","full_name":"Pukrop, Simon","id":"44428","first_name":"Simon"}],"year":"2022","place":"Cham","citation":{"chicago":"Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server Cloud Scheduling.” In <i>Approximation and Online Algorithms</i>. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">https://doi.org/10.1007/978-3-030-92702-8_10</a>.","ieee":"M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,” in <i>Approximation and Online Algorithms</i>, Cham: Springer International Publishing, 2022.","mla":"Maack, Marten, et al. “Server Cloud Scheduling.” <i>Approximation and Online Algorithms</i>, Springer International Publishing, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">10.1007/978-3-030-92702-8_10</a>.","bibtex":"@inbook{Maack_Meyer auf der Heide_Pukrop_2022, place={Cham}, title={Server Cloud Scheduling}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">10.1007/978-3-030-92702-8_10</a>}, booktitle={Approximation and Online Algorithms}, publisher={Springer International Publishing}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2022} }","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, in: Approximation and Online Algorithms, Springer International Publishing, Cham, 2022.","apa":"Maack, M., Meyer auf der Heide, F., &#38; Pukrop, S. (2022). Server Cloud Scheduling. In <i>Approximation and Online Algorithms</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">https://doi.org/10.1007/978-3-030-92702-8_10</a>","ama":"Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. In: <i>Approximation and Online Algorithms</i>. Springer International Publishing; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">10.1007/978-3-030-92702-8_10</a>"},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030927011","9783030927028"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"29872","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"}],"department":[{"_id":"63"}],"user_id":"44428","status":"public","publication":"Approximation and Online Algorithms","type":"book_chapter"},{"date_updated":"2022-01-06T06:54:20Z","publisher":"IEEE Computer Society","date_created":"2020-10-19T14:27:17Z","author":[{"id":"63288","full_name":"Hasnain, Asif","last_name":"Hasnain","first_name":"Asif"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"title":"Learning Flow Scheduling","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/9369514"}],"conference":{"name":"2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC)","start_date":"2021-01-09","end_date":"2021-01-12","location":"Las Vegas, USA"},"doi":"https://doi.org/10.1109/CCNC49032.2021.9369514","publication_status":"accepted","year":"2021","citation":{"ama":"Hasnain A, Karl H. Learning Flow Scheduling. In: <i>2021 IEEE 18th Annual Consumer Communications &#38; Networking Conference (CCNC)</i>. IEEE Computer Society. doi:<a href=\"https://doi.org/10.1109/CCNC49032.2021.9369514\">https://doi.org/10.1109/CCNC49032.2021.9369514</a>","chicago":"Hasnain, Asif, and Holger Karl. “Learning Flow Scheduling.” In <i>2021 IEEE 18th Annual Consumer Communications &#38; Networking Conference (CCNC)</i>. IEEE Computer Society, n.d. <a href=\"https://doi.org/10.1109/CCNC49032.2021.9369514\">https://doi.org/10.1109/CCNC49032.2021.9369514</a>.","ieee":"A. Hasnain and H. Karl, “Learning Flow Scheduling,” in <i>2021 IEEE 18th Annual Consumer Communications &#38; Networking Conference (CCNC)</i>, Las Vegas, USA.","bibtex":"@inproceedings{Hasnain_Karl, title={Learning Flow Scheduling}, DOI={<a href=\"https://doi.org/10.1109/CCNC49032.2021.9369514\">https://doi.org/10.1109/CCNC49032.2021.9369514</a>}, booktitle={2021 IEEE 18th Annual Consumer Communications &#38; Networking Conference (CCNC)}, publisher={IEEE Computer Society}, author={Hasnain, Asif and Karl, Holger} }","short":"A. Hasnain, H. Karl, in: 2021 IEEE 18th Annual Consumer Communications &#38; Networking Conference (CCNC), IEEE Computer Society, n.d.","mla":"Hasnain, Asif, and Holger Karl. “Learning Flow Scheduling.” <i>2021 IEEE 18th Annual Consumer Communications &#38; Networking Conference (CCNC)</i>, IEEE Computer Society, doi:<a href=\"https://doi.org/10.1109/CCNC49032.2021.9369514\">https://doi.org/10.1109/CCNC49032.2021.9369514</a>.","apa":"Hasnain, A., &#38; Karl, H. (n.d.). Learning Flow Scheduling. In <i>2021 IEEE 18th Annual Consumer Communications &#38; Networking Conference (CCNC)</i>. Las Vegas, USA: IEEE Computer Society. <a href=\"https://doi.org/10.1109/CCNC49032.2021.9369514\">https://doi.org/10.1109/CCNC49032.2021.9369514</a>"},"project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901","_id":"1"}],"_id":"20125","user_id":"63288","department":[{"_id":"75"}],"ddc":["000"],"keyword":["Flow scheduling","Deadlines","Reinforcement learning"],"language":[{"iso":"eng"}],"type":"conference","publication":"2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC)","abstract":[{"lang":"eng","text":"Datacenter applications have different resource requirements from network and developing flow scheduling heuristics for every workload is practically infeasible. In this paper, we show that deep reinforcement learning (RL) can be used to efficiently learn flow scheduling policies for different workloads without manual feature engineering. Specifically, we present LFS, which learns to optimize a high-level performance objective, e.g., maximize the number of flow admissions while meeting the deadlines. The LFS scheduler is trained through deep RL to learn a scheduling policy on continuous online flow arrivals. The evaluation results show that the trained LFS scheduler admits 1.05x more flows than the greedy flow scheduling heuristics under varying network load."}],"status":"public"},{"citation":{"apa":"Hasnain, A. (2021). <i>Automating Network Resource Allocation for Coflows with Deadlines</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1241 \">https://doi.org/10.17619/UNIPB/1-1241 </a>","bibtex":"@book{Hasnain_2021, title={Automating Network Resource Allocation for Coflows with Deadlines}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1241 \">10.17619/UNIPB/1-1241 </a>}, author={Hasnain, Asif}, year={2021} }","short":"A. Hasnain, Automating Network Resource Allocation for Coflows with Deadlines, 2021.","mla":"Hasnain, Asif. <i>Automating Network Resource Allocation for Coflows with Deadlines</i>. 2021, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1241 \">10.17619/UNIPB/1-1241 </a>.","ieee":"A. Hasnain, <i>Automating Network Resource Allocation for Coflows with Deadlines</i>. 2021.","chicago":"Hasnain, Asif. <i>Automating Network Resource Allocation for Coflows with Deadlines</i>, 2021. <a href=\"https://doi.org/10.17619/UNIPB/1-1241 \">https://doi.org/10.17619/UNIPB/1-1241 </a>.","ama":"Hasnain A. <i>Automating Network Resource Allocation for Coflows with Deadlines</i>.; 2021. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1241 \">10.17619/UNIPB/1-1241 </a>"},"year":"2021","doi":"10.17619/UNIPB/1-1241 ","title":"Automating Network Resource Allocation for Coflows with Deadlines","author":[{"last_name":"Hasnain","full_name":"Hasnain, Asif","first_name":"Asif"}],"supervisor":[{"last_name":"Karl","full_name":"Karl, Holger","first_name":"Holger"}],"date_created":"2021-11-16T13:05:12Z","date_updated":"2022-01-06T06:57:40Z","status":"public","type":"dissertation","language":[{"iso":"eng"}],"department":[{"_id":"75"}],"user_id":"15504","_id":"27503","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}]},{"abstract":[{"text":"Data-parallel applications are developed using different data programming models, e.g., MapReduce, partition/aggregate. These models represent diverse resource requirements of application in a datacenter network, which can be represented by the coflow abstraction. The conventional method of creating hand-crafted coflow heuristics for admission or scheduling for different workloads is practically infeasible. In this paper, we propose a deep reinforcement learning (DRL)-based coflow admission scheme -- LCS -- that can learn an admission policy for a higher-level performance objective, i.e., maximize successful coflow admissions, without manual feature engineering.  LCS is trained on a production trace, which has online coflow arrivals. The evaluation results show that LCS is able to learn a reasonable admission policy that admits more coflows than state-of-the-art Varys heuristic while meeting their deadlines.","lang":"eng"}],"publication":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","language":[{"iso":"eng"}],"ddc":["000"],"keyword":["Coflow scheduling","Reinforcement learning","Deadlines"],"year":"2021","title":"Learning Coflow Admissions","date_created":"2021-01-16T18:24:19Z","publisher":"IEEE Communications Society","status":"public","type":"conference","user_id":"63288","department":[{"_id":"75"}],"project":[{"name":"SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901","_id":"1"}],"_id":"21005","citation":{"bibtex":"@inproceedings{Hasnain_Karl, title={Learning Coflow Admissions}, DOI={<a href=\"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484599\">10.1109/INFOCOMWKSHPS51825.2021.9484599</a>}, booktitle={IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)}, publisher={IEEE Communications Society}, author={Hasnain, Asif and Karl, Holger} }","short":"A. Hasnain, H. Karl, in: IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), IEEE Communications Society, n.d.","mla":"Hasnain, Asif, and Holger Karl. “Learning Coflow Admissions.” <i>IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</i>, IEEE Communications Society, doi:<a href=\"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484599\">10.1109/INFOCOMWKSHPS51825.2021.9484599</a>.","apa":"Hasnain, A., &#38; Karl, H. (n.d.). Learning Coflow Admissions. In <i>IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</i>. Vancouver BC Canada: IEEE Communications Society. <a href=\"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484599\">https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484599</a>","chicago":"Hasnain, Asif, and Holger Karl. “Learning Coflow Admissions.” In <i>IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</i>. IEEE Communications Society, n.d. <a href=\"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484599\">https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484599</a>.","ieee":"A. Hasnain and H. Karl, “Learning Coflow Admissions,” in <i>IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</i>, Vancouver BC Canada.","ama":"Hasnain A, Karl H. Learning Coflow Admissions. In: <i>IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</i>. IEEE Communications Society. doi:<a href=\"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484599\">10.1109/INFOCOMWKSHPS51825.2021.9484599</a>"},"related_material":{"link":[{"relation":"confirmation","url":"https://ieeexplore.ieee.org/document/9484599"}]},"publication_status":"accepted","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/9484599"}],"doi":"10.1109/INFOCOMWKSHPS51825.2021.9484599","conference":{"start_date":"2021-05-10","name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications","location":"Vancouver BC Canada","end_date":"2021-05-13"},"author":[{"last_name":"Hasnain","full_name":"Hasnain, Asif","id":"63288","first_name":"Asif"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"date_updated":"2022-01-06T06:54:42Z"}]