---
_id: '50458'
abstract:
- lang: eng
  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>
author:
- first_name: Marten
  full_name: Maack, Marten
  id: '88252'
  last_name: Maack
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Simon
  full_name: Pukrop, Simon
  id: '44428'
  last_name: Pukrop
citation:
  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>
  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>
  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} }'
  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>.
  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>.'
  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>.
  short: M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).
date_created: 2024-01-11T11:10:53Z
date_updated: 2024-01-11T11:19:33Z
department:
- _id: '63'
doi: 10.1007/s00453-023-01189-x
extern: '1'
keyword:
- Applied Mathematics
- Computer Science Applications
- General Computer Science
language:
- iso: eng
project:
- _id: '1'
  grant_number: '160364472'
  name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
    in dynamischen Märkten '
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
  grant_number: '160364472'
  name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter
    Dienste in konfigurierbaren Rechenzentren (Subproject C4)'
publication: Algorithmica
publication_identifier:
  issn:
  - 0178-4617
  - 1432-0541
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Server Cloud Scheduling
type: journal_article
user_id: '44428'
year: '2023'
...
---
_id: '50460'
author:
- first_name: Max A.
  full_name: Deppert, Max A.
  last_name: Deppert
- first_name: Klaus
  full_name: Jansen, Klaus
  last_name: Jansen
- first_name: Marten
  full_name: Maack, Marten
  id: '88252'
  last_name: Maack
- first_name: Simon
  full_name: Pukrop, Simon
  id: '44428'
  last_name: Pukrop
- first_name: Malin
  full_name: Rau, Malin
  last_name: Rau
citation:
  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>'
  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} }'
  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>.'
  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.'
date_created: 2024-01-11T11:30:14Z
date_updated: 2024-01-11T11:31:11Z
department:
- _id: '63'
doi: 10.1109/ipdps54959.2023.00049
language:
- iso: eng
project:
- _id: '1'
  grant_number: '160364472'
  name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
    in dynamischen Märkten '
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
  grant_number: '160364472'
  name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter
    Dienste in konfigurierbaren Rechenzentren (Subproject C4)'
publication: 2023 IEEE International Parallel and Distributed Processing Symposium
  (IPDPS)
publication_status: published
publisher: IEEE
status: public
title: Scheduling with Many Shared Resources
type: conference
user_id: '44428'
year: '2023'
...
---
_id: '45863'
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."
alternative_title:
- Collaborative Research Centre 901 (2011 – 2023)
author:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
- first_name: Henning
  full_name: Wachsmuth, Henning
  id: '3900'
  last_name: Wachsmuth
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  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>
  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>
  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}
    }'
  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>.'
  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.'
  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>.
  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.
date_created: 2023-07-05T07:16:51Z
date_updated: 2024-07-12T12:07:59Z
ddc:
- '000'
department:
- _id: '7'
- _id: '78'
- _id: '26'
doi: 10.17619/UNIPB/1-1797
file:
- access_level: open_access
  content_type: application/pdf
  creator: ups
  date_created: 2023-07-05T07:15:55Z
  date_updated: 2023-07-05T07:19:14Z
  file_id: '45864'
  file_name: SFB-Buch-Final.pdf
  file_size: 15480050
  relation: main_file
file_date_updated: 2023-07-05T07:19:14Z
has_accepted_license: '1'
intvolume: '       412'
language:
- iso: eng
oa: '1'
page: '247'
place: Paderborn
project:
- _id: '1'
  grant_number: '160364472'
  name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
    in dynamischen Märkten '
- _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'
- _id: '82'
  name: 'SFB 901 - T: SFB 901 - Project Area T'
- _id: '5'
  grant_number: '160364472'
  name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen
    Netzen (Subproject A1)'
- _id: '7'
  grant_number: '160364472'
  name: 'SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation
    (Subproject A3)'
- _id: '8'
  grant_number: '160364472'
  name: 'SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen
    (Subproject A4)'
- _id: '9'
  grant_number: '160364472'
  name: 'SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject
    B1)'
- _id: '10'
  grant_number: '160364472'
  name: 'SFB 901 - B2: Konfiguration und Bewertung (B02)'
- _id: '11'
  name: 'SFB 901 - B3: SFB 901 - Subproject B3'
- _id: '12'
  name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '13'
  grant_number: '160364472'
  name: 'SFB 901 - C1: SFB 901 - Subproject C1'
- _id: '14'
  grant_number: '160364472'
  name: 'SFB 901 - C2: SFB 901 - On-The-Fly Compute Centers I: Heterogene Ausführungsumgebungen
    (Subproject C2)'
- _id: '16'
  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: '17'
  name: 'SFB 901 - C5: SFB 901 - Subproject C5'
- _id: '83'
  name: 'SFB 901 - T1: SFB 901 -Subproject T1'
- _id: '84'
  grant_number: '160364472'
  name: 'SFB 901 - T2: SFB 901 -Subproject T2'
publication_identifier:
  unknown:
  - 978-3-947647-31-6
publisher: Heinz Nixdorf Institut, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: On-The-Fly Computing -- Individualized IT-services in dynamic markets
type: book
user_id: '1112'
volume: 412
year: '2023'
...
---
_id: '44077'
author:
- first_name: Marten
  full_name: Maack, Marten
  last_name: Maack
citation:
  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>
  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>
  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} }'
  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>.'
  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.
date_created: 2023-04-20T08:59:14Z
date_updated: 2023-04-21T07:53:42Z
department:
- _id: '63'
doi: 10.1016/j.orl.2023.02.013
intvolume: '        51'
issue: '3'
keyword:
- Applied Mathematics
- Industrial and Manufacturing Engineering
- Management Science and Operations Research
- Software
language:
- iso: eng
page: 220-225
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'
publication: Operations Research Letters
publication_identifier:
  issn:
  - 0167-6377
publisher: Elsevier BV
status: public
title: Online load balancing on uniform machines with limited migration
type: journal_article
user_id: '88252'
volume: 51
year: '2023'
...
---
_id: '45895'
author:
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
- first_name: Marten
  full_name: Maack, Marten
  id: '88252'
  last_name: Maack
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Simon
  full_name: Pukrop, Simon
  id: '44428'
  last_name: Pukrop
- first_name: Adrian
  full_name: Redder, Adrian
  id: '52265'
  last_name: Redder
  orcid: https://orcid.org/0000-0001-7391-4688
citation:
  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} }'
  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.'
  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.'
date_created: 2023-07-07T08:24:28Z
date_updated: 2023-07-07T11:16:53Z
ddc:
- '004'
department:
- _id: '7'
doi: 10.5281/zenodo.8068664
editor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  last_name: Haake
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  last_name: Meyer auf der Heide
- first_name: Marco
  full_name: Platzner, Marco
  last_name: Platzner
- first_name: Henning
  full_name: Wachsmuth, Henning
  last_name: Wachsmuth
- first_name: Heike
  full_name: Wehrheim, Heike
  last_name: Wehrheim
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2023-07-07T08:24:20Z
  date_updated: 2023-07-07T11:16:52Z
  file_id: '45896'
  file_name: C4-Chapter-SFB-Buch-Final.pdf
  file_size: 1803186
  relation: main_file
file_date_updated: 2023-07-07T11:16:52Z
has_accepted_license: '1'
intvolume: '       412'
language:
- iso: eng
oa: '1'
page: 183-202
place: Paderborn
project:
- _id: '1'
  grant_number: '160364472'
  name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
    in dynamischen Märkten '
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
  grant_number: '160364472'
  name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter
    Dienste in konfigurierbaren Rechenzentren (Subproject C4)'
publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets
publisher: Heinz Nixdorf Institut, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: 'On-The-Fly Compute Centers II: Execution of Composed Services in Configurable
  Compute Centers'
type: book_chapter
user_id: '477'
volume: 412
year: '2023'
...
---
_id: '45781'
author:
- first_name: Simon
  full_name: Pukrop, Simon
  id: '44428'
  last_name: Pukrop
citation:
  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>
  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>
  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} }'
  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.
  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>.
  short: S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling,
    2023.
date_created: 2023-06-27T05:24:19Z
date_updated: 2023-07-14T09:27:44Z
department:
- _id: '63'
doi: '10.17619/UNIPB/1-1768 '
language:
- iso: eng
project:
- _id: '1'
  grant_number: '160364472'
  name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
    in dynamischen Märkten '
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
  grant_number: '160364472'
  name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter
    Dienste in konfigurierbaren Rechenzentren (Subproject C4)'
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling
type: dissertation
user_id: '15504'
year: '2023'
...
---
_id: '29672'
author:
- first_name: Stefan Balthasar
  full_name: Schneider, Stefan Balthasar
  id: '35343'
  last_name: Schneider
  orcid: 0000-0001-8210-4011
citation:
  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>'
  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}
    }'
  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.'
  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>.'
  short: 'S.B. Schneider, Network and Service Coordination: Conventional and Machine
    Learning Approaches", 2022.'
date_created: 2022-01-31T07:08:47Z
date_updated: 2022-02-18T08:17:36Z
department:
- _id: '75'
doi: '10.17619/UNIPB/1-1276 '
language:
- iso: eng
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
supervisor:
- first_name: Karl
  full_name: Holger, Karl
  last_name: Holger
title: 'Network and Service Coordination: Conventional and Machine Learning Approaches"'
type: dissertation
user_id: '15504'
year: '2022'
...
---
_id: '30236'
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."
author:
- first_name: Stefan Balthasar
  full_name: Schneider, Stefan Balthasar
  id: '35343'
  last_name: Schneider
  orcid: 0000-0001-8210-4011
- first_name: Stefan
  full_name: Werner, Stefan
  last_name: Werner
- first_name: Ramin
  full_name: Khalili, Ramin
  last_name: Khalili
- first_name: Artur
  full_name: Hecker, Artur
  last_name: Hecker
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  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.'
  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.'
  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} }'
  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.'
  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.'
  short: 'S.B. Schneider, S. Werner, R. Khalili, A. Hecker, H. Karl, in: IEEE/IFIP
    Network Operations and Management Symposium (NOMS), IEEE, 2022.'
conference:
  end_date: 2022-04-29
  location: Budapest
  name: IEEE/IFIP Network Operations and Management Symposium (NOMS)
  start_date: 2022-04-25
date_created: 2022-03-10T18:28:14Z
date_updated: 2022-03-10T18:28:19Z
ddc:
- '004'
department:
- _id: '75'
file:
- access_level: open_access
  content_type: application/pdf
  creator: stschn
  date_created: 2022-03-10T18:25:41Z
  date_updated: 2022-03-10T18:25:41Z
  file_id: '30237'
  file_name: author_version.pdf
  file_size: 223412
  relation: main_file
file_date_updated: 2022-03-10T18:25:41Z
has_accepted_license: '1'
keyword:
- wireless mobile networks
- network management
- continuous control
- cognitive networks
- autonomous coordination
- reinforcement learning
- gym environment
- simulation
- open source
language:
- iso: eng
oa: '1'
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'
publication: IEEE/IFIP Network Operations and Management Symposium (NOMS)
publisher: IEEE
quality_controlled: '1'
status: public
title: 'mobile-env: An Open Platform for Reinforcement Learning in Wireless Mobile
  Networks'
type: conference
user_id: '35343'
year: '2022'
...
---
_id: '33085'
author:
- first_name: Leah
  full_name: Epstein, Leah
  last_name: Epstein
- first_name: Alexandra
  full_name: Lassota, Alexandra
  last_name: Lassota
- first_name: Asaf
  full_name: Levin, Asaf
  last_name: Levin
- first_name: Marten
  full_name: Maack, Marten
  id: '88252'
  last_name: Maack
- first_name: Lars
  full_name: Rohwedder, Lars
  last_name: Rohwedder
citation:
  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>'
  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>
  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}
    }'
  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>.'
  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>.
  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.'
date_created: 2022-08-23T08:10:36Z
date_updated: 2022-11-08T16:34:32Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.STACS.2022.28
editor:
- first_name: Petra
  full_name: Berenbrink, Petra
  last_name: Berenbrink
- first_name: Benjamin
  full_name: Monmege, Benjamin
  last_name: Monmege
intvolume: '       219'
language:
- iso: eng
page: 28:1–28:15
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'
publication: 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
series_title: LIPIcs
status: public
title: Cardinality Constrained Scheduling in Online Models
type: conference
user_id: '88252'
volume: 219
year: '2022'
...
---
_id: '32811'
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.'
author:
- first_name: Adrian
  full_name: Redder, Adrian
  id: '52265'
  last_name: Redder
  orcid: https://orcid.org/0000-0001-7391-4688
- first_name: Arunselvan
  full_name: Ramaswamy, Arunselvan
  id: '66937'
  last_name: Ramaswamy
  orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  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.'
  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.
  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} }'
  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.
  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.
  short: 'A. Redder, A. Ramaswamy, H. Karl, in: Proceedings of the 58th Allerton Conference
    on Communication, Control, and Computing, 2022.'
conference:
  name: 58th Allerton Conference on Communication, Control, and Computing
date_created: 2022-08-15T09:59:17Z
date_updated: 2022-11-18T09:31:19Z
ddc:
- '000'
department:
- _id: '75'
has_accepted_license: '1'
language:
- iso: eng
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'
publication: Proceedings of the 58th Allerton Conference on Communication, Control,
  and Computing
status: public
title: Age of Information Process under Strongly Mixing Communication -- Moment Bound,
  Mixing Rate and Strong Law
type: conference
user_id: '477'
year: '2022'
...
---
_id: '30793'
author:
- first_name: Adrian
  full_name: Redder, Adrian
  id: '52265'
  last_name: Redder
  orcid: https://orcid.org/0000-0001-7391-4688
- first_name: Arunselvan
  full_name: Ramaswamy, Arunselvan
  id: '66937'
  last_name: Ramaswamy
  orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  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>'
  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>
  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} }'
  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>.
  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>.'
  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>.
  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.'
date_created: 2022-04-06T07:18:36Z
date_updated: 2022-11-18T09:32:14Z
ddc:
- '006'
department:
- _id: '75'
doi: 10.5220/0010845400003116
file:
- access_level: closed
  content_type: application/pdf
  creator: aredder
  date_created: 2022-08-31T07:10:13Z
  date_updated: 2022-08-31T07:10:13Z
  file_id: '33237'
  file_name: ICCART2022.pdf
  file_size: 298926
  relation: main_file
  success: 1
file_date_updated: 2022-08-31T07:10:13Z
has_accepted_license: '1'
language:
- iso: eng
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'
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: Proceedings of the 14th International Conference on Agents and Artificial
  Intelligence
publication_status: published
publisher: SCITEPRESS - Science and Technology Publications
status: public
title: Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy
  Communication
type: conference
user_id: '477'
year: '2022'
...
---
_id: '30790'
abstract:
- lang: eng
  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."
author:
- first_name: Adrian
  full_name: Redder, Adrian
  id: '52265'
  last_name: Redder
  orcid: https://orcid.org/0000-0001-7391-4688
- first_name: Arunselvan
  full_name: Ramaswamy, Arunselvan
  id: '66937'
  last_name: Ramaswamy
  orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
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.
  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>.
  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}
    }'
  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.
  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.
  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).
date_created: 2022-04-06T06:53:38Z
date_updated: 2022-11-18T09:33:01Z
department:
- _id: '75'
external_id:
  arxiv:
  - '2201.11343'
language:
- iso: eng
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'
publication: arXiv:2201.11343
status: public
title: Distributed gradient-based optimization in the presence of dependent  aperiodic
  communication
type: preprint
user_id: '477'
year: '2022'
...
---
_id: '30791'
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."
author:
- first_name: Adrian
  full_name: Redder, Adrian
  id: '52265'
  last_name: Redder
  orcid: https://orcid.org/0000-0001-7391-4688
- first_name: Arunselvan
  full_name: Ramaswamy, Arunselvan
  id: '66937'
  last_name: Ramaswamy
  orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: Redder A, Ramaswamy A, Karl H. Asymptotic Convergence of Deep Multi-Agent Actor-Critic
    Algorithms. <i>arXiv:220100570</i>. Published online 2022.
  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} }'
  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.
  mla: Redder, Adrian, et al. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic
    Algorithms.” <i>ArXiv:2201.00570</i>, 2022.
  short: A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.00570 (2022).
date_created: 2022-04-06T06:53:52Z
date_updated: 2022-11-18T09:33:42Z
department:
- _id: '75'
external_id:
  arxiv:
  - '2201.00570'
language:
- iso: eng
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'
publication: arXiv:2201.00570
status: public
title: Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms
type: preprint
user_id: '477'
year: '2022'
...
---
_id: '32854'
author:
- first_name: Adrian
  full_name: Redder, Adrian
  id: '52265'
  last_name: Redder
  orcid: https://orcid.org/0000-0001-7391-4688
- first_name: Arunselvan
  full_name: Ramaswamy, Arunselvan
  id: '66937'
  last_name: Ramaswamy
  orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
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.
  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} }'
  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.
  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.
conference:
  name: IFAC Conference on Networked Systems
date_created: 2022-08-16T09:12:55Z
date_updated: 2022-11-18T10:05:14Z
ddc:
- '006'
department:
- _id: '75'
file:
- access_level: closed
  content_type: application/pdf
  creator: aredder
  date_created: 2022-08-31T07:06:30Z
  date_updated: 2022-08-31T07:06:30Z
  file_id: '33236'
  file_name: NecSys2022____Practical_Conditions_for_Conv.pdf
  file_size: 298395
  relation: main_file
  success: 1
file_date_updated: 2022-08-31T07:06:30Z
has_accepted_license: '1'
intvolume: '        55'
issue: '13'
language:
- iso: eng
page: 133–138
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'
publication: IFAC-PapersOnLine
publisher: Elsevier
status: public
title: Practical Network Conditions for the Convergence of Distributed Optimization
type: journal_article
user_id: '477'
volume: 55
year: '2022'
...
---
_id: '33491'
author:
- first_name: Marten
  full_name: Maack, Marten
  id: '88252'
  last_name: Maack
- first_name: Simon
  full_name: Pukrop, Simon
  id: '44428'
  last_name: Pukrop
- first_name: Anna Rodriguez
  full_name: Rasmussen, Anna Rodriguez
  last_name: Rasmussen
citation:
  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>'
  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} }'
  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>.
  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>.'
  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.'
date_created: 2022-09-27T13:06:05Z
date_updated: 2022-11-18T10:14:14Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.ESA.2022.77
editor:
- first_name: Shiri
  full_name: Chechik, Shiri
  last_name: Chechik
- first_name: Gonzalo
  full_name: Navarro, Gonzalo
  last_name: Navarro
- first_name: Eva
  full_name: Rotenberg, Eva
  last_name: Rotenberg
- first_name: Grzegorz
  full_name: Herman, Grzegorz
  last_name: Herman
intvolume: '       244'
language:
- iso: eng
page: 77:1–77:13
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '16'
  name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9,
  2022, Berlin/Potsdam, Germany
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: (In-)Approximability Results for Interval, Resource Restricted, and Low Rank
  Scheduling
type: conference
user_id: '477'
volume: 244
year: '2022'
...
---
_id: '29220'
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."
author:
- first_name: Stefan
  full_name: Werner, Stefan
  last_name: Werner
- first_name: Stefan Balthasar
  full_name: Schneider, Stefan Balthasar
  id: '35343'
  last_name: Schneider
  orcid: 0000-0001-8210-4011
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  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.'
  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.'
  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} }'
  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.'
  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.'
conference:
  end_date: 2022-04-29
  location: Budapest
  name: IEEE/IFIP Network Operations and Management Symposium (NOMS)
  start_date: 2022-04-25
date_created: 2022-01-11T08:43:26Z
date_updated: 2022-01-11T08:44:04Z
ddc:
- '004'
department:
- _id: '75'
file:
- access_level: open_access
  content_type: application/pdf
  creator: stschn
  date_created: 2022-01-11T08:39:57Z
  date_updated: 2022-01-11T08:39:57Z
  file_id: '29222'
  file_name: author_version.pdf
  file_size: 528653
  relation: main_file
file_date_updated: 2022-01-11T08:39:57Z
has_accepted_license: '1'
keyword:
- network management
- service management
- AI
- Monte Carlo Tree Search
- model-based
- QoS
language:
- iso: eng
oa: '1'
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'
publication: IEEE/IFIP Network Operations and Management Symposium (NOMS)
publisher: IEEE
quality_controlled: '1'
status: public
title: 'Use What You Know: Network and Service Coordination Beyond Certainty'
type: conference
user_id: '35343'
year: '2022'
...
---
_id: '29872'
author:
- first_name: Marten
  full_name: Maack, Marten
  id: '88252'
  last_name: Maack
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Simon
  full_name: Pukrop, Simon
  id: '44428'
  last_name: Pukrop
citation:
  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>'
  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>
  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} }'
  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>.
  short: 'M. Maack, F. Meyer auf der Heide, S. Pukrop, in: Approximation and Online
    Algorithms, Springer International Publishing, Cham, 2022.'
date_created: 2022-02-18T09:31:54Z
date_updated: 2022-09-27T15:03:13Z
department:
- _id: '63'
doi: 10.1007/978-3-030-92702-8_10
language:
- iso: eng
place: Cham
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'
publication: Approximation and Online Algorithms
publication_identifier:
  isbn:
  - '9783030927011'
  - '9783030927028'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Server Cloud Scheduling
type: book_chapter
user_id: '44428'
year: '2022'
...
---
_id: '20125'
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.
author:
- first_name: Asif
  full_name: Hasnain, Asif
  id: '63288'
  last_name: Hasnain
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
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>'
  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>'
  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}
    }'
  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.
  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>.
  short: 'A. Hasnain, H. Karl, in: 2021 IEEE 18th Annual Consumer Communications &#38;
    Networking Conference (CCNC), IEEE Computer Society, n.d.'
conference:
  end_date: 2021-01-12
  location: Las Vegas, USA
  name: 2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC)
  start_date: 2021-01-09
date_created: 2020-10-19T14:27:17Z
date_updated: 2022-01-06T06:54:20Z
ddc:
- '000'
department:
- _id: '75'
doi: https://doi.org/10.1109/CCNC49032.2021.9369514
keyword:
- Flow scheduling
- Deadlines
- Reinforcement learning
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/9369514
project:
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '1'
  name: SFB 901
publication: 2021 IEEE 18th Annual Consumer Communications & Networking Conference
  (CCNC)
publication_status: accepted
publisher: IEEE Computer Society
status: public
title: Learning Flow Scheduling
type: conference
user_id: '63288'
year: '2021'
...
---
_id: '27503'
author:
- first_name: Asif
  full_name: Hasnain, Asif
  last_name: Hasnain
citation:
  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>
  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} }'
  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>.
  ieee: A. Hasnain, <i>Automating Network Resource Allocation for Coflows with Deadlines</i>.
    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>.
  short: A. Hasnain, Automating Network Resource Allocation for Coflows with Deadlines,
    2021.
date_created: 2021-11-16T13:05:12Z
date_updated: 2022-01-06T06:57:40Z
department:
- _id: '75'
doi: '10.17619/UNIPB/1-1241 '
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
status: public
supervisor:
- first_name: Holger
  full_name: Karl, Holger
  last_name: Karl
title: Automating Network Resource Allocation for Coflows with Deadlines
type: dissertation
user_id: '15504'
year: '2021'
...
---
_id: '21005'
abstract:
- lang: eng
  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.
author:
- first_name: Asif
  full_name: Hasnain, Asif
  id: '63288'
  last_name: Hasnain
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  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>'
  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>'
  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} }'
  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.
  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>.
  short: 'A. Hasnain, H. Karl, in: IEEE INFOCOM 2021 - IEEE Conference on Computer
    Communications Workshops (INFOCOM WKSHPS), IEEE Communications Society, n.d.'
conference:
  end_date: 2021-05-13
  location: Vancouver BC Canada
  name: IEEE INFOCOM 2021 - IEEE Conference on Computer Communications
  start_date: 2021-05-10
date_created: 2021-01-16T18:24:19Z
date_updated: 2022-01-06T06:54:42Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/INFOCOMWKSHPS51825.2021.9484599
keyword:
- Coflow scheduling
- Reinforcement learning
- Deadlines
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/9484599
project:
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '1'
  name: SFB 901
publication: IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops
  (INFOCOM WKSHPS)
publication_status: accepted
publisher: IEEE Communications Society
related_material:
  link:
  - relation: confirmation
    url: https://ieeexplore.ieee.org/document/9484599
status: public
title: Learning Coflow Admissions
type: conference
user_id: '63288'
year: '2021'
...