---
_id: '2850'
author:
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Mostafa
  full_name: Wahby, Mostafa
  last_name: Wahby
citation:
  ama: 'Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, &#38; Survive:
    Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets.
    In: <i>Ninth International Conference on Fun with Algorithms (FUN)</i>. ; 2018.
    doi:<a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>'
  apa: 'Hamann, H., Markarian, C., Meyer auf der Heide, F., &#38; Wahby, M. (2018).
    Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online
    Connected Dominating Sets. In <i>Ninth International Conference on Fun with Algorithms
    (FUN)</i>. <a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>'
  bibtex: '@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick,
    Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected
    Dominating Sets}, DOI={<a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>},
    booktitle={Ninth International Conference on Fun with Algorithms (FUN)}, author={Hamann,
    Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa},
    year={2018} }'
  chicago: 'Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and
    Mostafa Wahby. “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse
    Based on Online Connected Dominating Sets.” In <i>Ninth International Conference
    on Fun with Algorithms (FUN)</i>, 2018. <a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>.'
  ieee: 'H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack,
    &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected
    Dominating Sets,” in <i>Ninth International Conference on Fun with Algorithms
    (FUN)</i>, 2018.'
  mla: 'Hamann, Heiko, et al. “Pick, Pack, &#38; Survive: Charging Robots in a Modern
    Warehouse Based on Online Connected Dominating Sets.” <i>Ninth International Conference
    on Fun with Algorithms (FUN)</i>, 2018, doi:<a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>.'
  short: 'H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International
    Conference on Fun with Algorithms (FUN), 2018.'
date_created: 2018-05-24T08:41:48Z
date_updated: 2022-01-06T06:58:07Z
ddc:
- '000'
department:
- _id: '63'
- _id: '238'
doi: 10.4230/LIPIcs.FUN.2018.22
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-11-13T13:15:19Z
  date_updated: 2018-11-13T13:15:19Z
  file_id: '5536'
  file_name: LIPIcs-FUN-2018-22.pdf
  file_size: 554298
  relation: main_file
  success: 1
file_date_updated: 2018-11-13T13:15:19Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Ninth International Conference on Fun with Algorithms (FUN)
status: public
title: 'Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online
  Connected Dominating Sets'
type: conference
user_id: '15415'
year: '2018'
...
---
_id: '2857'
author:
- first_name: Felix
  full_name: Mohr, Felix
  last_name: Mohr
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
- first_name: Marcel Dominik
  full_name: Wever, Marcel Dominik
  id: '33176'
  last_name: Wever
  orcid: ' https://orcid.org/0000-0001-9782-6818'
citation:
  ama: 'Mohr F, Lettmann T, Hüllermeier E, Wever MD. Programmatic Task Network Planning.
    In: <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>. AAAI;
    2018:31-39.'
  apa: 'Mohr, F., Lettmann, T., Hüllermeier, E., &#38; Wever, M. D. (2018). Programmatic
    Task Network Planning. In <i>Proceedings of the 1st ICAPS Workshop on Hierarchical
    Planning</i> (pp. 31–39). Delft, Netherlands: AAAI.'
  bibtex: '@inproceedings{Mohr_Lettmann_Hüllermeier_Wever_2018, title={Programmatic
    Task Network Planning}, booktitle={Proceedings of the 1st ICAPS Workshop on Hierarchical
    Planning}, publisher={AAAI}, author={Mohr, Felix and Lettmann, Theodor and Hüllermeier,
    Eyke and Wever, Marcel Dominik}, year={2018}, pages={31–39} }'
  chicago: Mohr, Felix, Theodor Lettmann, Eyke Hüllermeier, and Marcel Dominik Wever.
    “Programmatic Task Network Planning.” In <i>Proceedings of the 1st ICAPS Workshop
    on Hierarchical Planning</i>, 31–39. AAAI, 2018.
  ieee: F. Mohr, T. Lettmann, E. Hüllermeier, and M. D. Wever, “Programmatic Task
    Network Planning,” in <i>Proceedings of the 1st ICAPS Workshop on Hierarchical
    Planning</i>, Delft, Netherlands, 2018, pp. 31–39.
  mla: Mohr, Felix, et al. “Programmatic Task Network Planning.” <i>Proceedings of
    the 1st ICAPS Workshop on Hierarchical Planning</i>, AAAI, 2018, pp. 31–39.
  short: 'F. Mohr, T. Lettmann, E. Hüllermeier, M.D. Wever, in: Proceedings of the
    1st ICAPS Workshop on Hierarchical Planning, AAAI, 2018, pp. 31–39.'
conference:
  end_date: 2018-06-29
  location: Delft, Netherlands
  name: 28th International Conference on Automated Planning and Scheduling
  start_date: 2018-06-24
date_created: 2018-05-24T09:00:20Z
date_updated: 2022-01-06T06:58:08Z
ddc:
- '000'
department:
- _id: '355'
file:
- access_level: closed
  content_type: application/pdf
  creator: wever
  date_created: 2018-11-06T15:18:26Z
  date_updated: 2018-11-06T15:18:26Z
  file_id: '5384'
  file_name: Mohr18ProgrammaticPlanning.pdf
  file_size: 349958
  relation: main_file
  success: 1
file_date_updated: 2018-11-06T15:18:26Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop08/docs/Mohr18ProgrammaticPlanning.pdf
oa: '1'
page: 31-39
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '10'
  name: SFB 901 - Subproject B2
publication: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning
publisher: AAAI
status: public
title: Programmatic Task Network Planning
type: conference
user_id: '315'
year: '2018'
...
---
_id: '2862'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Fabian
  full_name: Eidens, Fabian
  id: '25078'
  last_name: Eidens
- first_name: Jakob
  full_name: Juhnke, Jakob
  id: '48090'
  last_name: Juhnke
citation:
  ama: 'Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable
    Universally-Composable Reputation Systems. In: <i>Topics in Cryptology - {CT-RSA}
    2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>.
    Cham: Springer International Publishing; 2018:470-490. doi:<a href="https://doi.org/10.1007/978-3-319-76953-0_25">10.1007/978-3-319-76953-0_25</a>'
  apa: 'Blömer, J., Eidens, F., &#38; Juhnke, J. (2018). Practical, Anonymous, and
    Publicly Linkable Universally-Composable Reputation Systems. In <i>Topics in Cryptology
    - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>
    (pp. 470–490). Cham: Springer International Publishing. <a href="https://doi.org/10.1007/978-3-319-76953-0_25">https://doi.org/10.1007/978-3-319-76953-0_25</a>'
  bibtex: '@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical,
    Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={<a
    href="https://doi.org/10.1007/978-3-319-76953-0_25">10.1007/978-3-319-76953-0_25</a>},
    booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at
    the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing},
    author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490}
    }'
  chicago: 'Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous,
    and Publicly Linkable Universally-Composable Reputation Systems.” In <i>Topics
    in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference
    2018, Proceedings</i>, 470–90. Cham: Springer International Publishing, 2018.
    <a href="https://doi.org/10.1007/978-3-319-76953-0_25">https://doi.org/10.1007/978-3-319-76953-0_25</a>.'
  ieee: J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable
    Universally-Composable Reputation Systems,” in <i>Topics in Cryptology - {CT-RSA}
    2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>,
    San Francisco, CA, USA, 2018, pp. 470–490.
  mla: Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable
    Reputation Systems.” <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’
    Track at the {RSA} Conference 2018, Proceedings</i>, Springer International Publishing,
    2018, pp. 470–90, doi:<a href="https://doi.org/10.1007/978-3-319-76953-0_25">10.1007/978-3-319-76953-0_25</a>.
  short: 'J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018
    - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer
    International Publishing, Cham, 2018, pp. 470–490.'
conference:
  end_date: 2018-04-20
  location: San Francisco, CA, USA
  name: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA}
    Conference 2018
  start_date: 2018-04-16
date_created: 2018-05-24T11:14:02Z
date_updated: 2022-01-06T06:58:12Z
ddc:
- '004'
department:
- _id: '7'
- _id: '64'
doi: 10.1007/978-3-319-76953-0_25
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T13:45:40Z
  date_updated: 2018-11-02T13:45:40Z
  file_id: '5253'
  file_name: PracticalAnonymousAndPubliclyL.pdf
  file_size: 3371773
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T13:45:40Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2018/029
oa: '1'
page: 470-490
place: Cham
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publication: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the
  {RSA} Conference 2018, Proceedings
publication_identifier:
  isbn:
  - '9783319769523'
  - '9783319769530'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation
  Systems
type: conference
user_id: '477'
year: '2018'
...
---
_id: '24150'
author:
- first_name: Arunselvan
  full_name: Ramaswamy, Arunselvan
  id: '66937'
  last_name: Ramaswamy
  orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Shalabh
  full_name: Bhatnagar, Shalabh
  last_name: Bhatnagar
citation:
  ama: Ramaswamy A, Bhatnagar S. Stability of stochastic approximations with “controlled
    markov” noise and temporal difference learning. <i>IEEE Transactions on Automatic
    Control</i>. 2018;64(6):2614-2620.
  apa: Ramaswamy, A., &#38; Bhatnagar, S. (2018). Stability of stochastic approximations
    with “controlled markov” noise and temporal difference learning. <i>IEEE Transactions
    on Automatic Control</i>, <i>64</i>(6), 2614–2620.
  bibtex: '@article{Ramaswamy_Bhatnagar_2018, title={Stability of stochastic approximations
    with “controlled markov” noise and temporal difference learning}, volume={64},
    number={6}, journal={IEEE Transactions on Automatic Control}, publisher={IEEE},
    author={Ramaswamy, Arunselvan and Bhatnagar, Shalabh}, year={2018}, pages={2614–2620}
    }'
  chicago: 'Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Stability of Stochastic
    Approximations with ‘Controlled Markov’ Noise and Temporal Difference Learning.”
    <i>IEEE Transactions on Automatic Control</i> 64, no. 6 (2018): 2614–20.'
  ieee: A. Ramaswamy and S. Bhatnagar, “Stability of stochastic approximations with
    ‘controlled markov’ noise and temporal difference learning,” <i>IEEE Transactions
    on Automatic Control</i>, vol. 64, no. 6, pp. 2614–2620, 2018.
  mla: Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Stability of Stochastic Approximations
    with ‘Controlled Markov’ Noise and Temporal Difference Learning.” <i>IEEE Transactions
    on Automatic Control</i>, vol. 64, no. 6, IEEE, 2018, pp. 2614–20.
  short: A. Ramaswamy, S. Bhatnagar, IEEE Transactions on Automatic Control 64 (2018)
    2614–2620.
date_created: 2021-09-10T10:17:54Z
date_updated: 2022-01-06T06:56:08Z
department:
- _id: '355'
intvolume: '        64'
issue: '6'
language:
- iso: eng
page: 2614-2620
publication: IEEE Transactions on Automatic Control
publisher: IEEE
status: public
title: Stability of stochastic approximations with “controlled markov” noise and temporal
  difference learning
type: journal_article
user_id: '66937'
volume: 64
year: '2018'
...
---
_id: '24151'
author:
- first_name: Burak
  full_name: Demirel, Burak
  last_name: Demirel
- first_name: Arunselvan
  full_name: Ramaswamy, Arunselvan
  id: '66937'
  last_name: Ramaswamy
  orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Daniel E
  full_name: Quevedo, Daniel E
  last_name: Quevedo
- first_name: Holger
  full_name: Karl, Holger
  last_name: Karl
citation:
  ama: 'Demirel B, Ramaswamy A, Quevedo DE, Karl H. Deepcas: A deep reinforcement
    learning algorithm for control-aware scheduling. <i>IEEE Control Systems Letters</i>.
    2018;2(4):737-742.'
  apa: 'Demirel, B., Ramaswamy, A., Quevedo, D. E., &#38; Karl, H. (2018). Deepcas:
    A deep reinforcement learning algorithm for control-aware scheduling. <i>IEEE
    Control Systems Letters</i>, <i>2</i>(4), 737–742.'
  bibtex: '@article{Demirel_Ramaswamy_Quevedo_Karl_2018, title={Deepcas: A deep reinforcement
    learning algorithm for control-aware scheduling}, volume={2}, number={4}, journal={IEEE
    Control Systems Letters}, publisher={IEEE}, author={Demirel, Burak and Ramaswamy,
    Arunselvan and Quevedo, Daniel E and Karl, Holger}, year={2018}, pages={737–742}
    }'
  chicago: 'Demirel, Burak, Arunselvan Ramaswamy, Daniel E Quevedo, and Holger Karl.
    “Deepcas: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling.”
    <i>IEEE Control Systems Letters</i> 2, no. 4 (2018): 737–42.'
  ieee: 'B. Demirel, A. Ramaswamy, D. E. Quevedo, and H. Karl, “Deepcas: A deep reinforcement
    learning algorithm for control-aware scheduling,” <i>IEEE Control Systems Letters</i>,
    vol. 2, no. 4, pp. 737–742, 2018.'
  mla: 'Demirel, Burak, et al. “Deepcas: A Deep Reinforcement Learning Algorithm for
    Control-Aware Scheduling.” <i>IEEE Control Systems Letters</i>, vol. 2, no. 4,
    IEEE, 2018, pp. 737–42.'
  short: B. Demirel, A. Ramaswamy, D.E. Quevedo, H. Karl, IEEE Control Systems Letters
    2 (2018) 737–742.
date_created: 2021-09-10T10:19:07Z
date_updated: 2022-01-06T06:56:08Z
department:
- _id: '355'
intvolume: '         2'
issue: '4'
language:
- iso: eng
page: 737-742
publication: IEEE Control Systems Letters
publisher: IEEE
status: public
title: 'Deepcas: A deep reinforcement learning algorithm for control-aware scheduling'
type: journal_article
user_id: '66937'
volume: 2
year: '2018'
...
---
_id: '24396'
abstract:
- lang: eng
  text: 'We study the Online Prize-collecting Node-weighted Steiner Forest problem
    (OPC-NWSF) in which we are given an undirected graph \(G=(V, E)\) with \(|V| =
    n\) and node-weight function \(w: V \rightarrow \mathcal {R}^+\). A sequence of
    k pairs of nodes of G, each associated with a penalty, arrives online. OPC-NWSF
    asks to construct a subgraph H such that each pair \(\{s, t\}\) is either connected
    (there is a path between s and t in H) or its associated penalty is paid. The
    goal is to minimize the weight of H and the total penalties paid. The current
    best result for OPC-NWSF is a randomized \(\mathcal {O}(\log ^4 n)\)-competitive
    algorithm due to Hajiaghayi et al. (ICALP 2014). We improve this by proposing
    a randomized \(\mathcal {O}(\log n \log k)\)-competitive algorithm for OPC-NWSF,
    which is optimal up to constant factor since OPC-NWSF has a randomized lower bound
    of \(\varOmega (\log ^2 n)\) due to Korman [11]. Moreover, our result also implies
    an improvement for two special cases of OPC-NWSF, the Online Prize-collecting
    Node-weighted Steiner Tree problem (OPC-NWST) and the Online Node-weighted Steiner
    Forest problem (ONWSF). In OPC-NWST, there is a distinguished node which is one
    of the nodes in each pair. In ONWSF, all penalties are set to infinity. The currently
    best known results for OPC-NWST and ONWSF are a randomized \(\mathcal {O}(\log
    ^3 n)\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014) and a randomized
    \(\mathcal {O}(\log n \log ^2 k)\)-competitive algorithm due to Hajiaghayi et
    al. (FOCS 2013), respectively.'
author:
- first_name: Christine
  full_name: Markarian, Christine
  last_name: Markarian
citation:
  ama: 'Markarian C. An Optimal Algorithm for Online Prize-Collecting Node-Weighted
    Steiner Forest. In: <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>.
    ; 2018. doi:<a href="https://doi.org/10.1007/978-3-319-94667-2_18">10.1007/978-3-319-94667-2_18</a>'
  apa: Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted
    Steiner Forest. <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>.
    <a href="https://doi.org/10.1007/978-3-319-94667-2_18">https://doi.org/10.1007/978-3-319-94667-2_18</a>
  bibtex: '@inproceedings{Markarian_2018, place={Cham}, title={An Optimal Algorithm
    for Online Prize-Collecting Node-Weighted Steiner Forest}, DOI={<a href="https://doi.org/10.1007/978-3-319-94667-2_18">10.1007/978-3-319-94667-2_18</a>},
    booktitle={International Workshop on Combinatorial Algorithms (IWOCA)}, author={Markarian,
    Christine}, year={2018} }'
  chicago: Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting
    Node-Weighted Steiner Forest.” In <i>International Workshop on Combinatorial Algorithms
    (IWOCA)</i>. Cham, 2018. <a href="https://doi.org/10.1007/978-3-319-94667-2_18">https://doi.org/10.1007/978-3-319-94667-2_18</a>.
  ieee: 'C. Markarian, “An Optimal Algorithm for Online Prize-Collecting Node-Weighted
    Steiner Forest,” 2018, doi: <a href="https://doi.org/10.1007/978-3-319-94667-2_18">10.1007/978-3-319-94667-2_18</a>.'
  mla: Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted
    Steiner Forest.” <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>,
    2018, doi:<a href="https://doi.org/10.1007/978-3-319-94667-2_18">10.1007/978-3-319-94667-2_18</a>.
  short: 'C. Markarian, in: International Workshop on Combinatorial Algorithms (IWOCA),
    Cham, 2018.'
date_created: 2021-09-14T12:23:29Z
date_updated: 2022-01-06T06:56:19Z
department:
- _id: '63'
doi: 10.1007/978-3-319-94667-2_18
language:
- iso: eng
place: Cham
publication: International Workshop on Combinatorial Algorithms (IWOCA)
publication_identifier:
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest
type: conference
user_id: '15415'
year: '2018'
...
---
_id: '2471'
author:
- first_name: Felix
  full_name: Mohr, Felix
  last_name: Mohr
- first_name: Marcel Dominik
  full_name: Wever, Marcel Dominik
  id: '33176'
  last_name: Wever
  orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
citation:
  ama: 'Mohr F, Wever MD, Hüllermeier E. On-The-Fly Service Construction with Prototypes.
    In: <i>SCC</i>. San Francisco, CA, USA: IEEE Computer Society; 2018. doi:<a href="https://doi.org/10.1109/SCC.2018.00036">10.1109/SCC.2018.00036</a>'
  apa: 'Mohr, F., Wever, M. D., &#38; Hüllermeier, E. (2018). On-The-Fly Service Construction
    with Prototypes. In <i>SCC</i>. San Francisco, CA, USA: IEEE Computer Society.
    <a href="https://doi.org/10.1109/SCC.2018.00036">https://doi.org/10.1109/SCC.2018.00036</a>'
  bibtex: '@inproceedings{Mohr_Wever_Hüllermeier_2018, place={San Francisco, CA, USA},
    title={On-The-Fly Service Construction with Prototypes}, DOI={<a href="https://doi.org/10.1109/SCC.2018.00036">10.1109/SCC.2018.00036</a>},
    booktitle={SCC}, publisher={IEEE Computer Society}, author={Mohr, Felix and Wever,
    Marcel Dominik and Hüllermeier, Eyke}, year={2018} }'
  chicago: 'Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “On-The-Fly Service
    Construction with Prototypes.” In <i>SCC</i>. San Francisco, CA, USA: IEEE Computer
    Society, 2018. <a href="https://doi.org/10.1109/SCC.2018.00036">https://doi.org/10.1109/SCC.2018.00036</a>.'
  ieee: F. Mohr, M. D. Wever, and E. Hüllermeier, “On-The-Fly Service Construction
    with Prototypes,” in <i>SCC</i>, San Francisco, CA, USA, 2018.
  mla: Mohr, Felix, et al. “On-The-Fly Service Construction with Prototypes.” <i>SCC</i>,
    IEEE Computer Society, 2018, doi:<a href="https://doi.org/10.1109/SCC.2018.00036">10.1109/SCC.2018.00036</a>.
  short: 'F. Mohr, M.D. Wever, E. Hüllermeier, in: SCC, IEEE Computer Society, San
    Francisco, CA, USA, 2018.'
conference:
  end_date: 2018-07-07
  location: San Francisco, CA, USA
  name: IEEE International Conference on Services Computing, SCC 2018
  start_date: 2018-07-02
date_created: 2018-04-23T11:40:20Z
date_updated: 2022-01-06T06:56:32Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.1109/SCC.2018.00036
file:
- access_level: closed
  content_type: application/pdf
  creator: wever
  date_created: 2018-11-06T15:15:38Z
  date_updated: 2018-11-06T15:15:38Z
  file_id: '5383'
  file_name: 08456422.pdf
  file_size: 356132
  relation: main_file
  success: 1
file_date_updated: 2018-11-06T15:15:38Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://ieeexplore.ieee.org/abstract/document/8456422
oa: '1'
place: San Francisco, CA, USA
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '10'
  name: SFB 901 - Subproject B2
publication: SCC
publisher: IEEE Computer Society
status: public
title: On-The-Fly Service Construction with Prototypes
type: conference
user_id: '49109'
year: '2018'
...
---
_id: '2472'
author:
- first_name: Sébastien
  full_name: Auroux, Sébastien
  last_name: Auroux
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Auroux S, Karl H. Distributed Placement of Virtualized Control Applications
    in Mobile Backhaul Networks. In: Proc. of IEEE Wireless Communications and Networking
    Conference (WCNC); 2018. doi:<a href="https://doi.org/ 10.1109/WCNC.2018.8377335">
    10.1109/WCNC.2018.8377335</a>'
  apa: Auroux, S., &#38; Karl, H. (2018). Distributed Placement of Virtualized Control
    Applications in Mobile Backhaul Networks. Proc. of IEEE Wireless Communications
    and Networking Conference (WCNC). <a href="https://doi.org/ 10.1109/WCNC.2018.8377335">https://doi.org/
    10.1109/WCNC.2018.8377335</a>
  bibtex: '@inproceedings{Auroux_Karl_2018, title={Distributed Placement of Virtualized
    Control Applications in Mobile Backhaul Networks}, DOI={<a href="https://doi.org/
    10.1109/WCNC.2018.8377335"> 10.1109/WCNC.2018.8377335</a>}, publisher={Proc. of
    IEEE Wireless Communications and Networking Conference (WCNC)}, author={Auroux,
    Sébastien and Karl, Holger}, year={2018} }'
  chicago: Auroux, Sébastien, and Holger Karl. “Distributed Placement of Virtualized
    Control Applications in Mobile Backhaul Networks.” Proc. of IEEE Wireless Communications
    and Networking Conference (WCNC), 2018. <a href="https://doi.org/ 10.1109/WCNC.2018.8377335">https://doi.org/
    10.1109/WCNC.2018.8377335</a>.
  ieee: S. Auroux and H. Karl, “Distributed Placement of Virtualized Control Applications
    in Mobile Backhaul Networks,” 2018.
  mla: Auroux, Sébastien, and Holger Karl. <i>Distributed Placement of Virtualized
    Control Applications in Mobile Backhaul Networks</i>. Proc. of IEEE Wireless Communications
    and Networking Conference (WCNC), 2018, doi:<a href="https://doi.org/ 10.1109/WCNC.2018.8377335">
    10.1109/WCNC.2018.8377335</a>.
  short: 'S. Auroux, H. Karl, in: Proc. of IEEE Wireless Communications and Networking
    Conference (WCNC), 2018.'
date_created: 2018-04-24T08:04:28Z
date_updated: 2022-01-06T06:56:33Z
ddc:
- '000'
department:
- _id: '75'
doi: ' 10.1109/WCNC.2018.8377335'
file:
- access_level: closed
  content_type: application/pdf
  creator: tabu
  date_created: 2018-04-24T08:04:02Z
  date_updated: 2018-04-24T08:04:02Z
  file_id: '2473'
  file_name: p2262-auroux.pdf
  file_size: 371352
  relation: main_file
  success: 1
file_date_updated: 2018-04-24T08:04:02Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
publisher: Proc. of IEEE Wireless Communications and Networking Conference (WCNC)
status: public
title: Distributed Placement of Virtualized Control Applications in Mobile Backhaul
  Networks
type: conference
user_id: '126'
year: '2018'
...
---
_id: '26421'
author:
- first_name: Felix
  full_name: Winkelnkemper, Felix
  id: '3117'
  last_name: Winkelnkemper
- first_name: Reinhard
  full_name: Keil, Reinhard
  last_name: Keil
citation:
  ama: 'Winkelnkemper F, Keil R. MediaThing – A Learning Scenario Targeting on Research
    Skills. In: Bastiaens T,  Van Braak  J, Brown  M, eds. <i>Proceedings of EdMedia:
    World Conference on Educational Media and Technology.</i> ; 2018:2397-2406.'
  apa: 'Winkelnkemper, F., &#38; Keil, R. (2018). MediaThing – A Learning Scenario
    Targeting on Research Skills. In T. Bastiaens,  J  Van Braak, &#38;  M Brown (Eds.),
    <i>Proceedings of EdMedia: World Conference on Educational Media and Technology.</i>
    (pp. 2397–2406).'
  bibtex: '@inproceedings{Winkelnkemper_Keil_2018, place={Amsterdam, Netherlands},
    title={MediaThing – A Learning Scenario Targeting on Research Skills}, booktitle={Proceedings
    of EdMedia: World Conference on Educational Media and Technology.}, author={Winkelnkemper,
    Felix and Keil, Reinhard}, editor={Bastiaens, T  and  Van Braak,  J and Brown,  M},
    year={2018}, pages={2397–2406} }'
  chicago: 'Winkelnkemper, Felix, and Reinhard Keil. “MediaThing – A Learning Scenario
    Targeting on Research Skills.” In <i>Proceedings of EdMedia: World Conference
    on Educational Media and Technology.</i>, edited by T  Bastiaens,  J  Van Braak,
    and  M Brown, 2397–2406. Amsterdam, Netherlands, 2018.'
  ieee: 'F. Winkelnkemper and R. Keil, “MediaThing – A Learning Scenario Targeting
    on Research Skills,” in <i>Proceedings of EdMedia: World Conference on Educational
    Media and Technology.</i>, 2018, pp. 2397–2406.'
  mla: 'Winkelnkemper, Felix, and Reinhard Keil. “MediaThing – A Learning Scenario
    Targeting on Research Skills.” <i>Proceedings of EdMedia: World Conference on
    Educational Media and Technology.</i>, edited by T  Bastiaens et al., 2018, pp.
    2397–406.'
  short: 'F. Winkelnkemper, R. Keil, in: T. Bastiaens,  J  Van Braak,  M Brown (Eds.),
    Proceedings of EdMedia: World Conference on Educational Media and Technology.,
    Amsterdam, Netherlands, 2018, pp. 2397–2406.'
date_created: 2021-10-18T18:17:23Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '71'
editor:
- first_name: 'T '
  full_name: 'Bastiaens, T '
  last_name: Bastiaens
- first_name: ' J'
  full_name: ' Van Braak,  J'
  last_name: ' Van Braak'
- first_name: ' M'
  full_name: Brown,  M
  last_name: Brown
language:
- iso: eng
page: 2397-2406
place: Amsterdam, Netherlands
publication: 'Proceedings of EdMedia: World Conference on Educational Media and Technology.'
publication_status: published
status: public
title: MediaThing – A Learning Scenario Targeting on Research Skills
type: conference
user_id: '71124'
year: '2018'
...
---
_id: '26422'
alternative_title:
- STUDIOLO. Kooperative Forschungsumgebungen in den eHumanities
author:
- first_name: E.-M
  full_name: Seng, E.-M
  last_name: Seng
- first_name: Reinhard
  full_name: Keil, Reinhard
  last_name: Keil
- first_name: Gudrun
  full_name: Oevel, Gudrun
  id: '14924'
  last_name: Oevel
  orcid: https://orcid.org/0000-0002-6396-9535
citation:
  ama: 'Seng E-M, Keil R, Oevel G. studiolo communis. In: Seng E-M, Keil R,  Oevel
    G, eds. De Gruyter; 2018:1-5.'
  apa: Seng, E.-M., Keil, R., &#38; Oevel, G. (2018). <i>studiolo communis</i> (E.-M.
    Seng, R. Keil, &#38; G.  Oevel, Eds.; pp. 1–5). De Gruyter.
  bibtex: '@inproceedings{Seng_Keil_Oevel_2018, place={Berlin, Bosten}, title={studiolo
    communis}, publisher={De Gruyter}, author={Seng, E.-M and Keil, Reinhard and Oevel,
    Gudrun}, editor={Seng, E.-M and Keil, Reinhard and  Oevel, G}, year={2018}, pages={1–5}
    }'
  chicago: 'Seng, E.-M, Reinhard Keil, and Gudrun Oevel. “Studiolo Communis.” edited
    by E.-M Seng, Reinhard Keil, and G  Oevel, 1–5. Berlin, Bosten: De Gruyter, 2018.'
  ieee: E.-M. Seng, R. Keil, and G. Oevel, “studiolo communis,” 2018, pp. 1–5.
  mla: Seng, E. M., et al. <i>Studiolo Communis</i>. Edited by E.-M Seng et al., De
    Gruyter, 2018, pp. 1–5.
  short: 'E.-M. Seng, R. Keil, G. Oevel, in: E.-M. Seng, R. Keil, G.  Oevel (Eds.),
    De Gruyter, Berlin, Bosten, 2018, pp. 1–5.'
date_created: 2021-10-18T18:23:28Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '71'
editor:
- first_name: E.-M
  full_name: Seng, E.-M
  last_name: Seng
- first_name: Reinhard
  full_name: Keil, Reinhard
  last_name: Keil
- first_name: G
  full_name: ' Oevel, G'
  last_name: ' Oevel'
language:
- iso: eng
page: 1-5
place: Berlin, Bosten
publication_status: published
publisher: De Gruyter
status: public
title: studiolo communis
type: conference
user_id: '71124'
year: '2018'
...
---
_id: '26423'
alternative_title:
- STUDIOLO. Kooperative Forschungsumgebungen in den eHumanities
author:
- first_name: Reinhard
  full_name: Keil, Reinhard
  last_name: Keil
citation:
  ama: 'Keil R. Unterst{\"u}tzung kontingenter Wissensarbeit. Ein Rahmenwerk f{\"u}r
    die Entwicklung digitaler Arbeitsumgebungen zur Unterst{\"u}tzung des Forschungsdiskurses
    in den Kulturwissenschaften. In: Seng E-M,  Keil R, Oevel G, eds. De Gruyter;
    2018.'
  apa: Keil, R. (2018). <i>Unterst{\"u}tzung kontingenter Wissensarbeit. Ein Rahmenwerk
    f{\"u}r die Entwicklung digitaler Arbeitsumgebungen zur Unterst{\"u}tzung des
    Forschungsdiskurses in den Kulturwissenschaften</i> (E.-M. Seng, R.  Keil, &#38;
    G. Oevel, Eds.). De Gruyter.
  bibtex: '@inproceedings{Keil_2018, place={Berlin, Bosten}, title={Unterst{\"u}tzung
    kontingenter Wissensarbeit. Ein Rahmenwerk f{\"u}r die Entwicklung digitaler Arbeitsumgebungen
    zur Unterst{\"u}tzung des Forschungsdiskurses in den Kulturwissenschaften}, publisher={De
    Gruyter}, author={Keil, Reinhard}, editor={Seng, E.-M and  Keil, Reinhard and
    Oevel, G}, year={2018} }'
  chicago: 'Keil, Reinhard. “Unterst{\"u}tzung Kontingenter Wissensarbeit. Ein Rahmenwerk
    F{\"u}r Die Entwicklung Digitaler Arbeitsumgebungen Zur Unterst{\"u}tzung Des
    Forschungsdiskurses in Den Kulturwissenschaften.” edited by E.-M Seng, Reinhard  Keil,
    and G Oevel. Berlin, Bosten: De Gruyter, 2018.'
  ieee: R. Keil, “Unterst{\"u}tzung kontingenter Wissensarbeit. Ein Rahmenwerk f{\"u}r
    die Entwicklung digitaler Arbeitsumgebungen zur Unterst{\"u}tzung des Forschungsdiskurses
    in den Kulturwissenschaften,” 2018.
  mla: Keil, Reinhard. <i>Unterst{\"u}tzung Kontingenter Wissensarbeit. Ein Rahmenwerk
    F{\"u}r Die Entwicklung Digitaler Arbeitsumgebungen Zur Unterst{\"u}tzung Des
    Forschungsdiskurses in Den Kulturwissenschaften</i>. Edited by E.-M Seng et al.,
    De Gruyter, 2018.
  short: 'R. Keil, in: E.-M. Seng, R.  Keil, G. Oevel (Eds.), De Gruyter, Berlin,
    Bosten, 2018.'
date_created: 2021-10-18T18:26:49Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '71'
editor:
- first_name: E.-M
  full_name: Seng, E.-M
  last_name: Seng
- first_name: Reinhard
  full_name: ' Keil, Reinhard'
  last_name: ' Keil'
- first_name: G
  full_name: Oevel, G
  last_name: Oevel
language:
- iso: eng
place: Berlin, Bosten
publication_status: published
publisher: De Gruyter
status: public
title: Unterst{\"u}tzung kontingenter Wissensarbeit. Ein Rahmenwerk f{\"u}r die Entwicklung
  digitaler Arbeitsumgebungen zur Unterst{\"u}tzung des Forschungsdiskurses in den
  Kulturwissenschaften
type: conference
user_id: '71124'
year: '2018'
...
---
_id: '26424'
author:
- first_name: ' E.-M'
  full_name: Seng,  E.-M
  last_name: Seng
- first_name: Reinhard
  full_name: Keil, Reinhard
  last_name: Keil
- first_name: Gudrun
  full_name: Oevel, Gudrun
  id: '14924'
  last_name: Oevel
  orcid: https://orcid.org/0000-0002-6396-9535
citation:
  ama: Seng  E.-M, Keil R, Oevel G. <i>STUDIOLO. Kooperative Forschungsumgebungen
    in Den EHumanities</i>. De Gruyter; 2018.
  apa: Seng,  E.-M, Keil, R., &#38; Oevel, G. (2018). <i>STUDIOLO. Kooperative Forschungsumgebungen
    in den eHumanities</i>. De Gruyter.
  bibtex: '@book{Seng_Keil_Oevel_2018, place={Berlin, Bosten}, title={STUDIOLO. Kooperative
    Forschungsumgebungen in den eHumanities}, publisher={De Gruyter}, author={Seng,  E.-M
    and Keil, Reinhard and Oevel, Gudrun}, year={2018} }'
  chicago: 'Seng,  E.-M, Reinhard Keil, and Gudrun Oevel. <i>STUDIOLO. Kooperative
    Forschungsumgebungen in Den EHumanities</i>. Berlin, Bosten: De Gruyter, 2018.'
  ieee: 'E.-M Seng, R. Keil, and G. Oevel, <i>STUDIOLO. Kooperative Forschungsumgebungen
    in den eHumanities</i>. Berlin, Bosten: De Gruyter, 2018.'
  mla: Seng,  E.-M, et al. <i>STUDIOLO. Kooperative Forschungsumgebungen in Den EHumanities</i>.
    De Gruyter, 2018.
  short: E.-M Seng, R. Keil, G. Oevel, STUDIOLO. Kooperative Forschungsumgebungen
    in Den EHumanities, De Gruyter, Berlin, Bosten, 2018.
date_created: 2021-10-18T18:32:41Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '71'
language:
- iso: eng
place: Berlin, Bosten
publication_status: published
publisher: De Gruyter
status: public
title: STUDIOLO. Kooperative Forschungsumgebungen in den eHumanities
type: book
user_id: '71124'
year: '2018'
...
---
_id: '26425'
alternative_title:
- 'Paderborn Symposium on Data Science Education at School Level 2017: The Collected
  Extended Abstracts'
author:
- first_name: Harald
  full_name: Selke, Harald
  id: '497'
  last_name: Selke
citation:
  ama: 'Selke H. Data science in schools from the perspective of contextual informatics.
    In: Biehler R, Budde  L, Frischemeier D, et al., eds. Universit{\"a}tsbibliothek
    Paderborn; 2018:107-109.'
  apa: Selke, H. (2018). <i>Data science in schools from the perspective of contextual
    informatics</i> (R. Biehler,  L Budde, D. Frischemeier, B. Heinemann, S. Podworny,
    C. Schulte, &#38; T. Wassong, Eds.; pp. 107–109). Universit{\"a}tsbibliothek Paderborn.
  bibtex: '@inproceedings{Selke_2018, place={Paderborn}, title={Data science in schools
    from the perspective of contextual informatics}, publisher={Universit{\"a}tsbibliothek
    Paderborn}, author={Selke, Harald}, editor={Biehler, R and Budde,  L and Frischemeier,
    D and Heinemann, B and Podworny, S and Schulte, Carsten and Wassong, T}, year={2018},
    pages={107–109} }'
  chicago: 'Selke, Harald. “Data Science in Schools from the Perspective of Contextual
    Informatics.” edited by R Biehler,  L Budde, D Frischemeier, B Heinemann, S Podworny,
    Carsten Schulte, and T Wassong, 107–9. Paderborn: Universit{\"a}tsbibliothek Paderborn,
    2018.'
  ieee: H. Selke, “Data science in schools from the perspective of contextual informatics,”
    2018, pp. 107–109.
  mla: Selke, Harald. <i>Data Science in Schools from the Perspective of Contextual
    Informatics</i>. Edited by R Biehler et al., Universit{\"a}tsbibliothek Paderborn,
    2018, pp. 107–09.
  short: 'H. Selke, in: R. Biehler,  L Budde, D. Frischemeier, B. Heinemann, S. Podworny,
    C. Schulte, T. Wassong (Eds.), Universit{\"a}tsbibliothek Paderborn, Paderborn,
    2018, pp. 107–109.'
date_created: 2021-10-18T18:37:32Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '71'
editor:
- first_name: R
  full_name: Biehler, R
  last_name: Biehler
- first_name: ' L'
  full_name: Budde,  L
  last_name: Budde
- first_name: D
  full_name: Frischemeier, D
  last_name: Frischemeier
- first_name: B
  full_name: Heinemann, B
  last_name: Heinemann
- first_name: S
  full_name: Podworny, S
  last_name: Podworny
- first_name: Carsten
  full_name: Schulte, Carsten
  last_name: Schulte
- first_name: T
  full_name: Wassong, T
  last_name: Wassong
language:
- iso: eng
page: 107-109
place: Paderborn
publication_status: published
publisher: Universit{\"a}tsbibliothek Paderborn
status: public
title: Data science in schools from the perspective of contextual informatics
type: conference
user_id: '71124'
year: '2018'
...
---
_id: '2685'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Kathlén
  full_name: Kohn, Kathlén
  last_name: Kohn
citation:
  ama: Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms.
    <i>SIAM Journal on Applied Algebra and Geometry</i>. 2018;2(2):314-338. doi:<a
    href="https://doi.org/10.1137/17M1132045">10.1137/17M1132045</a>
  apa: Blömer, J., &#38; Kohn, K. (2018). Voronoi Cells of Lattices with Respect to
    Arbitrary Norms. <i>SIAM Journal on Applied Algebra and Geometry.</i>, <i>2</i>(2),
    314–338. <a href="https://doi.org/10.1137/17M1132045">https://doi.org/10.1137/17M1132045</a>
  bibtex: '@article{Blömer_Kohn_2018, title={Voronoi Cells of Lattices with Respect
    to Arbitrary Norms}, volume={2}, DOI={<a href="https://doi.org/10.1137/17M1132045">10.1137/17M1132045</a>},
    number={2}, journal={SIAM Journal on Applied Algebra and Geometry.}, author={Blömer,
    Johannes and Kohn, Kathlén}, year={2018}, pages={314–338} }'
  chicago: 'Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect
    to Arbitrary Norms.” <i>SIAM Journal on Applied Algebra and Geometry.</i> 2, no.
    2 (2018): 314–38. <a href="https://doi.org/10.1137/17M1132045">https://doi.org/10.1137/17M1132045</a>.'
  ieee: J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary
    Norms,” <i>SIAM Journal on Applied Algebra and Geometry.</i>, vol. 2, no. 2, pp.
    314–338, 2018.
  mla: Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect
    to Arbitrary Norms.” <i>SIAM Journal on Applied Algebra and Geometry.</i>, vol.
    2, no. 2, 2018, pp. 314–38, doi:<a href="https://doi.org/10.1137/17M1132045">10.1137/17M1132045</a>.
  short: J. Blömer, K. Kohn, SIAM Journal on Applied Algebra and Geometry. 2 (2018)
    314–338.
date_created: 2018-05-08T09:18:54Z
date_updated: 2022-01-06T06:57:29Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
doi: 10.1137/17M1132045
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:22:55Z
  date_updated: 2018-11-02T15:22:55Z
  file_id: '5300'
  file_name: 17m1132045.pdf
  file_size: 1131048
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:22:55Z
has_accepted_license: '1'
intvolume: '         2'
issue: '2'
language:
- iso: eng
page: 314-338
project:
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
publication: SIAM Journal on Applied Algebra and Geometry.
publication_identifier:
  eissn:
  - 2470-6566
publication_status: epub_ahead
status: public
title: Voronoi Cells of Lattices with Respect to Arbitrary Norms
type: journal_article
user_id: '477'
volume: 2
year: '2018'
...
---
_id: '3217'
author:
- first_name: Burak
  full_name: Demirel, Burak
  last_name: Demirel
- first_name: Arunselvan
  full_name: Ramaswamy, Arunselvan
  last_name: Ramaswamy
- first_name: Daniel
  full_name: Quevedo, Daniel
  last_name: Quevedo
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Demirel B, Ramaswamy A, Quevedo D, Karl H. DeepCAS: A Deep Reinforcement Learning
    Algorithm for Control-Aware Scheduling. In: ; 2018. doi:<a href="https://doi.org/10.1109/LCSYS.2018.2847721">10.1109/LCSYS.2018.2847721</a>'
  apa: 'Demirel, B., Ramaswamy, A., Quevedo, D., &#38; Karl, H. (2018). DeepCAS: A
    Deep Reinforcement Learning Algorithm for Control-Aware Scheduling. <a href="https://doi.org/10.1109/LCSYS.2018.2847721">https://doi.org/10.1109/LCSYS.2018.2847721</a>'
  bibtex: '@inproceedings{Demirel_Ramaswamy_Quevedo_Karl_2018, title={DeepCAS: A Deep
    Reinforcement Learning Algorithm for Control-Aware Scheduling}, DOI={<a href="https://doi.org/10.1109/LCSYS.2018.2847721">10.1109/LCSYS.2018.2847721</a>},
    author={Demirel, Burak and Ramaswamy, Arunselvan and Quevedo, Daniel and Karl,
    Holger}, year={2018} }'
  chicago: 'Demirel, Burak, Arunselvan Ramaswamy, Daniel Quevedo, and Holger Karl.
    “DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling,”
    2018. <a href="https://doi.org/10.1109/LCSYS.2018.2847721">https://doi.org/10.1109/LCSYS.2018.2847721</a>.'
  ieee: 'B. Demirel, A. Ramaswamy, D. Quevedo, and H. Karl, “DeepCAS: A Deep Reinforcement
    Learning Algorithm for Control-Aware Scheduling,” 2018.'
  mla: 'Demirel, Burak, et al. <i>DeepCAS: A Deep Reinforcement Learning Algorithm
    for Control-Aware Scheduling</i>. 2018, doi:<a href="https://doi.org/10.1109/LCSYS.2018.2847721">10.1109/LCSYS.2018.2847721</a>.'
  short: 'B. Demirel, A. Ramaswamy, D. Quevedo, H. Karl, in: 2018.'
date_created: 2018-06-13T10:26:23Z
date_updated: 2022-01-06T06:59:05Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/LCSYS.2018.2847721
file:
- access_level: closed
  content_type: application/pdf
  creator: tabu
  date_created: 2018-06-13T10:47:57Z
  date_updated: 2018-06-13T10:47:57Z
  file_id: '3218'
  file_name: 1803.02998.pdf
  file_size: 354166
  relation: main_file
  success: 1
file_date_updated: 2018-06-13T10:47:57Z
has_accepted_license: '1'
main_file_link:
- url: https://arxiv.org/pdf/1803.02998.pdf
project:
- _id: '24'
  name: Netzgewahre Regelung & regelungsgewahre Netze
status: public
title: 'DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling'
type: conference
user_id: '126'
year: '2018'
...
---
_id: '3265'
abstract:
- lang: eng
  text: "We present CLARC (Cryptographic Library for Anonymous Reputation and Credentials),
    an anonymous credentials system (ACS) combined with an anonymous reputation system.\r\n\r\nUsing
    CLARC, users can receive attribute-based credentials from issuers. They can efficiently
    prove that their credentials satisfy complex (access) policies in a privacy-preserving
    way. This implements anonymous access control with complex policies.\r\n\r\nFurthermore,
    CLARC is the first ACS that is combined with an anonymous reputation system where
    users can anonymously rate services. A user who gets access to a service via a
    credential, also anonymously receives a review token to rate the service. If a
    user creates more than a single rating, this can be detected by anyone, preventing
    users from spamming ratings to sway public opinion.\r\n\r\nTo evaluate feasibility
    of our construction, we present an open-source prototype implementation."
author:
- first_name: Kai
  full_name: Bemmann, Kai
  last_name: Bemmann
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Jan
  full_name: Bobolz, Jan
  id: '27207'
  last_name: Bobolz
- first_name: Henrik
  full_name: Bröcher, Henrik
  id: '41047'
  last_name: Bröcher
- first_name: Denis Pascal
  full_name: Diemert, Denis Pascal
  id: '44071'
  last_name: Diemert
- first_name: Fabian
  full_name: Eidens, Fabian
  id: '25078'
  last_name: Eidens
- first_name: Lukas
  full_name: Eilers, Lukas
  last_name: Eilers
- first_name: Jan Frederik
  full_name: Haltermann, Jan Frederik
  id: '44413'
  last_name: Haltermann
- first_name: Jakob
  full_name: Juhnke, Jakob
  id: '48090'
  last_name: Juhnke
- first_name: Burhan
  full_name: Otour, Burhan
  last_name: Otour
- first_name: Laurens Alexander
  full_name: Porzenheim, Laurens Alexander
  id: '47434'
  last_name: Porzenheim
- first_name: Simon
  full_name: Pukrop, Simon
  last_name: Pukrop
- first_name: Erik
  full_name: Schilling, Erik
  last_name: Schilling
- first_name: Michael
  full_name: Schlichtig, Michael
  id: '32312'
  last_name: Schlichtig
- first_name: Marcel
  full_name: Stienemeier, Marcel
  last_name: Stienemeier
citation:
  ama: 'Bemmann K, Blömer J, Bobolz J, et al. Fully-Featured Anonymous Credentials
    with Reputation System. In: <i>Proceedings of the 13th International Conference
    on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM.
    doi:<a href="https://doi.org/10.1145/3230833.3234517">10.1145/3230833.3234517</a>'
  apa: 'Bemmann, K., Blömer, J., Bobolz, J., Bröcher, H., Diemert, D. P., Eidens,
    F., … Stienemeier, M. (n.d.). Fully-Featured Anonymous Credentials with Reputation
    System. In <i>Proceedings of the 13th International Conference on Availability,
    Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM. <a href="https://doi.org/10.1145/3230833.3234517">https://doi.org/10.1145/3230833.3234517</a>'
  bibtex: '@inproceedings{Bemmann_Blömer_Bobolz_Bröcher_Diemert_Eidens_Eilers_Haltermann_Juhnke_Otour_et
    al., place={New York, NY, USA}, title={Fully-Featured Anonymous Credentials with
    Reputation System}, DOI={<a href="https://doi.org/10.1145/3230833.3234517">10.1145/3230833.3234517</a>},
    booktitle={Proceedings of the 13th International Conference on Availability, Reliability
    and Security - ARES ’18}, publisher={ACM}, author={Bemmann, Kai and Blömer, Johannes
    and Bobolz, Jan and Bröcher, Henrik and Diemert, Denis Pascal and Eidens, Fabian
    and Eilers, Lukas and Haltermann, Jan Frederik and Juhnke, Jakob and Otour, Burhan
    and et al.} }'
  chicago: 'Bemmann, Kai, Johannes Blömer, Jan Bobolz, Henrik Bröcher, Denis Pascal
    Diemert, Fabian Eidens, Lukas Eilers, et al. “Fully-Featured Anonymous Credentials
    with Reputation System.” In <i>Proceedings of the 13th International Conference
    on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM,
    n.d. <a href="https://doi.org/10.1145/3230833.3234517">https://doi.org/10.1145/3230833.3234517</a>.'
  ieee: K. Bemmann <i>et al.</i>, “Fully-Featured Anonymous Credentials with Reputation
    System,” in <i>Proceedings of the 13th International Conference on Availability,
    Reliability and Security - ARES ’18</i>, Hamburg, Germany.
  mla: Bemmann, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation
    System.” <i>Proceedings of the 13th International Conference on Availability,
    Reliability and Security - ARES ’18</i>, ACM, doi:<a href="https://doi.org/10.1145/3230833.3234517">10.1145/3230833.3234517</a>.
  short: 'K. Bemmann, J. Blömer, J. Bobolz, H. Bröcher, D.P. Diemert, F. Eidens, L.
    Eilers, J.F. Haltermann, J. Juhnke, B. Otour, L.A. Porzenheim, S. Pukrop, E. Schilling,
    M. Schlichtig, M. Stienemeier, in: Proceedings of the 13th International Conference
    on Availability, Reliability and Security - ARES ’18, ACM, New York, NY, USA,
    n.d.'
conference:
  end_date: 2018-08-30
  location: Hamburg, Germany
  name: ARES 2018 - SECPID
  start_date: 2018-08-27
date_created: 2018-06-14T11:19:29Z
date_updated: 2022-01-06T06:59:07Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1145/3230833.3234517
file:
- access_level: closed
  content_type: application/pdf
  creator: feidens
  date_created: 2018-11-08T10:17:39Z
  date_updated: 2018-11-08T10:17:39Z
  file_id: '5428'
  file_name: react_acs.pdf
  file_size: 920843
  relation: main_file
file_date_updated: 2018-11-08T10:17:39Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2018/835
oa: '1'
place: New York, NY, USA
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '44'
  name: KogniHome - die mitdenkende Wohnung
publication: Proceedings of the 13th International Conference on Availability, Reliability
  and Security - ARES '18
publication_identifier:
  isbn:
  - 978-1-4503-6448-5
publication_status: accepted
publisher: ACM
quality_controlled: '1'
related_material:
  link:
  - relation: software
    url: https://github.com/upbcuk
status: public
title: Fully-Featured Anonymous Credentials with Reputation System
type: conference
user_id: '25078'
year: '2018'
...
---
_id: '3320'
author:
- first_name: Kai
  full_name: Rautenberg, Kai
  last_name: Rautenberg
citation:
  ama: Rautenberg K. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>.
    Universität Paderborn; 2018.
  apa: Rautenberg, K. (2018). <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>.
    Universität Paderborn.
  bibtex: '@book{Rautenberg_2018, title={Korrektheitsbeweise für Muster von Servicekompositionen},
    publisher={Universität Paderborn}, author={Rautenberg, Kai}, year={2018} }'
  chicago: Rautenberg, Kai. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>.
    Universität Paderborn, 2018.
  ieee: K. Rautenberg, <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>.
    Universität Paderborn, 2018.
  mla: Rautenberg, Kai. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>.
    Universität Paderborn, 2018.
  short: K. Rautenberg, Korrektheitsbeweise für Muster von Servicekompositionen, Universität
    Paderborn, 2018.
date_created: 2018-06-25T07:53:32Z
date_updated: 2022-01-06T06:59:10Z
department:
- _id: '7'
- _id: '77'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '11'
  name: SFB 901 - Subproject B3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
title: Korrektheitsbeweise für Muster von Servicekompositionen
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '3345'
abstract:
- lang: eng
  text: "Dynamically steering flows through virtualized net- work function instances
    is a key enabler for elastic, on-demand deployments of virtualized network functions.
    This becomes par- ticular challenging when stateful functions are involved, necessi-
    tating state management. The problem with existing solutions is that they typically
    embrace state migration and flow rerouting jointly, imposing a huge set of requirements
    on the on-boarded VNFs, e.g., solution-specific state management interfaces.\r\nIn
    this paper, we introduce the seamless handover proto- col (SHarP). It provides
    an easy-to-use, loss-less, and order- preserving flow rerouting mechanism that
    is not fixed to a single state management approach. This allows VNF vendors to
    implement or use the state management solution of their choice. SHarP supports
    these solutions with additional information when flows are migrated. Further,
    we show how SHarP significantly reduces the buffer usage at a central (SDN) controller,
    which is a typical bottleneck in existing solutions. Our experiments show that
    SHarP uses a constant amount of controller buffer, irrespective of the time taken
    to migrate the VNF state."
author:
- first_name: Manuel
  full_name: Peuster, Manuel
  id: '13271'
  last_name: Peuster
- first_name: Hannes
  full_name: Küttner, Hannes
  last_name: Küttner
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Peuster M, Küttner H, Karl H.  Let the state follow its flows: An SDN-based
    flow handover protocol to support state migration. In: <i>4th IEEE International
    Conference on Network Softwarization (NetSoft 2018)</i>. Montreal. doi:<a href="https://doi.org/10.1109/NETSOFT.2018.8460007">10.1109/NETSOFT.2018.8460007</a>'
  apa: 'Peuster, M., Küttner, H., &#38; Karl, H. (n.d.).  Let the state follow its
    flows: An SDN-based flow handover protocol to support state migration. In <i>4th
    IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal.
    <a href="https://doi.org/10.1109/NETSOFT.2018.8460007">https://doi.org/10.1109/NETSOFT.2018.8460007</a>'
  bibtex: '@inproceedings{Peuster_Küttner_Karl, place={Montreal}, title={ Let the
    state follow its flows: An SDN-based flow handover protocol to support state migration},
    DOI={<a href="https://doi.org/10.1109/NETSOFT.2018.8460007">10.1109/NETSOFT.2018.8460007</a>},
    booktitle={4th IEEE International Conference on Network Softwarization (NetSoft
    2018)}, author={Peuster, Manuel and Küttner, Hannes and Karl, Holger} }'
  chicago: 'Peuster, Manuel, Hannes Küttner, and Holger Karl. “ Let the State Follow
    Its Flows: An SDN-Based Flow Handover Protocol to Support State Migration.” In
    <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>.
    Montreal, n.d. <a href="https://doi.org/10.1109/NETSOFT.2018.8460007">https://doi.org/10.1109/NETSOFT.2018.8460007</a>.'
  ieee: 'M. Peuster, H. Küttner, and H. Karl, “ Let the state follow its flows: An
    SDN-based flow handover protocol to support state migration,” in <i>4th IEEE International
    Conference on Network Softwarization (NetSoft 2018)</i>, Montreal.'
  mla: 'Peuster, Manuel, et al. “ Let the State Follow Its Flows: An SDN-Based Flow
    Handover Protocol to Support State Migration.” <i>4th IEEE International Conference
    on Network Softwarization (NetSoft 2018)</i>, doi:<a href="https://doi.org/10.1109/NETSOFT.2018.8460007">10.1109/NETSOFT.2018.8460007</a>.'
  short: 'M. Peuster, H. Küttner, H. Karl, in: 4th IEEE International Conference on
    Network Softwarization (NetSoft 2018), Montreal, n.d.'
conference:
  end_date: 2018-06-29
  location: Montreal
  name: 4th IEEE International Conference on Network Softwarization (NetSoft 2018)
  start_date: 2018-06-25
date_created: 2018-06-25T12:21:49Z
date_updated: 2022-01-06T06:59:11Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/NETSOFT.2018.8460007
file:
- access_level: open_access
  content_type: application/pdf
  creator: peuster
  date_created: 2018-07-05T11:11:37Z
  date_updated: 2018-07-05T11:12:29Z
  file_id: '3428'
  file_name: main_ris.pdf
  file_size: 901561
  relation: main_file
file_date_updated: 2018-07-05T11:12:29Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/8460007/
oa: '1'
place: Montreal
project:
- _id: '28'
  grant_number: '761493'
  name: 5G Development and validation platform for global industry-specific network
    services and Apps
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
publication: 4th IEEE International Conference on Network Softwarization (NetSoft
  2018)
publication_status: accepted
status: public
title: ' Let the state follow its flows: An SDN-based flow handover protocol to support
  state migration'
type: conference
urn: '33458'
user_id: '13271'
year: '2018'
...
---
_id: '3346'
abstract:
- lang: eng
  text: "Developing a virtualized network service does not only involve the\r\n  implementation
    and configuration of the network functions it is\r\n  composed of but also its
    integration and test with management\r\n  solutions that will control the service
    in its production\r\n  environment. These integration tasks require testbeds that
    offer the\r\n  needed network function virtualization infrastructure~(NFVI), like
    OpenStack, introducing a\r\n  lot of management and maintenance overheads. Such
    testbed setups\r\n  become even more complicated when the multi\r\n  point-of-presence~(PoP)
    case, with multiple infrastructure\r\n  installations, is considered.\r\n\r\n
    \ In this demo, we showcase an emulation platform that executes\r\n  containerized
    network services in user-defined multi-PoP\r\n  topologies. The platform does
    not only allow network service developers to\r\n  locally test their services
    but also to connect real-world\r\n  management and orchestration solutions to
    the emulated PoPs. During our\r\n  interactive demonstration we focus on the integration
    between\r\n  the emulated infrastructure and state-of-the-art orchestration\r\n
    \ solutions like SONATA or OSM."
author:
- first_name: Manuel
  full_name: Peuster, Manuel
  id: '13271'
  last_name: Peuster
- first_name: 'Johannes '
  full_name: 'Kampmeyer, Johannes '
  last_name: Kampmeyer
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Peuster M, Kampmeyer J, Karl H. Containernet 2.0: A Rapid Prototyping Platform
    for Hybrid Service Function Chains. In: <i>4th IEEE International Conference on
    Network Softwarization (NetSoft 2018)</i>. Montreal. doi:<a href="https://doi.org/10.1109/NETSOFT.2018.8459905">10.1109/NETSOFT.2018.8459905</a>'
  apa: 'Peuster, M., Kampmeyer, J., &#38; Karl, H. (n.d.). Containernet 2.0: A Rapid
    Prototyping Platform for Hybrid Service Function Chains. In <i>4th IEEE International
    Conference on Network Softwarization (NetSoft 2018)</i>. Montreal. <a href="https://doi.org/10.1109/NETSOFT.2018.8459905">https://doi.org/10.1109/NETSOFT.2018.8459905</a>'
  bibtex: '@inproceedings{Peuster_Kampmeyer_Karl, place={Montreal}, title={Containernet
    2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains}, DOI={<a
    href="https://doi.org/10.1109/NETSOFT.2018.8459905">10.1109/NETSOFT.2018.8459905</a>},
    booktitle={4th IEEE International Conference on Network Softwarization (NetSoft
    2018)}, author={Peuster, Manuel and Kampmeyer, Johannes  and Karl, Holger} }'
  chicago: 'Peuster, Manuel, Johannes  Kampmeyer, and Holger Karl. “Containernet 2.0:
    A Rapid Prototyping Platform for Hybrid Service Function Chains.” In <i>4th IEEE
    International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal,
    n.d. <a href="https://doi.org/10.1109/NETSOFT.2018.8459905">https://doi.org/10.1109/NETSOFT.2018.8459905</a>.'
  ieee: 'M. Peuster, J. Kampmeyer, and H. Karl, “Containernet 2.0: A Rapid Prototyping
    Platform for Hybrid Service Function Chains,” in <i>4th IEEE International Conference
    on Network Softwarization (NetSoft 2018)</i>, Montreal.'
  mla: 'Peuster, Manuel, et al. “Containernet 2.0: A Rapid Prototyping Platform for
    Hybrid Service Function Chains.” <i>4th IEEE International Conference on Network
    Softwarization (NetSoft 2018)</i>, doi:<a href="https://doi.org/10.1109/NETSOFT.2018.8459905">10.1109/NETSOFT.2018.8459905</a>.'
  short: 'M. Peuster, J. Kampmeyer, H. Karl, in: 4th IEEE International Conference
    on Network Softwarization (NetSoft 2018), Montreal, n.d.'
conference:
  end_date: 2018-06-29
  location: Montreal
  name: 4th IEEE International Conference on Network Softwarization (NetSoft 2018)
  start_date: 2018-06-25
date_created: 2018-06-25T12:24:19Z
date_updated: 2022-01-06T06:59:11Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/NETSOFT.2018.8459905
file:
- access_level: open_access
  content_type: application/pdf
  creator: peuster
  date_created: 2018-07-05T11:12:55Z
  date_updated: 2018-07-05T11:12:55Z
  file_id: '3429'
  file_name: main_ris.pdf
  file_size: 449513
  relation: main_file
file_date_updated: 2018-07-05T11:12:55Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/8459905/
oa: '1'
place: Montreal
project:
- _id: '28'
  grant_number: '761493'
  name: 5G Development and validation platform for global industry-specific network
    services and Apps
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
publication: 4th IEEE International Conference on Network Softwarization (NetSoft
  2018)
publication_status: accepted
status: public
title: 'Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function
  Chains'
type: conference
urn: '33467'
user_id: '13271'
year: '2018'
...
---
_id: '3347'
abstract:
- lang: eng
  text: "Management and orchestration~(MANO) systems are the key components of future
    large-scale NFV environments. They will manage resources of hundreds or even thousands
    of NFV infrastructure installations, so called points of presence~(PoP). Such
    scenarios need to be automatically tested during the development phase of a MANO
    system. This task becomes very challenging because large-scale NFV testbeds are
    hard to maintain, too expensive, or simply not available.\r\n\r\nIn this paper,
    we present a multi-PoP NFV infrastructure emulation platform that enables automated,
    large-scale testing of MANO stacks. We show that our platform can easily emulate
    hundreds of PoPs on a single physical machine and reduces the setup time of a
    test PoP by a factor of 232x compared to a DevStack-based test PoP installation.
    Further, we present a case study in which we test ETSI's Open Source MANO~(OSM)
    against our proposed system  to gain insights about OSM's behaviour in large-scale
    NFV deployments."
author:
- first_name: Manuel
  full_name: Peuster, Manuel
  id: '13271'
  last_name: Peuster
- first_name: Michael
  full_name: Marchetti, Michael
  last_name: Marchetti
- first_name: Gerado
  full_name: Garcia de Blas, Gerado
  last_name: Garcia de Blas
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Peuster M, Marchetti M, Garcia de Blas G, Karl H. Emulation-based Smoke Testing
    of NFV Orchestrators in Large Multi-PoP Environments. In: <i>European Conference
    on Networks and Communications (EuCNC)</i>. Ljubljana. doi:<a href="https://doi.org/10.1109/EuCNC.2018.8442701">10.1109/EuCNC.2018.8442701</a>'
  apa: Peuster, M., Marchetti, M., Garcia de Blas, G., &#38; Karl, H. (n.d.). Emulation-based
    Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments. In <i>European
    Conference on Networks and Communications (EuCNC)</i>. Ljubljana. <a href="https://doi.org/10.1109/EuCNC.2018.8442701">https://doi.org/10.1109/EuCNC.2018.8442701</a>
  bibtex: '@inproceedings{Peuster_Marchetti_Garcia de Blas_Karl, place={Ljubljana},
    title={Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments},
    DOI={<a href="https://doi.org/10.1109/EuCNC.2018.8442701">10.1109/EuCNC.2018.8442701</a>},
    booktitle={European Conference on Networks and Communications (EuCNC)}, author={Peuster,
    Manuel and Marchetti, Michael and Garcia de Blas, Gerado and Karl, Holger} }'
  chicago: Peuster, Manuel, Michael Marchetti, Gerado Garcia de Blas, and Holger Karl.
    “Emulation-Based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments.”
    In <i>European Conference on Networks and Communications (EuCNC)</i>. Ljubljana,
    n.d. <a href="https://doi.org/10.1109/EuCNC.2018.8442701">https://doi.org/10.1109/EuCNC.2018.8442701</a>.
  ieee: M. Peuster, M. Marchetti, G. Garcia de Blas, and H. Karl, “Emulation-based
    Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments,” in <i>European
    Conference on Networks and Communications (EuCNC)</i>, Ljubljana.
  mla: Peuster, Manuel, et al. “Emulation-Based Smoke Testing of NFV Orchestrators
    in Large Multi-PoP Environments.” <i>European Conference on Networks and Communications
    (EuCNC)</i>, doi:<a href="https://doi.org/10.1109/EuCNC.2018.8442701">10.1109/EuCNC.2018.8442701</a>.
  short: 'M. Peuster, M. Marchetti, G. Garcia de Blas, H. Karl, in: European Conference
    on Networks and Communications (EuCNC), Ljubljana, n.d.'
conference:
  location: Ljubljana
  name: European Conference on Networks and Communications (EuCNC)
date_created: 2018-06-25T12:27:59Z
date_updated: 2022-01-06T06:59:12Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/EuCNC.2018.8442701
file:
- access_level: open_access
  content_type: application/pdf
  creator: peuster
  date_created: 2018-07-05T11:13:29Z
  date_updated: 2018-07-05T11:13:29Z
  file_id: '3430'
  file_name: main_ris.pdf
  file_size: 713495
  relation: main_file
file_date_updated: 2018-07-05T11:13:29Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/8442701/
oa: '1'
place: Ljubljana
project:
- _id: '28'
  grant_number: '761493'
  name: 5G Development and validation platform for global industry-specific network
    services and Apps
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
publication: European Conference on Networks and Communications (EuCNC)
publication_status: accepted
status: public
title: Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments
type: conference
urn: '33477'
user_id: '13271'
year: '2018'
...
