---
_id: '2344'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Peter
  full_name: Günther, Peter
  last_name: Günther
- first_name: Volker
  full_name: Krummel, Volker
  last_name: Krummel
- first_name: Nils
  full_name: Löken, Nils
  id: '13703'
  last_name: Löken
citation:
  ama: 'Blömer J, Günther P, Krummel V, Löken N. Attribute-Based Encryption as a Service
    for Access Control in Large-Scale Organizations. In: <i>Foundations and Practice
    of Security</i>. Cham: Springer International Publishing; 2017:3-17. doi:<a href="https://doi.org/10.1007/978-3-319-75650-9_1">10.1007/978-3-319-75650-9_1</a>'
  apa: 'Blömer, J., Günther, P., Krummel, V., &#38; Löken, N. (2017). Attribute-Based
    Encryption as a Service for Access Control in Large-Scale Organizations. In <i>Foundations
    and Practice of Security</i> (pp. 3–17). Cham: Springer International Publishing.
    <a href="https://doi.org/10.1007/978-3-319-75650-9_1">https://doi.org/10.1007/978-3-319-75650-9_1</a>'
  bibtex: '@inproceedings{Blömer_Günther_Krummel_Löken_2017, place={Cham}, title={Attribute-Based
    Encryption as a Service for Access Control in Large-Scale Organizations}, DOI={<a
    href="https://doi.org/10.1007/978-3-319-75650-9_1">10.1007/978-3-319-75650-9_1</a>},
    booktitle={Foundations and Practice of Security}, publisher={Springer International
    Publishing}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker and
    Löken, Nils}, year={2017}, pages={3–17} }'
  chicago: 'Blömer, Johannes, Peter Günther, Volker Krummel, and Nils Löken. “Attribute-Based
    Encryption as a Service for Access Control in Large-Scale Organizations.” In <i>Foundations
    and Practice of Security</i>, 3–17. Cham: Springer International Publishing, 2017.
    <a href="https://doi.org/10.1007/978-3-319-75650-9_1">https://doi.org/10.1007/978-3-319-75650-9_1</a>.'
  ieee: J. Blömer, P. Günther, V. Krummel, and N. Löken, “Attribute-Based Encryption
    as a Service for Access Control in Large-Scale Organizations,” in <i>Foundations
    and Practice of Security</i>, 2017, pp. 3–17.
  mla: Blömer, Johannes, et al. “Attribute-Based Encryption as a Service for Access
    Control in Large-Scale Organizations.” <i>Foundations and Practice of Security</i>,
    Springer International Publishing, 2017, pp. 3–17, doi:<a href="https://doi.org/10.1007/978-3-319-75650-9_1">10.1007/978-3-319-75650-9_1</a>.
  short: 'J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice
    of Security, Springer International Publishing, Cham, 2017, pp. 3–17.'
date_created: 2018-04-13T11:40:48Z
date_updated: 2022-01-06T06:55:55Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-319-75650-9_1
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:04:13Z
  date_updated: 2018-11-02T15:04:13Z
  file_id: '5292'
  file_name: Attribute-BasedEncryptionAsASe.pdf
  file_size: 634736
  relation: main_file
  success: 1
- access_level: open_access
  content_type: application/pdf
  creator: nilo
  date_created: 2018-11-08T09:53:34Z
  date_updated: 2018-11-08T09:53:34Z
  file_id: '5425'
  file_name: abe_aas.pdf
  file_size: 522516
  relation: main_file
file_date_updated: 2018-11-08T09:53:34Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 3-17
place: Cham
project:
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '1'
  name: SFB 901
- _id: '43'
  name: Securing the Financial Cloud
publication: Foundations and Practice of Security
publication_identifier:
  isbn:
  - '9783319756493'
  - '9783319756509'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations
type: conference
user_id: '13703'
year: '2017'
...
---
_id: '18027'
author:
- first_name: Ngoc Chi
  full_name: Banh, Ngoc Chi
  last_name: Banh
citation:
  ama: Banh NC. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>.
    Universität Paderborn; 2017.
  apa: Banh, N. C. (2017). <i>An Asynchronous Adaption of a Churn-resistant Overlay
    Network</i>. Universität Paderborn.
  bibtex: '@book{Banh_2017, title={An Asynchronous Adaption of a Churn-resistant Overlay
    Network}, publisher={Universität Paderborn}, author={Banh, Ngoc Chi}, year={2017}
    }'
  chicago: Banh, Ngoc Chi. <i>An Asynchronous Adaption of a Churn-Resistant Overlay
    Network</i>. Universität Paderborn, 2017.
  ieee: N. C. Banh, <i>An Asynchronous Adaption of a Churn-resistant Overlay Network</i>.
    Universität Paderborn, 2017.
  mla: Banh, Ngoc Chi. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>.
    Universität Paderborn, 2017.
  short: N.C. Banh, An Asynchronous Adaption of a Churn-Resistant Overlay Network,
    Universität Paderborn, 2017.
date_created: 2020-08-18T08:40:19Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: An Asynchronous Adaption of a Churn-resistant Overlay Network
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '91'
abstract:
- lang: eng
  text: The interest in business model innovation has risen rapidly in recent years,
    and software tools for business model development hold great promise for supporting
    business model innovation. Nonetheless, virtually no design-relevant knowledge
    exists concerning the functions that such tools should possess. Therefore, we
    develop a comprehensive taxonomy that identifies characteristic functions of software-based
    business model development tools. For developing the taxonomy, we draw on prior
    research on business model innovation, process modeling, and creativity support
    systems, and we analyze software tools for business model development that have
    been proposed in practice. The resulting taxonomy can support practitioners in
    their tool (re-)design and investment decisions, and for researchers can serve
    as a preliminary step towards more advanced theories for software tools for business
    model development.
author:
- first_name: Daniel
  full_name: Szopinski, Daniel
  id: '36372'
  last_name: Szopinski
- first_name: Thorsten
  full_name: Schoormann, Thorsten
  last_name: Schoormann
- first_name: Thomas
  full_name: John, Thomas
  id: '3952'
  last_name: John
- first_name: Ralf
  full_name: Knackstedt, Ralf
  last_name: Knackstedt
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'Szopinski D, Schoormann T, John T, Knackstedt R, Kundisch D. How Software
    Can Support Innovating Business Models: A Taxonomy of Functions of Business Model
    Development Tools. In: <i>Proceedings of the 23rd Americas Conference on Information
    Systems (AMCIS)</i>. ; 2017.'
  apa: 'Szopinski, D., Schoormann, T., John, T., Knackstedt, R., &#38; Kundisch, D.
    (2017). How Software Can Support Innovating Business Models: A Taxonomy of Functions
    of Business Model Development Tools. In <i>Proceedings of the 23rd Americas Conference
    on Information Systems (AMCIS)</i>. Boston, USA.'
  bibtex: '@inproceedings{Szopinski_Schoormann_John_Knackstedt_Kundisch_2017, title={How
    Software Can Support Innovating Business Models: A Taxonomy of Functions of Business
    Model Development Tools}, booktitle={Proceedings of the 23rd Americas Conference
    on Information Systems (AMCIS)}, author={Szopinski, Daniel and Schoormann, Thorsten
    and John, Thomas and Knackstedt, Ralf and Kundisch, Dennis}, year={2017} }'
  chicago: 'Szopinski, Daniel, Thorsten Schoormann, Thomas John, Ralf Knackstedt,
    and Dennis Kundisch. “How Software Can Support Innovating Business Models: A Taxonomy
    of Functions of Business Model Development Tools.” In <i>Proceedings of the 23rd
    Americas Conference on Information Systems (AMCIS)</i>, 2017.'
  ieee: 'D. Szopinski, T. Schoormann, T. John, R. Knackstedt, and D. Kundisch, “How
    Software Can Support Innovating Business Models: A Taxonomy of Functions of Business
    Model Development Tools,” in <i>Proceedings of the 23rd Americas Conference on
    Information Systems (AMCIS)</i>, Boston, USA, 2017.'
  mla: 'Szopinski, Daniel, et al. “How Software Can Support Innovating Business Models:
    A Taxonomy of Functions of Business Model Development Tools.” <i>Proceedings of
    the 23rd Americas Conference on Information Systems (AMCIS)</i>, 2017.'
  short: 'D. Szopinski, T. Schoormann, T. John, R. Knackstedt, D. Kundisch, in: Proceedings
    of the 23rd Americas Conference on Information Systems (AMCIS), 2017.'
conference:
  location: Boston, USA
  name: 23rd Americas Conference on Information Systems (AMCIS)
date_created: 2017-10-17T12:41:09Z
date_updated: 2022-01-06T07:04:08Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: dsz
  date_created: 2018-11-12T13:22:49Z
  date_updated: 2018-11-12T13:22:49Z
  file_id: '5503'
  file_name: AMCIS2017_BMDT.pdf
  file_size: 912449
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T13:22:49Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '17'
  name: SFB 901 - Subprojekt C5
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 23rd Americas Conference on Information Systems (AMCIS)
status: public
title: 'How Software Can Support Innovating Business Models: A Taxonomy of Functions
  of Business Model Development Tools'
type: conference
user_id: '16205'
year: '2017'
...
---
_id: '92'
author:
- first_name: Daniel
  full_name: Szopinski, Daniel
  id: '36372'
  last_name: Szopinski
- first_name: Thorsten
  full_name: Schoormann, Thorsten
  last_name: Schoormann
- first_name: Thomas
  full_name: John, Thomas
  id: '3952'
  last_name: John
- first_name: Ralf
  full_name: Knackstedt, Ralf
  last_name: Knackstedt
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'Szopinski D, Schoormann T, John T, Knackstedt R, Kundisch D. How Software
    Can Support Innovating Business Models: A Taxonomy of Functions of Business Model
    Development Tools. In: <i>Bosch Business Model Innovation Summit 2017</i>. ; 2017.'
  apa: 'Szopinski, D., Schoormann, T., John, T., Knackstedt, R., &#38; Kundisch, D.
    (2017). How Software Can Support Innovating Business Models: A Taxonomy of Functions
    of Business Model Development Tools. In <i>Bosch Business Model Innovation Summit
    2017</i>. Renningen, Germany.'
  bibtex: '@inproceedings{Szopinski_Schoormann_John_Knackstedt_Kundisch_2017, title={How
    Software Can Support Innovating Business Models: A Taxonomy of Functions of Business
    Model Development Tools}, booktitle={Bosch Business Model Innovation Summit 2017},
    author={Szopinski, Daniel and Schoormann, Thorsten and John, Thomas and Knackstedt,
    Ralf and Kundisch, Dennis}, year={2017} }'
  chicago: 'Szopinski, Daniel, Thorsten Schoormann, Thomas John, Ralf Knackstedt,
    and Dennis Kundisch. “How Software Can Support Innovating Business Models: A Taxonomy
    of Functions of Business Model Development Tools.” In <i>Bosch Business Model
    Innovation Summit 2017</i>, 2017.'
  ieee: 'D. Szopinski, T. Schoormann, T. John, R. Knackstedt, and D. Kundisch, “How
    Software Can Support Innovating Business Models: A Taxonomy of Functions of Business
    Model Development Tools,” in <i>Bosch Business Model Innovation Summit 2017</i>,
    Renningen, Germany, 2017.'
  mla: 'Szopinski, Daniel, et al. “How Software Can Support Innovating Business Models:
    A Taxonomy of Functions of Business Model Development Tools.” <i>Bosch Business
    Model Innovation Summit 2017</i>, 2017.'
  short: 'D. Szopinski, T. Schoormann, T. John, R. Knackstedt, D. Kundisch, in: Bosch
    Business Model Innovation Summit 2017, 2017.'
conference:
  location: Renningen, Germany
  name: Bosch Business Model Innovation Summit 2017
date_created: 2017-10-17T12:41:09Z
date_updated: 2022-01-06T07:04:09Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: dsz
  date_created: 2018-11-29T15:02:15Z
  date_updated: 2018-11-29T15:02:15Z
  file_id: '5981'
  file_name: Bosch BMI Summit 2017.pdf
  file_size: 1359194
  relation: main_file
  success: 1
file_date_updated: 2018-11-29T15:02:15Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '17'
  name: SFB 901 - Subprojekt C5
- _id: '4'
  name: SFB 901 - Project Area C
publication: Bosch Business Model Innovation Summit 2017
status: public
title: 'How Software Can Support Innovating Business Models: A Taxonomy of Functions
  of Business Model Development Tools'
type: conference_abstract
user_id: '477'
year: '2017'
...
---
_id: '94'
author:
- first_name: Martin
  full_name: Martens, Martin
  last_name: Martens
citation:
  ama: Martens M. <i>Geschäftsmodelle elektronischer Handelsplattformen</i>. Universität
    Paderborn; 2017.
  apa: Martens, M. (2017). <i>Geschäftsmodelle elektronischer Handelsplattformen</i>.
    Universität Paderborn.
  bibtex: '@book{Martens_2017, title={Geschäftsmodelle elektronischer Handelsplattformen},
    publisher={Universität Paderborn}, author={Martens, Martin}, year={2017} }'
  chicago: Martens, Martin. <i>Geschäftsmodelle elektronischer Handelsplattformen</i>.
    Universität Paderborn, 2017.
  ieee: M. Martens, <i>Geschäftsmodelle elektronischer Handelsplattformen</i>. Universität
    Paderborn, 2017.
  mla: Martens, Martin. <i>Geschäftsmodelle elektronischer Handelsplattformen</i>.
    Universität Paderborn, 2017.
  short: M. Martens, Geschäftsmodelle elektronischer Handelsplattformen, Universität
    Paderborn, 2017.
date_created: 2017-10-17T12:41:09Z
date_updated: 2022-01-06T07:04:14Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '17'
  name: SFB 901 - Subprojekt C5
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Geschäftsmodelle elektronischer Handelsplattformen
type: bachelorsthesis
user_id: '16205'
year: '2017'
...
---
_id: '95'
author:
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
- first_name: Thomas
  full_name: John, Thomas
  id: '3952'
  last_name: John
citation:
  ama: 'Kundisch D, John T. Geschäftsmodell-Modellierungssprache/Business Model Modeling
    Language. In: <i>Enzyklopädie der Wirtschaftsinformatik, GITO</i>. ; 2017.'
  apa: Kundisch, D., &#38; John, T. (2017). Geschäftsmodell-Modellierungssprache/Business
    Model Modeling Language. In <i>Enzyklopädie der Wirtschaftsinformatik, GITO</i>.
  bibtex: '@inbook{Kundisch_John_2017, title={Geschäftsmodell-Modellierungssprache/Business
    Model Modeling Language}, booktitle={Enzyklopädie der Wirtschaftsinformatik, GITO},
    author={Kundisch, Dennis and John, Thomas}, year={2017} }'
  chicago: Kundisch, Dennis, and Thomas John. “Geschäftsmodell-Modellierungssprache/Business
    Model Modeling Language.” In <i>Enzyklopädie der Wirtschaftsinformatik, GITO</i>,
    2017.
  ieee: D. Kundisch and T. John, “Geschäftsmodell-Modellierungssprache/Business Model
    Modeling Language,” in <i>Enzyklopädie der Wirtschaftsinformatik, GITO</i>, 2017.
  mla: Kundisch, Dennis, and Thomas John. “Geschäftsmodell-Modellierungssprache/Business
    Model Modeling Language.” <i>Enzyklopädie der Wirtschaftsinformatik, GITO</i>,
    2017.
  short: 'D. Kundisch, T. John, in: Enzyklopädie der Wirtschaftsinformatik, GITO,
    2017.'
date_created: 2017-10-17T12:41:10Z
date_updated: 2022-01-06T07:04:16Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: abursig
  date_created: 2018-12-03T15:24:40Z
  date_updated: 2018-12-03T15:24:40Z
  file_id: '5990'
  file_name: EDW_BMML.PDF
  file_size: 456551
  relation: main_file
  success: 1
file_date_updated: 2018-12-03T15:24:40Z
has_accepted_license: '1'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '17'
  name: SFB 901 - Subproject C5
- _id: '4'
  name: SFB 901 - Project Area C
publication: Enzyklopädie der Wirtschaftsinformatik, GITO
related_material:
  link:
  - relation: confirmation
    url: http://www.enzyklopaedie-der-wirtschaftsinformatik.de/lexikon/is-management/Systementwicklung/Hauptaktivitaten-der-Systementwicklung/Problemanalyse-/geschaeftsmodellmodellierungssprache-business-model-modeling-language
status: public
title: Geschäftsmodell-Modellierungssprache/Business Model Modeling Language
type: encyclopedia_article
user_id: '477'
year: '2017'
...
---
_id: '77'
abstract:
- lang: eng
  text: Das Enterprise Architecture Management stellt umfangreiche Methoden, Modelle
    und Frameworks f{\"u}r die Modellierung von Unternehmensarchitekturen zur Verf{\"u}gung.
    Die Entwicklung von Software und deren Integration in IT-Landschaften ist heutzutage
    zunehmend von Komplexit{\"a}t und Unsicherheit gepr{\"a}gt. Dieser Beitrag (Research-in-progress)
    m{\"o}chte ein neues Paradigma – das „On-The-Fly Computing“ – vorschlagen, um
    diesen Herausforderungen zu begegnen, m{\"o}gliche L{\"o}sungsans{\"a}tze zu diskutieren
    sowie erste Ergebnisse eines Referenzmodells f{\"u}r individualisierte IT-Dienstleistungen
    in dynamischen Software-M{\"a}rkten dokumentieren.
author:
- first_name: Daniel
  full_name: Szopinski, Daniel
  id: '36372'
  last_name: Szopinski
- first_name: Bahar
  full_name: Jazayeri, Bahar
  id: '36399'
  last_name: Jazayeri
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'Szopinski D, Jazayeri B, Engels G, Kundisch D. On-The-Fly Computing: Ein Referenzmodell
    für individualisierte IT-Dienstleistungen in dynamischen Märkten. In: <i>Proceedings
    of the Workshop Enterprise Architecture Management in Forschung Und Praxis, INFORMATIK
    2017, Chemnitz, Germany</i>. Lecture Notes in Informatics (LNI). GI; 2017:2059-2066.'
  apa: 'Szopinski, D., Jazayeri, B., Engels, G., &#38; Kundisch, D. (2017). On-The-Fly
    Computing: Ein Referenzmodell für individualisierte IT-Dienstleistungen in dynamischen
    Märkten. In <i>Proceedings of the Workshop Enterprise Architecture Management
    in Forschung und Praxis, INFORMATIK 2017, Chemnitz, Germany</i> (pp. 2059–2066).
    GI.'
  bibtex: '@inproceedings{Szopinski_Jazayeri_Engels_Kundisch_2017, series={Lecture
    Notes in Informatics (LNI)}, title={On-The-Fly Computing: Ein Referenzmodell für
    individualisierte IT-Dienstleistungen in dynamischen Märkten}, booktitle={Proceedings
    of the Workshop Enterprise Architecture Management in Forschung und Praxis, INFORMATIK
    2017, Chemnitz, Germany}, publisher={GI}, author={Szopinski, Daniel and Jazayeri,
    Bahar and Engels, Gregor and Kundisch, Dennis}, year={2017}, pages={2059–2066},
    collection={Lecture Notes in Informatics (LNI)} }'
  chicago: 'Szopinski, Daniel, Bahar Jazayeri, Gregor Engels, and Dennis Kundisch.
    “On-The-Fly Computing: Ein Referenzmodell Für Individualisierte IT-Dienstleistungen
    in Dynamischen Märkten.” In <i>Proceedings of the Workshop Enterprise Architecture
    Management in Forschung Und Praxis, INFORMATIK 2017, Chemnitz, Germany</i>, 2059–66.
    Lecture Notes in Informatics (LNI). GI, 2017.'
  ieee: 'D. Szopinski, B. Jazayeri, G. Engels, and D. Kundisch, “On-The-Fly Computing:
    Ein Referenzmodell für individualisierte IT-Dienstleistungen in dynamischen Märkten,”
    in <i>Proceedings of the Workshop Enterprise Architecture Management in Forschung
    und Praxis, INFORMATIK 2017, Chemnitz, Germany</i>, 2017, pp. 2059–2066.'
  mla: 'Szopinski, Daniel, et al. “On-The-Fly Computing: Ein Referenzmodell Für Individualisierte
    IT-Dienstleistungen in Dynamischen Märkten.” <i>Proceedings of the Workshop Enterprise
    Architecture Management in Forschung Und Praxis, INFORMATIK 2017, Chemnitz, Germany</i>,
    GI, 2017, pp. 2059–66.'
  short: 'D. Szopinski, B. Jazayeri, G. Engels, D. Kundisch, in: Proceedings of the
    Workshop Enterprise Architecture Management in Forschung Und Praxis, INFORMATIK
    2017, Chemnitz, Germany, GI, 2017, pp. 2059–2066.'
date_created: 2017-10-17T12:41:06Z
date_updated: 2022-01-06T07:03:44Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: dsz
  date_created: 2018-11-12T13:22:12Z
  date_updated: 2018-11-12T13:22:12Z
  file_id: '5502'
  file_name: INFORMATIK2017_OTF.pdf
  file_size: 251032
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T13:22:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 2059-2066
project:
- _id: '1'
  name: SFB 901
- _id: '17'
  name: SFB 901 - Subprojekt C5
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the Workshop Enterprise Architecture Management in Forschung
  und Praxis, INFORMATIK 2017, Chemnitz, Germany
publication_status: published
publisher: GI
series_title: Lecture Notes in Informatics (LNI)
status: public
title: 'On-The-Fly Computing: Ein Referenzmodell für individualisierte IT-Dienstleistungen
  in dynamischen Märkten'
type: conference
user_id: '16205'
year: '2017'
...
---
_id: '78'
abstract:
- lang: eng
  text: The Internet of Things (IoT) connects the things of our everyday life and
    supports usin our common activities.Several markets for IoT services have been
    created. These markets enable IoT users to search and compose services in order
    to support an IoT activity.However, existing IoT markets like IFTTT (If This Then
    That) are not convenient for users with respect to service discovery and composition.The
    objective of On-the-fly (OTF) computing is to configure and provide software markets
    that fulfill individual users' wishes by the automatic on-the-fly composition
    of single services.The architecture framework of On-the-fly computing markets
    helps architects to systematically develop these systems in different domains.In
    this paper, we use our OTF architectural framework to examine the requirements
    of a reference architecture for IoT markets.Furthermore, we perform a comparison
    between the architecture of IFTTT as an existing IoT market with this reference
    architecture. The results show how existing IoT markets can be improved. In return,
    the practical knowledge of IFTTT is taken to the reference architecture.This knowledge
    helps to overcome the limitations of today's IoT markets or creating new markets
    in the future.
author:
- first_name: Bahar
  full_name: Jazayeri, Bahar
  id: '36399'
  last_name: Jazayeri
- first_name: Simon
  full_name: Schwichtenberg, Simon
  id: '13235'
  last_name: Schwichtenberg
citation:
  ama: 'Jazayeri B, Schwichtenberg S. On-The-Fly Computing Meets IoT Markets - Towards
    a Reference Architecture. In: <i>Proceedings of the International Conference on
    Software Architecture (ICSA) IoT-ASAP Workshop</i>. Gothenburg, Sweden: IEEE;
    2017:120--127. doi:<a href="https://doi.org/10.1109/ICSAW.2017.59">10.1109/ICSAW.2017.59</a>'
  apa: 'Jazayeri, B., &#38; Schwichtenberg, S. (2017). On-The-Fly Computing Meets
    IoT Markets - Towards a Reference Architecture. In <i>Proceedings of the International
    Conference on Software Architecture (ICSA) IoT-ASAP Workshop</i> (pp. 120--127).
    Gothenburg, Sweden: IEEE. <a href="https://doi.org/10.1109/ICSAW.2017.59">https://doi.org/10.1109/ICSAW.2017.59</a>'
  bibtex: '@inproceedings{Jazayeri_Schwichtenberg_2017, place={Gothenburg, Sweden},
    title={On-The-Fly Computing Meets IoT Markets - Towards a Reference Architecture},
    DOI={<a href="https://doi.org/10.1109/ICSAW.2017.59">10.1109/ICSAW.2017.59</a>},
    booktitle={Proceedings of the International Conference on Software Architecture
    (ICSA) IoT-ASAP Workshop}, publisher={IEEE}, author={Jazayeri, Bahar and Schwichtenberg,
    Simon}, year={2017}, pages={120--127} }'
  chicago: 'Jazayeri, Bahar, and Simon Schwichtenberg. “On-The-Fly Computing Meets
    IoT Markets - Towards a Reference Architecture.” In <i>Proceedings of the International
    Conference on Software Architecture (ICSA) IoT-ASAP Workshop</i>, 120--127. Gothenburg,
    Sweden: IEEE, 2017. <a href="https://doi.org/10.1109/ICSAW.2017.59">https://doi.org/10.1109/ICSAW.2017.59</a>.'
  ieee: B. Jazayeri and S. Schwichtenberg, “On-The-Fly Computing Meets IoT Markets
    - Towards a Reference Architecture,” in <i>Proceedings of the International Conference
    on Software Architecture (ICSA) IoT-ASAP Workshop</i>, 2017, pp. 120--127.
  mla: Jazayeri, Bahar, and Simon Schwichtenberg. “On-The-Fly Computing Meets IoT
    Markets - Towards a Reference Architecture.” <i>Proceedings of the International
    Conference on Software Architecture (ICSA) IoT-ASAP Workshop</i>, IEEE, 2017,
    pp. 120--127, doi:<a href="https://doi.org/10.1109/ICSAW.2017.59">10.1109/ICSAW.2017.59</a>.
  short: 'B. Jazayeri, S. Schwichtenberg, in: Proceedings of the International Conference
    on Software Architecture (ICSA) IoT-ASAP Workshop, IEEE, Gothenburg, Sweden, 2017,
    pp. 120--127.'
date_created: 2017-10-17T12:41:06Z
date_updated: 2022-01-06T07:03:46Z
ddc:
- '000'
department:
- _id: '66'
doi: 10.1109/ICSAW.2017.59
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:49:05Z
  date_updated: 2018-11-02T14:49:05Z
  file_id: '5284'
  file_name: 07958467.pdf
  file_size: 624689
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:49:05Z
has_accepted_license: '1'
language:
- iso: eng
page: 120--127
place: Gothenburg, Sweden
project:
- _id: '1'
  name: SFB 901
- _id: '17'
  name: SFB 901 - Subprojekt C5
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the International Conference on Software Architecture
  (ICSA) IoT-ASAP Workshop
publisher: IEEE
status: public
title: On-The-Fly Computing Meets IoT Markets - Towards a Reference Architecture
type: conference
user_id: '36399'
year: '2017'
...
---
_id: '79'
abstract:
- lang: eng
  text: Consider a problem in which $n$ jobs that are classified into $k$ types arrive
    over time at their release times and are to be scheduled on a single machine so
    as to minimize the maximum flow time.The machine requires a setup taking $s$ time
    units whenever it switches from processing jobs of one type to jobs of a different
    type.We consider the problem as an online problem where each job is only known
    to the scheduler as soon as it arrives and where the processing time of a job
    only becomes known upon its completion (non-clairvoyance).We are interested in
    the potential of simple ``greedy-like'' algorithms.We analyze a modification of
    the FIFO strategy and show its competitiveness to be $\Theta(\sqrt{n})$, which
    is optimal for the considered class of algorithms.For $k=2$ types it achieves
    a constant competitiveness.Our main insight is obtained by an analysis of the
    smoothed competitiveness.If processing times $p_j$ are independently perturbed
    to $\hat p_j = (1+X_j)p_j$, we obtain a competitiveness of $O(\sigma^{-2} \log^2
    n)$ when $X_j$ is drawn from a uniform or a (truncated) normal distribution with
    standard deviation $\sigma$.The result proves that bad instances are fragile and
    ``practically'' one might expect a much better performance than given by the $\Omega(\sqrt{n})$-bound.
author:
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- first_name: Manuel
  full_name: Malatyali, Manuel
  last_name: Malatyali
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
citation:
  ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-Clairvoyant
    Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In: <i>Proceedings
    of the 15th Workshop on Approximation and Online Algorithms (WAOA)</i>. Vol 10787.
    Lecture Notes in Computer Science. Springer; 2017:207-222. doi:<a href="https://doi.org/10.1007/978-3-319-89441-6">10.1007/978-3-319-89441-6</a>'
  apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2017).
    Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.
    In <i>Proceedings of the 15th Workshop on Approximation and Online Algorithms
    (WAOA)</i> (Vol. 10787, pp. 207–222). Springer. <a href="https://doi.org/10.1007/978-3-319-89441-6">https://doi.org/10.1007/978-3-319-89441-6</a>
  bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, series={Lecture
    Notes in Computer Science}, title={Non-Clairvoyant Scheduling to Minimize Max
    Flow Time on a Machine with Setup Times}, volume={10787}, DOI={<a href="https://doi.org/10.1007/978-3-319-89441-6">10.1007/978-3-319-89441-6</a>},
    booktitle={Proceedings of the 15th Workshop on Approximation and Online Algorithms
    (WAOA)}, publisher={Springer}, author={Mäcker, Alexander and Malatyali, Manuel
    and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2017}, pages={207–222},
    collection={Lecture Notes in Computer Science} }'
  chicago: Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
    Sören Riechers. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine
    with Setup Times.” In <i>Proceedings of the 15th Workshop on Approximation and
    Online Algorithms (WAOA)</i>, 10787:207–22. Lecture Notes in Computer Science.
    Springer, 2017. <a href="https://doi.org/10.1007/978-3-319-89441-6">https://doi.org/10.1007/978-3-319-89441-6</a>.
  ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-Clairvoyant
    Scheduling to Minimize Max Flow Time on a Machine with Setup Times,” in <i>Proceedings
    of the 15th Workshop on Approximation and Online Algorithms (WAOA)</i>, 2017,
    vol. 10787, pp. 207–222.
  mla: Mäcker, Alexander, et al. “Non-Clairvoyant Scheduling to Minimize Max Flow
    Time on a Machine with Setup Times.” <i>Proceedings of the 15th Workshop on Approximation
    and Online Algorithms (WAOA)</i>, vol. 10787, Springer, 2017, pp. 207–22, doi:<a
    href="https://doi.org/10.1007/978-3-319-89441-6">10.1007/978-3-319-89441-6</a>.
  short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings
    of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer,
    2017, pp. 207–222.'
date_created: 2017-10-17T12:41:06Z
date_updated: 2022-01-06T07:03:47Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-89441-6
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:59:22Z
  date_updated: 2018-11-02T14:59:22Z
  file_id: '5289'
  file_name: Non-clairvoyantSchedulingToMin.pdf
  file_size: 380629
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:59:22Z
has_accepted_license: '1'
intvolume: '     10787'
language:
- iso: eng
page: 207-222
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 15th Workshop on Approximation and Online Algorithms
  (WAOA)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup
  Times
type: conference
user_id: '477'
volume: 10787
year: '2017'
...
---
_id: '5695'
article_number: '2'
author:
- first_name: Bahar
  full_name: Jazayeri, Bahar
  id: '36399'
  last_name: Jazayeri
- first_name: Simon
  full_name: Schwichtenberg, Simon
  id: '13235'
  last_name: Schwichtenberg
citation:
  ama: 'Jazayeri B, Schwichtenberg S. On the Necessity of an Architecture Framework
    for On-The-Fly Computing. In: <i>Proceedings of Softwaretechnik-Trends Workshops</i>.
    Vol 37. Bad Honnef, Germany: Gesellschaft für Informatik eV, Fachgruppe PARS;
    2017.'
  apa: 'Jazayeri, B., &#38; Schwichtenberg, S. (2017). On the Necessity of an Architecture
    Framework for On-The-Fly Computing. In <i>Proceedings of Softwaretechnik-Trends
    Workshops</i> (Vol. 37). Bad Honnef, Germany: Gesellschaft für Informatik eV,
    Fachgruppe PARS.'
  bibtex: '@inproceedings{Jazayeri_Schwichtenberg_2017, place={Bad Honnef, Germany},
    title={On the Necessity of an Architecture Framework for On-The-Fly Computing},
    volume={37}, number={2}, booktitle={Proceedings of Softwaretechnik-Trends Workshops},
    publisher={Gesellschaft für Informatik eV, Fachgruppe PARS}, author={Jazayeri,
    Bahar and Schwichtenberg, Simon}, year={2017} }'
  chicago: 'Jazayeri, Bahar, and Simon Schwichtenberg. “On the Necessity of an Architecture
    Framework for On-The-Fly Computing.” In <i>Proceedings of Softwaretechnik-Trends
    Workshops</i>, Vol. 37. Bad Honnef, Germany: Gesellschaft für Informatik eV, Fachgruppe
    PARS, 2017.'
  ieee: B. Jazayeri and S. Schwichtenberg, “On the Necessity of an Architecture Framework
    for On-The-Fly Computing,” in <i>Proceedings of Softwaretechnik-Trends Workshops</i>,
    2017, vol. 37.
  mla: Jazayeri, Bahar, and Simon Schwichtenberg. “On the Necessity of an Architecture
    Framework for On-The-Fly Computing.” <i>Proceedings of Softwaretechnik-Trends
    Workshops</i>, vol. 37, 2, Gesellschaft für Informatik eV, Fachgruppe PARS, 2017.
  short: 'B. Jazayeri, S. Schwichtenberg, in: Proceedings of Softwaretechnik-Trends
    Workshops, Gesellschaft für Informatik eV, Fachgruppe PARS, Bad Honnef, Germany,
    2017.'
date_created: 2018-11-15T09:06:51Z
date_updated: 2022-01-06T07:02:35Z
ddc:
- '040'
department:
- _id: '66'
file:
- access_level: closed
  content_type: application/pdf
  creator: bahareh
  date_created: 2018-11-15T09:08:46Z
  date_updated: 2018-11-15T09:08:46Z
  file_id: '5696'
  file_name: Jazayeri_DFF2017.pdf
  file_size: 65506
  relation: main_file
  success: 1
file_date_updated: 2018-11-15T09:08:46Z
has_accepted_license: '1'
intvolume: '        37'
language:
- iso: eng
place: Bad Honnef, Germany
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '17'
  name: SFB 901 - Subproject C5
publication: Proceedings of Softwaretechnik-Trends Workshops
publisher: Gesellschaft für Informatik eV, Fachgruppe PARS
status: public
title: On the Necessity of an Architecture Framework for On-The-Fly Computing
type: conference
user_id: '36399'
volume: 37
year: '2017'
...
---
_id: '58'
abstract:
- lang: eng
  text: Network function virtualization and software-defined networking allow services
    consisting of virtual network functions to be designed and implemented with great
    flexibility by facilitating automatic deployments, migrations, and reconfigurations
    for services and their components. For extended flexibility, we go beyond seeing
    services as a fixed chain of functions. We define the service structure in a flexible
    way that enables changing the order of functions in case the functionality of
    the service is not influenced by this, and propose a YANG data model for expressing
    this flexibility. Flexible structures allow the network orchestration system to
    choose the optimal composition of service components that for example gives the
    best results for placement of services in the network. When number of flexible
    services and number of components in each service increase, combinatorial explosion
    limits the practical use of this flexibility. In this paper, we describe a selection
    heuristic that gives a Pareto set of the possible compositions of a service as
    well as possible combinations of different services, with respect to different
    optimization objectives. Moreover, we present a heuristic algorithm for placement
    of a combination of services, which aims at placing service components along shortest
    paths that have enough capacity for accommodating the services. By applying these
    solutions, we show that allowing flexibility in the service structure is feasible.
author:
- first_name: Sevil
  full_name: Dräxler, Sevil
  id: '31764'
  last_name: Dräxler
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: Dräxler S, Karl H. Specification, Composition, and Placement of Network Services
    with Flexible Structures. <i>International Journal of Network Management</i>.
    2017;(2):1--16. doi:<a href="https://doi.org/10.1002/nem.1963">10.1002/nem.1963</a>
  apa: Dräxler, S., &#38; Karl, H. (2017). Specification, Composition, and Placement
    of Network Services with Flexible Structures. <i>International Journal of Network
    Management</i>, (2), 1--16. <a href="https://doi.org/10.1002/nem.1963">https://doi.org/10.1002/nem.1963</a>
  bibtex: '@article{Dräxler_Karl_2017, title={Specification, Composition, and Placement
    of Network Services with Flexible Structures}, DOI={<a href="https://doi.org/10.1002/nem.1963">10.1002/nem.1963</a>},
    number={2}, journal={International Journal of Network Management}, publisher={Wiley
    Online Library}, author={Dräxler, Sevil and Karl, Holger}, year={2017}, pages={1--16}
    }'
  chicago: 'Dräxler, Sevil, and Holger Karl. “Specification, Composition, and Placement
    of Network Services with Flexible Structures.” <i>International Journal of Network
    Management</i>, no. 2 (2017): 1--16. <a href="https://doi.org/10.1002/nem.1963">https://doi.org/10.1002/nem.1963</a>.'
  ieee: S. Dräxler and H. Karl, “Specification, Composition, and Placement of Network
    Services with Flexible Structures,” <i>International Journal of Network Management</i>,
    no. 2, pp. 1--16, 2017.
  mla: Dräxler, Sevil, and Holger Karl. “Specification, Composition, and Placement
    of Network Services with Flexible Structures.” <i>International Journal of Network
    Management</i>, no. 2, Wiley Online Library, 2017, pp. 1--16, doi:<a href="https://doi.org/10.1002/nem.1963">10.1002/nem.1963</a>.
  short: S. Dräxler, H. Karl, International Journal of Network Management (2017) 1--16.
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:02:42Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1002/nem.1963
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T13:18:13Z
  date_updated: 2018-06-13T09:15:42Z
  file_id: '1579'
  file_name: 58-preprint-ijnm.pdf
  file_size: 2765738
  relation: hidden
- access_level: open_access
  content_type: application/pdf
  creator: sevilmeh
  date_created: 2018-06-13T09:22:37Z
  date_updated: 2018-06-13T09:22:37Z
  file_id: '3197'
  file_name: 58-accepted-ijnm.pdf
  file_size: 2766920
  relation: main_file
file_date_updated: 2018-06-13T09:22:37Z
has_accepted_license: '1'
issue: '2'
oa: '1'
page: 1--16
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '25'
  call_identifier: 5G PPP Phase 1
  grant_number: '671517'
  name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
    Networks'
publication: International Journal of Network Management
publisher: Wiley Online Library
status: public
title: Specification, Composition, and Placement of Network Services with Flexible
  Structures
type: journal_article
urn: '582'
user_id: '477'
year: '2017'
...
---
_id: '59'
abstract:
- lang: eng
  text: We consider a scheduling problem on $m$ identical processors sharing an arbitrarily
    divisible resource. In addition to assigning jobs to processors, the scheduler
    must distribute the resource among the processors (e.g., for three processors
    in shares of 20\%, 15\%, and 65\%) and adjust this distribution over time. Each
    job $j$ comes with a size $p_j \in \mathbb{R}$ and a resource requirement $r_j
    > 0$. Jobs do not benefit when receiving a share larger than $r_j$ of the resource.
    But providing them with a fraction of the resource requirement causes a linear
    decrease in the processing efficiency. We seek a (non-preemptive) job and resource
    assignment minimizing the makespan.Our main result is an efficient approximation
    algorithm which achieves an approximation ratio of $2 + 1/(m-2)$. It can be improved
    to an (asymptotic) ratio of $1 + 1/(m-1)$ if all jobs have unit size. Our algorithms
    also imply new results for a well-known bin packing problem with splittable items
    and a restricted number of allowed item parts per bin.Based upon the above solution,
    we also derive an approximation algorithm with similar guarantees for a setting
    in which we introduce so-called tasks each containing several jobs and where we
    are interested in the average completion time of tasks (a task is completed when
    all its jobs are completed).
author:
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: 'Kling P, Mäcker A, Riechers S, Skopalik A. Sharing is Caring: Multiprocessor
    Scheduling with a Sharable Resource. In: <i>Proceedings of the 29th ACM Symposium
    on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2017:123--132. doi:<a
    href="https://doi.org/10.1145/3087556.3087578">10.1145/3087556.3087578</a>'
  apa: 'Kling, P., Mäcker, A., Riechers, S., &#38; Skopalik, A. (2017). Sharing is
    Caring: Multiprocessor Scheduling with a Sharable Resource. In <i>Proceedings
    of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>
    (pp. 123--132). <a href="https://doi.org/10.1145/3087556.3087578">https://doi.org/10.1145/3087556.3087578</a>'
  bibtex: '@inproceedings{Kling_Mäcker_Riechers_Skopalik_2017, title={Sharing is Caring:
    Multiprocessor Scheduling with a Sharable Resource}, DOI={<a href="https://doi.org/10.1145/3087556.3087578">10.1145/3087556.3087578</a>},
    booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)}, author={Kling, Peter and Mäcker, Alexander and Riechers,
    Sören and Skopalik, Alexander}, year={2017}, pages={123--132} }'
  chicago: 'Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik.
    “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In <i>Proceedings
    of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>,
    123--132, 2017. <a href="https://doi.org/10.1145/3087556.3087578">https://doi.org/10.1145/3087556.3087578</a>.'
  ieee: 'P. Kling, A. Mäcker, S. Riechers, and A. Skopalik, “Sharing is Caring: Multiprocessor
    Scheduling with a Sharable Resource,” in <i>Proceedings of the 29th ACM Symposium
    on Parallelism in Algorithms and Architectures (SPAA)</i>, 2017, pp. 123--132.'
  mla: 'Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a
    Sharable Resource.” <i>Proceedings of the 29th ACM Symposium on Parallelism in
    Algorithms and Architectures (SPAA)</i>, 2017, pp. 123--132, doi:<a href="https://doi.org/10.1145/3087556.3087578">10.1145/3087556.3087578</a>.'
  short: 'P. Kling, A. Mäcker, S. Riechers, A. Skopalik, in: Proceedings of the 29th
    ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp.
    123--132.'
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:02:46Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1145/3087556.3087578
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T13:17:33Z
  date_updated: 2018-03-21T13:17:33Z
  file_id: '1578'
  file_name: 59-progress.pdf
  file_size: 784867
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T13:17:33Z
has_accepted_license: '1'
language:
- iso: eng
page: 123--132
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
status: public
title: 'Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource'
type: conference
user_id: '477'
year: '2017'
...
---
_id: '60'
author:
- first_name: David
  full_name: Niehus, David
  last_name: Niehus
citation:
  ama: Niehus D. <i>Semantically Secure Attribute-Based Searchable Encryption</i>.
    Universität Paderborn; 2017.
  apa: Niehus, D. (2017). <i>Semantically Secure Attribute-based Searchable Encryption</i>.
    Universität Paderborn.
  bibtex: '@book{Niehus_2017, title={Semantically Secure Attribute-based Searchable
    Encryption}, publisher={Universität Paderborn}, author={Niehus, David}, year={2017}
    }'
  chicago: Niehus, David. <i>Semantically Secure Attribute-Based Searchable Encryption</i>.
    Universität Paderborn, 2017.
  ieee: D. Niehus, <i>Semantically Secure Attribute-based Searchable Encryption</i>.
    Universität Paderborn, 2017.
  mla: Niehus, David. <i>Semantically Secure Attribute-Based Searchable Encryption</i>.
    Universität Paderborn, 2017.
  short: D. Niehus, Semantically Secure Attribute-Based Searchable Encryption, Universität
    Paderborn, 2017.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:02:49Z
department:
- _id: '64'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Semantically Secure Attribute-based Searchable Encryption
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '62'
author:
- first_name: Eduard
  full_name: Weis, Eduard
  last_name: Weis
citation:
  ama: Weis E. <i>Searchable Encryption</i>. Universität Paderborn; 2017.
  apa: Weis, E. (2017). <i>Searchable Encryption</i>. Universität Paderborn.
  bibtex: '@book{Weis_2017, title={Searchable Encryption}, publisher={Universität
    Paderborn}, author={Weis, Eduard}, year={2017} }'
  chicago: Weis, Eduard. <i>Searchable Encryption</i>. Universität Paderborn, 2017.
  ieee: E. Weis, <i>Searchable Encryption</i>. Universität Paderborn, 2017.
  mla: Weis, Eduard. <i>Searchable Encryption</i>. Universität Paderborn, 2017.
  short: E. Weis, Searchable Encryption, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:02:56Z
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Searchable Encryption
type: mastersthesis
user_id: '15504'
year: '2017'
...
---
_id: '64'
abstract:
- lang: eng
  text: 'A current trend in networking and cloud computing is to provide compute resources
    at widely distributed sites; this is exemplified by developments such as Network
    Function Virtualisation. This paves the way for wide-area service deployments
    with improved service quality: e.g. user-perceived response times can be reduced
    by offering services at nearby sites. But always assigning users to the nearest
    site can be a bad decision if this site is already highly utilised. This paper
    formalises two related decisions of allocating compute resources at different
    sites and assigning users to them with the goal of minimising the response times
    while the total number of resources to be allocated is limited – a non-linear
    capacitated Facility Location Problem with integrated queuing systems. To efficiently
    handle its non-linearity, we introduce five linear problem linearisations and
    adapt the currently best heuristic for a similar scenario to our scenario. All
    six approaches are compared in experiments for solution quality and solving time.
    Surprisingly, our best optimisation formulation outperforms the heuristic in both
    time and quality. Additionally, we evaluate the influence of distributions of
    available compute resources in the network on the response time: The time was
    halved for some configurations. The presented formulation techniques for our problem
    linearisations are applicable to a broader optimisation domain.'
author:
- first_name: Matthias
  full_name: Keller, Matthias
  last_name: Keller
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Keller M, Karl H. Response-Time-Optimised Service Deployment: MILP Formulations
    of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer
    Functions. <i>IEEE Transactions on Network and Service Management</i>. 2017;(1):121--135.
    doi:<a href="https://doi.org/10.1109/TNSM.2016.2611590">10.1109/TNSM.2016.2611590</a>'
  apa: 'Keller, M., &#38; Karl, H. (2017). Response-Time-Optimised Service Deployment:
    MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate
    Mixed-integer Functions. <i>IEEE Transactions on Network and Service Management</i>,
    (1), 121--135. <a href="https://doi.org/10.1109/TNSM.2016.2611590">https://doi.org/10.1109/TNSM.2016.2611590</a>'
  bibtex: '@article{Keller_Karl_2017, title={Response-Time-Optimised Service Deployment:
    MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate
    Mixed-integer Functions}, DOI={<a href="https://doi.org/10.1109/TNSM.2016.2611590">10.1109/TNSM.2016.2611590</a>},
    number={1}, journal={IEEE Transactions on Network and Service Management}, publisher={IEEE},
    author={Keller, Matthias and Karl, Holger}, year={2017}, pages={121--135} }'
  chicago: 'Keller, Matthias, and Holger Karl. “Response-Time-Optimised Service Deployment:
    MILP Formulations of Piece-Wise Linear Functions Approximating Non-Linear Bivariate
    Mixed-Integer Functions.” <i>IEEE Transactions on Network and Service Management</i>,
    no. 1 (2017): 121--135. <a href="https://doi.org/10.1109/TNSM.2016.2611590">https://doi.org/10.1109/TNSM.2016.2611590</a>.'
  ieee: 'M. Keller and H. Karl, “Response-Time-Optimised Service Deployment: MILP
    Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate
    Mixed-integer Functions,” <i>IEEE Transactions on Network and Service Management</i>,
    no. 1, pp. 121--135, 2017.'
  mla: 'Keller, Matthias, and Holger Karl. “Response-Time-Optimised Service Deployment:
    MILP Formulations of Piece-Wise Linear Functions Approximating Non-Linear Bivariate
    Mixed-Integer Functions.” <i>IEEE Transactions on Network and Service Management</i>,
    no. 1, IEEE, 2017, pp. 121--135, doi:<a href="https://doi.org/10.1109/TNSM.2016.2611590">10.1109/TNSM.2016.2611590</a>.'
  short: M. Keller, H. Karl, IEEE Transactions on Network and Service Management (2017)
    121--135.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:03:03Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/TNSM.2016.2611590
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T13:15:53Z
  date_updated: 2018-03-21T13:15:53Z
  file_id: '1576'
  file_name: 64-07572217.pdf
  file_size: 1505773
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T13:15:53Z
has_accepted_license: '1'
issue: '1'
page: 121--135
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
publication: IEEE Transactions on Network and Service Management
publisher: IEEE
status: public
title: 'Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise
  Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions'
type: journal_article
user_id: '477'
year: '2017'
...
---
_id: '49'
abstract:
- lang: eng
  text: A multiplicity of visual languages have been proposed for representing business
    models. These languages are claimed to facilitate tasks such as understanding,
    communicating, and innovating a business model; and have been developed rather
    independently by scholars from accounting, computer science, information systems,
    and strategy. Consequently, the existing approaches greatly differ and to some
    extent contradict each other, for example, regarding their understanding of the
    business model concept, their terminology, and their visual notations – which
    means there is little common ground for developing a cumulative stream of research.
    Therefore, we provide a systematic, cross-disciplinary review of this emerging
    field and synthesize the pragmatic, semantic, and syntactic foundations of the
    proposed approaches. Further, we derive an agenda for future research and discuss
    the challenges that lie ahead to advance the field.
author:
- first_name: Thomas
  full_name: John, Thomas
  id: '3952'
  last_name: John
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
- first_name: Daniel
  full_name: Szopinski, Daniel
  id: '36372'
  last_name: Szopinski
citation:
  ama: 'John T, Kundisch D, Szopinski D. Visual Languages for Modeling Business Models:
    A Critical Review and Future Research Directions. In: <i>Proceedings of the 38th
    International Conference on Information Systems (ICIS), Seoul, South Korea</i>.
    ; 2017.'
  apa: 'John, T., Kundisch, D., &#38; Szopinski, D. (2017). Visual Languages for Modeling
    Business Models: A Critical Review and Future Research Directions. In <i>Proceedings
    of the 38th International Conference on Information Systems (ICIS), Seoul, South
    Korea</i>.'
  bibtex: '@inproceedings{John_Kundisch_Szopinski_2017, title={Visual Languages for
    Modeling Business Models: A Critical Review and Future Research Directions}, booktitle={Proceedings
    of the 38th International Conference on Information Systems (ICIS), Seoul, South
    Korea}, author={John, Thomas and Kundisch, Dennis and Szopinski, Daniel}, year={2017}
    }'
  chicago: 'John, Thomas, Dennis Kundisch, and Daniel Szopinski. “Visual Languages
    for Modeling Business Models: A Critical Review and Future Research Directions.”
    In <i>Proceedings of the 38th International Conference on Information Systems
    (ICIS), Seoul, South Korea</i>, 2017.'
  ieee: 'T. John, D. Kundisch, and D. Szopinski, “Visual Languages for Modeling Business
    Models: A Critical Review and Future Research Directions,” in <i>Proceedings of
    the 38th International Conference on Information Systems (ICIS), Seoul, South
    Korea</i>, 2017.'
  mla: 'John, Thomas, et al. “Visual Languages for Modeling Business Models: A Critical
    Review and Future Research Directions.” <i>Proceedings of the 38th International
    Conference on Information Systems (ICIS), Seoul, South Korea</i>, 2017.'
  short: 'T. John, D. Kundisch, D. Szopinski, in: Proceedings of the 38th International
    Conference on Information Systems (ICIS), Seoul, South Korea, 2017.'
date_created: 2017-10-17T12:41:00Z
date_updated: 2022-01-06T07:01:28Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: dsz
  date_created: 2018-11-12T13:21:25Z
  date_updated: 2018-11-12T13:21:25Z
  file_id: '5501'
  file_name: ICIS2017_BMML.pdf
  file_size: 754019
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T13:21:25Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '17'
  name: SFB 901 - Subprojekt C5
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 38th International Conference on Information Systems
  (ICIS), Seoul, South Korea
status: public
title: 'Visual Languages for Modeling Business Models: A Critical Review and Future
  Research Directions'
type: conference
user_id: '16205'
year: '2017'
...
---
_id: '698'
author:
- first_name: Ngoc Chi
  full_name: Banh, Ngoc Chi
  last_name: Banh
citation:
  ama: Banh NC. <i>As Asynchronous Adaption of a Churn-Resistant Overlay Network</i>.
    Universität Paderborn; 2017.
  apa: Banh, N. C. (2017). <i>As Asynchronous Adaption of a Churn-resistant Overlay
    Network</i>. Universität Paderborn.
  bibtex: '@book{Banh_2017, title={As Asynchronous Adaption of a Churn-resistant Overlay
    Network}, publisher={Universität Paderborn}, author={Banh, Ngoc Chi}, year={2017}
    }'
  chicago: Banh, Ngoc Chi. <i>As Asynchronous Adaption of a Churn-Resistant Overlay
    Network</i>. Universität Paderborn, 2017.
  ieee: N. C. Banh, <i>As Asynchronous Adaption of a Churn-resistant Overlay Network</i>.
    Universität Paderborn, 2017.
  mla: Banh, Ngoc Chi. <i>As Asynchronous Adaption of a Churn-Resistant Overlay Network</i>.
    Universität Paderborn, 2017.
  short: N.C. Banh, As Asynchronous Adaption of a Churn-Resistant Overlay Network,
    Universität Paderborn, 2017.
date_created: 2017-11-14T08:02:46Z
date_updated: 2022-01-06T07:03:25Z
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: As Asynchronous Adaption of a Churn-resistant Overlay Network
type: bachelorsthesis
user_id: '15504'
year: '2017'
...
---
_id: '704'
author:
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
citation:
  ama: Riechers S. <i>Scheduling with Scarce Resources</i>. Universität Paderborn;
    2017. doi:<a href="https://doi.org/10.17619/UNIPB/1-231">10.17619/UNIPB/1-231</a>
  apa: Riechers, S. (2017). <i>Scheduling with Scarce Resources</i>. Universität Paderborn.
    <a href="https://doi.org/10.17619/UNIPB/1-231">https://doi.org/10.17619/UNIPB/1-231</a>
  bibtex: '@book{Riechers_2017, title={Scheduling with Scarce Resources}, DOI={<a
    href="https://doi.org/10.17619/UNIPB/1-231">10.17619/UNIPB/1-231</a>}, publisher={Universität
    Paderborn}, author={Riechers, Sören}, year={2017} }'
  chicago: Riechers, Sören. <i>Scheduling with Scarce Resources</i>. Universität Paderborn,
    2017. <a href="https://doi.org/10.17619/UNIPB/1-231">https://doi.org/10.17619/UNIPB/1-231</a>.
  ieee: S. Riechers, <i>Scheduling with Scarce Resources</i>. Universität Paderborn,
    2017.
  mla: Riechers, Sören. <i>Scheduling with Scarce Resources</i>. Universität Paderborn,
    2017, doi:<a href="https://doi.org/10.17619/UNIPB/1-231">10.17619/UNIPB/1-231</a>.
  short: S. Riechers, Scheduling with Scarce Resources, Universität Paderborn, 2017.
date_created: 2017-11-15T07:51:07Z
date_updated: 2022-01-06T07:03:27Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.17619/UNIPB/1-231
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-11-14T15:18:37Z
  date_updated: 2018-11-14T15:18:37Z
  file_id: '5673'
  file_name: thesisStable.pdf
  file_size: 1491627
  relation: main_file
  success: 1
file_date_updated: 2018-11-14T15:18:37Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Scheduling with Scarce Resources
type: dissertation
user_id: '14052'
year: '2017'
...
---
_id: '706'
author:
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- first_name: Manuel
  full_name: Malatyali, Manuel
  last_name: Malatyali
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
citation:
  ama: Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling
    on Machines from the Cloud. <i>Journal of Combinatorial Optimization</i>. 2017;36(4):1168-1194.
    doi:<a href="https://doi.org/10.1007/s10878-017-0198-x">10.1007/s10878-017-0198-x</a>
  apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2017).
    Cost-efficient Scheduling on Machines from the Cloud. <i>Journal of Combinatorial
    Optimization</i>, <i>36</i>(4), 1168–1194. <a href="https://doi.org/10.1007/s10878-017-0198-x">https://doi.org/10.1007/s10878-017-0198-x</a>
  bibtex: '@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, title={Cost-efficient
    Scheduling on Machines from the Cloud}, volume={36}, DOI={<a href="https://doi.org/10.1007/s10878-017-0198-x">10.1007/s10878-017-0198-x</a>},
    number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer},
    author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm
    and Riechers, Sören}, year={2017}, pages={1168–1194} }'
  chicago: 'Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
    Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” <i>Journal
    of Combinatorial Optimization</i> 36, no. 4 (2017): 1168–94. <a href="https://doi.org/10.1007/s10878-017-0198-x">https://doi.org/10.1007/s10878-017-0198-x</a>.'
  ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient
    Scheduling on Machines from the Cloud,” <i>Journal of Combinatorial Optimization</i>,
    vol. 36, no. 4, pp. 1168–1194, 2017.
  mla: Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”
    <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, Springer, 2017,
    pp. 1168–94, doi:<a href="https://doi.org/10.1007/s10878-017-0198-x">10.1007/s10878-017-0198-x</a>.
  short: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, Journal of
    Combinatorial Optimization 36 (2017) 1168–1194.
date_created: 2017-11-15T10:21:34Z
date_updated: 2022-01-06T07:03:27Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/s10878-017-0198-x
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-14T12:21:34Z
  date_updated: 2018-03-14T12:21:34Z
  file_id: '1210'
  file_name: 706-chp_3A10.1007_2F978-3-319-48749-6_42.pdf
  file_size: 608614
  relation: main_file
  success: 1
file_date_updated: 2018-03-14T12:21:34Z
has_accepted_license: '1'
intvolume: '        36'
issue: '4'
language:
- iso: eng
page: 1168-1194
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
publisher: Springer
status: public
title: Cost-efficient Scheduling on Machines from the Cloud
type: journal_article
user_id: '15415'
volume: 36
year: '2017'
...
---
_id: '717'
abstract:
- lang: eng
  text: In conventional large-scale networks, creation and management of network services
    are costly and complex tasks that often consume a lot of resources, including
    time and manpower. Network softwarization and network function virtualization
    have been introduced to tackle these problems, aiming at decreasing costs and
    complexity of implementing new services, maintaining the implemented services,
    and managing available resources in service provisioning platforms and underlying
    infrastructures. To experience the full potential of these approaches, innovative
    development support tools and service provisioning environments are needed. To
    answer these needs, we introduce the architecture of the open-source SONATA system,
    a service programming, orchestration, and management framework. We present a development
    toolchain for virtualized network services, fully integrated with a service platform
    and orchestration system. We introduce the modular and flexible architecture of
    our system and discuss its main components and features, such as function- and
    service-specific managers that allow fine-grained service management, slicing
    support to facilitate multi-tenancy, recursiveness for improved scalability, and
    full-featured DevOps support.
author:
- first_name: Sevil
  full_name: Dräxler, Sevil
  id: '31764'
  last_name: Dräxler
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
- first_name: Manuel
  full_name: Peuster, Manuel
  id: '13271'
  last_name: Peuster
- first_name: Hadi
  full_name: Razzaghi Kouchaksaraei, Hadi
  id: '60845'
  last_name: Razzaghi Kouchaksaraei
- first_name: Michael
  full_name: Bredel, Michael
  last_name: Bredel
- first_name: Johannes
  full_name: Lessmann, Johannes
  last_name: Lessmann
- first_name: Thomas
  full_name: Soenen, Thomas
  last_name: Soenen
- first_name: Wouter
  full_name: Tavernier, Wouter
  last_name: Tavernier
- first_name: Sharon
  full_name: Mendel-Brin, Sharon
  last_name: Mendel-Brin
- first_name: George
  full_name: Xilouris, George
  last_name: Xilouris
citation:
  ama: 'Dräxler S, Karl H, Peuster M, et al. SONATA: Service programming and orchestration
    for virtualized software networks. In: <i>2017 IEEE International Conference on
    Communications Workshops (ICC Workshops)</i>. IEEE; 2017. doi:<a href="https://doi.org/10.1109/iccw.2017.7962785">10.1109/iccw.2017.7962785</a>'
  apa: 'Dräxler, S., Karl, H., Peuster, M., Razzaghi Kouchaksaraei, H., Bredel, M.,
    Lessmann, J., … Xilouris, G. (2017). SONATA: Service programming and orchestration
    for virtualized software networks. In <i>2017 IEEE International Conference on
    Communications Workshops (ICC Workshops)</i>. Paris, France: IEEE. <a href="https://doi.org/10.1109/iccw.2017.7962785">https://doi.org/10.1109/iccw.2017.7962785</a>'
  bibtex: '@inproceedings{Dräxler_Karl_Peuster_Razzaghi Kouchaksaraei_Bredel_Lessmann_Soenen_Tavernier_Mendel-Brin_Xilouris_2017,
    title={SONATA: Service programming and orchestration for virtualized software
    networks}, DOI={<a href="https://doi.org/10.1109/iccw.2017.7962785">10.1109/iccw.2017.7962785</a>},
    booktitle={2017 IEEE International Conference on Communications Workshops (ICC
    Workshops)}, publisher={IEEE}, author={Dräxler, Sevil and Karl, Holger and Peuster,
    Manuel and Razzaghi Kouchaksaraei, Hadi and Bredel, Michael and Lessmann, Johannes
    and Soenen, Thomas and Tavernier, Wouter and Mendel-Brin, Sharon and Xilouris,
    George}, year={2017} }'
  chicago: 'Dräxler, Sevil, Holger Karl, Manuel Peuster, Hadi Razzaghi Kouchaksaraei,
    Michael Bredel, Johannes Lessmann, Thomas Soenen, Wouter Tavernier, Sharon Mendel-Brin,
    and George Xilouris. “SONATA: Service Programming and Orchestration for Virtualized
    Software Networks.” In <i>2017 IEEE International Conference on Communications
    Workshops (ICC Workshops)</i>. IEEE, 2017. <a href="https://doi.org/10.1109/iccw.2017.7962785">https://doi.org/10.1109/iccw.2017.7962785</a>.'
  ieee: 'S. Dräxler <i>et al.</i>, “SONATA: Service programming and orchestration
    for virtualized software networks,” in <i>2017 IEEE International Conference on
    Communications Workshops (ICC Workshops)</i>, Paris, France, 2017.'
  mla: 'Dräxler, Sevil, et al. “SONATA: Service Programming and Orchestration for
    Virtualized Software Networks.” <i>2017 IEEE International Conference on Communications
    Workshops (ICC Workshops)</i>, IEEE, 2017, doi:<a href="https://doi.org/10.1109/iccw.2017.7962785">10.1109/iccw.2017.7962785</a>.'
  short: 'S. Dräxler, H. Karl, M. Peuster, H. Razzaghi Kouchaksaraei, M. Bredel, J.
    Lessmann, T. Soenen, W. Tavernier, S. Mendel-Brin, G. Xilouris, in: 2017 IEEE
    International Conference on Communications Workshops (ICC Workshops), IEEE, 2017.'
conference:
  end_date: 2017-05-25
  location: Paris, France
  name: 2017 IEEE International Conference on Communications Workshops (ICC Workshops)
  start_date: 2017-05-21
date_created: 2017-11-22T09:42:59Z
date_updated: 2022-01-06T07:03:28Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/iccw.2017.7962785
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:22:10Z
  date_updated: 2018-11-02T14:22:10Z
  file_id: '5270'
  file_name: 07962785.pdf
  file_size: 821211
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:22:10Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/pdf/1605.05850.pdf
oa: '1'
project:
- _id: '25'
  call_identifier: 5G PPP Phase 1
  grant_number: '671517'
  name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
    Networks'
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
publication: 2017 IEEE International Conference on Communications Workshops (ICC Workshops)
publication_identifier:
  isbn:
  - '9781509015252'
publication_status: published
publisher: IEEE
status: public
title: 'SONATA: Service programming and orchestration for virtualized software networks'
type: conference
user_id: '31764'
year: '2017'
...