---
_id: '759'
author:
- first_name: Martin
  full_name: Dräxler, Martin
  last_name: Dräxler
- first_name: Philipp
  full_name: Dreimann, Philipp
  last_name: Dreimann
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Dräxler M, Dreimann P, Karl H. Anticipatory power cycling of mobile network
    equipment for high demand multimedia traffic. In: <i>IEEE Online Conference on
    Green Communications, OnlineGreenComm 2014, November 12-14, 2014</i>. ; 2014:1--7.
    doi:<a href="https://doi.org/10.1109/OnlineGreenCom.2014.7114415">10.1109/OnlineGreenCom.2014.7114415</a>'
  apa: Dräxler, M., Dreimann, P., &#38; Karl, H. (2014). Anticipatory power cycling
    of mobile network equipment for high demand multimedia traffic. In <i>IEEE Online
    Conference on Green Communications, OnlineGreenComm 2014, November 12-14, 2014</i>
    (pp. 1--7). <a href="https://doi.org/10.1109/OnlineGreenCom.2014.7114415">https://doi.org/10.1109/OnlineGreenCom.2014.7114415</a>
  bibtex: '@inproceedings{Dräxler_Dreimann_Karl_2014, title={Anticipatory power cycling
    of mobile network equipment for high demand multimedia traffic}, DOI={<a href="https://doi.org/10.1109/OnlineGreenCom.2014.7114415">10.1109/OnlineGreenCom.2014.7114415</a>},
    booktitle={IEEE Online Conference on Green Communications, OnlineGreenComm 2014,
    November 12-14, 2014}, author={Dräxler, Martin and Dreimann, Philipp and Karl,
    Holger}, year={2014}, pages={1--7} }'
  chicago: Dräxler, Martin, Philipp Dreimann, and Holger Karl. “Anticipatory Power
    Cycling of Mobile Network Equipment for High Demand Multimedia Traffic.” In <i>IEEE
    Online Conference on Green Communications, OnlineGreenComm 2014, November 12-14,
    2014</i>, 1--7, 2014. <a href="https://doi.org/10.1109/OnlineGreenCom.2014.7114415">https://doi.org/10.1109/OnlineGreenCom.2014.7114415</a>.
  ieee: M. Dräxler, P. Dreimann, and H. Karl, “Anticipatory power cycling of mobile
    network equipment for high demand multimedia traffic,” in <i>IEEE Online Conference
    on Green Communications, OnlineGreenComm 2014, November 12-14, 2014</i>, 2014,
    pp. 1--7.
  mla: Dräxler, Martin, et al. “Anticipatory Power Cycling of Mobile Network Equipment
    for High Demand Multimedia Traffic.” <i>IEEE Online Conference on Green Communications,
    OnlineGreenComm 2014, November 12-14, 2014</i>, 2014, pp. 1--7, doi:<a href="https://doi.org/10.1109/OnlineGreenCom.2014.7114415">10.1109/OnlineGreenCom.2014.7114415</a>.
  short: 'M. Dräxler, P. Dreimann, H. Karl, in: IEEE Online Conference on Green Communications,
    OnlineGreenComm 2014, November 12-14, 2014, 2014, pp. 1--7.'
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:40Z
department:
- _id: '75'
doi: 10.1109/OnlineGreenCom.2014.7114415
ec_funded: '1'
page: 1--7
project:
- _id: '22'
  call_identifier: FP7-ICT-2011-C
  grant_number: '318115'
  name: Connectivity management for eneRgy Optimised Wireless Dense works
publication: IEEE Online Conference on Green Communications, OnlineGreenComm 2014,
  November 12-14, 2014
status: public
title: Anticipatory power cycling of mobile network equipment for high demand multimedia
  traffic
type: conference
user_id: '15572'
year: '2014'
...
---
_id: '760'
author:
- first_name: Sebastien
  full_name: Auroux, Sebastien
  last_name: Auroux
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Auroux S, Karl H. Flow processing-aware controller placement in wireless DenseNets.
    In: <i>25th IEEE Annual International Symposium on Personal, Indoor, and Mobile
    Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5, 2014</i>.
    ; 2014:1294--1299. doi:<a href="https://doi.org/10.1109/PIMRC.2014.7136368">10.1109/PIMRC.2014.7136368</a>'
  apa: Auroux, S., &#38; Karl, H. (2014). Flow processing-aware controller placement
    in wireless DenseNets. In <i>25th IEEE Annual International Symposium on Personal,
    Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September
    2-5, 2014</i> (pp. 1294--1299). <a href="https://doi.org/10.1109/PIMRC.2014.7136368">https://doi.org/10.1109/PIMRC.2014.7136368</a>
  bibtex: '@inproceedings{Auroux_Karl_2014, title={Flow processing-aware controller
    placement in wireless DenseNets}, DOI={<a href="https://doi.org/10.1109/PIMRC.2014.7136368">10.1109/PIMRC.2014.7136368</a>},
    booktitle={25th IEEE Annual International Symposium on Personal, Indoor, and Mobile
    Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5, 2014}, author={Auroux,
    Sebastien and Karl, Holger}, year={2014}, pages={1294--1299} }'
  chicago: Auroux, Sebastien, and Holger Karl. “Flow Processing-Aware Controller Placement
    in Wireless DenseNets.” In <i>25th IEEE Annual International Symposium on Personal,
    Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September
    2-5, 2014</i>, 1294--1299, 2014. <a href="https://doi.org/10.1109/PIMRC.2014.7136368">https://doi.org/10.1109/PIMRC.2014.7136368</a>.
  ieee: S. Auroux and H. Karl, “Flow processing-aware controller placement in wireless
    DenseNets,” in <i>25th IEEE Annual International Symposium on Personal, Indoor,
    and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5,
    2014</i>, 2014, pp. 1294--1299.
  mla: Auroux, Sebastien, and Holger Karl. “Flow Processing-Aware Controller Placement
    in Wireless DenseNets.” <i>25th IEEE Annual International Symposium on Personal,
    Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September
    2-5, 2014</i>, 2014, pp. 1294--1299, doi:<a href="https://doi.org/10.1109/PIMRC.2014.7136368">10.1109/PIMRC.2014.7136368</a>.
  short: 'S. Auroux, H. Karl, in: 25th IEEE Annual International Symposium on Personal,
    Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September
    2-5, 2014, 2014, pp. 1294--1299.'
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:40Z
department:
- _id: '75'
doi: 10.1109/PIMRC.2014.7136368
ec_funded: '1'
page: 1294--1299
project:
- _id: '22'
  call_identifier: FP7-ICT-2011-C
  grant_number: '318115'
  name: Connectivity management for eneRgy Optimised Wireless Dense works
publication: 25th IEEE Annual International Symposium on Personal, Indoor, and Mobile
  Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5, 2014
status: public
title: Flow processing-aware controller placement in wireless DenseNets
type: conference
user_id: '15572'
year: '2014'
...
---
_id: '762'
author:
- first_name: Arne
  full_name: Schwabe, Arne
  last_name: Schwabe
- first_name: Holger
  full_name: Karl, Holger
  last_name: Karl
citation:
  ama: 'Schwabe A, Karl H. Using MAC addresses as efficient routing labels in data
    centers. In: <i>Proceedings of the Third Workshop on Hot Topics in Software Defined
    Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i>. ; 2014:115--120.
    doi:<a href="https://doi.org/10.1145/2620728.2620730">10.1145/2620728.2620730</a>'
  apa: Schwabe, A., &#38; Karl, H. (2014). Using MAC addresses as efficient routing
    labels in data centers. In <i>Proceedings of the third workshop on Hot topics
    in software defined networking, HotSDN ’14, Chicago, Illinois, USA, August 22,
    2014</i> (pp. 115--120). <a href="https://doi.org/10.1145/2620728.2620730">https://doi.org/10.1145/2620728.2620730</a>
  bibtex: '@inproceedings{Schwabe_Karl_2014, title={Using MAC addresses as efficient
    routing labels in data centers}, DOI={<a href="https://doi.org/10.1145/2620728.2620730">10.1145/2620728.2620730</a>},
    booktitle={Proceedings of the third workshop on Hot topics in software defined
    networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014}, author={Schwabe,
    Arne and Karl, Holger}, year={2014}, pages={115--120} }'
  chicago: Schwabe, Arne, and Holger Karl. “Using MAC Addresses as Efficient Routing
    Labels in Data Centers.” In <i>Proceedings of the Third Workshop on Hot Topics
    in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22,
    2014</i>, 115--120, 2014. <a href="https://doi.org/10.1145/2620728.2620730">https://doi.org/10.1145/2620728.2620730</a>.
  ieee: A. Schwabe and H. Karl, “Using MAC addresses as efficient routing labels in
    data centers,” in <i>Proceedings of the third workshop on Hot topics in software
    defined networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i>, 2014,
    pp. 115--120.
  mla: Schwabe, Arne, and Holger Karl. “Using MAC Addresses as Efficient Routing Labels
    in Data Centers.” <i>Proceedings of the Third Workshop on Hot Topics in Software
    Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i>, 2014,
    pp. 115--120, doi:<a href="https://doi.org/10.1145/2620728.2620730">10.1145/2620728.2620730</a>.
  short: 'A. Schwabe, H. Karl, in: Proceedings of the Third Workshop on Hot Topics
    in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22,
    2014, 2014, pp. 115--120.'
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:41Z
ddc:
- '004'
department:
- _id: '75'
doi: 10.1145/2620728.2620730
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T13:32:48Z
  date_updated: 2018-11-02T13:32:48Z
  file_id: '5249'
  file_name: p115-schwabe.pdf
  file_size: 1349578
  relation: main_file
file_date_updated: 2018-11-02T13:32:48Z
has_accepted_license: '1'
language:
- iso: eng
page: 115--120
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '6'
  name: SFB 901 - Subproject A2
publication: Proceedings of the third workshop on Hot topics in software defined networking,
  HotSDN '14, Chicago, Illinois, USA, August 22, 2014
status: public
title: Using MAC addresses as efficient routing labels in data centers
type: conference
user_id: '477'
year: '2014'
...
---
_id: '763'
author:
- first_name: Johannes
  full_name: Blanckenstein, Johannes
  last_name: Blanckenstein
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Blanckenstein J, Karl H. Energy-efficient clock synchronization using wake-up
    receivers. In: <i>22nd International Conference on Software, Telecommunications
    and Computer Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014</i>.
    ; 2014:408--413. doi:<a href="https://doi.org/10.1109/SOFTCOM.2014.7039090">10.1109/SOFTCOM.2014.7039090</a>'
  apa: Blanckenstein, J., &#38; Karl, H. (2014). Energy-efficient clock synchronization
    using wake-up receivers. In <i>22nd International Conference on Software, Telecommunications
    and Computer Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014</i>
    (pp. 408--413). <a href="https://doi.org/10.1109/SOFTCOM.2014.7039090">https://doi.org/10.1109/SOFTCOM.2014.7039090</a>
  bibtex: '@inproceedings{Blanckenstein_Karl_2014, title={Energy-efficient clock synchronization
    using wake-up receivers}, DOI={<a href="https://doi.org/10.1109/SOFTCOM.2014.7039090">10.1109/SOFTCOM.2014.7039090</a>},
    booktitle={22nd International Conference on Software, Telecommunications and Computer
    Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014}, author={Blanckenstein,
    Johannes and Karl, Holger}, year={2014}, pages={408--413} }'
  chicago: Blanckenstein, Johannes, and Holger Karl. “Energy-Efficient Clock Synchronization
    Using Wake-up Receivers.” In <i>22nd International Conference on Software, Telecommunications
    and Computer Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014</i>,
    408--413, 2014. <a href="https://doi.org/10.1109/SOFTCOM.2014.7039090">https://doi.org/10.1109/SOFTCOM.2014.7039090</a>.
  ieee: J. Blanckenstein and H. Karl, “Energy-efficient clock synchronization using
    wake-up receivers,” in <i>22nd International Conference on Software, Telecommunications
    and Computer Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014</i>,
    2014, pp. 408--413.
  mla: Blanckenstein, Johannes, and Holger Karl. “Energy-Efficient Clock Synchronization
    Using Wake-up Receivers.” <i>22nd International Conference on Software, Telecommunications
    and Computer Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014</i>,
    2014, pp. 408--413, doi:<a href="https://doi.org/10.1109/SOFTCOM.2014.7039090">10.1109/SOFTCOM.2014.7039090</a>.
  short: 'J. Blanckenstein, H. Karl, in: 22nd International Conference on Software,
    Telecommunications and Computer Networks, SoftCOM 2014, Split, Croatia, September
    17-19, 2014, 2014, pp. 408--413.'
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:41Z
department:
- _id: '75'
doi: 10.1109/SOFTCOM.2014.7039090
page: 408--413
publication: 22nd International Conference on Software, Telecommunications and Computer
  Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014
status: public
title: Energy-efficient clock synchronization using wake-up receivers
type: conference
user_id: '15572'
year: '2014'
...
---
_id: '765'
author:
- first_name: Frederic
  full_name: Beister, Frederic
  last_name: Beister
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Beister F, Karl H. Predicting mobile video inter-download times with Hidden
    Markov Models. In: <i>IEEE 10th International Conference on Wireless and Mobile
    Computing, Networking and Communications, WiMob 2014, Larnaca, Cyprus, October
    8-10, 2014</i>. ; 2014:359--364. doi:<a href="https://doi.org/10.1109/WiMOB.2014.6962195">10.1109/WiMOB.2014.6962195</a>'
  apa: Beister, F., &#38; Karl, H. (2014). Predicting mobile video inter-download
    times with Hidden Markov Models. In <i>IEEE 10th International Conference on Wireless
    and Mobile Computing, Networking and Communications, WiMob 2014, Larnaca, Cyprus,
    October 8-10, 2014</i> (pp. 359--364). <a href="https://doi.org/10.1109/WiMOB.2014.6962195">https://doi.org/10.1109/WiMOB.2014.6962195</a>
  bibtex: '@inproceedings{Beister_Karl_2014, title={Predicting mobile video inter-download
    times with Hidden Markov Models}, DOI={<a href="https://doi.org/10.1109/WiMOB.2014.6962195">10.1109/WiMOB.2014.6962195</a>},
    booktitle={IEEE 10th International Conference on Wireless and Mobile Computing,
    Networking and Communications, WiMob 2014, Larnaca, Cyprus, October 8-10, 2014},
    author={Beister, Frederic and Karl, Holger}, year={2014}, pages={359--364} }'
  chicago: Beister, Frederic, and Holger Karl. “Predicting Mobile Video Inter-Download
    Times with Hidden Markov Models.” In <i>IEEE 10th International Conference on
    Wireless and Mobile Computing, Networking and Communications, WiMob 2014, Larnaca,
    Cyprus, October 8-10, 2014</i>, 359--364, 2014. <a href="https://doi.org/10.1109/WiMOB.2014.6962195">https://doi.org/10.1109/WiMOB.2014.6962195</a>.
  ieee: F. Beister and H. Karl, “Predicting mobile video inter-download times with
    Hidden Markov Models,” in <i>IEEE 10th International Conference on Wireless and
    Mobile Computing, Networking and Communications, WiMob 2014, Larnaca, Cyprus,
    October 8-10, 2014</i>, 2014, pp. 359--364.
  mla: Beister, Frederic, and Holger Karl. “Predicting Mobile Video Inter-Download
    Times with Hidden Markov Models.” <i>IEEE 10th International Conference on Wireless
    and Mobile Computing, Networking and Communications, WiMob 2014, Larnaca, Cyprus,
    October 8-10, 2014</i>, 2014, pp. 359--364, doi:<a href="https://doi.org/10.1109/WiMOB.2014.6962195">10.1109/WiMOB.2014.6962195</a>.
  short: 'F. Beister, H. Karl, in: IEEE 10th International Conference on Wireless
    and Mobile Computing, Networking and Communications, WiMob 2014, Larnaca, Cyprus,
    October 8-10, 2014, 2014, pp. 359--364.'
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:43Z
department:
- _id: '75'
doi: 10.1109/WiMOB.2014.6962195
page: 359--364
publication: IEEE 10th International Conference on Wireless and Mobile Computing,
  Networking and Communications, WiMob 2014, Larnaca, Cyprus, October 8-10, 2014
status: public
title: Predicting mobile video inter-download times with Hidden Markov Models
type: conference
user_id: '15572'
year: '2014'
...
---
_id: '766'
author:
- first_name: Sevil
  full_name: Mehraghdam, Sevil
  last_name: Mehraghdam
- first_name: Matthias
  full_name: Keller, Matthias
  last_name: Keller
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: Mehraghdam S, Keller M, Karl H. Specifying and Placing Chains of Virtual Network
    Functions. <i>CoRR</i>. 2014.
  apa: Mehraghdam, S., Keller, M., &#38; Karl, H. (2014). Specifying and Placing Chains
    of Virtual Network Functions. <i>CoRR</i>.
  bibtex: '@article{Mehraghdam_Keller_Karl_2014, title={Specifying and Placing Chains
    of Virtual Network Functions}, journal={CoRR}, author={Mehraghdam, Sevil and Keller,
    Matthias and Karl, Holger}, year={2014} }'
  chicago: Mehraghdam, Sevil, Matthias Keller, and Holger Karl. “Specifying and Placing
    Chains of Virtual Network Functions.” <i>CoRR</i>, 2014.
  ieee: S. Mehraghdam, M. Keller, and H. Karl, “Specifying and Placing Chains of Virtual
    Network Functions,” <i>CoRR</i>. 2014.
  mla: Mehraghdam, Sevil, et al. “Specifying and Placing Chains of Virtual Network
    Functions.” <i>CoRR</i>, 2014.
  short: S. Mehraghdam, M. Keller, H. Karl, CoRR (2014).
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:43Z
department:
- _id: '75'
publication: CoRR
status: public
title: Specifying and Placing Chains of Virtual Network Functions
type: preprint
user_id: '15572'
year: '2014'
...
---
_id: '767'
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. DCT<sup>2</sup>Gen: A Versatile TCP Traffic Generator for
    Data Centers. <i>CoRR</i>. 2014.'
  apa: 'Wette, P., &#38; Karl, H. (2014). DCT<sup>2</sup>Gen: A Versatile TCP Traffic
    Generator for Data Centers. <i>CoRR</i>.'
  bibtex: '@article{Wette_Karl_2014, title={DCT<sup>2</sup>Gen: A Versatile TCP Traffic
    Generator for Data Centers}, journal={CoRR}, author={Wette, Philip and Karl, Holger},
    year={2014} }'
  chicago: 'Wette, Philip, and Holger Karl. “DCT<sup>2</sup>Gen: A Versatile TCP Traffic
    Generator for Data Centers.” <i>CoRR</i>, 2014.'
  ieee: 'P. Wette and H. Karl, “DCT<sup>2</sup>Gen: A Versatile TCP Traffic Generator
    for Data Centers,” <i>CoRR</i>. 2014.'
  mla: 'Wette, Philip, and Holger Karl. “DCT<sup>2</sup>Gen: A Versatile TCP Traffic
    Generator for Data Centers.” <i>CoRR</i>, 2014.'
  short: P. Wette, H. Karl, CoRR (2014).
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:43Z
department:
- _id: '75'
publication: CoRR
status: public
title: 'DCT²Gen: A Versatile TCP Traffic Generator for Data Centers'
type: preprint
user_id: '15572'
year: '2014'
...
---
_id: '768'
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. Adding Geographical Embedding to AS Topology Generation.
    <i>CoRR</i>. 2014.
  apa: Schwabe, A., &#38; Karl, H. (2014). Adding Geographical Embedding to AS Topology
    Generation. <i>CoRR</i>.
  bibtex: '@article{Schwabe_Karl_2014, title={Adding Geographical Embedding to AS
    Topology Generation}, journal={CoRR}, author={Schwabe, Arne and Karl, Holger},
    year={2014} }'
  chicago: Schwabe, Arne, and Holger Karl. “Adding Geographical Embedding to AS Topology
    Generation.” <i>CoRR</i>, 2014.
  ieee: A. Schwabe and H. Karl, “Adding Geographical Embedding to AS Topology Generation,”
    <i>CoRR</i>. 2014.
  mla: Schwabe, Arne, and Holger Karl. “Adding Geographical Embedding to AS Topology
    Generation.” <i>CoRR</i>, 2014.
  short: A. Schwabe, H. Karl, CoRR (2014).
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:43Z
department:
- _id: '75'
publication: CoRR
status: public
title: Adding Geographical Embedding to AS Topology Generation
type: preprint
user_id: '15572'
year: '2014'
...
---
_id: '8842'
author:
- first_name: Ivan
  full_name: Jovanovikj, Ivan
  id: '39187'
  last_name: Jovanovikj
  orcid: https://orcid.org/0000-0002-1838-794X
citation:
  ama: Jovanovikj I. <i>Detection and Resolution of Data-Flow Differences in Business
    Process Models</i>.; 2014.
  apa: Jovanovikj, I. (2014). <i>Detection and Resolution of Data-Flow Differences
    in Business Process Models</i>.
  bibtex: '@book{Jovanovikj_2014, title={Detection and Resolution of Data-Flow Differences
    in Business Process Models}, author={Jovanovikj, Ivan}, year={2014} }'
  chicago: Jovanovikj, Ivan. <i>Detection and Resolution of Data-Flow Differences
    in Business Process Models</i>, 2014.
  ieee: I. Jovanovikj, <i>Detection and Resolution of Data-Flow Differences in Business
    Process Models</i>. 2014.
  mla: Jovanovikj, Ivan. <i>Detection and Resolution of Data-Flow Differences in Business
    Process Models</i>. 2014.
  short: I. Jovanovikj, Detection and Resolution of Data-Flow Differences in Business
    Process Models, 2014.
date_created: 2019-04-08T07:37:33Z
date_updated: 2022-01-06T07:04:03Z
department:
- _id: '66'
extern: '1'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
  full_name: Gerth, Christian
  last_name: Gerth
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
title: Detection and Resolution of Data-Flow Differences in Business Process Models
type: mastersthesis
user_id: '39187'
year: '2014'
...
---
_id: '393'
abstract:
- lang: eng
  text: 'A fundamental problem for peer-to-peer systems is to maintain connectivity
    while nodes are leaving, i.e., the nodes requesting to leave the peer-to-peer
    system are excluded from the overlay network without affecting its connectivity.
    There are a number of studies for safe node exclusion if the overlay is in a well-defined
    state initially. Surprisingly, the problem is not formally studied yet 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 if necessary. We show that
    there is no self-stabilizing distributed algorithm for the FDP, even in a synchronous
    message passing model. To allow a solution, we introduce an oracle called NIDEC
    and show that it is sufficient even for the asynchronous message passing model
    by proposing an algorithm that can solve the FDP using NIDEC. We also show that
    a solution to the FSP does not require an oracle.'
author:
- first_name: Dianne
  full_name: Foreback, Dianne
  last_name: Foreback
- first_name: Andreas
  full_name: Koutsopoulos, Andreas
  last_name: Koutsopoulos
- first_name: Mikhail
  full_name: Nesterenko, Mikhail
  last_name: Nesterenko
- 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: 'Foreback D, Koutsopoulos A, Nesterenko M, Scheideler C, Strothmann TF. On
    Stabilizing Departures in Overlay Networks. In: <i>Proceedings of the 16th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems</i>. LNCS.
    ; 2014:48--62. doi:<a href="https://doi.org/10.1007/978-3-319-11764-5_4">10.1007/978-3-319-11764-5_4</a>'
  apa: Foreback, D., Koutsopoulos, A., Nesterenko, M., Scheideler, C., &#38; Strothmann,
    T. F. (2014). On Stabilizing Departures in Overlay Networks. In <i>Proceedings
    of the 16th International Symposium on Stabilization, Safety, and Security of
    Distributed Systems</i> (pp. 48--62). <a href="https://doi.org/10.1007/978-3-319-11764-5_4">https://doi.org/10.1007/978-3-319-11764-5_4</a>
  bibtex: '@inproceedings{Foreback_Koutsopoulos_Nesterenko_Scheideler_Strothmann_2014,
    series={LNCS}, title={On Stabilizing Departures in Overlay Networks}, DOI={<a
    href="https://doi.org/10.1007/978-3-319-11764-5_4">10.1007/978-3-319-11764-5_4</a>},
    booktitle={Proceedings of the 16th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems}, author={Foreback, Dianne and Koutsopoulos,
    Andreas and Nesterenko, Mikhail and Scheideler, Christian and Strothmann, Thim
    Frederik}, year={2014}, pages={48--62}, collection={LNCS} }'
  chicago: Foreback, Dianne, Andreas Koutsopoulos, Mikhail Nesterenko, Christian Scheideler,
    and Thim Frederik Strothmann. “On Stabilizing Departures in Overlay Networks.”
    In <i>Proceedings of the 16th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems</i>, 48--62. LNCS, 2014. <a href="https://doi.org/10.1007/978-3-319-11764-5_4">https://doi.org/10.1007/978-3-319-11764-5_4</a>.
  ieee: D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, and T. F. Strothmann,
    “On Stabilizing Departures in Overlay Networks,” in <i>Proceedings of the 16th
    International Symposium on Stabilization, Safety, and Security of Distributed
    Systems</i>, 2014, pp. 48--62.
  mla: Foreback, Dianne, et al. “On Stabilizing Departures in Overlay Networks.” <i>Proceedings
    of the 16th International Symposium on Stabilization, Safety, and Security of
    Distributed Systems</i>, 2014, pp. 48--62, doi:<a href="https://doi.org/10.1007/978-3-319-11764-5_4">10.1007/978-3-319-11764-5_4</a>.
  short: 'D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, T.F. Strothmann,
    in: Proceedings of the 16th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems, 2014, pp. 48--62.'
date_created: 2017-10-17T12:42:08Z
date_updated: 2022-01-06T06:59:56Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-11764-5_4
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:00:28Z
  date_updated: 2018-03-20T07:00:28Z
  file_id: '1384'
  file_name: 393-departures.pdf
  file_size: 287539
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:00:28Z
has_accepted_license: '1'
language:
- iso: eng
page: 48--62
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 16th International Symposium on Stabilization, Safety,
  and Security of Distributed Systems
series_title: LNCS
status: public
title: On Stabilizing Departures in Overlay Networks
type: conference
user_id: '477'
year: '2014'
...
---
_id: '394'
abstract:
- lang: eng
  text: Service Oriented Architectures (SOAs) enable the reuse and substitution of
    software services to develop highly flexible software systems. To benefit from
    the growing plethora of available services, sophisticated service discovery approaches
    are needed that bring service requests and offers together. Such approaches rely
    on rich service descriptions, which specify also the behavior of provided/requested
    services, e.g., by pre- and postconditions of operations. As a base for the specification
    a data schema is used, which specifies the used data types and their relations.
    However, data schemas are typically heterogeneous wrt. their structure and terminology,
    since they are created individually in their diverse application contexts. As
    a consequence the behavioral models that are typed over the heterogeneous data
    schemas, cannot be compared directly. In this paper, we present an holistic approach
    to normalize rich service description models to enable behavior-aware service
    discovery. The approach consists of a matching algorithm that helps to resolve
    structural and terminological heterogeneity in data schemas by exploiting domain-specific
    background ontologies. The resulting data schema mappings are represented in terms
    of Query View Transformation (QVT) relations that even reflect complex n:m correspondences.
    By executing the transformation, behavioral models are automatically normalized,
    which is a prerequisite for a behavior-aware operation matching.
author:
- first_name: Simon
  full_name: Schwichtenberg, Simon
  id: '13235'
  last_name: Schwichtenberg
- first_name: Christian
  full_name: Gerth, Christian
  last_name: Gerth
- first_name: Zille
  full_name: Huma, Zille
  last_name: Huma
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: 'Schwichtenberg S, Gerth C, Huma Z, Engels G. Normalizing Heterogeneous Service
    Description Models with Generated QVT Transformations. In: <i>Proceedings of the
    10th European Conference on Modelling Foundations and Applications (ECMFA)</i>.
    LNCS. ; 2014:180-195. doi:<a href="https://doi.org/10.1007/978-3-319-09195-2_12">10.1007/978-3-319-09195-2_12</a>'
  apa: Schwichtenberg, S., Gerth, C., Huma, Z., &#38; Engels, G. (2014). Normalizing
    Heterogeneous Service Description Models with Generated QVT Transformations. In
    <i>Proceedings of the 10th European Conference on Modelling Foundations and Applications
    (ECMFA)</i> (pp. 180–195). <a href="https://doi.org/10.1007/978-3-319-09195-2_12">https://doi.org/10.1007/978-3-319-09195-2_12</a>
  bibtex: '@inproceedings{Schwichtenberg_Gerth_Huma_Engels_2014, series={LNCS}, title={Normalizing
    Heterogeneous Service Description Models with Generated QVT Transformations},
    DOI={<a href="https://doi.org/10.1007/978-3-319-09195-2_12">10.1007/978-3-319-09195-2_12</a>},
    booktitle={Proceedings of the 10th European Conference on Modelling Foundations
    and Applications (ECMFA)}, author={Schwichtenberg, Simon and Gerth, Christian
    and Huma, Zille and Engels, Gregor}, year={2014}, pages={180–195}, collection={LNCS}
    }'
  chicago: Schwichtenberg, Simon, Christian Gerth, Zille Huma, and Gregor Engels.
    “Normalizing Heterogeneous Service Description Models with Generated QVT Transformations.”
    In <i>Proceedings of the 10th European Conference on Modelling Foundations and
    Applications (ECMFA)</i>, 180–95. LNCS, 2014. <a href="https://doi.org/10.1007/978-3-319-09195-2_12">https://doi.org/10.1007/978-3-319-09195-2_12</a>.
  ieee: S. Schwichtenberg, C. Gerth, Z. Huma, and G. Engels, “Normalizing Heterogeneous
    Service Description Models with Generated QVT Transformations,” in <i>Proceedings
    of the 10th European Conference on Modelling Foundations and Applications (ECMFA)</i>,
    2014, pp. 180–195.
  mla: Schwichtenberg, Simon, et al. “Normalizing Heterogeneous Service Description
    Models with Generated QVT Transformations.” <i>Proceedings of the 10th European
    Conference on Modelling Foundations and Applications (ECMFA)</i>, 2014, pp. 180–95,
    doi:<a href="https://doi.org/10.1007/978-3-319-09195-2_12">10.1007/978-3-319-09195-2_12</a>.
  short: 'S. Schwichtenberg, C. Gerth, Z. Huma, G. Engels, in: Proceedings of the
    10th European Conference on Modelling Foundations and Applications (ECMFA), 2014,
    pp. 180–195.'
date_created: 2017-10-17T12:42:08Z
date_updated: 2022-01-06T06:59:58Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1007/978-3-319-09195-2_12
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T06:59:55Z
  date_updated: 2018-03-20T06:59:55Z
  file_id: '1383'
  file_name: 394-SGHE14.pdf
  file_size: 1107805
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T06:59:55Z
has_accepted_license: '1'
language:
- iso: eng
page: 180-195
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 10th European Conference on Modelling Foundations
  and Applications (ECMFA)
series_title: LNCS
status: public
title: Normalizing Heterogeneous Service Description Models with Generated QVT Transformations
type: conference
user_id: '477'
year: '2014'
...
---
_id: '395'
abstract:
- lang: eng
  text: We consider a multilevel network game, where nodes can improvetheir communication
    costs by connecting to a high-speed network.The n nodes are connected by a static
    network and each node can decideindividually to become a gateway to the high-speed
    network. The goalof a node v is to minimize its private costs, i.e., the sum (SUM-game)
    ormaximum (MAX-game) of communication distances from v to all othernodes plus
    a fixed price α > 0 if it decides to be a gateway. Between gatewaysthe communication
    distance is 0, and gateways also improve othernodes’ distances by behaving as
    shortcuts. For the SUM-game, we showthat for α ≤ n − 1, the price of anarchy is
    Θ (n/√α) and in this rangeequilibria always exist. In range α ∈ (n−1, n(n−1))
    the price of anarchyis Θ(√α), and for α ≥ n(n − 1) it is constant. For the MAX-game,
    weshow that the price of anarchy is either Θ (1 + n/√α), for α ≥ 1, orelse 1.
    Given a graph with girth of at least 4α, equilibria always exist.Concerning the
    dynamics, both games are not potential games. For theSUM-game, we even show that
    it is not weakly acyclic.
author:
- first_name: Sebastian
  full_name: Abshoff, Sebastian
  last_name: Abshoff
- first_name: Andreas
  full_name: Cord-Landwehr, Andreas
  last_name: Cord-Landwehr
- first_name: Daniel
  full_name: Jung, Daniel
  id: '37827'
  last_name: Jung
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: 'Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Multilevel Network Games.
    In: <i>Proceedings of the 10th International Conference on Web and Internet Economics
    (WINE)</i>. LNCS. ; 2014:435-440. doi:<a href="https://doi.org/10.1007/978-3-319-13129-0_36">10.1007/978-3-319-13129-0_36</a>'
  apa: Abshoff, S., Cord-Landwehr, A., Jung, D., &#38; Skopalik, A. (2014). Multilevel
    Network Games. In <i>Proceedings of the 10th International Conference on Web and
    Internet Economics (WINE)</i> (pp. 435–440). <a href="https://doi.org/10.1007/978-3-319-13129-0_36">https://doi.org/10.1007/978-3-319-13129-0_36</a>
  bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS},
    title={Multilevel Network Games}, DOI={<a href="https://doi.org/10.1007/978-3-319-13129-0_36">10.1007/978-3-319-13129-0_36</a>},
    booktitle={Proceedings of the 10th International Conference on Web and Internet
    Economics (WINE)}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung,
    Daniel and Skopalik, Alexander}, year={2014}, pages={435–440}, collection={LNCS}
    }'
  chicago: Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik.
    “Multilevel Network Games.” In <i>Proceedings of the 10th International Conference
    on Web and Internet Economics (WINE)</i>, 435–40. LNCS, 2014. <a href="https://doi.org/10.1007/978-3-319-13129-0_36">https://doi.org/10.1007/978-3-319-13129-0_36</a>.
  ieee: S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Multilevel Network
    Games,” in <i>Proceedings of the 10th International Conference on Web and Internet
    Economics (WINE)</i>, 2014, pp. 435–440.
  mla: Abshoff, Sebastian, et al. “Multilevel Network Games.” <i>Proceedings of the
    10th International Conference on Web and Internet Economics (WINE)</i>, 2014,
    pp. 435–40, doi:<a href="https://doi.org/10.1007/978-3-319-13129-0_36">10.1007/978-3-319-13129-0_36</a>.
  short: 'S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: Proceedings of the
    10th International Conference on Web and Internet Economics (WINE), 2014, pp.
    435–440.'
date_created: 2017-10-17T12:42:09Z
date_updated: 2022-01-06T06:59:59Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-13129-0_36
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T06:59:20Z
  date_updated: 2018-03-20T06:59:20Z
  file_id: '1382'
  file_name: 395-WINE2014ACJS.pdf
  file_size: 161479
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T06:59:20Z
has_accepted_license: '1'
language:
- iso: eng
page: 435-440
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 10th International Conference on Web and Internet
  Economics (WINE)
series_title: LNCS
status: public
title: Multilevel Network Games
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '397'
abstract:
- lang: eng
  text: We present a factor $14D^2$ approximation algorithm for the minimum linear
    arrangement problem on series-parallel graphs, where $D$ is the maximum degree
    in the graph. Given a suitable decomposition of the graph, our algorithm runs
    in time $O(|E|)$ and is very easy to implement. Its divide-and-conquer approach
    allows for an effective parallelization. Note that a suitable decomposition can
    also be computed in time $O(|E|\log{|E|})$ (or even $O(\log{|E|}\log^*{|E|})$
    on an EREW PRAM using $O(|E|)$ processors). For the proof of the approximation
    ratio, we use a sophisticated charging method that uses techniques similar to
    amortized analysis in advanced data structures. On general graphs, the minimum
    linear arrangement problem is known to be NP-hard. To the best of our knowledge,
    the minimum linear arrangement problem on series-parallel graphs has not been
    studied before.
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Martina
  full_name: Eikel, Martina
  last_name: Eikel
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
citation:
  ama: 'Scheideler C, Eikel M, Setzer A. Minimum Linear Arrangement of Series-Parallel
    Graphs. In: <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms
    (WAOA)</i>. LNCS. ; 2014:168--180.'
  apa: Scheideler, C., Eikel, M., &#38; Setzer, A. (2014). Minimum Linear Arrangement
    of Series-Parallel Graphs. In <i>Proceedings of the 12th Workshop on Approximation
    and Online Algorithms (WAOA)</i> (pp. 168--180).
  bibtex: '@inproceedings{Scheideler_Eikel_Setzer_2014, series={LNCS}, title={Minimum
    Linear Arrangement of Series-Parallel Graphs}, booktitle={Proceedings of the 12th
    Workshop on Approximation and Online Algorithms (WAOA)}, author={Scheideler, Christian
    and Eikel, Martina and Setzer, Alexander}, year={2014}, pages={168--180}, collection={LNCS}
    }'
  chicago: Scheideler, Christian, Martina Eikel, and Alexander Setzer. “Minimum Linear
    Arrangement of Series-Parallel Graphs.” In <i>Proceedings of the 12th Workshop
    on Approximation and Online Algorithms (WAOA)</i>, 168--180. LNCS, 2014.
  ieee: C. Scheideler, M. Eikel, and A. Setzer, “Minimum Linear Arrangement of Series-Parallel
    Graphs,” in <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms
    (WAOA)</i>, 2014, pp. 168--180.
  mla: Scheideler, Christian, et al. “Minimum Linear Arrangement of Series-Parallel
    Graphs.” <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms
    (WAOA)</i>, 2014, pp. 168--180.
  short: 'C. Scheideler, M. Eikel, A. Setzer, in: Proceedings of the 12th Workshop
    on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.'
date_created: 2017-10-17T12:42:09Z
date_updated: 2022-01-06T07:00:02Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T06:58:44Z
  date_updated: 2018-03-20T06:58:44Z
  file_id: '1381'
  file_name: 397-WAOA14_01.pdf
  file_size: 365818
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T06:58:44Z
has_accepted_license: '1'
page: 168--180
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 12th Workshop on Approximation and Online Algorithms
  (WAOA)
series_title: LNCS
status: public
title: Minimum Linear Arrangement of Series-Parallel Graphs
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '399'
abstract:
- lang: eng
  text: Ensuring memory access security is a challenge for reconfigurable systems
    with multiple cores. Previous work introduced access monitors attached to the
    memory subsystem to ensure that the cores adhere to pre-defined protocols when
    accessing memory. In this paper, we combine access monitors with a formal runtime
    verification technique known as proof-carrying hardware to guarantee memory security.
    We extend previous work on proof-carrying hardware by covering sequential circuits
    and demonstrate our approach with a prototype leveraging ReconOS/Zynq with an
    embedded ZUMA virtual FPGA overlay. Experiments show the feasibility of the approach
    and the capabilities of the prototype, which constitutes the first realization
    of proof-carrying hardware on real FPGAs. The area overheads for the virtual FPGA
    are measured as 2x-10x, depending on the resource type. The delay overhead is
    substantial with almost 100x, but this is an extremely pessimistic estimate that
    will be lowered once accurate timing analysis for FPGA overlays become available.
    Finally, reconfiguration time for the virtual FPGA is about one order of magnitude
    lower than for the native Zynq fabric.
author:
- first_name: Tobias
  full_name: Wiersema, Tobias
  id: '3118'
  last_name: Wiersema
- first_name: Stephanie
  full_name: Drzevitzky, Stephanie
  last_name: Drzevitzky
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Wiersema T, Drzevitzky S, Platzner M. Memory Security in Reconfigurable Computers:
    Combining Formal Verification with Monitoring. In: <i>Proceedings of the International
    Conference on Field-Programmable Technology (FPT)</i>. ; 2014:167-174. doi:<a
    href="https://doi.org/10.1109/FPT.2014.7082771">10.1109/FPT.2014.7082771</a>'
  apa: 'Wiersema, T., Drzevitzky, S., &#38; Platzner, M. (2014). Memory Security in
    Reconfigurable Computers: Combining Formal Verification with Monitoring. In <i>Proceedings
    of the International Conference on Field-Programmable Technology (FPT)</i> (pp.
    167–174). <a href="https://doi.org/10.1109/FPT.2014.7082771">https://doi.org/10.1109/FPT.2014.7082771</a>'
  bibtex: '@inproceedings{Wiersema_Drzevitzky_Platzner_2014, title={Memory Security
    in Reconfigurable Computers: Combining Formal Verification with Monitoring}, DOI={<a
    href="https://doi.org/10.1109/FPT.2014.7082771">10.1109/FPT.2014.7082771</a>},
    booktitle={Proceedings of the International Conference on Field-Programmable Technology
    (FPT)}, author={Wiersema, Tobias and Drzevitzky, Stephanie and Platzner, Marco},
    year={2014}, pages={167–174} }'
  chicago: 'Wiersema, Tobias, Stephanie Drzevitzky, and Marco Platzner. “Memory Security
    in Reconfigurable Computers: Combining Formal Verification with Monitoring.” In
    <i>Proceedings of the International Conference on Field-Programmable Technology
    (FPT)</i>, 167–74, 2014. <a href="https://doi.org/10.1109/FPT.2014.7082771">https://doi.org/10.1109/FPT.2014.7082771</a>.'
  ieee: 'T. Wiersema, S. Drzevitzky, and M. Platzner, “Memory Security in Reconfigurable
    Computers: Combining Formal Verification with Monitoring,” in <i>Proceedings of
    the International Conference on Field-Programmable Technology (FPT)</i>, 2014,
    pp. 167–174.'
  mla: 'Wiersema, Tobias, et al. “Memory Security in Reconfigurable Computers: Combining
    Formal Verification with Monitoring.” <i>Proceedings of the International Conference
    on Field-Programmable Technology (FPT)</i>, 2014, pp. 167–74, doi:<a href="https://doi.org/10.1109/FPT.2014.7082771">10.1109/FPT.2014.7082771</a>.'
  short: 'T. Wiersema, S. Drzevitzky, M. Platzner, in: Proceedings of the International
    Conference on Field-Programmable Technology (FPT), 2014, pp. 167–174.'
date_created: 2017-10-17T12:42:09Z
date_updated: 2022-01-06T07:00:05Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1109/FPT.2014.7082771
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T06:57:44Z
  date_updated: 2018-03-20T06:57:44Z
  file_id: '1380'
  file_name: 399-wiersema14_fpt_IEEE_approved.pdf
  file_size: 404328
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T06:57:44Z
has_accepted_license: '1'
language:
- iso: eng
page: 167-174
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the International Conference on Field-Programmable Technology
  (FPT)
status: public
title: 'Memory Security in Reconfigurable Computers: Combining Formal Verification
  with Monitoring'
type: conference
user_id: '477'
year: '2014'
...
---
_id: '401'
abstract:
- lang: eng
  text: Service matching approaches determine to what extent a provided service matches
    a requester's requirements. This process is based on service specifications describing
    functional (e.g., signatures) as well as non-functional properties (e.g., privacy
    policies). However, we cannot expect service specifications to be complete as
    providers do not want to share all details of their services' implementation.
    Moreover, creating complete specifications requires much effort. In this paper,
    we propose a novel service matching approach taking into account a service's signatures
    and privacy policies. In particular, our approach applies fuzzy matching techniques
    that are able to deal with incomplete service specifications. As a benefit, decision-making
    based on matching results is improved and service matching becomes better applicable
    in practice.
author:
- first_name: Marie Christin
  full_name: Platenius, Marie Christin
  last_name: Platenius
- first_name: Svetlana
  full_name: Arifulina, Svetlana
  last_name: Arifulina
- first_name: Ronald
  full_name: Petrlic, Ronald
  last_name: Petrlic
- first_name: Wilhelm
  full_name: Schäfer, Wilhelm
  last_name: Schäfer
citation:
  ama: 'Platenius MC, Arifulina S, Petrlic R, Schäfer W. Matching of Incomplete Service
    Specifications Exemplified by Privacy Policy Matching. In: <i>Proceedings of the
    4th International Workshop on Adaptive Services for the Future Internet</i>. Communications
    in Computer and Information Science. ; 2014:6-17. doi:<a href="https://doi.org/10.1007/978-3-319-14886-1_2">10.1007/978-3-319-14886-1_2</a>'
  apa: Platenius, M. C., Arifulina, S., Petrlic, R., &#38; Schäfer, W. (2014). Matching
    of Incomplete Service Specifications Exemplified by Privacy Policy Matching. In
    <i>Proceedings of the 4th International Workshop on Adaptive Services for the
    Future Internet</i> (pp. 6–17). <a href="https://doi.org/10.1007/978-3-319-14886-1_2">https://doi.org/10.1007/978-3-319-14886-1_2</a>
  bibtex: '@inproceedings{Platenius_Arifulina_Petrlic_Schäfer_2014, series={Communications
    in Computer and Information Science}, title={Matching of Incomplete Service Specifications
    Exemplified by Privacy Policy Matching}, DOI={<a href="https://doi.org/10.1007/978-3-319-14886-1_2">10.1007/978-3-319-14886-1_2</a>},
    booktitle={Proceedings of the 4th International Workshop on Adaptive Services
    for the Future Internet}, author={Platenius, Marie Christin and Arifulina, Svetlana
    and Petrlic, Ronald and Schäfer, Wilhelm}, year={2014}, pages={6–17}, collection={Communications
    in Computer and Information Science} }'
  chicago: Platenius, Marie Christin, Svetlana Arifulina, Ronald Petrlic, and Wilhelm
    Schäfer. “Matching of Incomplete Service Specifications Exemplified by Privacy
    Policy Matching.” In <i>Proceedings of the 4th International Workshop on Adaptive
    Services for the Future Internet</i>, 6–17. Communications in Computer and Information
    Science, 2014. <a href="https://doi.org/10.1007/978-3-319-14886-1_2">https://doi.org/10.1007/978-3-319-14886-1_2</a>.
  ieee: M. C. Platenius, S. Arifulina, R. Petrlic, and W. Schäfer, “Matching of Incomplete
    Service Specifications Exemplified by Privacy Policy Matching,” in <i>Proceedings
    of the 4th International Workshop on Adaptive Services for the Future Internet</i>,
    2014, pp. 6–17.
  mla: Platenius, Marie Christin, et al. “Matching of Incomplete Service Specifications
    Exemplified by Privacy Policy Matching.” <i>Proceedings of the 4th International
    Workshop on Adaptive Services for the Future Internet</i>, 2014, pp. 6–17, doi:<a
    href="https://doi.org/10.1007/978-3-319-14886-1_2">10.1007/978-3-319-14886-1_2</a>.
  short: 'M.C. Platenius, S. Arifulina, R. Petrlic, W. Schäfer, in: Proceedings of
    the 4th International Workshop on Adaptive Services for the Future Internet, 2014,
    pp. 6–17.'
date_created: 2017-10-17T12:42:10Z
date_updated: 2022-01-06T07:00:07Z
ddc:
- '040'
department:
- _id: '66'
- _id: '76'
doi: 10.1007/978-3-319-14886-1_2
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:38:13Z
  date_updated: 2018-03-16T11:38:13Z
  file_id: '1367'
  file_name: 401-WAS4FI2014.pdf
  file_size: 396656
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:38:13Z
has_accepted_license: '1'
language:
- iso: eng
page: 6-17
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 4th International Workshop on Adaptive Services for
  the Future Internet
series_title: Communications in Computer and Information Science
status: public
title: Matching of Incomplete Service Specifications Exemplified by Privacy Policy
  Matching
type: conference
user_id: '477'
year: '2014'
...
---
_id: '402'
abstract:
- lang: eng
  text: Various approaches in service engineering are based on servicemarkets where
    brokers use service matching in order to performservice discovery. For matching,
    a broker translates the specifications ofproviders' services and requesters' requirements
    into her own specificationlanguage, in order to check their compliance using a
    matcher. Thebroker's success depends on the configuration of her language and
    itsmatcher because they in uence important properties like the effort forproviders
    and requesters to create suitable specifications as well as accuracyand runtime
    of matching. However, neither existing service specification languages, nor existing
    matching approaches are optimized insuch way. Our approach automatically provides
    brokers with an optimalconfiguration of a language and its matcher to improve
    her success ina given market with respect to her strategy. The approach is based
    onformalized configuration properties and a predefined set of configurationrules.
author:
- first_name: Svetlana
  full_name: Arifulina, Svetlana
  last_name: Arifulina
- first_name: Marie Christin
  full_name: Platenius, Marie Christin
  last_name: Platenius
- first_name: Christian
  full_name: Gerth, Christian
  last_name: Gerth
- first_name: Steffen
  full_name: Becker, Steffen
  last_name: Becker
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Wilhelm
  full_name: Schäfer, Wilhelm
  last_name: Schäfer
citation:
  ama: 'Arifulina S, Platenius MC, Gerth C, Becker S, Engels G, Schäfer W. Market-optimized
    Service Specification and Matching. In: Franch X, Ghose A, Lewis G, Bhiri S, eds.
    <i>Proceedings of the 12th International Conference on Service Oriented Computing
    (ICSOC 2014)</i>. LNCS. ; 2014:543-550. doi:<a href="https://doi.org/10.1007/978-3-662-45391-9_47">10.1007/978-3-662-45391-9_47</a>'
  apa: Arifulina, S., Platenius, M. C., Gerth, C., Becker, S., Engels, G., &#38; Schäfer,
    W. (2014). Market-optimized Service Specification and Matching. In X. Franch,
    A. Ghose, G. Lewis, &#38; S. Bhiri (Eds.), <i>Proceedings of the 12th International
    Conference on Service Oriented Computing (ICSOC 2014)</i> (pp. 543–550). <a href="https://doi.org/10.1007/978-3-662-45391-9_47">https://doi.org/10.1007/978-3-662-45391-9_47</a>
  bibtex: '@inproceedings{Arifulina_Platenius_Gerth_Becker_Engels_Schäfer_2014, series={LNCS},
    title={Market-optimized Service Specification and Matching}, DOI={<a href="https://doi.org/10.1007/978-3-662-45391-9_47">10.1007/978-3-662-45391-9_47</a>},
    booktitle={Proceedings of the 12th International Conference on Service Oriented
    Computing (ICSOC 2014)}, author={Arifulina, Svetlana and Platenius, Marie Christin
    and Gerth, Christian and Becker, Steffen and Engels, Gregor and Schäfer, Wilhelm},
    editor={Franch, Xavier and Ghose, AdityaK. and Lewis, GraceA. and Bhiri, SamiEditors},
    year={2014}, pages={543–550}, collection={LNCS} }'
  chicago: Arifulina, Svetlana, Marie Christin Platenius, Christian Gerth, Steffen
    Becker, Gregor Engels, and Wilhelm Schäfer. “Market-Optimized Service Specification
    and Matching.” In <i>Proceedings of the 12th International Conference on Service
    Oriented Computing (ICSOC 2014)</i>, edited by Xavier Franch, AdityaK. Ghose,
    GraceA. Lewis, and Sami Bhiri, 543–50. LNCS, 2014. <a href="https://doi.org/10.1007/978-3-662-45391-9_47">https://doi.org/10.1007/978-3-662-45391-9_47</a>.
  ieee: S. Arifulina, M. C. Platenius, C. Gerth, S. Becker, G. Engels, and W. Schäfer,
    “Market-optimized Service Specification and Matching,” in <i>Proceedings of the
    12th International Conference on Service Oriented Computing (ICSOC 2014)</i>,
    2014, pp. 543–550.
  mla: Arifulina, Svetlana, et al. “Market-Optimized Service Specification and Matching.”
    <i>Proceedings of the 12th International Conference on Service Oriented Computing
    (ICSOC 2014)</i>, edited by Xavier Franch et al., 2014, pp. 543–50, doi:<a href="https://doi.org/10.1007/978-3-662-45391-9_47">10.1007/978-3-662-45391-9_47</a>.
  short: 'S. Arifulina, M.C. Platenius, C. Gerth, S. Becker, G. Engels, W. Schäfer,
    in: X. Franch, A. Ghose, G. Lewis, S. Bhiri (Eds.), Proceedings of the 12th International
    Conference on Service Oriented Computing (ICSOC 2014), 2014, pp. 543–550.'
date_created: 2017-10-17T12:42:10Z
date_updated: 2022-01-06T07:00:07Z
ddc:
- '040'
department:
- _id: '66'
- _id: '76'
doi: 10.1007/978-3-662-45391-9_47
editor:
- first_name: Xavier
  full_name: Franch, Xavier
  last_name: Franch
- first_name: AdityaK.
  full_name: Ghose, AdityaK.
  last_name: Ghose
- first_name: GraceA.
  full_name: Lewis, GraceA.
  last_name: Lewis
- first_name: Sami
  full_name: Bhiri, Sami
  last_name: Bhiri
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:38:59Z
  date_updated: 2018-03-16T11:38:59Z
  file_id: '1368'
  file_name: 402-ICSOC2014.pdf
  file_size: 377432
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:38:59Z
has_accepted_license: '1'
language:
- iso: eng
page: 543-550
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '11'
  name: SFB 901 - Subproject B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 12th International Conference on Service Oriented
  Computing (ICSOC 2014)
series_title: LNCS
status: public
title: Market-optimized Service Specification and Matching
type: conference
user_id: '477'
year: '2014'
...
---
_id: '408'
abstract:
- lang: eng
  text: Verification of hardware and software usually proceeds separately, software
    analysis relying on the correctness of processors executing instructions. This
    assumption is valid as long as the software runs on standard CPUs that have been
    extensively validated and are in wide use. However, for processors exploiting
    custom instruction set extensions to meet performance and energy constraints the
    validation might be less extensive, challenging the correctness assumption.In
    this paper we present an approach for integrating software analyses with hardware
    verification, specifically targeting custom instruction set extensions. We propose
    three different techniques for deriving the properties to be proven for the hardware
    implementation of a custom instruction in order to support software analyses.
    The techniques are designed to explore the trade-off between generality and efficiency
    and span from proving functional equivalence over checking the rules of a particular
    analysis domain to verifying actual pre and post conditions resulting from program
    analysis. We demonstrate and compare the three techniques on example programs
    with custom instructions, using stateof-the-art software and hardware verification
    techniques.
author:
- first_name: Marie-Christine
  full_name: Jakobs, Marie-Christine
  last_name: Jakobs
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
- first_name: Tobias
  full_name: Wiersema, Tobias
  id: '3118'
  last_name: Wiersema
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Jakobs M-C, Platzner M, Wiersema T, Wehrheim H. Integrating Software and Hardware
    Verification. In: Albert E, Sekerinski E, eds. <i>Proceedings of the 11th International
    Conference on Integrated Formal Methods (IFM)</i>. LNCS. ; 2014:307-322. doi:<a
    href="https://doi.org/10.1007/978-3-319-10181-1_19">10.1007/978-3-319-10181-1_19</a>'
  apa: Jakobs, M.-C., Platzner, M., Wiersema, T., &#38; Wehrheim, H. (2014). Integrating
    Software and Hardware Verification. In E. Albert &#38; E. Sekerinski (Eds.), <i>Proceedings
    of the 11th International Conference on Integrated Formal Methods (iFM)</i> (pp.
    307–322). <a href="https://doi.org/10.1007/978-3-319-10181-1_19">https://doi.org/10.1007/978-3-319-10181-1_19</a>
  bibtex: '@inproceedings{Jakobs_Platzner_Wiersema_Wehrheim_2014, series={LNCS}, title={Integrating
    Software and Hardware Verification}, DOI={<a href="https://doi.org/10.1007/978-3-319-10181-1_19">10.1007/978-3-319-10181-1_19</a>},
    booktitle={Proceedings of the 11th International Conference on Integrated Formal
    Methods (iFM)}, author={Jakobs, Marie-Christine and Platzner, Marco and Wiersema,
    Tobias and Wehrheim, Heike}, editor={Albert, Elvira and Sekerinski, EmilEditors},
    year={2014}, pages={307–322}, collection={LNCS} }'
  chicago: Jakobs, Marie-Christine, Marco Platzner, Tobias Wiersema, and Heike Wehrheim.
    “Integrating Software and Hardware Verification.” In <i>Proceedings of the 11th
    International Conference on Integrated Formal Methods (IFM)</i>, edited by Elvira
    Albert and Emil Sekerinski, 307–22. LNCS, 2014. <a href="https://doi.org/10.1007/978-3-319-10181-1_19">https://doi.org/10.1007/978-3-319-10181-1_19</a>.
  ieee: M.-C. Jakobs, M. Platzner, T. Wiersema, and H. Wehrheim, “Integrating Software
    and Hardware Verification,” in <i>Proceedings of the 11th International Conference
    on Integrated Formal Methods (iFM)</i>, 2014, pp. 307–322.
  mla: Jakobs, Marie-Christine, et al. “Integrating Software and Hardware Verification.”
    <i>Proceedings of the 11th International Conference on Integrated Formal Methods
    (IFM)</i>, edited by Elvira Albert and Emil Sekerinski, 2014, pp. 307–22, doi:<a
    href="https://doi.org/10.1007/978-3-319-10181-1_19">10.1007/978-3-319-10181-1_19</a>.
  short: 'M.-C. Jakobs, M. Platzner, T. Wiersema, H. Wehrheim, in: E. Albert, E. Sekerinski
    (Eds.), Proceedings of the 11th International Conference on Integrated Formal
    Methods (IFM), 2014, pp. 307–322.'
date_created: 2017-10-17T12:42:11Z
date_updated: 2022-01-06T07:00:14Z
ddc:
- '040'
department:
- _id: '77'
- _id: '78'
doi: 10.1007/978-3-319-10181-1_19
editor:
- first_name: Elvira
  full_name: Albert, Elvira
  last_name: Albert
- first_name: Emil
  full_name: Sekerinski, Emil
  last_name: Sekerinski
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:35:28Z
  date_updated: 2018-03-16T11:35:28Z
  file_id: '1364'
  file_name: 408-jakobs14_ifm.pdf
  file_size: 561325
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:35:28Z
has_accepted_license: '1'
language:
- iso: eng
page: 307-322
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 11th International Conference on Integrated Formal
  Methods (iFM)
series_title: LNCS
status: public
title: Integrating Software and Hardware Verification
type: conference
user_id: '477'
year: '2014'
...
---
_id: '409'
abstract:
- lang: eng
  text: Service markets provide software components in the formof services. In order
    to enable a service discovery that satisfies servicerequesters and providers best,
    markets need automatic service matching:approaches for comparing whether a provided
    service satisfies a servicerequest. Current markets, e.g., app markets, are limited
    to basic keywordbasedsearch although many better suitable matching approaches
    aredescribed in literature. However, necessary architectural decisions forthe
    integration of matchers have a huge impact on quality propertieslike performance
    or security.Architectural decisions wrt. servicematchers have rarely been discussed,yet,
    and systematic approaches for their integration into service marketsare missing.
    In this paper, we present a systematic integration approachincluding the definition
    of requirements and a discussion on architecturaltactics. As a benefit, the decision-making
    process of integrating servicematchers is supported and the overall market success
    can be improved.
author:
- first_name: Marie Christin
  full_name: Platenius, Marie Christin
  last_name: Platenius
- first_name: Steffen
  full_name: Becker, Steffen
  last_name: Becker
- first_name: Wilhelm
  full_name: Schäfer, Wilhelm
  last_name: Schäfer
citation:
  ama: 'Platenius MC, Becker S, Schäfer W. Integrating Service Matchers into a Service
    Market Architecture. In: Avgeriou P, Zdun U, eds. <i>Proceedings of the 8th European
    Conference on Software Architecture (ECSA 2014)</i>. LNCS. ; 2014:210-217. doi:<a
    href="https://doi.org/10.1007/978-3-319-09970-5_19">10.1007/978-3-319-09970-5_19</a>'
  apa: Platenius, M. C., Becker, S., &#38; Schäfer, W. (2014). Integrating Service
    Matchers into a Service Market Architecture. In P. Avgeriou &#38; U. Zdun (Eds.),
    <i>Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)</i>
    (pp. 210–217). <a href="https://doi.org/10.1007/978-3-319-09970-5_19">https://doi.org/10.1007/978-3-319-09970-5_19</a>
  bibtex: '@inproceedings{Platenius_Becker_Schäfer_2014, series={LNCS}, title={Integrating
    Service Matchers into a Service Market Architecture}, DOI={<a href="https://doi.org/10.1007/978-3-319-09970-5_19">10.1007/978-3-319-09970-5_19</a>},
    booktitle={Proceedings of the 8th European Conference on Software Architecture
    (ECSA 2014)}, author={Platenius, Marie Christin and Becker, Steffen and Schäfer,
    Wilhelm}, editor={Avgeriou, Paris and Zdun, UweEditors}, year={2014}, pages={210–217},
    collection={LNCS} }'
  chicago: Platenius, Marie Christin, Steffen Becker, and Wilhelm Schäfer. “Integrating
    Service Matchers into a Service Market Architecture.” In <i>Proceedings of the
    8th European Conference on Software Architecture (ECSA 2014)</i>, edited by Paris
    Avgeriou and Uwe Zdun, 210–17. LNCS, 2014. <a href="https://doi.org/10.1007/978-3-319-09970-5_19">https://doi.org/10.1007/978-3-319-09970-5_19</a>.
  ieee: M. C. Platenius, S. Becker, and W. Schäfer, “Integrating Service Matchers
    into a Service Market Architecture,” in <i>Proceedings of the 8th European Conference
    on Software Architecture (ECSA 2014)</i>, 2014, pp. 210–217.
  mla: Platenius, Marie Christin, et al. “Integrating Service Matchers into a Service
    Market Architecture.” <i>Proceedings of the 8th European Conference on Software
    Architecture (ECSA 2014)</i>, edited by Paris Avgeriou and Uwe Zdun, 2014, pp.
    210–17, doi:<a href="https://doi.org/10.1007/978-3-319-09970-5_19">10.1007/978-3-319-09970-5_19</a>.
  short: 'M.C. Platenius, S. Becker, W. Schäfer, in: P. Avgeriou, U. Zdun (Eds.),
    Proceedings of the 8th European Conference on Software Architecture (ECSA 2014),
    2014, pp. 210–217.'
date_created: 2017-10-17T12:42:11Z
date_updated: 2022-01-06T07:00:15Z
ddc:
- '040'
department:
- _id: '76'
doi: 10.1007/978-3-319-09970-5_19
editor:
- first_name: Paris
  full_name: Avgeriou, Paris
  last_name: Avgeriou
- first_name: Uwe
  full_name: Zdun, Uwe
  last_name: Zdun
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:34:58Z
  date_updated: 2018-03-16T11:34:58Z
  file_id: '1363'
  file_name: 409-ecsa14.pdf
  file_size: 395884
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:34:58Z
has_accepted_license: '1'
language:
- iso: eng
page: 210-217
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '11'
  name: SFB 901 - Subproject B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 8th European Conference on Software Architecture (ECSA
  2014)
series_title: LNCS
status: public
title: Integrating Service Matchers into a Service Market Architecture
type: conference
user_id: '477'
year: '2014'
...
---
_id: '412'
abstract:
- lang: eng
  text: In this paper we present and analyze HSkip+, a self-stabilizing overlay network
    for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology
    as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization
    mechanism significantly outperforms the self-stabilization mechanism proposed
    for Skip+. Also, the nodes are now ordered according to their bandwidths and not
    according to their identifiers. Various other solutions have already been proposed
    for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing.
    In addition to HSkip+ being self-stabilizing, its performance is on par with the
    best previous bounds on the time and work for joining or leaving a network of
    peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation
    and congestion for routing messages is on par with the best previous bounds for
    such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical
    investigations are backed by simulations demonstrating that HSkip+ is indeed performing
    much better than Skip+ and working correctly under high churn rates.
author:
- first_name: Matthias
  full_name: Feldotto, Matthias
  id: '14052'
  last_name: Feldotto
  orcid: 0000-0003-1348-6516
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Kalman
  full_name: Graffi, Kalman
  last_name: Graffi
citation:
  ama: 'Feldotto M, Scheideler C, Graffi K. HSkip+: A Self-Stabilizing Overlay Network
    for Nodes with Heterogeneous Bandwidths. In: <i>Proceedings of the 14th IEEE International
    Conference on Peer-to-Peer Computing (P2P)</i>. ; 2014:1-10. doi:<a href="https://doi.org/10.1109/P2P.2014.6934300">10.1109/P2P.2014.6934300</a>'
  apa: 'Feldotto, M., Scheideler, C., &#38; Graffi, K. (2014). HSkip+: A Self-Stabilizing
    Overlay Network for Nodes with Heterogeneous Bandwidths. In <i>Proceedings of
    the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i> (pp.
    1–10). <a href="https://doi.org/10.1109/P2P.2014.6934300">https://doi.org/10.1109/P2P.2014.6934300</a>'
  bibtex: '@inproceedings{Feldotto_Scheideler_Graffi_2014, title={HSkip+: A Self-Stabilizing
    Overlay Network for Nodes with Heterogeneous Bandwidths}, DOI={<a href="https://doi.org/10.1109/P2P.2014.6934300">10.1109/P2P.2014.6934300</a>},
    booktitle={Proceedings of the 14th IEEE International Conference on Peer-to-Peer
    Computing (P2P)}, author={Feldotto, Matthias and Scheideler, Christian and Graffi,
    Kalman}, year={2014}, pages={1–10} }'
  chicago: 'Feldotto, Matthias, Christian Scheideler, and Kalman Graffi. “HSkip+:
    A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” In
    <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing
    (P2P)</i>, 1–10, 2014. <a href="https://doi.org/10.1109/P2P.2014.6934300">https://doi.org/10.1109/P2P.2014.6934300</a>.'
  ieee: 'M. Feldotto, C. Scheideler, and K. Graffi, “HSkip+: A Self-Stabilizing Overlay
    Network for Nodes with Heterogeneous Bandwidths,” in <i>Proceedings of the 14th
    IEEE International Conference on Peer-to-Peer Computing (P2P)</i>, 2014, pp. 1–10.'
  mla: 'Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for
    Nodes with Heterogeneous Bandwidths.” <i>Proceedings of the 14th IEEE International
    Conference on Peer-to-Peer Computing (P2P)</i>, 2014, pp. 1–10, doi:<a href="https://doi.org/10.1109/P2P.2014.6934300">10.1109/P2P.2014.6934300</a>.'
  short: 'M. Feldotto, C. Scheideler, K. Graffi, in: Proceedings of the 14th IEEE
    International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.'
date_created: 2017-10-17T12:42:12Z
date_updated: 2022-01-06T07:00:20Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
- _id: '541'
doi: 10.1109/P2P.2014.6934300
external_id:
  arxiv:
  - '1408.0395'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:34:00Z
  date_updated: 2018-03-16T11:34:00Z
  file_id: '1361'
  file_name: 412-FSG2014P2P.pdf
  file_size: 472321
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:34:00Z
has_accepted_license: '1'
page: 1-10
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 14th IEEE International Conference on Peer-to-Peer
  Computing (P2P)
status: public
title: 'HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths'
type: conference
user_id: '14052'
year: '2014'
...
---
_id: '414'
author:
- first_name: Janek
  full_name: Jochheim, Janek
  last_name: Jochheim
citation:
  ama: Jochheim J. <i>Hiding Software Components Using Functional Encryption</i>.
    Universität Paderborn; 2014.
  apa: Jochheim, J. (2014). <i>Hiding software components using functional encryption</i>.
    Universität Paderborn.
  bibtex: '@book{Jochheim_2014, title={Hiding software components using functional
    encryption}, publisher={Universität Paderborn}, author={Jochheim, Janek}, year={2014}
    }'
  chicago: Jochheim, Janek. <i>Hiding Software Components Using Functional Encryption</i>.
    Universität Paderborn, 2014.
  ieee: J. Jochheim, <i>Hiding software components using functional encryption</i>.
    Universität Paderborn, 2014.
  mla: Jochheim, Janek. <i>Hiding Software Components Using Functional Encryption</i>.
    Universität Paderborn, 2014.
  short: J. Jochheim, Hiding Software Components Using Functional Encryption, Universität
    Paderborn, 2014.
date_created: 2017-10-17T12:42:12Z
date_updated: 2022-01-06T07:00:23Z
department:
- _id: '64'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '43'
  name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Hiding software components using functional encryption
type: mastersthesis
user_id: '25078'
year: '2014'
...