---
_id: '28598'
author:
- first_name: Birgit
  full_name: Eickelmann, Birgit
  id: '40387'
  last_name: Eickelmann
- first_name: Wilfried
  full_name: Bos, Wilfried
  last_name: Bos
- first_name: Julia
  full_name: Gerick, Julia
  last_name: Gerick
citation:
  ama: Eickelmann B, Bos W, Gerick J. Wie geht es weiter? Zentrale Befunde der Studie
    ICILS 2013 und mögliche Handlungs- und Entwicklungsperspektiven für Einzelschulen.
    <i>SchulVerwaltung NRW</i>. 2015;5:145-148.
  apa: Eickelmann, B., Bos, W., &#38; Gerick, J. (2015). Wie geht es weiter? Zentrale
    Befunde der Studie ICILS 2013 und mögliche Handlungs- und Entwicklungsperspektiven
    für Einzelschulen. <i>SchulVerwaltung NRW</i>, <i>5</i>, 145–148.
  bibtex: '@article{Eickelmann_Bos_Gerick_2015, title={Wie geht es weiter? Zentrale
    Befunde der Studie ICILS 2013 und mögliche Handlungs- und Entwicklungsperspektiven
    für Einzelschulen}, volume={5}, journal={SchulVerwaltung NRW}, author={Eickelmann,
    Birgit and Bos, Wilfried and Gerick, Julia}, year={2015}, pages={145–148} }'
  chicago: 'Eickelmann, Birgit, Wilfried Bos, and Julia Gerick. “Wie geht es weiter?
    Zentrale Befunde der Studie ICILS 2013 und mögliche Handlungs- und Entwicklungsperspektiven
    für Einzelschulen.” <i>SchulVerwaltung NRW</i> 5 (2015): 145–48.'
  ieee: B. Eickelmann, W. Bos, and J. Gerick, “Wie geht es weiter? Zentrale Befunde
    der Studie ICILS 2013 und mögliche Handlungs- und Entwicklungsperspektiven für
    Einzelschulen,” <i>SchulVerwaltung NRW</i>, vol. 5, pp. 145–148, 2015.
  mla: Eickelmann, Birgit, et al. “Wie geht es weiter? Zentrale Befunde der Studie
    ICILS 2013 und mögliche Handlungs- und Entwicklungsperspektiven für Einzelschulen.”
    <i>SchulVerwaltung NRW</i>, vol. 5, 2015, pp. 145–48.
  short: B. Eickelmann, W. Bos, J. Gerick, SchulVerwaltung NRW 5 (2015) 145–148.
date_created: 2021-12-11T07:17:16Z
date_updated: 2022-01-06T06:58:09Z
department:
- _id: '462'
intvolume: '         5'
language:
- iso: ger
page: 145-148
publication: SchulVerwaltung NRW
status: public
title: Wie geht es weiter? Zentrale Befunde der Studie ICILS 2013 und mögliche Handlungs-
  und Entwicklungsperspektiven für Einzelschulen
type: journal_article
user_id: '50923'
volume: 5
year: '2015'
...
---
_id: '286'
author:
- first_name: Benedikt
  full_name: Kalde, Benedikt
  last_name: Kalde
citation:
  ama: Kalde B. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach
    Cramer und Shoup</i>. Universität Paderborn; 2015.
  apa: Kalde, B. (2015). <i>Implementierung eines hybriden Verschlüsselungsverfahrens
    nach Cramer und Shoup</i>. Universität Paderborn.
  bibtex: '@book{Kalde_2015, title={Implementierung eines hybriden Verschlüsselungsverfahrens
    nach Cramer und Shoup}, publisher={Universität Paderborn}, author={Kalde, Benedikt},
    year={2015} }'
  chicago: Kalde, Benedikt. <i>Implementierung eines hybriden Verschlüsselungsverfahrens
    nach Cramer und Shoup</i>. Universität Paderborn, 2015.
  ieee: B. Kalde, <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach
    Cramer und Shoup</i>. Universität Paderborn, 2015.
  mla: Kalde, Benedikt. <i>Implementierung eines hybriden Verschlüsselungsverfahrens
    nach Cramer und Shoup</i>. Universität Paderborn, 2015.
  short: B. Kalde, Implementierung eines hybriden Verschlüsselungsverfahrens nach
    Cramer und Shoup, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:10Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '28601'
author:
- first_name: Birgit
  full_name: Eickelmann, Birgit
  id: '40387'
  last_name: Eickelmann
- first_name: Wilfried
  full_name: Bos, Wilfried
  last_name: Bos
- first_name: Mario
  full_name: Vennemann, Mario
  last_name: Vennemann
citation:
  ama: Eickelmann B, Bos W, Vennemann M. <i>Total digital? - Wie Jugendliche Kompetenzen
    im Umgang mit neuen Technologien erwerben. Dokumentation der Analysen des Vertiefungsmoduls
    zu ICILS 2013</i>. Waxmann; 2015.
  apa: Eickelmann, B., Bos, W., &#38; Vennemann, M. (2015). <i>Total digital? - Wie
    Jugendliche Kompetenzen im Umgang mit neuen Technologien erwerben. Dokumentation
    der Analysen des Vertiefungsmoduls zu ICILS 2013</i>. Waxmann.
  bibtex: '@book{Eickelmann_Bos_Vennemann_2015, place={Münster}, title={Total digital?
    - Wie Jugendliche Kompetenzen im Umgang mit neuen Technologien erwerben. Dokumentation
    der Analysen des Vertiefungsmoduls zu ICILS 2013}, publisher={Waxmann}, author={Eickelmann,
    Birgit and Bos, Wilfried and Vennemann, Mario}, year={2015} }'
  chicago: 'Eickelmann, Birgit, Wilfried Bos, and Mario Vennemann. <i>Total digital?
    - Wie Jugendliche Kompetenzen im Umgang mit neuen Technologien erwerben. Dokumentation
    der Analysen des Vertiefungsmoduls zu ICILS 2013</i>. Münster: Waxmann, 2015.'
  ieee: 'B. Eickelmann, W. Bos, and M. Vennemann, <i>Total digital? - Wie Jugendliche
    Kompetenzen im Umgang mit neuen Technologien erwerben. Dokumentation der Analysen
    des Vertiefungsmoduls zu ICILS 2013</i>. Münster: Waxmann, 2015.'
  mla: Eickelmann, Birgit, et al. <i>Total digital? - Wie Jugendliche Kompetenzen
    im Umgang mit neuen Technologien erwerben. Dokumentation der Analysen des Vertiefungsmoduls
    zu ICILS 2013</i>. Waxmann, 2015.
  short: B. Eickelmann, W. Bos, M. Vennemann, Total digital? - Wie Jugendliche Kompetenzen
    im Umgang mit neuen Technologien erwerben. Dokumentation der Analysen des Vertiefungsmoduls
    zu ICILS 2013, Waxmann, Münster, 2015.
date_created: 2021-12-11T08:08:07Z
date_updated: 2022-01-06T06:58:10Z
ddc:
- '370'
department:
- _id: '462'
file:
- access_level: closed
  content_type: application/pdf
  creator: sschall
  date_created: 2021-12-11T08:08:36Z
  date_updated: 2021-12-11T08:08:36Z
  file_id: '28602'
  file_name: vertiefungsmodul_icils_2013_langfassung_20150623.pdf
  file_size: 215966
  relation: main_file
  success: 1
file_date_updated: 2021-12-11T08:08:36Z
has_accepted_license: '1'
language:
- iso: ger
place: Münster
publisher: Waxmann
status: public
title: Total digital? - Wie Jugendliche Kompetenzen im Umgang mit neuen Technologien
  erwerben. Dokumentation der Analysen des Vertiefungsmoduls zu ICILS 2013
type: book
user_id: '50923'
year: '2015'
...
---
_id: '28603'
author:
- first_name: Kwok-Wing
  full_name: Lai, Kwok-Wing
  last_name: Lai
- first_name: Niki
  full_name: Davis, Niki
  last_name: Davis
- first_name: Birgit
  full_name: Eickelmann, Birgit
  id: '40387'
  last_name: Eickelmann
- first_name: Ola
  full_name: Erstad, Ola
  last_name: Erstad
- first_name: Petra
  full_name: Fisser, Petra
  last_name: Fisser
- first_name: David C.
  full_name: Gibson, David C.
  last_name: Gibson
- first_name: Ferial
  full_name: Khaddage, Ferial
  last_name: Khaddage
- first_name: Gerald
  full_name: Knezek, Gerald
  last_name: Knezek
- first_name: Mary
  full_name: Webb, Mary
  last_name: Webb
citation:
  ama: 'Lai K-W, Davis N, Eickelmann B, et al. Tackling Educational Challenges in
    a Digitally Networked World. In: Brinda T, Reynolds N, Romeike R, Schwill A, eds.
    <i>KEYCIT 2014. Key Competencies in Informatics and ICT</i>. Universitätsverlag;
    2015:415-424.'
  apa: Lai, K.-W., Davis, N., Eickelmann, B., Erstad, O., Fisser, P., Gibson, D. C.,
    Khaddage, F., Knezek, G., &#38; Webb, M. (2015). Tackling Educational Challenges
    in a Digitally Networked World. In T. Brinda, N. Reynolds, R. Romeike, &#38; A.
    Schwill (Eds.), <i>KEYCIT 2014. Key Competencies in Informatics and ICT</i> (pp.
    415–424). Universitätsverlag.
  bibtex: '@inbook{Lai_Davis_Eickelmann_Erstad_Fisser_Gibson_Khaddage_Knezek_Webb_2015,
    place={Potsdam}, title={Tackling Educational Challenges in a Digitally Networked
    World}, booktitle={KEYCIT 2014. Key Competencies in Informatics and ICT}, publisher={Universitätsverlag},
    author={Lai, Kwok-Wing and Davis, Niki and Eickelmann, Birgit and Erstad, Ola
    and Fisser, Petra and Gibson, David C. and Khaddage, Ferial and Knezek, Gerald
    and Webb, Mary}, editor={Brinda, Torsten and Reynolds, Nicholas and Romeike, Ralf
    and Schwill, Andreas}, year={2015}, pages={415–424} }'
  chicago: 'Lai, Kwok-Wing, Niki Davis, Birgit Eickelmann, Ola Erstad, Petra Fisser,
    David C. Gibson, Ferial Khaddage, Gerald Knezek, and Mary Webb. “Tackling Educational
    Challenges in a Digitally Networked World.” In <i>KEYCIT 2014. Key Competencies
    in Informatics and ICT</i>, edited by Torsten Brinda, Nicholas Reynolds, Ralf
    Romeike, and Andreas Schwill, 415–24. Potsdam: Universitätsverlag, 2015.'
  ieee: 'K.-W. Lai <i>et al.</i>, “Tackling Educational Challenges in a Digitally
    Networked World,” in <i>KEYCIT 2014. Key Competencies in Informatics and ICT</i>,
    T. Brinda, N. Reynolds, R. Romeike, and A. Schwill, Eds. Potsdam: Universitätsverlag,
    2015, pp. 415–424.'
  mla: Lai, Kwok-Wing, et al. “Tackling Educational Challenges in a Digitally Networked
    World.” <i>KEYCIT 2014. Key Competencies in Informatics and ICT</i>, edited by
    Torsten Brinda et al., Universitätsverlag, 2015, pp. 415–24.
  short: 'K.-W. Lai, N. Davis, B. Eickelmann, O. Erstad, P. Fisser, D.C. Gibson, F.
    Khaddage, G. Knezek, M. Webb, in: T. Brinda, N. Reynolds, R. Romeike, A. Schwill
    (Eds.), KEYCIT 2014. Key Competencies in Informatics and ICT, Universitätsverlag,
    Potsdam, 2015, pp. 415–424.'
date_created: 2021-12-11T08:17:57Z
date_updated: 2022-01-06T06:58:11Z
ddc:
- '370'
department:
- _id: '462'
editor:
- first_name: Torsten
  full_name: Brinda, Torsten
  last_name: Brinda
- first_name: Nicholas
  full_name: Reynolds, Nicholas
  last_name: Reynolds
- first_name: Ralf
  full_name: Romeike, Ralf
  last_name: Romeike
- first_name: Andreas
  full_name: Schwill, Andreas
  last_name: Schwill
file:
- access_level: closed
  content_type: application/pdf
  creator: sschall
  date_created: 2021-12-11T08:17:47Z
  date_updated: 2021-12-11T08:17:47Z
  file_id: '28604'
  file_name: cid07.pdf
  file_size: 24021353
  relation: main_file
  success: 1
file_date_updated: 2021-12-11T08:17:47Z
has_accepted_license: '1'
language:
- iso: eng
page: 415-424
place: Potsdam
publication: KEYCIT 2014. Key Competencies in Informatics and ICT
publisher: Universitätsverlag
status: public
title: Tackling Educational Challenges in a Digitally Networked World
type: book_chapter
user_id: '50923'
year: '2015'
...
---
_id: '2865'
author:
- first_name: Daniela
  full_name: Strotmann, Daniela
  last_name: Strotmann
citation:
  ama: Strotmann D. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>.;
    2015.
  apa: Strotmann, D. (2015). <i>Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen</i>.
  bibtex: '@book{Strotmann_2015, title={Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen},
    author={Strotmann, Daniela}, year={2015} }'
  chicago: Strotmann, Daniela. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>,
    2015.
  ieee: D. Strotmann, <i>Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen</i>.
    2015.
  mla: Strotmann, Daniela. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>.
    2015.
  short: D. Strotmann, Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen, 2015.
date_created: 2018-05-24T13:05:41Z
date_updated: 2022-01-06T06:58:12Z
department:
- _id: '64'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen
type: bachelorsthesis
user_id: '25078'
year: '2015'
...
---
_id: '287'
abstract:
- lang: eng
  text: The size of modern data centers is constantly increasing. As it is not economic
    to interconnect all machines in the data center using a full-bisection-bandwidth
    network, techniques have to be developed to increase the efficiency of data-center
    networks. The Software-Defined Network paradigm opened the door for centralized
    traffic engineering (TE) in such environments. Up to now, there were already a
    number of TE proposals for SDN-controlled data centers that all work very well.
    However, these techniques either use a high amount of flow table entries or a
    high flow installation rate that overwhelms available switching hardware, or they
    require custom or very expensive end-of-line equipment to be usable in practice.
    We present HybridTE, a TE technique that uses (uncertain) information about large
    flows. Using this extra information, our technique has very low hardware requirements
    while maintaining better performance than existing TE techniques. This enables
    us to build very low-cost, high performance data-center networks.
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. HybridTE: Traffic Engineering for Very Low-Cost Software-Defined
    Data-Center Networks. In: <i>Proceedings of the 4th European Workshop on Software
    Defined Networks (EWSDN 2015)</i>. ; 2015:1--7. doi:<a href="https://doi.org/10.1109/EWSDN.2015.57">10.1109/EWSDN.2015.57</a>'
  apa: 'Wette, P., &#38; Karl, H. (2015). HybridTE: Traffic Engineering for Very Low-Cost
    Software-Defined Data-Center Networks. In <i>Proceedings of the 4th European Workshop
    on Software Defined Networks (EWSDN 2015)</i> (pp. 1--7). <a href="https://doi.org/10.1109/EWSDN.2015.57">https://doi.org/10.1109/EWSDN.2015.57</a>'
  bibtex: '@inproceedings{Wette_Karl_2015, title={HybridTE: Traffic Engineering for
    Very Low-Cost Software-Defined Data-Center Networks}, DOI={<a href="https://doi.org/10.1109/EWSDN.2015.57">10.1109/EWSDN.2015.57</a>},
    booktitle={Proceedings of the 4th European Workshop on Software Defined Networks
    (EWSDN 2015)}, author={Wette, Philip and Karl, Holger}, year={2015}, pages={1--7}
    }'
  chicago: 'Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very
    Low-Cost Software-Defined Data-Center Networks.” In <i>Proceedings of the 4th
    European Workshop on Software Defined Networks (EWSDN 2015)</i>, 1--7, 2015. <a
    href="https://doi.org/10.1109/EWSDN.2015.57">https://doi.org/10.1109/EWSDN.2015.57</a>.'
  ieee: 'P. Wette and H. Karl, “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined
    Data-Center Networks,” in <i>Proceedings of the 4th European Workshop on Software
    Defined Networks (EWSDN 2015)</i>, 2015, pp. 1--7.'
  mla: 'Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very Low-Cost
    Software-Defined Data-Center Networks.” <i>Proceedings of the 4th European Workshop
    on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 1--7, doi:<a href="https://doi.org/10.1109/EWSDN.2015.57">10.1109/EWSDN.2015.57</a>.'
  short: 'P. Wette, H. Karl, in: Proceedings of the 4th European Workshop on Software
    Defined Networks (EWSDN 2015), 2015, pp. 1--7.'
date_created: 2017-10-17T12:41:48Z
date_updated: 2022-01-06T06:58:17Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/EWSDN.2015.57
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-08T09:55:30Z
  date_updated: 2018-03-08T09:59:05Z
  file_id: '1203'
  file_name: 287-1503.04317v1.pdf
  file_size: 1625732
  relation: main_file
file_date_updated: 2018-03-08T09:59:05Z
has_accepted_license: '1'
page: 1--7
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 4th European Workshop on Software Defined Networks
  (EWSDN 2015)
quality_controlled: '1'
status: public
title: 'HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center
  Networks'
type: conference
urn: '2875'
user_id: '15572'
year: '2015'
...
---
_id: '24073'
author:
- first_name: Christian
  full_name: Erfurth, Christian
  last_name: Erfurth
- first_name: Jens
  full_name: Pottebaum, Jens
  id: '405'
  last_name: Pottebaum
  orcid: http://orcid.org/0000-0001-8778-2989
citation:
  ama: 'Erfurth C, Pottebaum J. IT-Unterstützung in Emergency Management &#38; Response.
    In: Cunningham DW, Hofstedt P, Meer K, Schmitt I, eds. <i>45. Jahrestagung Der
    Gesellschaft Für Informatik, Informatik 2015, Informatik, Energie Und Umwelt,
    28. September - 2. Oktober 2015 in Cottbus, Deutschland</i>. LNI. GI; 2015:1141-1142.'
  apa: Erfurth, C., &#38; Pottebaum, J. (2015). IT-Unterstützung in Emergency Management
    &#38; Response. In D. W. Cunningham, P. Hofstedt, K. Meer, &#38; I. Schmitt (Eds.),
    <i>45. Jahrestagung der Gesellschaft für Informatik, Informatik 2015, Informatik,
    Energie und Umwelt, 28. September - 2. Oktober 2015 in Cottbus, Deutschland</i>
    (pp. 1141–1142). GI.
  bibtex: '@inproceedings{Erfurth_Pottebaum_2015, series={LNI}, title={IT-Unterstützung
    in Emergency Management &#38; Response}, booktitle={45. Jahrestagung der Gesellschaft
    für Informatik, Informatik 2015, Informatik, Energie und Umwelt, 28. September
    - 2. Oktober 2015 in Cottbus, Deutschland}, publisher={GI}, author={Erfurth, Christian
    and Pottebaum, Jens}, editor={Cunningham, Douglas W. and Hofstedt, Petra and Meer,
    Klaus and Schmitt, Ingo}, year={2015}, pages={1141–1142}, collection={LNI} }'
  chicago: Erfurth, Christian, and Jens Pottebaum. “IT-Unterstützung in Emergency
    Management &#38; Response.” In <i>45. Jahrestagung Der Gesellschaft Für Informatik,
    Informatik 2015, Informatik, Energie Und Umwelt, 28. September - 2. Oktober 2015
    in Cottbus, Deutschland</i>, edited by Douglas W. Cunningham, Petra Hofstedt,
    Klaus Meer, and Ingo Schmitt, 1141–42. LNI. GI, 2015.
  ieee: C. Erfurth and J. Pottebaum, “IT-Unterstützung in Emergency Management &#38;
    Response,” in <i>45. Jahrestagung der Gesellschaft für Informatik, Informatik
    2015, Informatik, Energie und Umwelt, 28. September - 2. Oktober 2015 in Cottbus,
    Deutschland</i>, 2015, pp. 1141–1142.
  mla: Erfurth, Christian, and Jens Pottebaum. “IT-Unterstützung in Emergency Management
    &#38; Response.” <i>45. Jahrestagung Der Gesellschaft Für Informatik, Informatik
    2015, Informatik, Energie Und Umwelt, 28. September - 2. Oktober 2015 in Cottbus,
    Deutschland</i>, edited by Douglas W. Cunningham et al., GI, 2015, pp. 1141–42.
  short: 'C. Erfurth, J. Pottebaum, in: D.W. Cunningham, P. Hofstedt, K. Meer, I.
    Schmitt (Eds.), 45. Jahrestagung Der Gesellschaft Für Informatik, Informatik 2015,
    Informatik, Energie Und Umwelt, 28. September - 2. Oktober 2015 in Cottbus, Deutschland,
    GI, 2015, pp. 1141–1142.'
date_created: 2021-09-09T12:32:01Z
date_updated: 2022-01-06T06:56:06Z
editor:
- first_name: Douglas W.
  full_name: Cunningham, Douglas W.
  last_name: Cunningham
- first_name: Petra
  full_name: Hofstedt, Petra
  last_name: Hofstedt
- first_name: Klaus
  full_name: Meer, Klaus
  last_name: Meer
- first_name: Ingo
  full_name: Schmitt, Ingo
  last_name: Schmitt
keyword:
- Ver{\
language:
- iso: eng
page: 1141-1142
publication: 45. Jahrestagung der Gesellschaft für Informatik, Informatik 2015, Informatik,
  Energie und Umwelt, 28. September - 2. Oktober 2015 in Cottbus, Deutschland
publication_identifier:
  isbn:
  - 978-3-88579-640-4
publisher: GI
series_title: LNI
status: public
title: IT-Unterstützung in Emergency Management & Response
type: conference
user_id: '405'
year: '2015'
...
---
_id: '241'
abstract:
- lang: eng
  text: Distributed applications are commonly based on overlay networks interconnecting
    their sites so that they can exchange information. For these overlay networks
    to preserve their functionality, they should be able to recover from various problems
    like membership changes or faults. Various self-stabilizing overlay networks have
    already been proposed in recent years, which have the advantage of being able
    to recover from any illegal state, but none of these networks can give any guarantees
    on its functionality while the recovery process is going on. We initiate research
    on overlay networks that are not only self-stabilizing but that also ensure that
    searchability is maintained while the recovery process is going on, as long as
    there are no corrupted messages in the system. More precisely, once a search message
    from node u to another node v is successfully delivered, all future search messages
    from u to v succeed as well. We call this property monotonic searchability. We
    show that in general it is impossible to provide monotonic searchability if corrupted
    messages are present in the system, which justifies the restriction to system
    states without corrupted messages. Furthermore, we provide a self-stabilizing
    protocol for the line for which we can also show monotonic searchability. It turns
    out that even for the line it is non-trivial to achieve this property. Additionally,
    we extend our protocol to deal with node departures in terms of the Finite Departure
    Problem of Foreback et. al (SSS 2014). This makes our protocol even capable of
    handling node dynamics.
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: 'Scheideler C, Setzer A, Strothmann TF. Towards Establishing Monotonic Searchability
    in Self-Stabilizing Data Structures. In: <i>Proceedings of the 19th International
    Conference on Principles of Distributed Systems (OPODIS)</i>. Leibniz International
    Proceedings in Informatics (LIPIcs). ; 2015. doi:<a href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.24">10.4230/LIPIcs.OPODIS.2015.24</a>'
  apa: Scheideler, C., Setzer, A., &#38; Strothmann, T. F. (2015). Towards Establishing
    Monotonic Searchability in Self-Stabilizing Data Structures. In <i>Proceedings
    of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>.
    <a href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.24">https://doi.org/10.4230/LIPIcs.OPODIS.2015.24</a>
  bibtex: '@inproceedings{Scheideler_Setzer_Strothmann_2015, series={Leibniz International
    Proceedings in Informatics (LIPIcs)}, title={Towards Establishing Monotonic Searchability
    in Self-Stabilizing Data Structures}, DOI={<a href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.24">10.4230/LIPIcs.OPODIS.2015.24</a>},
    booktitle={Proceedings of the 19th International Conference on Principles of Distributed
    Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann,
    Thim Frederik}, year={2015}, collection={Leibniz International Proceedings in
    Informatics (LIPIcs)} }'
  chicago: Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann.
    “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.”
    In <i>Proceedings of the 19th International Conference on Principles of Distributed
    Systems (OPODIS)</i>. Leibniz International Proceedings in Informatics (LIPIcs),
    2015. <a href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.24">https://doi.org/10.4230/LIPIcs.OPODIS.2015.24</a>.
  ieee: C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards Establishing Monotonic
    Searchability in Self-Stabilizing Data Structures,” in <i>Proceedings of the 19th
    International Conference on Principles of Distributed Systems (OPODIS)</i>, 2015.
  mla: Scheideler, Christian, et al. “Towards Establishing Monotonic Searchability
    in Self-Stabilizing Data Structures.” <i>Proceedings of the 19th International
    Conference on Principles of Distributed Systems (OPODIS)</i>, 2015, doi:<a href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.24">10.4230/LIPIcs.OPODIS.2015.24</a>.
  short: 'C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 19th International
    Conference on Principles of Distributed Systems (OPODIS), 2015.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:07Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.4230/LIPIcs.OPODIS.2015.24
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:28:21Z
  date_updated: 2018-03-21T10:28:21Z
  file_id: '1497'
  file_name: 241-ScheidelerSetzerStrothmann2015.pdf
  file_size: 692363
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:28:21Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 19th International Conference on Principles of Distributed
  Systems (OPODIS)
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures
type: conference
user_id: '477'
year: '2015'
...
---
_id: '242'
abstract:
- lang: eng
  text: 'A fundamental problem for overlay networks is to safely exclude leaving nodes,
    i.e., the nodes requesting to leave the overlay network are excluded from it without
    affecting its connectivity. There are a number of studies for safe node exclusion
    if the overlay is in a well-defined state, but almost no formal results are known
    for the case in which the overlay network is in an arbitrary initial state, i.e.,
    when looking for a self-stabilizing solution for excluding leaving nodes. We study
    this problem in two variants: the Finite Departure Problem (FDP) and the Finite
    Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when
    it is safe to leave the network, whereas in the FSP, this leaving decision does
    not have to be final: the nodes may resume computation when woken up by an incoming
    message. We are the first to present a self-stabilizing protocol for the FDP and
    the FSP that can be combined with a large class of overlay maintenance protocols
    so that these are then guaranteed to safely exclude leaving nodes from the system
    from any initial state while operating as specified for the staying nodes. In
    order to formally define the properties these overlay maintenance protocols have
    to satisfy, we identify four basic primitives for manipulating edges in an overlay
    network that might be of independent interest.'
author:
- first_name: Andreas
  full_name: Koutsopoulos, Andreas
  last_name: Koutsopoulos
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: 'Koutsopoulos A, Scheideler C, Strothmann TF. Towards a Universal Approach
    for the Finite Departure Problem in Overlay Networks. In: <i>Proceedings of the
    17th International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS)</i>. Lecture Notes in Computer Science. ; 2015:201-216. doi:<a href="https://doi.org/10.1007/978-3-319-21741-3_14">10.1007/978-3-319-21741-3_14</a>'
  apa: Koutsopoulos, A., Scheideler, C., &#38; Strothmann, T. F. (2015). Towards a
    Universal Approach for the Finite Departure Problem in Overlay Networks. In <i>Proceedings
    of the 17th International Symposium on Stabilization, Safety, and Security of
    Distributed Systems (SSS)</i> (pp. 201–216). <a href="https://doi.org/10.1007/978-3-319-21741-3_14">https://doi.org/10.1007/978-3-319-21741-3_14</a>
  bibtex: '@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, series={Lecture
    Notes in Computer Science}, title={Towards a Universal Approach for the Finite
    Departure Problem in Overlay Networks}, DOI={<a href="https://doi.org/10.1007/978-3-319-21741-3_14">10.1007/978-3-319-21741-3_14</a>},
    booktitle={Proceedings of the 17th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)}, author={Koutsopoulos, Andreas and
    Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={201–216},
    collection={Lecture Notes in Computer Science} }'
  chicago: Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann.
    “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”
    In <i>Proceedings of the 17th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)</i>, 201–16. Lecture Notes in Computer
    Science, 2015. <a href="https://doi.org/10.1007/978-3-319-21741-3_14">https://doi.org/10.1007/978-3-319-21741-3_14</a>.
  ieee: A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a Universal
    Approach for the Finite Departure Problem in Overlay Networks,” in <i>Proceedings
    of the 17th International Symposium on Stabilization, Safety, and Security of
    Distributed Systems (SSS)</i>, 2015, pp. 201–216.
  mla: Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite
    Departure Problem in Overlay Networks.” <i>Proceedings of the 17th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>,
    2015, pp. 201–16, doi:<a href="https://doi.org/10.1007/978-3-319-21741-3_14">10.1007/978-3-319-21741-3_14</a>.
  short: 'A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the
    17th International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS), 2015, pp. 201–216.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:10Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-21741-3_14
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:59:32Z
  date_updated: 2018-03-21T09:59:32Z
  file_id: '1496'
  file_name: 242-KSS-SSS2015.pdf
  file_size: 532792
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:59:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 201-216
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 17th International Symposium on Stabilization, Safety,
  and Security of Distributed Systems (SSS)
series_title: Lecture Notes in Computer Science
status: public
title: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks
type: conference
user_id: '477'
year: '2015'
...
---
_id: '243'
abstract:
- lang: eng
  text: This paper introduces the problem of communication pattern adaption for a
    distributed self-adjusting binary search tree. We propose a simple local algorithm,
    which is closely related to the nearly thirty-year-old idea of splay trees and
    evaluate its adaption performance in the distributed scenario if different communication
    patterns are provided.To do so, the process of self-adjustment is modeled similarly
    to a basic network creation game, in which the nodes want to communicate with
    only a certain subset of all nodes. We show that, in general, the game (i.e.,
    the process of local adjustments) does not converge, and convergence is related
    to certain structures of the communication interests, which we call conflicts.We
    classify conflicts and show that for two communication scenarios in which convergence
    is guaranteed, the self-adjusting tree performs well.Furthermore, we investigate
    the different classes of conflicts separately and show that, for a certain class
    of conflicts, the performance of the tree network is asymptotically as good as
    the performance for converging instances. However, for the other conflict classes,
    a distributed self-adjusting binary search tree adapts poorly.
author:
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: 'Strothmann TF. The impact of communication patterns on distributed locally
    self-adjusting binary search trees. In: <i>Proceedings of the 9th International
    Workshop on Algorithms and Computation (WALCOM)</i>. LNCS. ; 2015:175--186. doi:<a
    href="https://doi.org/10.1007/978-3-319-15612-5_16">10.1007/978-3-319-15612-5_16</a>'
  apa: Strothmann, T. F. (2015). The impact of communication patterns on distributed
    locally self-adjusting binary search trees. In <i>Proceedings of the 9th International
    Workshop on Algorithms and Computation (WALCOM)</i> (pp. 175--186). <a href="https://doi.org/10.1007/978-3-319-15612-5_16">https://doi.org/10.1007/978-3-319-15612-5_16</a>
  bibtex: '@inproceedings{Strothmann_2015, series={LNCS}, title={The impact of communication
    patterns on distributed locally self-adjusting binary search trees}, DOI={<a href="https://doi.org/10.1007/978-3-319-15612-5_16">10.1007/978-3-319-15612-5_16</a>},
    booktitle={Proceedings of the 9th International Workshop on Algorithms and Computation
    (WALCOM)}, author={Strothmann, Thim Frederik}, year={2015}, pages={175--186},
    collection={LNCS} }'
  chicago: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
    Locally Self-Adjusting Binary Search Trees.” In <i>Proceedings of the 9th International
    Workshop on Algorithms and Computation (WALCOM)</i>, 175--186. LNCS, 2015. <a
    href="https://doi.org/10.1007/978-3-319-15612-5_16">https://doi.org/10.1007/978-3-319-15612-5_16</a>.
  ieee: T. F. Strothmann, “The impact of communication patterns on distributed locally
    self-adjusting binary search trees,” in <i>Proceedings of the 9th International
    Workshop on Algorithms and Computation (WALCOM)</i>, 2015, pp. 175--186.
  mla: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
    Locally Self-Adjusting Binary Search Trees.” <i>Proceedings of the 9th International
    Workshop on Algorithms and Computation (WALCOM)</i>, 2015, pp. 175--186, doi:<a
    href="https://doi.org/10.1007/978-3-319-15612-5_16">10.1007/978-3-319-15612-5_16</a>.
  short: 'T.F. Strothmann, in: Proceedings of the 9th International Workshop on Algorithms
    and Computation (WALCOM), 2015, pp. 175--186.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:17Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-15612-5_16
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:59:00Z
  date_updated: 2018-03-21T09:59:00Z
  file_id: '1495'
  file_name: 243-Strothmann-Walcom2015.pdf
  file_size: 1003113
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:59:00Z
has_accepted_license: '1'
language:
- iso: eng
page: 175--186
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 9th International Workshop on Algorithms and Computation
  (WALCOM)
series_title: LNCS
status: public
title: The impact of communication patterns on distributed locally self-adjusting
  binary search trees
type: conference
user_id: '477'
year: '2015'
...
---
_id: '244'
abstract:
- lang: eng
  text: We revisit the simple class of weighted congestion games on parallel links
    [10], where each player has a non-negative weight and her cost on the link she
    chooses is the sum of the weights of all players choosing the link. We extend
    this class to mix-weighted congestion games on parallel links, where weights may
    as well be negative. For the resulting simple class, we study the complexity of
    deciding the existence of a pure equilibrium, where no player could unilaterally
    improve her cost by switching to another link.We show that even for a singlenegative
    weight, this decision problem is strongly NP-complete when the number of links
    is part of the input; the problem is NP-complete already for two links. When the
    number of links is a fixed constant, we show, through a pseudopolynomial, dynamic
    programming algorithm, that the problem is not strongly NP-complete unless P =
    NP; the algorithm works for any number of negative weights.
author:
- first_name: Burkhard
  full_name: Monien, Burkhard
  last_name: Monien
- first_name: Marios
  full_name: Mavronicolas, Marios
  last_name: Mavronicolas
citation:
  ama: Monien B, Mavronicolas M. The complexity of pure equilibria in mix-weighted
    congestion games on parallel links. <i>Information Processing Letters</i>. 2015;115(12):927-931.
    doi:<a href="https://doi.org/10.1016/j.ipl.2015.07.012">10.1016/j.ipl.2015.07.012</a>
  apa: Monien, B., &#38; Mavronicolas, M. (2015). The complexity of pure equilibria
    in mix-weighted congestion games on parallel links. <i>Information Processing
    Letters</i>, <i>115</i>(12), 927–931. <a href="https://doi.org/10.1016/j.ipl.2015.07.012">https://doi.org/10.1016/j.ipl.2015.07.012</a>
  bibtex: '@article{Monien_Mavronicolas_2015, title={The complexity of pure equilibria
    in mix-weighted congestion games on parallel links}, volume={115}, DOI={<a href="https://doi.org/10.1016/j.ipl.2015.07.012">10.1016/j.ipl.2015.07.012</a>},
    number={12}, journal={Information Processing Letters}, publisher={Elsevier}, author={Monien,
    Burkhard and Mavronicolas, Marios}, year={2015}, pages={927–931} }'
  chicago: 'Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Pure Equilibria
    in Mix-Weighted Congestion Games on Parallel Links.” <i>Information Processing
    Letters</i> 115, no. 12 (2015): 927–31. <a href="https://doi.org/10.1016/j.ipl.2015.07.012">https://doi.org/10.1016/j.ipl.2015.07.012</a>.'
  ieee: B. Monien and M. Mavronicolas, “The complexity of pure equilibria in mix-weighted
    congestion games on parallel links,” <i>Information Processing Letters</i>, vol.
    115, no. 12, pp. 927–931, 2015.
  mla: Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Pure Equilibria
    in Mix-Weighted Congestion Games on Parallel Links.” <i>Information Processing
    Letters</i>, vol. 115, no. 12, Elsevier, 2015, pp. 927–31, doi:<a href="https://doi.org/10.1016/j.ipl.2015.07.012">10.1016/j.ipl.2015.07.012</a>.
  short: B. Monien, M. Mavronicolas, Information Processing Letters 115 (2015) 927–931.
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:20Z
ddc:
- '040'
doi: 10.1016/j.ipl.2015.07.012
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:48:16Z
  date_updated: 2018-03-21T09:48:16Z
  file_id: '1494'
  file_name: 244-Mavronic_Monien2015_01.pdf
  file_size: 239984
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:48:16Z
has_accepted_license: '1'
intvolume: '       115'
issue: '12'
language:
- iso: eng
main_file_link:
- url: http://www.sciencedirect.com/journal/information-processing-letters/vol/115/issue/12
page: 927-931
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: Information Processing Letters
publisher: Elsevier
status: public
title: The complexity of pure equilibria in mix-weighted congestion games on parallel
  links
type: journal_article
user_id: '42447'
volume: 115
year: '2015'
...
---
_id: '245'
abstract:
- lang: eng
  text: In cloud computing, software architects develop systems for virtually unlimited
    resources that cloud providers account on a pay-per-use basis. Elasticity management
    systems provision these resources autonomously to deal with changing workload.
    Such changing workloads call for new objective metrics allowing architects to
    quantify quality properties like scalability, elasticity, and efficiency, e.g.,
    for requirements/SLO engineering and software design analysis. In literature,
    initial metrics for these properties have been proposed. However, current metrics
    lack a systematic derivation and assume knowledge of implementation details like
    resource handling. Therefore, these metrics are inapplicable where such knowledge
    is unavailable.To cope with these lacks, this short paper derives metrics for
    scalability, elasticity, and efficiency properties of cloud computing systems
    using the goal question metric (GQM) method. Our derivation uses a running example
    that outlines characteristics of cloud computing systems. Eventually, this example
    allows us to set up a systematic GQM plan and to derive an initial set of six
    new metrics. We particularly show that our GQM plan allows to classify existing
    metrics.
author:
- first_name: Matthias
  full_name: Becker, Matthias
  last_name: Becker
- first_name: Sebastian
  full_name: Lehrig, Sebastian
  last_name: Lehrig
- first_name: Steffen
  full_name: Becker, Steffen
  last_name: Becker
citation:
  ama: 'Becker M, Lehrig S, Becker S. Systematically Deriving Quality Metrics for
    Cloud Computing Systems. In: <i>Proceedings of the 6th ACM/SPEC International
    Conference on Performance Engineering</i>. ICPE ’15. New York, NY, USA; 2015:169--174.
    doi:<a href="https://doi.org/10.1145/2668930.2688043">10.1145/2668930.2688043</a>'
  apa: Becker, M., Lehrig, S., &#38; Becker, S. (2015). Systematically Deriving Quality
    Metrics for Cloud Computing Systems. In <i>Proceedings of the 6th ACM/SPEC International
    Conference on Performance Engineering</i> (pp. 169--174). New York, NY, USA. <a
    href="https://doi.org/10.1145/2668930.2688043">https://doi.org/10.1145/2668930.2688043</a>
  bibtex: '@inproceedings{Becker_Lehrig_Becker_2015, place={New York, NY, USA}, series={ICPE
    ’15}, title={Systematically Deriving Quality Metrics for Cloud Computing Systems},
    DOI={<a href="https://doi.org/10.1145/2668930.2688043">10.1145/2668930.2688043</a>},
    booktitle={Proceedings of the 6th ACM/SPEC International Conference on Performance
    Engineering}, author={Becker, Matthias and Lehrig, Sebastian and Becker, Steffen},
    year={2015}, pages={169--174}, collection={ICPE ’15} }'
  chicago: Becker, Matthias, Sebastian Lehrig, and Steffen Becker. “Systematically
    Deriving Quality Metrics for Cloud Computing Systems.” In <i>Proceedings of the
    6th ACM/SPEC International Conference on Performance Engineering</i>, 169--174.
    ICPE ’15. New York, NY, USA, 2015. <a href="https://doi.org/10.1145/2668930.2688043">https://doi.org/10.1145/2668930.2688043</a>.
  ieee: M. Becker, S. Lehrig, and S. Becker, “Systematically Deriving Quality Metrics
    for Cloud Computing Systems,” in <i>Proceedings of the 6th ACM/SPEC International
    Conference on Performance Engineering</i>, 2015, pp. 169--174.
  mla: Becker, Matthias, et al. “Systematically Deriving Quality Metrics for Cloud
    Computing Systems.” <i>Proceedings of the 6th ACM/SPEC International Conference
    on Performance Engineering</i>, 2015, pp. 169--174, doi:<a href="https://doi.org/10.1145/2668930.2688043">10.1145/2668930.2688043</a>.
  short: 'M. Becker, S. Lehrig, S. Becker, in: Proceedings of the 6th ACM/SPEC International
    Conference on Performance Engineering, New York, NY, USA, 2015, pp. 169--174.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:26Z
ddc:
- '040'
doi: 10.1145/2668930.2688043
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:47:47Z
  date_updated: 2018-03-21T09:47:47Z
  file_id: '1493'
  file_name: 245-paper_02.pdf
  file_size: 462675
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:47:47Z
has_accepted_license: '1'
language:
- iso: eng
page: 169--174
place: New York, NY, USA
project:
- _id: '1'
  name: SFB 901
- _id: '10'
  name: SFB 901 - Subprojekt B2
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 6th ACM/SPEC International Conference on Performance
  Engineering
series_title: ICPE '15
status: public
title: Systematically Deriving Quality Metrics for Cloud Computing Systems
type: conference
user_id: '477'
year: '2015'
...
---
_id: '24530'
author:
- first_name: Elmar
  full_name: Moritzer, Elmar
  id: '20531'
  last_name: Moritzer
- first_name: Matthias
  full_name: Hopp, Matthias
  id: '13142'
  last_name: Hopp
citation:
  ama: 'Moritzer E, Hopp M. Bonding of Wood Plastic Composites (WPC) - Material and
    Surface Modification for Special Applications. In: <i>68th Annual Assembly of
    the International Institute of Welding (IIW)</i>. ; 2015.'
  apa: Moritzer, E., &#38; Hopp, M. (2015). Bonding of Wood Plastic Composites (WPC)
    - Material and Surface Modification for Special Applications. <i>68th Annual Assembly
    of the International Institute of Welding (IIW)</i>.
  bibtex: '@inproceedings{Moritzer_Hopp_2015, place={Helsinki, Finnland}, title={Bonding
    of Wood Plastic Composites (WPC) - Material and Surface Modification for Special
    Applications}, booktitle={68th Annual Assembly of the International Institute
    of Welding (IIW)}, author={Moritzer, Elmar and Hopp, Matthias}, year={2015} }'
  chicago: Moritzer, Elmar, and Matthias Hopp. “Bonding of Wood Plastic Composites
    (WPC) - Material and Surface Modification for Special Applications.” In <i>68th
    Annual Assembly of the International Institute of Welding (IIW)</i>. Helsinki,
    Finnland, 2015.
  ieee: E. Moritzer and M. Hopp, “Bonding of Wood Plastic Composites (WPC) - Material
    and Surface Modification for Special Applications,” 2015.
  mla: Moritzer, Elmar, and Matthias Hopp. “Bonding of Wood Plastic Composites (WPC)
    - Material and Surface Modification for Special Applications.” <i>68th Annual
    Assembly of the International Institute of Welding (IIW)</i>, 2015.
  short: 'E. Moritzer, M. Hopp, in: 68th Annual Assembly of the International Institute
    of Welding (IIW), Helsinki, Finnland, 2015.'
date_created: 2021-09-15T12:45:16Z
date_updated: 2022-01-06T06:56:27Z
department:
- _id: '9'
- _id: '367'
- _id: '321'
language:
- iso: eng
place: Helsinki, Finnland
publication: 68th Annual Assembly of the International Institute of Welding (IIW)
status: public
title: Bonding of Wood Plastic Composites (WPC) - Material and Surface Modification
  for Special Applications
type: conference
user_id: '13142'
year: '2015'
...
---
_id: '24531'
author:
- first_name: Elmar
  full_name: Moritzer, Elmar
  last_name: Moritzer
- first_name: Matthias
  full_name: Hopp, Matthias
  id: '13142'
  last_name: Hopp
citation:
  ama: Moritzer E, Hopp M. Kleben von Wood-Plastic-Composites (WPC) - Material- und
    Oberflächenmodifizierung für spezielle Anwendungen. <i>Jahresmagazin Kunststofftechnik</i>.
    Published online 2015.
  apa: Moritzer, E., &#38; Hopp, M. (2015). Kleben von Wood-Plastic-Composites (WPC)
    - Material- und Oberflächenmodifizierung für spezielle Anwendungen. <i>Jahresmagazin
    Kunststofftechnik</i>.
  bibtex: '@article{Moritzer_Hopp_2015, title={Kleben von Wood-Plastic-Composites
    (WPC) - Material- und Oberflächenmodifizierung für spezielle Anwendungen}, journal={Jahresmagazin
    Kunststofftechnik}, author={Moritzer, Elmar and Hopp, Matthias}, year={2015} }'
  chicago: Moritzer, Elmar, and Matthias Hopp. “Kleben von Wood-Plastic-Composites
    (WPC) - Material- Und Oberflächenmodifizierung Für Spezielle Anwendungen.” <i>Jahresmagazin
    Kunststofftechnik</i>, 2015.
  ieee: E. Moritzer and M. Hopp, “Kleben von Wood-Plastic-Composites (WPC) - Material-
    und Oberflächenmodifizierung für spezielle Anwendungen,” <i>Jahresmagazin Kunststofftechnik</i>,
    2015.
  mla: Moritzer, Elmar, and Matthias Hopp. “Kleben von Wood-Plastic-Composites (WPC)
    - Material- Und Oberflächenmodifizierung Für Spezielle Anwendungen.” <i>Jahresmagazin
    Kunststofftechnik</i>, 2015.
  short: E. Moritzer, M. Hopp, Jahresmagazin Kunststofftechnik (2015).
date_created: 2021-09-15T12:48:42Z
date_updated: 2022-01-06T06:56:27Z
department:
- _id: '9'
- _id: '367'
- _id: '321'
language:
- iso: eng
publication: Jahresmagazin Kunststofftechnik
publication_identifier:
  issn:
  - 1618-8357
status: public
title: Kleben von Wood-Plastic-Composites (WPC) - Material- und Oberflächenmodifizierung
  für spezielle Anwendungen
type: journal_article
user_id: '13142'
year: '2015'
...
---
_id: '246'
author:
- first_name: Galina
  full_name: Besova, Galina
  last_name: Besova
citation:
  ama: Besova G. <i>Systematic Development and Re-Use of Model Tranformations</i>.
    Universität Paderborn; 2015.
  apa: Besova, G. (2015). <i>Systematic Development and Re-Use of Model Tranformations</i>.
    Universität Paderborn.
  bibtex: '@book{Besova_2015, title={Systematic Development and Re-Use of Model Tranformations},
    publisher={Universität Paderborn}, author={Besova, Galina}, year={2015} }'
  chicago: Besova, Galina. <i>Systematic Development and Re-Use of Model Tranformations</i>.
    Universität Paderborn, 2015.
  ieee: G. Besova, <i>Systematic Development and Re-Use of Model Tranformations</i>.
    Universität Paderborn, 2015.
  mla: Besova, Galina. <i>Systematic Development and Re-Use of Model Tranformations</i>.
    Universität Paderborn, 2015.
  short: G. Besova, Systematic Development and Re-Use of Model Tranformations, Universität
    Paderborn, 2015.
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:30Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:47:14Z
  date_updated: 2018-03-21T09:47:14Z
  file_id: '1492'
  file_name: 246-Dissertation_-_Besova.pdf
  file_size: 10091866
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:47:14Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
related_material:
  link:
  - relation: confirmation
    url: http://digital.ub.uni-paderborn.de/hsx/content/titleinfo/1705899
status: public
supervisor:
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
title: Systematic Development and Re-Use of Model Tranformations
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '247'
abstract:
- lang: eng
  text: 'Multi-rooted trees are becoming the norm for modern data-center networks.
    In these networks, scalable flow routing is challenging owing to vast number of
    flows. Current approaches either employ a central controller that can have scalability
    issues or a scalable decentralized algorithm only considering local information.
    In this paper we present a new decentralized approach to least-congested path
    routing in software-defined data center networks that has neither of these issues:
    By duplicating the initial (or SYN) packet of a flow and estimating the data rate
    of multiple flows in parallel, we exploit TCP’s habit to fill buffers to find
    the least congested path. We show that our algorithm significantly improves flow
    completion time without the need for a central controller or specialized hardware.'
author:
- first_name: Arne
  full_name: Schwabe, Arne
  last_name: Schwabe
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Schwabe A, Karl H. SynRace: Decentralized Load-Adaptive Multi-path Routing
    without Collecting Statistics. In: <i>Proceedings of the 4th European Workshop
    on Software Defined Networks (EWSDN 2015)</i>. ; 2015:37-42. doi:<a href="https://doi.org/10.1109/EWSDN.2015.58">10.1109/EWSDN.2015.58</a>'
  apa: 'Schwabe, A., &#38; Karl, H. (2015). SynRace: Decentralized Load-Adaptive Multi-path
    Routing without Collecting Statistics. In <i>Proceedings of the 4th European Workshop
    on Software Defined Networks (EWSDN 2015)</i> (pp. 37–42). <a href="https://doi.org/10.1109/EWSDN.2015.58">https://doi.org/10.1109/EWSDN.2015.58</a>'
  bibtex: '@inproceedings{Schwabe_Karl_2015, title={SynRace: Decentralized Load-Adaptive
    Multi-path Routing without Collecting Statistics}, DOI={<a href="https://doi.org/10.1109/EWSDN.2015.58">10.1109/EWSDN.2015.58</a>},
    booktitle={Proceedings of the 4th European Workshop on Software Defined Networks
    (EWSDN 2015)}, author={Schwabe, Arne and Karl, Holger}, year={2015}, pages={37–42}
    }'
  chicago: 'Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive
    Multi-Path Routing without Collecting Statistics.” In <i>Proceedings of the 4th
    European Workshop on Software Defined Networks (EWSDN 2015)</i>, 37–42, 2015.
    <a href="https://doi.org/10.1109/EWSDN.2015.58">https://doi.org/10.1109/EWSDN.2015.58</a>.'
  ieee: 'A. Schwabe and H. Karl, “SynRace: Decentralized Load-Adaptive Multi-path
    Routing without Collecting Statistics,” in <i>Proceedings of the 4th European
    Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 37–42.'
  mla: 'Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path
    Routing without Collecting Statistics.” <i>Proceedings of the 4th European Workshop
    on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 37–42, doi:<a href="https://doi.org/10.1109/EWSDN.2015.58">10.1109/EWSDN.2015.58</a>.'
  short: 'A. Schwabe, H. Karl, in: Proceedings of the 4th European Workshop on Software
    Defined Networks (EWSDN 2015), 2015, pp. 37–42.'
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:32Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/EWSDN.2015.58
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:46:21Z
  date_updated: 2018-03-21T09:46:21Z
  file_id: '1491'
  file_name: 247-07313613.pdf
  file_size: 277574
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:46:21Z
has_accepted_license: '1'
page: 37-42
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 4th European Workshop on Software Defined Networks
  (EWSDN 2015)
status: public
title: 'SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting
  Statistics'
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '258'
author:
- first_name: Melissa
  full_name: Sonntag, Melissa
  last_name: Sonntag
citation:
  ama: Sonntag M. <i>Reputation und Vertrauen auf Online-Märkten</i>. Universität
    Paderborn; 2015.
  apa: Sonntag, M. (2015). <i>Reputation und Vertrauen auf Online-Märkten</i>. Universität
    Paderborn.
  bibtex: '@book{Sonntag_2015, title={Reputation und Vertrauen auf Online-Märkten},
    publisher={Universität Paderborn}, author={Sonntag, Melissa}, year={2015} }'
  chicago: Sonntag, Melissa. <i>Reputation und Vertrauen auf Online-Märkten</i>. Universität
    Paderborn, 2015.
  ieee: M. Sonntag, <i>Reputation und Vertrauen auf Online-Märkten</i>. Universität
    Paderborn, 2015.
  mla: Sonntag, Melissa. <i>Reputation und Vertrauen auf Online-Märkten</i>. Universität
    Paderborn, 2015.
  short: M. Sonntag, Reputation und Vertrauen auf Online-Märkten, Universität Paderborn,
    2015.
date_created: 2017-10-17T12:41:42Z
date_updated: 2022-01-06T06:57:12Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '8'
  name: SFB 901 - Subprojekt A4
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Reputation und Vertrauen auf Online-Märkten
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '259'
author:
- first_name: Dominik
  full_name: Gutt, Dominik
  id: '14368'
  last_name: Gutt
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'Gutt D, Kundisch D. Rating Aggregation in Multi-Dimensional Rating Systems:
    How Do Reviewers Form Overall Ratings? In: <i>INFORMS Annual Meeting</i>. ; 2015.'
  apa: 'Gutt, D., &#38; Kundisch, D. (2015). Rating Aggregation in Multi-Dimensional
    Rating Systems: How Do Reviewers Form Overall Ratings? In <i>INFORMS Annual Meeting</i>.
    Philadelphia, USA.'
  bibtex: '@inproceedings{Gutt_Kundisch_2015, title={Rating Aggregation in Multi-Dimensional
    Rating Systems: How Do Reviewers Form Overall Ratings?}, booktitle={INFORMS Annual
    Meeting}, author={Gutt, Dominik and Kundisch, Dennis}, year={2015} }'
  chicago: 'Gutt, Dominik, and Dennis Kundisch. “Rating Aggregation in Multi-Dimensional
    Rating Systems: How Do Reviewers Form Overall Ratings?” In <i>INFORMS Annual Meeting</i>,
    2015.'
  ieee: 'D. Gutt and D. Kundisch, “Rating Aggregation in Multi-Dimensional Rating
    Systems: How Do Reviewers Form Overall Ratings?,” in <i>INFORMS Annual Meeting</i>,
    Philadelphia, USA, 2015.'
  mla: 'Gutt, Dominik, and Dennis Kundisch. “Rating Aggregation in Multi-Dimensional
    Rating Systems: How Do Reviewers Form Overall Ratings?” <i>INFORMS Annual Meeting</i>,
    2015.'
  short: 'D. Gutt, D. Kundisch, in: INFORMS Annual Meeting, 2015.'
conference:
  location: Philadelphia, USA
  name: INFORMS Annual Meeting
date_created: 2017-10-17T12:41:42Z
date_updated: 2022-01-06T06:57:13Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: d0mi
  date_created: 2019-01-18T14:11:39Z
  date_updated: 2019-01-18T14:11:39Z
  file_id: '6862'
  file_name: Informs_annual_meeting_2015.pdf
  file_size: 89877
  relation: main_file
  success: 1
file_date_updated: 2019-01-18T14:11:39Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '8'
  name: SFB 901 - Subprojekt A4
- _id: '2'
  name: SFB 901 - Project Area A
publication: INFORMS Annual Meeting
status: public
title: 'Rating Aggregation in Multi-Dimensional Rating Systems: How Do Reviewers Form
  Overall Ratings?'
type: conference_abstract
user_id: '477'
year: '2015'
...
---
_id: '260'
abstract:
- lang: eng
  text: During the last decade, researchers have proposed a number of model transformations
    enabling performance predictions. These transformations map performance-annotated
    software architecture models into stochastic models solved by analytical means
    or by simulation. However, so far, a detailed quantitative evaluation of the accuracy
    and efﬁciency of different transformations is missing, making it hard to select
    an adequate transformation for a given context. This paper provides an in-depth
    comparison and quantitative evaluation of representative model transformations
    to, e.g., Queueing Petri Nets and Layered Queueing Networks. The semantic gaps
    between typical source model abstractions and the different analysis techniques
    are revealed. The accuracy and efﬁciency of each transformation are evaluated
    by considering four case studies representing systems of different size and complexity.
    The presented results and insights gained from the evaluation help software architects
    and performance engineers to select the appropriate transformation for a given
    context, thus signiﬁcantly improving the usability of model transformations for
    performance prediction.
author:
- first_name: Fabian
  full_name: Brosig, Fabian
  last_name: Brosig
- first_name: Philipp
  full_name: Meier, Philipp
  last_name: Meier
- first_name: Steffen
  full_name: Becker, Steffen
  last_name: Becker
- first_name: Anne
  full_name: Koziolek, Anne
  last_name: Koziolek
- first_name: Heiko
  full_name: Koziolek, Heiko
  last_name: Koziolek
- first_name: Samuel
  full_name: Kounev, Samuel
  last_name: Kounev
citation:
  ama: Brosig F, Meier P, Becker S, Koziolek A, Koziolek H, Kounev S. Quantitative
    Evaluation of Model-Driven Performance Analysis and Simulation of Component-based
    Architectures. <i>Transactions on Software Engineering</i>. 2015;(2):157--175.
    doi:<a href="https://doi.org/10.1109/TSE.2014.2362755">10.1109/TSE.2014.2362755</a>
  apa: Brosig, F., Meier, P., Becker, S., Koziolek, A., Koziolek, H., &#38; Kounev,
    S. (2015). Quantitative Evaluation of Model-Driven Performance Analysis and Simulation
    of Component-based Architectures. <i>Transactions on Software Engineering</i>,
    (2), 157--175. <a href="https://doi.org/10.1109/TSE.2014.2362755">https://doi.org/10.1109/TSE.2014.2362755</a>
  bibtex: '@article{Brosig_Meier_Becker_Koziolek_Koziolek_Kounev_2015, title={Quantitative
    Evaluation of Model-Driven Performance Analysis and Simulation of Component-based
    Architectures}, DOI={<a href="https://doi.org/10.1109/TSE.2014.2362755">10.1109/TSE.2014.2362755</a>},
    number={2}, journal={Transactions on Software Engineering}, publisher={IEEE},
    author={Brosig, Fabian and Meier, Philipp and Becker, Steffen and Koziolek, Anne
    and Koziolek, Heiko and Kounev, Samuel}, year={2015}, pages={157--175} }'
  chicago: 'Brosig, Fabian, Philipp Meier, Steffen Becker, Anne Koziolek, Heiko Koziolek,
    and Samuel Kounev. “Quantitative Evaluation of Model-Driven Performance Analysis
    and Simulation of Component-Based Architectures.” <i>Transactions on Software
    Engineering</i>, no. 2 (2015): 157--175. <a href="https://doi.org/10.1109/TSE.2014.2362755">https://doi.org/10.1109/TSE.2014.2362755</a>.'
  ieee: F. Brosig, P. Meier, S. Becker, A. Koziolek, H. Koziolek, and S. Kounev, “Quantitative
    Evaluation of Model-Driven Performance Analysis and Simulation of Component-based
    Architectures,” <i>Transactions on Software Engineering</i>, no. 2, pp. 157--175,
    2015.
  mla: Brosig, Fabian, et al. “Quantitative Evaluation of Model-Driven Performance
    Analysis and Simulation of Component-Based Architectures.” <i>Transactions on
    Software Engineering</i>, no. 2, IEEE, 2015, pp. 157--175, doi:<a href="https://doi.org/10.1109/TSE.2014.2362755">10.1109/TSE.2014.2362755</a>.
  short: F. Brosig, P. Meier, S. Becker, A. Koziolek, H. Koziolek, S. Kounev, Transactions
    on Software Engineering (2015) 157--175.
date_created: 2017-10-17T12:41:42Z
date_updated: 2022-01-06T06:57:15Z
ddc:
- '040'
doi: 10.1109/TSE.2014.2362755
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:38:42Z
  date_updated: 2018-03-21T09:38:42Z
  file_id: '1484'
  file_name: 260-TSE_Journal-1.pdf
  file_size: 1973471
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:38:42Z
has_accepted_license: '1'
issue: '2'
page: 157--175
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: Transactions on Software Engineering
publisher: IEEE
status: public
title: Quantitative Evaluation of Model-Driven Performance Analysis and Simulation
  of Component-based Architectures
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '261'
author:
- first_name: Thorsten
  full_name: Eisenhofer, Thorsten
  last_name: Eisenhofer
citation:
  ama: Eisenhofer T. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>.
    Universität Paderborn; 2015.
  apa: Eisenhofer, T. (2015). <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>.
    Universität Paderborn.
  bibtex: '@book{Eisenhofer_2015, title={Protokolle zur authentifizierten Schüsselvereinbarung},
    publisher={Universität Paderborn}, author={Eisenhofer, Thorsten}, year={2015}
    }'
  chicago: Eisenhofer, Thorsten. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>.
    Universität Paderborn, 2015.
  ieee: T. Eisenhofer, <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>.
    Universität Paderborn, 2015.
  mla: Eisenhofer, Thorsten. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>.
    Universität Paderborn, 2015.
  short: T. Eisenhofer, Protokolle zur authentifizierten Schüsselvereinbarung, Universität
    Paderborn, 2015.
date_created: 2017-10-17T12:41:43Z
date_updated: 2022-01-06T06:57:16Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Protokolle zur authentifizierten Schüsselvereinbarung
type: bachelorsthesis
user_id: '477'
year: '2015'
...
