---
_id: '772'
author:
- first_name: Till
  full_name: Hohenberger, Till
  last_name: Hohenberger
- first_name: Matthias
  full_name: Herlich, Matthias
  last_name: Herlich
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Hohenberger T, Herlich M, Karl H. Trade-off between latency and coverage in
    cooperative radio access networks. In: <i>IEEE International Conference on Advanced
    Networks and Telecommunications Systems, ANTS 2013, Kattankulathur, India, December
    15-18, 2013</i>. ; 2013:1--6. doi:<a href="https://doi.org/10.1109/ANTS.2013.6802869">10.1109/ANTS.2013.6802869</a>'
  apa: Hohenberger, T., Herlich, M., &#38; Karl, H. (2013). Trade-off between latency
    and coverage in cooperative radio access networks. In <i>IEEE International Conference
    on Advanced Networks and Telecommunications Systems, ANTS 2013, Kattankulathur,
    India, December 15-18, 2013</i> (pp. 1--6). <a href="https://doi.org/10.1109/ANTS.2013.6802869">https://doi.org/10.1109/ANTS.2013.6802869</a>
  bibtex: '@inproceedings{Hohenberger_Herlich_Karl_2013, title={Trade-off between
    latency and coverage in cooperative radio access networks}, DOI={<a href="https://doi.org/10.1109/ANTS.2013.6802869">10.1109/ANTS.2013.6802869</a>},
    booktitle={IEEE International Conference on Advanced Networks and Telecommunications
    Systems, ANTS 2013, Kattankulathur, India, December 15-18, 2013}, author={Hohenberger,
    Till and Herlich, Matthias and Karl, Holger}, year={2013}, pages={1--6} }'
  chicago: Hohenberger, Till, Matthias Herlich, and Holger Karl. “Trade-off between
    Latency and Coverage in Cooperative Radio Access Networks.” In <i>IEEE International
    Conference on Advanced Networks and Telecommunications Systems, ANTS 2013, Kattankulathur,
    India, December 15-18, 2013</i>, 1--6, 2013. <a href="https://doi.org/10.1109/ANTS.2013.6802869">https://doi.org/10.1109/ANTS.2013.6802869</a>.
  ieee: T. Hohenberger, M. Herlich, and H. Karl, “Trade-off between latency and coverage
    in cooperative radio access networks,” in <i>IEEE International Conference on
    Advanced Networks and Telecommunications Systems, ANTS 2013, Kattankulathur, India,
    December 15-18, 2013</i>, 2013, pp. 1--6.
  mla: Hohenberger, Till, et al. “Trade-off between Latency and Coverage in Cooperative
    Radio Access Networks.” <i>IEEE International Conference on Advanced Networks
    and Telecommunications Systems, ANTS 2013, Kattankulathur, India, December 15-18,
    2013</i>, 2013, pp. 1--6, doi:<a href="https://doi.org/10.1109/ANTS.2013.6802869">10.1109/ANTS.2013.6802869</a>.
  short: 'T. Hohenberger, M. Herlich, H. Karl, in: IEEE International Conference on
    Advanced Networks and Telecommunications Systems, ANTS 2013, Kattankulathur, India,
    December 15-18, 2013, 2013, pp. 1--6.'
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:45Z
department:
- _id: '75'
doi: 10.1109/ANTS.2013.6802869
page: 1--6
publication: IEEE International Conference on Advanced Networks and Telecommunications
  Systems, ANTS 2013, Kattankulathur, India, December 15-18, 2013
status: public
title: Trade-off between latency and coverage in cooperative radio access networks
type: conference
user_id: '15572'
year: '2013'
...
---
_id: '773'
author:
- first_name: Federico
  full_name: M. Facca, Federico
  last_name: M. Facca
- first_name: Elio
  full_name: Salvadori, Elio
  last_name: Salvadori
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
- first_name: Diego
  full_name: R. Lopez, Diego
  last_name: R. Lopez
- first_name: Pedro
  full_name: Arranda Gutierrez, Pedro
  last_name: Arranda Gutierrez
- first_name: Dejan
  full_name: Kostic, Dejan
  last_name: Kostic
- first_name: Roberto
  full_name: Riggio, Roberto
  last_name: Riggio
citation:
  ama: 'M. Facca F, Salvadori E, Karl H, et al. NetIDE: First Steps towards an Integrated
    Development Environment for Portable Network Apps. In: <i>Second European Workshop
    on Software Defined Networks, EWSDN 2013, Berlin, Germany, October 10-11, 2013</i>.
    ; 2013:105--110. doi:<a href="https://doi.org/10.1109/EWSDN.2013.24">10.1109/EWSDN.2013.24</a>'
  apa: 'M. Facca, F., Salvadori, E., Karl, H., R. Lopez, D., Arranda Gutierrez, P.,
    Kostic, D., &#38; Riggio, R. (2013). NetIDE: First Steps towards an Integrated
    Development Environment for Portable Network Apps. In <i>Second European Workshop
    on Software Defined Networks, EWSDN 2013, Berlin, Germany, October 10-11, 2013</i>
    (pp. 105--110). <a href="https://doi.org/10.1109/EWSDN.2013.24">https://doi.org/10.1109/EWSDN.2013.24</a>'
  bibtex: '@inproceedings{M. Facca_Salvadori_Karl_R. Lopez_Arranda Gutierrez_Kostic_Riggio_2013,
    title={NetIDE: First Steps towards an Integrated Development Environment for Portable
    Network Apps}, DOI={<a href="https://doi.org/10.1109/EWSDN.2013.24">10.1109/EWSDN.2013.24</a>},
    booktitle={Second European Workshop on Software Defined Networks, EWSDN 2013,
    Berlin, Germany, October 10-11, 2013}, author={M. Facca, Federico and Salvadori,
    Elio and Karl, Holger and R. Lopez, Diego and Arranda Gutierrez, Pedro and Kostic,
    Dejan and Riggio, Roberto}, year={2013}, pages={105--110} }'
  chicago: 'M. Facca, Federico, Elio Salvadori, Holger Karl, Diego R. Lopez, Pedro
    Arranda Gutierrez, Dejan Kostic, and Roberto Riggio. “NetIDE: First Steps towards
    an Integrated Development Environment for Portable Network Apps.” In <i>Second
    European Workshop on Software Defined Networks, EWSDN 2013, Berlin, Germany, October
    10-11, 2013</i>, 105--110, 2013. <a href="https://doi.org/10.1109/EWSDN.2013.24">https://doi.org/10.1109/EWSDN.2013.24</a>.'
  ieee: 'F. M. Facca <i>et al.</i>, “NetIDE: First Steps towards an Integrated Development
    Environment for Portable Network Apps,” in <i>Second European Workshop on Software
    Defined Networks, EWSDN 2013, Berlin, Germany, October 10-11, 2013</i>, 2013,
    pp. 105--110.'
  mla: 'M. Facca, Federico, et al. “NetIDE: First Steps towards an Integrated Development
    Environment for Portable Network Apps.” <i>Second European Workshop on Software
    Defined Networks, EWSDN 2013, Berlin, Germany, October 10-11, 2013</i>, 2013,
    pp. 105--110, doi:<a href="https://doi.org/10.1109/EWSDN.2013.24">10.1109/EWSDN.2013.24</a>.'
  short: 'F. M. Facca, E. Salvadori, H. Karl, D. R. Lopez, P. Arranda Gutierrez, D.
    Kostic, R. Riggio, in: Second European Workshop on Software Defined Networks,
    EWSDN 2013, Berlin, Germany, October 10-11, 2013, 2013, pp. 105--110.'
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:45Z
department:
- _id: '75'
doi: 10.1109/EWSDN.2013.24
page: 105--110
publication: Second European Workshop on Software Defined Networks, EWSDN 2013, Berlin,
  Germany, October 10-11, 2013
status: public
title: 'NetIDE: First Steps towards an Integrated Development Environment for Portable
  Network Apps'
type: conference
user_id: '15572'
year: '2013'
...
---
_id: '774'
author:
- first_name: Claudio
  full_name: Cicconetti, Claudio
  last_name: Cicconetti
- first_name: Arianna
  full_name: Morelli, Arianna
  last_name: Morelli
- first_name: Martin
  full_name: Dräxler, Martin
  last_name: Dräxler
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
- first_name: Vincenzo
  full_name: Mancuso, Vincenzo
  last_name: Mancuso
- first_name: Vincenzo
  full_name: Sciancalepore, Vincenzo
  last_name: Sciancalepore
- first_name: Rohit
  full_name: Gupta, Rohit
  last_name: Gupta
- first_name: Antonio
  full_name: de la Oliva, Antonio
  last_name: de la Oliva
- first_name: M.
  full_name: Isabel Sanchez, M.
  last_name: Isabel Sanchez
- first_name: Pablo
  full_name: Serrano, Pablo
  last_name: Serrano
- first_name: Laurent
  full_name: Roullet, Laurent
  last_name: Roullet
citation:
  ama: 'Cicconetti C, Morelli A, Dräxler M, et al. The playground of Wireless Dense
    networks of the future. In: <i>2013 Future Network &#38; Mobile Summit, Lisboa,
    Portugal, July 3-5, 2013</i>. ; 2013:1--4.'
  apa: Cicconetti, C., Morelli, A., Dräxler, M., Karl, H., Mancuso, V., Sciancalepore,
    V., … Roullet, L. (2013). The playground of Wireless Dense networks of the future.
    In <i>2013 Future Network &#38; Mobile Summit, Lisboa, Portugal, July 3-5, 2013</i>
    (pp. 1--4).
  bibtex: '@inproceedings{Cicconetti_Morelli_Dräxler_Karl_Mancuso_Sciancalepore_Gupta_de
    la Oliva_Isabel Sanchez_Serrano_et al._2013, title={The playground of Wireless
    Dense networks of the future}, booktitle={2013 Future Network &#38; Mobile Summit,
    Lisboa, Portugal, July 3-5, 2013}, author={Cicconetti, Claudio and Morelli, Arianna
    and Dräxler, Martin and Karl, Holger and Mancuso, Vincenzo and Sciancalepore,
    Vincenzo and Gupta, Rohit and de la Oliva, Antonio and Isabel Sanchez, M. and
    Serrano, Pablo and et al.}, year={2013}, pages={1--4} }'
  chicago: Cicconetti, Claudio, Arianna Morelli, Martin Dräxler, Holger Karl, Vincenzo
    Mancuso, Vincenzo Sciancalepore, Rohit Gupta, et al. “The Playground of Wireless
    Dense Networks of the Future.” In <i>2013 Future Network &#38; Mobile Summit,
    Lisboa, Portugal, July 3-5, 2013</i>, 1--4, 2013.
  ieee: C. Cicconetti <i>et al.</i>, “The playground of Wireless Dense networks of
    the future,” in <i>2013 Future Network &#38; Mobile Summit, Lisboa, Portugal,
    July 3-5, 2013</i>, 2013, pp. 1--4.
  mla: Cicconetti, Claudio, et al. “The Playground of Wireless Dense Networks of the
    Future.” <i>2013 Future Network &#38; Mobile Summit, Lisboa, Portugal, July 3-5,
    2013</i>, 2013, pp. 1--4.
  short: 'C. Cicconetti, A. Morelli, M. Dräxler, H. Karl, V. Mancuso, V. Sciancalepore,
    R. Gupta, A. de la Oliva, M. Isabel Sanchez, P. Serrano, L. Roullet, in: 2013
    Future Network &#38; Mobile Summit, Lisboa, Portugal, July 3-5, 2013, 2013, pp.
    1--4.'
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:45Z
department:
- _id: '75'
page: 1--4
publication: 2013 Future Network & Mobile Summit, Lisboa, Portugal, July 3-5, 2013
status: public
title: The playground of Wireless Dense networks of the future
type: conference
user_id: '15572'
year: '2013'
...
---
_id: '775'
author:
- first_name: Matthias
  full_name: Keller, Matthias
  last_name: Keller
- first_name: Manuel
  full_name: Peuster, Manuel
  id: '13271'
  last_name: Peuster
- first_name: Christoph
  full_name: Robbert, Christoph
  last_name: Robbert
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Keller M, Peuster M, Robbert C, Karl H. A topology-aware adaptive deployment
    framework for elastic applications. In: <i>17th International Conference on Intelligence
    in Next Generation Networks, {ICIN} 2013, Venice, Italy, October 15-16, 2013</i>.
    ; 2013:61--69. doi:<a href="https://doi.org/10.1109/ICIN.2013.6670895">10.1109/ICIN.2013.6670895</a>'
  apa: Keller, M., Peuster, M., Robbert, C., &#38; Karl, H. (2013). A topology-aware
    adaptive deployment framework for elastic applications. In <i>17th International
    Conference on Intelligence in Next Generation Networks, {ICIN} 2013, Venice, Italy,
    October 15-16, 2013</i> (pp. 61--69). <a href="https://doi.org/10.1109/ICIN.2013.6670895">https://doi.org/10.1109/ICIN.2013.6670895</a>
  bibtex: '@inproceedings{Keller_Peuster_Robbert_Karl_2013, title={A topology-aware
    adaptive deployment framework for elastic applications}, DOI={<a href="https://doi.org/10.1109/ICIN.2013.6670895">10.1109/ICIN.2013.6670895</a>},
    booktitle={17th International Conference on Intelligence in Next Generation Networks,
    {ICIN} 2013, Venice, Italy, October 15-16, 2013}, author={Keller, Matthias and
    Peuster, Manuel and Robbert, Christoph and Karl, Holger}, year={2013}, pages={61--69}
    }'
  chicago: Keller, Matthias, Manuel Peuster, Christoph Robbert, and Holger Karl. “A
    Topology-Aware Adaptive Deployment Framework for Elastic Applications.” In <i>17th
    International Conference on Intelligence in Next Generation Networks, {ICIN} 2013,
    Venice, Italy, October 15-16, 2013</i>, 61--69, 2013. <a href="https://doi.org/10.1109/ICIN.2013.6670895">https://doi.org/10.1109/ICIN.2013.6670895</a>.
  ieee: M. Keller, M. Peuster, C. Robbert, and H. Karl, “A topology-aware adaptive
    deployment framework for elastic applications,” in <i>17th International Conference
    on Intelligence in Next Generation Networks, {ICIN} 2013, Venice, Italy, October
    15-16, 2013</i>, 2013, pp. 61--69.
  mla: Keller, Matthias, et al. “A Topology-Aware Adaptive Deployment Framework for
    Elastic Applications.” <i>17th International Conference on Intelligence in Next
    Generation Networks, {ICIN} 2013, Venice, Italy, October 15-16, 2013</i>, 2013,
    pp. 61--69, doi:<a href="https://doi.org/10.1109/ICIN.2013.6670895">10.1109/ICIN.2013.6670895</a>.
  short: 'M. Keller, M. Peuster, C. Robbert, H. Karl, in: 17th International Conference
    on Intelligence in Next Generation Networks, {ICIN} 2013, Venice, Italy, October
    15-16, 2013, 2013, pp. 61--69.'
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:45Z
department:
- _id: '75'
doi: 10.1109/ICIN.2013.6670895
ec_funded: '1'
page: 61--69
project:
- _id: '26'
  call_identifier: FP7-ICT-2009-5
  grant_number: '257448'
  name: Scalable & Adaptive Internet soLutions
publication: 17th International Conference on Intelligence in Next Generation Networks,
  {ICIN} 2013, Venice, Italy, October 15-16, 2013
status: public
title: A topology-aware adaptive deployment framework for elastic applications
type: conference
user_id: '15572'
year: '2013'
...
---
_id: '776'
author:
- first_name: Matthias
  full_name: Herlich, Matthias
  last_name: Herlich
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Herlich M, Karl H. Energy-Efficient Assignment of User Equipment to Cooperative
    Base Stations. In: <i>ISWCS 2013, The Tenth International Symposium on Wireless
    Communication Systems, Ilmenau, Germany, August 27-30, 2013</i>. ; 2013:1--5.'
  apa: Herlich, M., &#38; Karl, H. (2013). Energy-Efficient Assignment of User Equipment
    to Cooperative Base Stations. In <i>ISWCS 2013, The Tenth International Symposium
    on Wireless Communication Systems, Ilmenau, Germany, August 27-30, 2013</i> (pp.
    1--5).
  bibtex: '@inproceedings{Herlich_Karl_2013, title={Energy-Efficient Assignment of
    User Equipment to Cooperative Base Stations}, booktitle={ISWCS 2013, The Tenth
    International Symposium on Wireless Communication Systems, Ilmenau, Germany, August
    27-30, 2013}, author={Herlich, Matthias and Karl, Holger}, year={2013}, pages={1--5}
    }'
  chicago: Herlich, Matthias, and Holger Karl. “Energy-Efficient Assignment of User
    Equipment to Cooperative Base Stations.” In <i>ISWCS 2013, The Tenth International
    Symposium on Wireless Communication Systems, Ilmenau, Germany, August 27-30, 2013</i>,
    1--5, 2013.
  ieee: M. Herlich and H. Karl, “Energy-Efficient Assignment of User Equipment to
    Cooperative Base Stations,” in <i>ISWCS 2013, The Tenth International Symposium
    on Wireless Communication Systems, Ilmenau, Germany, August 27-30, 2013</i>, 2013,
    pp. 1--5.
  mla: Herlich, Matthias, and Holger Karl. “Energy-Efficient Assignment of User Equipment
    to Cooperative Base Stations.” <i>ISWCS 2013, The Tenth International Symposium
    on Wireless Communication Systems, Ilmenau, Germany, August 27-30, 2013</i>, 2013,
    pp. 1--5.
  short: 'M. Herlich, H. Karl, in: ISWCS 2013, The Tenth International Symposium on
    Wireless Communication Systems, Ilmenau, Germany, August 27-30, 2013, 2013, pp.
    1--5.'
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:45Z
department:
- _id: '75'
page: 1--5
publication: ISWCS 2013, The Tenth International Symposium on Wireless Communication
  Systems, Ilmenau, Germany, August 27-30, 2013
status: public
title: Energy-Efficient Assignment of User Equipment to Cooperative Base Stations
type: conference
user_id: '15572'
year: '2013'
...
---
_id: '777'
author:
- first_name: Martin
  full_name: Dräxler, Martin
  last_name: Dräxler
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Dräxler M, Karl H. Cross-layer scheduling for multi-quality video streaming
    in cellular wireless networks. In: <i>2013 9th International Wireless Communications
    and Mobile Computing Conference, IWCMC 2013, Sardinia, Italy, July 1-5, 2013</i>.
    ; 2013:1181--1186. doi:<a href="https://doi.org/10.1109/IWCMC.2013.6583724">10.1109/IWCMC.2013.6583724</a>'
  apa: Dräxler, M., &#38; Karl, H. (2013). Cross-layer scheduling for multi-quality
    video streaming in cellular wireless networks. In <i>2013 9th International Wireless
    Communications and Mobile Computing Conference, IWCMC 2013, Sardinia, Italy, July
    1-5, 2013</i> (pp. 1181--1186). <a href="https://doi.org/10.1109/IWCMC.2013.6583724">https://doi.org/10.1109/IWCMC.2013.6583724</a>
  bibtex: '@inproceedings{Dräxler_Karl_2013, title={Cross-layer scheduling for multi-quality
    video streaming in cellular wireless networks}, DOI={<a href="https://doi.org/10.1109/IWCMC.2013.6583724">10.1109/IWCMC.2013.6583724</a>},
    booktitle={2013 9th International Wireless Communications and Mobile Computing
    Conference, IWCMC 2013, Sardinia, Italy, July 1-5, 2013}, author={Dräxler, Martin
    and Karl, Holger}, year={2013}, pages={1181--1186} }'
  chicago: Dräxler, Martin, and Holger Karl. “Cross-Layer Scheduling for Multi-Quality
    Video Streaming in Cellular Wireless Networks.” In <i>2013 9th International Wireless
    Communications and Mobile Computing Conference, IWCMC 2013, Sardinia, Italy, July
    1-5, 2013</i>, 1181--1186, 2013. <a href="https://doi.org/10.1109/IWCMC.2013.6583724">https://doi.org/10.1109/IWCMC.2013.6583724</a>.
  ieee: M. Dräxler and H. Karl, “Cross-layer scheduling for multi-quality video streaming
    in cellular wireless networks,” in <i>2013 9th International Wireless Communications
    and Mobile Computing Conference, IWCMC 2013, Sardinia, Italy, July 1-5, 2013</i>,
    2013, pp. 1181--1186.
  mla: Dräxler, Martin, and Holger Karl. “Cross-Layer Scheduling for Multi-Quality
    Video Streaming in Cellular Wireless Networks.” <i>2013 9th International Wireless
    Communications and Mobile Computing Conference, IWCMC 2013, Sardinia, Italy, July
    1-5, 2013</i>, 2013, pp. 1181--1186, doi:<a href="https://doi.org/10.1109/IWCMC.2013.6583724">10.1109/IWCMC.2013.6583724</a>.
  short: 'M. Dräxler, H. Karl, in: 2013 9th International Wireless Communications
    and Mobile Computing Conference, IWCMC 2013, Sardinia, Italy, July 1-5, 2013,
    2013, pp. 1181--1186.'
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:45Z
department:
- _id: '75'
doi: 10.1109/IWCMC.2013.6583724
page: 1181--1186
publication: 2013 9th International Wireless Communications and Mobile Computing Conference,
  IWCMC 2013, Sardinia, Italy, July 1-5, 2013
status: public
title: Cross-layer scheduling for multi-quality video streaming in cellular wireless
  networks
type: conference
user_id: '15572'
year: '2013'
...
---
_id: '781'
author:
- first_name: Martin
  full_name: Dräxler, Martin
  last_name: Dräxler
- first_name: Johannes
  full_name: Blobel, Johannes
  last_name: Blobel
- first_name: Philipp
  full_name: Dreimann, Philipp
  last_name: Dreimann
- first_name: Stefan
  full_name: Valentin, Stefan
  last_name: Valentin
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: Dräxler M, Blobel J, Dreimann P, Valentin S, Karl H. Anticipatory Buffer Control
    and Quality Selection for Wireless Video Streaming. <i>CoRR</i>. 2013.
  apa: Dräxler, M., Blobel, J., Dreimann, P., Valentin, S., &#38; Karl, H. (2013).
    Anticipatory Buffer Control and Quality Selection for Wireless Video Streaming.
    <i>CoRR</i>.
  bibtex: '@article{Dräxler_Blobel_Dreimann_Valentin_Karl_2013, title={Anticipatory
    Buffer Control and Quality Selection for Wireless Video Streaming}, journal={CoRR},
    author={Dräxler, Martin and Blobel, Johannes and Dreimann, Philipp and Valentin,
    Stefan and Karl, Holger}, year={2013} }'
  chicago: Dräxler, Martin, Johannes Blobel, Philipp Dreimann, Stefan Valentin, and
    Holger Karl. “Anticipatory Buffer Control and Quality Selection for Wireless Video
    Streaming.” <i>CoRR</i>, 2013.
  ieee: M. Dräxler, J. Blobel, P. Dreimann, S. Valentin, and H. Karl, “Anticipatory
    Buffer Control and Quality Selection for Wireless Video Streaming,” <i>CoRR</i>.
    2013.
  mla: Dräxler, Martin, et al. “Anticipatory Buffer Control and Quality Selection
    for Wireless Video Streaming.” <i>CoRR</i>, 2013.
  short: M. Dräxler, J. Blobel, P. Dreimann, S. Valentin, H. Karl, CoRR (2013).
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '75'
language:
- iso: eng
publication: CoRR
related_material:
  link:
  - relation: confirmation
    url: https://arxiv.org/abs/1309.5491
status: public
title: Anticipatory Buffer Control and Quality Selection for Wireless Video Streaming
type: preprint
user_id: '126'
year: '2013'
...
---
_id: '470'
abstract:
- lang: eng
  text: In OpenFlow [1], multiple switches share the same control plane which is centralized
    atwhat is called the OpenFlow controller. A switch only consists of a forwarding
    plane. Rules for forwarding individual packets (called ow entries in OpenFlow)
    are pushed from the controller to the switches. In a network with a high arrival
    rate of new ows, such as in a data center, the control trac between the switch
    and controller can become very high. As a consequence, routing of new ows will
    be slow. One way to reduce control trac is to use wildcarded ow entries. Wildcard
    ow entries can be used to create default routes in the network. However, since
    switches do not keep track of ows covered by a wildcard ow entry, the controller
    no longer has knowledge about individual ows. To nd out about these individual
    ows we propose an extension to the current OpenFlow standard to enable packet
    sampling of wildcard ow entries.
author:
- first_name: Philip
  full_name: Wette, Philip
  last_name: Wette
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Wette P, Karl H. Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet
    Sampling to OpenFlow. In: <i>Proceedings of the ACM SIGCOMM ’13</i>. Digital Library.
    ; 2013:541-542. doi:<a href="https://doi.org/10.1145/2486001.2491710">10.1145/2486001.2491710</a>'
  apa: Wette, P., &#38; Karl, H. (2013). Which Flows Are Hiding Behind My Wildcard
    Rule? Adding Packet Sampling to OpenFlow. In <i>Proceedings of the ACM SIGCOMM
    ’13</i> (pp. 541–542). <a href="https://doi.org/10.1145/2486001.2491710">https://doi.org/10.1145/2486001.2491710</a>
  bibtex: '@inproceedings{Wette_Karl_2013, series={Digital Library}, title={Which
    Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow},
    DOI={<a href="https://doi.org/10.1145/2486001.2491710">10.1145/2486001.2491710</a>},
    booktitle={Proceedings of the ACM SIGCOMM ’13}, author={Wette, Philip and Karl,
    Holger}, year={2013}, pages={541–542}, collection={Digital Library} }'
  chicago: Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard
    Rule? Adding Packet Sampling to OpenFlow.” In <i>Proceedings of the ACM SIGCOMM
    ’13</i>, 541–42. Digital Library, 2013. <a href="https://doi.org/10.1145/2486001.2491710">https://doi.org/10.1145/2486001.2491710</a>.
  ieee: P. Wette and H. Karl, “Which Flows Are Hiding Behind My Wildcard Rule? Adding
    Packet Sampling to OpenFlow,” in <i>Proceedings of the ACM SIGCOMM ’13</i>, 2013,
    pp. 541–542.
  mla: Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard
    Rule? Adding Packet Sampling to OpenFlow.” <i>Proceedings of the ACM SIGCOMM ’13</i>,
    2013, pp. 541–42, doi:<a href="https://doi.org/10.1145/2486001.2491710">10.1145/2486001.2491710</a>.
  short: 'P. Wette, H. Karl, in: Proceedings of the ACM SIGCOMM ’13, 2013, pp. 541–542.'
date_created: 2017-10-17T12:42:23Z
date_updated: 2022-01-06T07:01:19Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1145/2486001.2491710
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:18:01Z
  date_updated: 2018-03-16T11:18:01Z
  file_id: '1331'
  file_name: 470-p541-wette_01.pdf
  file_size: 446835
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:18:01Z
has_accepted_license: '1'
page: 541-542
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the ACM SIGCOMM '13
series_title: Digital Library
status: public
title: Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow
type: conference
user_id: '15572'
year: '2013'
...
---
_id: '490'
author:
- first_name: Felix
  full_name: Wallaschek, Felix
  last_name: Wallaschek
citation:
  ama: Wallaschek F. <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität
    Paderborn; 2013.
  apa: Wallaschek, F. (2013). <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität
    Paderborn.
  bibtex: '@book{Wallaschek_2013, title={Routing in heterogenen OpenFlow Netzwerken},
    publisher={Universität Paderborn}, author={Wallaschek, Felix}, year={2013} }'
  chicago: Wallaschek, Felix. <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität
    Paderborn, 2013.
  ieee: F. Wallaschek, <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität
    Paderborn, 2013.
  mla: Wallaschek, Felix. <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität
    Paderborn, 2013.
  short: F. Wallaschek, Routing in heterogenen OpenFlow Netzwerken, Universität Paderborn,
    2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
department:
- _id: '75'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Routing in heterogenen OpenFlow Netzwerken
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '492'
author:
- first_name: Christoph
  full_name: Robbert, Christoph
  last_name: Robbert
citation:
  ama: Robbert C. <i>Ressource-Optimized Deployment of Multi-Tier Applications - The
    Data Rate-Constrained Case</i>. Universität Paderborn; 2013.
  apa: Robbert, C. (2013). <i>Ressource-Optimized Deployment of Multi-Tier Applications
    - The Data Rate-Constrained Case</i>. Universität Paderborn.
  bibtex: '@book{Robbert_2013, title={Ressource-Optimized Deployment of Multi-Tier
    Applications - The Data Rate-Constrained Case}, publisher={Universität Paderborn},
    author={Robbert, Christoph}, year={2013} }'
  chicago: Robbert, Christoph. <i>Ressource-Optimized Deployment of Multi-Tier Applications
    - The Data Rate-Constrained Case</i>. Universität Paderborn, 2013.
  ieee: C. Robbert, <i>Ressource-Optimized Deployment of Multi-Tier Applications -
    The Data Rate-Constrained Case</i>. Universität Paderborn, 2013.
  mla: Robbert, Christoph. <i>Ressource-Optimized Deployment of Multi-Tier Applications
    - The Data Rate-Constrained Case</i>. Universität Paderborn, 2013.
  short: C. Robbert, Ressource-Optimized Deployment of Multi-Tier Applications - The
    Data Rate-Constrained Case, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:28Z
date_updated: 2022-01-06T07:01:29Z
department:
- _id: '75'
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained
  Case
type: bachelorsthesis
user_id: '15504'
year: '2013'
...
---
_id: '496'
abstract:
- lang: eng
  text: Within reactive topology control, a node determines its adjacent edges of
    a network subgraph without prior knowledge of its neighborhood. The goal is to
    construct a local view on a topology which provides certain desired properties
    such as planarity. During algorithm execution, a node, in general, is not allowed
    to determine all its neighbors of the network graph. There are well-known reactive
    algorithms for computing planar subgraphs. However, the subgraphs obtained do
    not have constant Euclidean spanning ratio. This means that routing along these
    subgraphs may result in potentially long detours. So far, it has been unknown
    if planar spanners can be constructed reactively. In this work, we show that at
    least under the unit disk network model, this is indeed possible, by proposing
    an algorithm for reactive construction of the partial Delaunay triangulation,
    which recently turned out to be a spanner. Furthermore, we show that our algorithm
    is message-optimal as a node will only exchange messages with nodes that are also
    neighbors in the spanner. The algorithm’s presentation is complemented by a rigorous
    proof of correctness.
author:
- first_name: Markus
  full_name: Benter, Markus
  last_name: Benter
- first_name: Florentin
  full_name: Neumann, Florentin
  last_name: Neumann
- first_name: Hannes
  full_name: Frey, Hannes
  last_name: Frey
citation:
  ama: 'Benter M, Neumann F, Frey H. Reactive Planar Spanner Construction in Wireless
    Ad Hoc and Sensor Networks. In: <i>Proceedings of the 32nd IEEE International
    Conference on Computer Communications (INFOCOM)</i>. ; 2013:2193-2201. doi:<a
    href="https://doi.org/10.1109/INFCOM.2013.6567022">10.1109/INFCOM.2013.6567022</a>'
  apa: Benter, M., Neumann, F., &#38; Frey, H. (2013). Reactive Planar Spanner Construction
    in Wireless Ad Hoc and Sensor Networks. In <i>Proceedings of the 32nd IEEE International
    Conference on Computer Communications (INFOCOM)</i> (pp. 2193–2201). <a href="https://doi.org/10.1109/INFCOM.2013.6567022">https://doi.org/10.1109/INFCOM.2013.6567022</a>
  bibtex: '@inproceedings{Benter_Neumann_Frey_2013, title={Reactive Planar Spanner
    Construction in Wireless Ad Hoc and Sensor Networks}, DOI={<a href="https://doi.org/10.1109/INFCOM.2013.6567022">10.1109/INFCOM.2013.6567022</a>},
    booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications
    (INFOCOM)}, author={Benter, Markus and Neumann, Florentin and Frey, Hannes}, year={2013},
    pages={2193–2201} }'
  chicago: Benter, Markus, Florentin Neumann, and Hannes Frey. “Reactive Planar Spanner
    Construction in Wireless Ad Hoc and Sensor Networks.” In <i>Proceedings of the
    32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2193–2201,
    2013. <a href="https://doi.org/10.1109/INFCOM.2013.6567022">https://doi.org/10.1109/INFCOM.2013.6567022</a>.
  ieee: M. Benter, F. Neumann, and H. Frey, “Reactive Planar Spanner Construction
    in Wireless Ad Hoc and Sensor Networks,” in <i>Proceedings of the 32nd IEEE International
    Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 2193–2201.
  mla: Benter, Markus, et al. “Reactive Planar Spanner Construction in Wireless Ad
    Hoc and Sensor Networks.” <i>Proceedings of the 32nd IEEE International Conference
    on Computer Communications (INFOCOM)</i>, 2013, pp. 2193–201, doi:<a href="https://doi.org/10.1109/INFCOM.2013.6567022">10.1109/INFCOM.2013.6567022</a>.
  short: 'M. Benter, F. Neumann, H. Frey, in: Proceedings of the 32nd IEEE International
    Conference on Computer Communications (INFOCOM), 2013, pp. 2193–2201.'
date_created: 2017-10-17T12:42:29Z
date_updated: 2022-01-06T07:01:31Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/INFCOM.2013.6567022
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T13:41:34Z
  date_updated: 2018-03-15T13:41:34Z
  file_id: '1312'
  file_name: 496-reactivePDT-copyright.pdf
  file_size: 352571
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T13:41:34Z
has_accepted_license: '1'
page: 2193-2201
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 32nd IEEE International Conference on Computer Communications
  (INFOCOM)
status: public
title: Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '769'
author:
- first_name: Thorsten
  full_name: Biermann, Thorsten
  last_name: Biermann
- first_name: Luca
  full_name: Scalia, Luca
  last_name: Scalia
- first_name: Changsoon
  full_name: Choi, Changsoon
  last_name: Choi
- first_name: Wolfgang
  full_name: Kellerer, Wolfgang
  last_name: Kellerer
- first_name: Holger
  full_name: Karl, Holger
  last_name: Karl
citation:
  ama: Biermann T, Scalia L, Choi C, Kellerer W, Karl H. How backhaul networks influence
    the feasibility of coordinated multipoint in cellular networks. <i>{IEEE} Communications
    Magazine</i>. 2013;(8). doi:<a href="https://doi.org/10.1109/MCOM.2013.6576356">10.1109/MCOM.2013.6576356</a>
  apa: Biermann, T., Scalia, L., Choi, C., Kellerer, W., &#38; Karl, H. (2013). How
    backhaul networks influence the feasibility of coordinated multipoint in cellular
    networks. <i>{IEEE} Communications Magazine</i>, (8). <a href="https://doi.org/10.1109/MCOM.2013.6576356">https://doi.org/10.1109/MCOM.2013.6576356</a>
  bibtex: '@article{Biermann_Scalia_Choi_Kellerer_Karl_2013, title={How backhaul networks
    influence the feasibility of coordinated multipoint in cellular networks}, DOI={<a
    href="https://doi.org/10.1109/MCOM.2013.6576356">10.1109/MCOM.2013.6576356</a>},
    number={8}, journal={{IEEE} Communications Magazine}, author={Biermann, Thorsten
    and Scalia, Luca and Choi, Changsoon and Kellerer, Wolfgang and Karl, Holger},
    year={2013} }'
  chicago: Biermann, Thorsten, Luca Scalia, Changsoon Choi, Wolfgang Kellerer, and
    Holger Karl. “How Backhaul Networks Influence the Feasibility of Coordinated Multipoint
    in Cellular Networks.” <i>{IEEE} Communications Magazine</i>, no. 8 (2013). <a
    href="https://doi.org/10.1109/MCOM.2013.6576356">https://doi.org/10.1109/MCOM.2013.6576356</a>.
  ieee: T. Biermann, L. Scalia, C. Choi, W. Kellerer, and H. Karl, “How backhaul networks
    influence the feasibility of coordinated multipoint in cellular networks,” <i>{IEEE}
    Communications Magazine</i>, no. 8, 2013.
  mla: Biermann, Thorsten, et al. “How Backhaul Networks Influence the Feasibility
    of Coordinated Multipoint in Cellular Networks.” <i>{IEEE} Communications Magazine</i>,
    no. 8, 2013, doi:<a href="https://doi.org/10.1109/MCOM.2013.6576356">10.1109/MCOM.2013.6576356</a>.
  short: T. Biermann, L. Scalia, C. Choi, W. Kellerer, H. Karl, {IEEE} Communications
    Magazine (2013).
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:44Z
department:
- _id: '75'
doi: 10.1109/MCOM.2013.6576356
issue: '8'
publication: '{IEEE} Communications Magazine'
status: public
title: How backhaul networks influence the feasibility of coordinated multipoint in
  cellular networks
type: journal_article
user_id: '15572'
year: '2013'
...
---
_id: '508'
abstract:
- lang: eng
  text: The process of planning a virtual topology for a Wavelength Devision Multiplexing
    (WDM) network is called Virtual Topology Design (VTD). The goal of VTD is to find
    a virtual topology that supports forwarding the expected traffic without congestion.
    In networks with fluctuating, high traffic demands, it can happen that no single
    topology fits all changing traffic demands occurring over a longer time. Thus,
    during operation, the virtual topology has to be reconfigured. Since modern networks
    tend to be large, VTD algorithms have to scale well with increasing network size,
    requiring distributed algorithms. Existing distributed VTD algorithms, however,
    react too slowly on congestion for the real-time reconfiguration of large networks.
    We propose Selfish Virtual Topology Reconfiguration (SVTR) as a new algorithm
    for distributed VTD. It combines reconfiguring the virtual topology and routing
    through a Software Defined Network (SDN). SVTR is used for online, on-the-fly
    network reconfiguration. Its integrated routing and WDM reconfiguration keeps
    connection disruption due to network reconfiguration to a minimum and is able
    to react very quickly to traffic pattern changes. SVTR works by iteratively adapting
    the virtual topology to the observed traffic patterns without global traffic information
    and without future traffic estimations. We evaluated SVTR by simulation and found
    that it significantly lowers congestion in realistic networks and high load scenarios.
author:
- first_name: Philip
  full_name: Wette, Philip
  last_name: Wette
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Wette P, Karl H. On the Quality of Selfish Virtual Topology Reconfiguration
    in IP-over-WDM Networks. In: <i>Proceedings of the 19th IEEE International Workshop
    on Local and Metropolitan Area Networks (IEEE LANMAN)</i>. ; 2013:1-6. doi:<a
    href="https://doi.org/10.1109/LANMAN.2013.6528271">10.1109/LANMAN.2013.6528271</a>'
  apa: Wette, P., &#38; Karl, H. (2013). On the Quality of Selfish Virtual Topology
    Reconfiguration in IP-over-WDM Networks. In <i>Proceedings of the 19th IEEE International
    Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i> (pp. 1–6).
    <a href="https://doi.org/10.1109/LANMAN.2013.6528271">https://doi.org/10.1109/LANMAN.2013.6528271</a>
  bibtex: '@inproceedings{Wette_Karl_2013, title={On the Quality of Selfish Virtual
    Topology Reconfiguration in IP-over-WDM Networks}, DOI={<a href="https://doi.org/10.1109/LANMAN.2013.6528271">10.1109/LANMAN.2013.6528271</a>},
    booktitle={Proceedings of the 19th IEEE International Workshop on Local and Metropolitan
    Area Networks (IEEE LANMAN)}, author={Wette, Philip and Karl, Holger}, year={2013},
    pages={1–6} }'
  chicago: Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology
    Reconfiguration in IP-over-WDM Networks.” In <i>Proceedings of the 19th IEEE International
    Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>, 1–6, 2013.
    <a href="https://doi.org/10.1109/LANMAN.2013.6528271">https://doi.org/10.1109/LANMAN.2013.6528271</a>.
  ieee: P. Wette and H. Karl, “On the Quality of Selfish Virtual Topology Reconfiguration
    in IP-over-WDM Networks,” in <i>Proceedings of the 19th IEEE International Workshop
    on Local and Metropolitan Area Networks (IEEE LANMAN)</i>, 2013, pp. 1–6.
  mla: Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology
    Reconfiguration in IP-over-WDM Networks.” <i>Proceedings of the 19th IEEE International
    Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>, 2013, pp.
    1–6, doi:<a href="https://doi.org/10.1109/LANMAN.2013.6528271">10.1109/LANMAN.2013.6528271</a>.
  short: 'P. Wette, H. Karl, in: Proceedings of the 19th IEEE International Workshop
    on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp. 1–6.'
date_created: 2017-10-17T12:42:31Z
date_updated: 2022-01-06T07:01:37Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/LANMAN.2013.6528271
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:50:19Z
  date_updated: 2018-03-15T10:50:19Z
  file_id: '1307'
  file_name: 508-06528271.pdf
  file_size: 219902
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:50:19Z
has_accepted_license: '1'
page: '1 - 6 '
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 19th IEEE International Workshop on Local and Metropolitan
  Area Networks (IEEE LANMAN)
status: public
title: On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks
type: conference
user_id: '15572'
year: '2013'
...
---
_id: '509'
abstract:
- lang: eng
  text: In this paper we will introduce a new d-dimensional graph for constructing
    geometric application layer overlay net-works. Our approach will use internet
    coordinates, embedded using the L∞ -metric. After describing the graph structure,
    we will show how it limits maintenance overhead by bounding each node’s out-degree
    and how it supports greedy routing using one-hop neighbourhood information in
    each routing step. We will further show that greedy routing can always compute
    a path in our graph and we will also prove that in each forwarding step the next
    hop is closer to the destination than the current node.
author:
- first_name: Marcus
  full_name: Autenrieth, Marcus
  last_name: Autenrieth
- first_name: Hannes
  full_name: Frey, Hannes
  last_name: Frey
citation:
  ama: 'Autenrieth M, Frey H. On Greedy Routing in Degree-bounded Graphs over d-Dimensional
    Internet Coordinate Embeddings. In: <i>Proceedings of the Conference on Networked
    Systems (NetSys)</i>. ; 2013:126-131. doi:<a href="https://doi.org/10.1109/NetSys.2013.10">10.1109/NetSys.2013.10</a>'
  apa: Autenrieth, M., &#38; Frey, H. (2013). On Greedy Routing in Degree-bounded
    Graphs over d-Dimensional Internet Coordinate Embeddings. In <i>Proceedings of
    the Conference on Networked Systems (NetSys)</i> (pp. 126–131). <a href="https://doi.org/10.1109/NetSys.2013.10">https://doi.org/10.1109/NetSys.2013.10</a>
  bibtex: '@inproceedings{Autenrieth_Frey_2013, title={On Greedy Routing in Degree-bounded
    Graphs over d-Dimensional Internet Coordinate Embeddings}, DOI={<a href="https://doi.org/10.1109/NetSys.2013.10">10.1109/NetSys.2013.10</a>},
    booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Autenrieth,
    Marcus and Frey, Hannes}, year={2013}, pages={126–131} }'
  chicago: Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded
    Graphs over d-Dimensional Internet Coordinate Embeddings.” In <i>Proceedings of
    the Conference on Networked Systems (NetSys)</i>, 126–31, 2013. <a href="https://doi.org/10.1109/NetSys.2013.10">https://doi.org/10.1109/NetSys.2013.10</a>.
  ieee: M. Autenrieth and H. Frey, “On Greedy Routing in Degree-bounded Graphs over
    d-Dimensional Internet Coordinate Embeddings,” in <i>Proceedings of the Conference
    on Networked Systems (NetSys)</i>, 2013, pp. 126–131.
  mla: Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs
    over d-Dimensional Internet Coordinate Embeddings.” <i>Proceedings of the Conference
    on Networked Systems (NetSys)</i>, 2013, pp. 126–31, doi:<a href="https://doi.org/10.1109/NetSys.2013.10">10.1109/NetSys.2013.10</a>.
  short: 'M. Autenrieth, H. Frey, in: Proceedings of the Conference on Networked Systems
    (NetSys), 2013, pp. 126–131.'
date_created: 2017-10-17T12:42:31Z
date_updated: 2022-01-06T07:01:37Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/NetSys.2013.10
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:46:51Z
  date_updated: 2018-03-15T10:46:51Z
  file_id: '1304'
  file_name: 509-06529245.pdf
  file_size: 197048
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:46:51Z
has_accepted_license: '1'
page: 126-131
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the Conference on Networked Systems (NetSys)
status: public
title: On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate
  Embeddings
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '511'
author:
- first_name: Malte
  full_name: Splietker, Malte
  last_name: Splietker
citation:
  ama: Splietker M. <i>MapReduce in Software Defined Networks</i>. Universität Paderborn;
    2013.
  apa: Splietker, M. (2013). <i>MapReduce in Software Defined Networks</i>. Universität
    Paderborn.
  bibtex: '@book{Splietker_2013, title={MapReduce in Software Defined Networks}, publisher={Universität
    Paderborn}, author={Splietker, Malte}, year={2013} }'
  chicago: Splietker, Malte. <i>MapReduce in Software Defined Networks</i>. Universität
    Paderborn, 2013.
  ieee: M. Splietker, <i>MapReduce in Software Defined Networks</i>. Universität Paderborn,
    2013.
  mla: Splietker, Malte. <i>MapReduce in Software Defined Networks</i>. Universität
    Paderborn, 2013.
  short: M. Splietker, MapReduce in Software Defined Networks, Universität Paderborn,
    2013.
date_created: 2017-10-17T12:42:32Z
date_updated: 2022-01-06T07:01:38Z
department:
- _id: '75'
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: MapReduce in Software Defined Networks
type: bachelorsthesis
user_id: '15504'
year: '2013'
...
---
_id: '520'
abstract:
- lang: eng
  text: Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established
    lightpaths in case not enough resources are available to set up a new lightpath
    in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths
    to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated
    properties of the network topology are required by the applications running on
    the network, these requirements have to be known to the RWA algorithm.Otherwise
    it might happen that by preempting a particular lightpath these requirements are
    violated. If, however, these requirements include parametersknown only at the
    nodes running the application, the RWA algorithm cannot evaluate the requirements.
    For this reason an RWA algorithm is needed which incorporates feedback from the
    application layer in the preemption decisions.This work proposes a simple interface
    along with an algorithm for computing and selecting preemption candidates in case
    a lightpath cannot be established. We reason about the necessity of using information
    from the application layer in the RWA and present two example applications which
    benefit from this idea.
author:
- first_name: Philip
  full_name: Wette, Philip
  last_name: Wette
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Wette P, Karl H. Incorporating feedback from application layer into routing
    and wavelength assignment algorithms. In: <i>Proceedings of the 32nd IEEE International
    Conference on Computer Communications (INFOCOM)</i>. ; 2013:51-52. doi:<a href="https://doi.org/10.1109/INFCOMW.2013.6970733">10.1109/INFCOMW.2013.6970733</a>'
  apa: Wette, P., &#38; Karl, H. (2013). Incorporating feedback from application layer
    into routing and wavelength assignment algorithms. In <i>Proceedings of the 32nd
    IEEE International Conference on Computer Communications (INFOCOM)</i> (pp. 51–52).
    <a href="https://doi.org/10.1109/INFCOMW.2013.6970733">https://doi.org/10.1109/INFCOMW.2013.6970733</a>
  bibtex: '@inproceedings{Wette_Karl_2013, title={Incorporating feedback from application
    layer into routing and wavelength assignment algorithms}, DOI={<a href="https://doi.org/10.1109/INFCOMW.2013.6970733">10.1109/INFCOMW.2013.6970733</a>},
    booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications
    (INFOCOM)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={51–52}
    }'
  chicago: Wette, Philip, and Holger Karl. “Incorporating Feedback from Application
    Layer into Routing and Wavelength Assignment Algorithms.” In <i>Proceedings of
    the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>,
    51–52, 2013. <a href="https://doi.org/10.1109/INFCOMW.2013.6970733">https://doi.org/10.1109/INFCOMW.2013.6970733</a>.
  ieee: P. Wette and H. Karl, “Incorporating feedback from application layer into
    routing and wavelength assignment algorithms,” in <i>Proceedings of the 32nd IEEE
    International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 51–52.
  mla: Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer
    into Routing and Wavelength Assignment Algorithms.” <i>Proceedings of the 32nd
    IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013,
    pp. 51–52, doi:<a href="https://doi.org/10.1109/INFCOMW.2013.6970733">10.1109/INFCOMW.2013.6970733</a>.
  short: 'P. Wette, H. Karl, in: Proceedings of the 32nd IEEE International Conference
    on Computer Communications (INFOCOM), 2013, pp. 51–52.'
date_created: 2017-10-17T12:42:33Z
date_updated: 2022-01-06T07:01:43Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/INFCOMW.2013.6970733
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:38:04Z
  date_updated: 2018-03-15T10:38:04Z
  file_id: '1298'
  file_name: 520-wetteinfocom2013.pdf
  file_size: 131502
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:38:04Z
has_accepted_license: '1'
main_file_link:
- url: http://ieeexplore.ieee.org/document/6970733/
page: 51-52
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 32nd IEEE International Conference on Computer Communications
  (INFOCOM)
status: public
title: Incorporating feedback from application layer into routing and wavelength assignment
  algorithms
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '525'
author:
- first_name: Tim
  full_name: Niklas Vinkemeier, Tim
  last_name: Niklas Vinkemeier
citation:
  ama: Niklas Vinkemeier T. <i>Haptics - Hadoop Performance Testing in Concurrent
    Job Scenarios</i>. Universität Paderborn; 2013.
  apa: Niklas Vinkemeier, T. (2013). <i>Haptics - Hadoop performance testing in concurrent
    job scenarios</i>. Universität Paderborn.
  bibtex: '@book{Niklas Vinkemeier_2013, title={Haptics - Hadoop performance testing
    in concurrent job scenarios}, publisher={Universität Paderborn}, author={Niklas
    Vinkemeier, Tim}, year={2013} }'
  chicago: Niklas Vinkemeier, Tim. <i>Haptics - Hadoop Performance Testing in Concurrent
    Job Scenarios</i>. Universität Paderborn, 2013.
  ieee: T. Niklas Vinkemeier, <i>Haptics - Hadoop performance testing in concurrent
    job scenarios</i>. Universität Paderborn, 2013.
  mla: Niklas Vinkemeier, Tim. <i>Haptics - Hadoop Performance Testing in Concurrent
    Job Scenarios</i>. Universität Paderborn, 2013.
  short: T. Niklas Vinkemeier, Haptics - Hadoop Performance Testing in Concurrent
    Job Scenarios, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:48Z
department:
- _id: '75'
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Haptics - Hadoop performance testing in concurrent job scenarios
type: bachelorsthesis
user_id: '15504'
year: '2013'
...
---
_id: '534'
author:
- first_name: Suhas
  full_name: Satya, Suhas
  last_name: Satya
citation:
  ama: Satya S. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>.
    Universität Paderborn; 2013.
  apa: Satya, S. (2013). <i>Emulating Wavelength Division Multiplexing using Openflow</i>.
    Universität Paderborn.
  bibtex: '@book{Satya_2013, title={Emulating Wavelength Division Multiplexing using
    Openflow}, publisher={Universität Paderborn}, author={Satya, Suhas}, year={2013}
    }'
  chicago: Satya, Suhas. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>.
    Universität Paderborn, 2013.
  ieee: S. Satya, <i>Emulating Wavelength Division Multiplexing using Openflow</i>.
    Universität Paderborn, 2013.
  mla: Satya, Suhas. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>.
    Universität Paderborn, 2013.
  short: S. Satya, Emulating Wavelength Division Multiplexing Using Openflow, Universität
    Paderborn, 2013.
date_created: 2017-10-17T12:42:36Z
date_updated: 2022-01-06T07:01:50Z
department:
- _id: '75'
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Emulating Wavelength Division Multiplexing using Openflow
type: mastersthesis
user_id: '15504'
year: '2013'
...
---
_id: '562'
abstract:
- lang: eng
  text: In Distributed Cloud Computing, applications are deployed across many data
    centres at topologically diverse locations to improved network-related quality
    of service (QoS). As we focus on interactive applications, we minimize the latency
    between users and an application by allocating Cloud resources nearby the customers.
    Allocating resources at all locations will result in the best latency but also
    in the highest expenses. So we need to find an optimal subset of locations which
    reduces the latency but also the expenses – the facility location problem (FLP).
    In addition, we consider resource capacity restrictions, as a resource can only
    serve a limited amount of users. An FLP can be globally solved. Additionally,
    we propose a local, distributed heuristic. This heuristic is running within the
    network and does not depend on a global component. No distributed, local approximations
    for the capacitated FLP have been proposed so far due to the complexity of the
    problem. We compared the heuristic with an optimal solution obtained from a mixed
    integer program for different network topologies. We investigated the influence
    of different parameters like overall resource utilization or different latency
    weights.
author:
- first_name: Matthias
  full_name: Keller, Matthias
  last_name: Keller
- first_name: Stefan
  full_name: Pawlik, Stefan
  last_name: Pawlik
- first_name: Peter
  full_name: Pietrzyk, Peter
  last_name: Pietrzyk
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Keller M, Pawlik S, Pietrzyk P, Karl H. A Local Heuristic for Latency-Optimized
    Distributed Cloud Deployment. In: <i>Proceedings of the 6th International Conference
    on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing</i>.
    ; 2013:429-434. doi:<a href="https://doi.org/10.1109/UCC.2013.85">10.1109/UCC.2013.85</a>'
  apa: Keller, M., Pawlik, S., Pietrzyk, P., &#38; Karl, H. (2013). A Local Heuristic
    for Latency-Optimized Distributed Cloud Deployment. In <i>Proceedings of the 6th
    International Conference on Utility and Cloud Computing (UCC) workshop on Distributed
    cloud computing</i> (pp. 429–434). <a href="https://doi.org/10.1109/UCC.2013.85">https://doi.org/10.1109/UCC.2013.85</a>
  bibtex: '@inproceedings{Keller_Pawlik_Pietrzyk_Karl_2013, title={A Local Heuristic
    for Latency-Optimized Distributed Cloud Deployment}, DOI={<a href="https://doi.org/10.1109/UCC.2013.85">10.1109/UCC.2013.85</a>},
    booktitle={Proceedings of the 6th International Conference on Utility and Cloud
    Computing (UCC) workshop on Distributed cloud computing}, author={Keller, Matthias
    and Pawlik, Stefan and Pietrzyk, Peter and Karl, Holger}, year={2013}, pages={429–434}
    }'
  chicago: Keller, Matthias, Stefan Pawlik, Peter Pietrzyk, and Holger Karl. “A Local
    Heuristic for Latency-Optimized Distributed Cloud Deployment.” In <i>Proceedings
    of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop
    on Distributed Cloud Computing</i>, 429–34, 2013. <a href="https://doi.org/10.1109/UCC.2013.85">https://doi.org/10.1109/UCC.2013.85</a>.
  ieee: M. Keller, S. Pawlik, P. Pietrzyk, and H. Karl, “A Local Heuristic for Latency-Optimized
    Distributed Cloud Deployment,” in <i>Proceedings of the 6th International Conference
    on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing</i>,
    2013, pp. 429–434.
  mla: Keller, Matthias, et al. “A Local Heuristic for Latency-Optimized Distributed
    Cloud Deployment.” <i>Proceedings of the 6th International Conference on Utility
    and Cloud Computing (UCC) Workshop on Distributed Cloud Computing</i>, 2013, pp.
    429–34, doi:<a href="https://doi.org/10.1109/UCC.2013.85">10.1109/UCC.2013.85</a>.
  short: 'M. Keller, S. Pawlik, P. Pietrzyk, H. Karl, in: Proceedings of the 6th International
    Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud
    Computing, 2013, pp. 429–434.'
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:11Z
ddc:
- '040'
department:
- _id: '75'
- _id: '63'
doi: 10.1109/UCC.2013.85
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:25:45Z
  date_updated: 2018-03-15T10:25:45Z
  file_id: '1279'
  file_name: 562-dcc13_paper.pdf
  file_size: 347873
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:25:45Z
has_accepted_license: '1'
language:
- iso: eng
page: 429-434
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 6th International Conference on Utility and Cloud
  Computing (UCC) workshop on Distributed cloud computing
status: public
title: A Local Heuristic for Latency-Optimized Distributed Cloud Deployment
type: conference
user_id: '477'
year: '2013'
...
---
_id: '2504'
author:
- first_name: Rana Azeem M.
  full_name: Khan, Rana Azeem M.
  last_name: Khan
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: Khan RAM, Karl H. <i>Simulating Cooperative Diversity Protocols for Multi-Hop
    Wireless and Sensor Networks</i>.; 2012.
  apa: Khan, R. A. M., &#38; Karl, H. (2012). <i>Simulating Cooperative Diversity
    Protocols for Multi-hop Wireless and Sensor Networks</i>.
  bibtex: '@book{Khan_Karl_2012, title={Simulating Cooperative Diversity Protocols
    for Multi-hop Wireless and Sensor Networks}, author={Khan, Rana Azeem M. and Karl,
    Holger}, year={2012} }'
  chicago: Khan, Rana Azeem M., and Holger Karl. <i>Simulating Cooperative Diversity
    Protocols for Multi-Hop Wireless and Sensor Networks</i>, 2012.
  ieee: R. A. M. Khan and H. Karl, <i>Simulating Cooperative Diversity Protocols for
    Multi-hop Wireless and Sensor Networks</i>. 2012.
  mla: Khan, Rana Azeem M., and Holger Karl. <i>Simulating Cooperative Diversity Protocols
    for Multi-Hop Wireless and Sensor Networks</i>. 2012.
  short: R.A.M. Khan, H. Karl, Simulating Cooperative Diversity Protocols for Multi-Hop
    Wireless and Sensor Networks, 2012.
date_created: 2018-04-26T10:33:57Z
date_updated: 2022-01-06T06:56:44Z
department:
- _id: '75'
main_file_link:
- url: https://pdfs.semanticscholar.org/d44f/54184aee09de1c22906b7515976de801d473.pdf
status: public
title: Simulating Cooperative Diversity Protocols for Multi-hop Wireless and Sensor
  Networks
type: report
user_id: '15572'
year: '2012'
...
