---
_id: '6483'
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Frederic
full_name: Christ, Frederic
last_name: Christ
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Schneider SB, Christ F, Karl H. A Prototyping Platform to Validate
and Verify Network Service Header-based Service Chains. In: IEEE Conference
on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp.
Verona: IEEE; 2018.'
apa: 'Peuster, M., Schneider, S. B., Christ, F., & Karl, H. (2018). A Prototyping
Platform to Validate and Verify Network Service Header-based Service Chains. In
IEEE Conference on Network Function Virtualisation and Software Defined Networks
(NFV-SDN) 5GNetApp. Verona: IEEE.'
bibtex: '@inproceedings{Peuster_Schneider_Christ_Karl_2018, place={Verona}, title={A
Prototyping Platform to Validate and Verify Network Service Header-based Service
Chains}, booktitle={IEEE Conference on Network Function Virtualisation and Software
Defined Networks (NFV-SDN) 5GNetApp}, publisher={IEEE}, author={Peuster, Manuel
and Schneider, Stefan Balthasar and Christ, Frederic and Karl, Holger}, year={2018}
}'
chicago: 'Peuster, Manuel, Stefan Balthasar Schneider, Frederic Christ, and Holger
Karl. “A Prototyping Platform to Validate and Verify Network Service Header-Based
Service Chains.” In IEEE Conference on Network Function Virtualisation and
Software Defined Networks (NFV-SDN) 5GNetApp. Verona: IEEE, 2018.'
ieee: M. Peuster, S. B. Schneider, F. Christ, and H. Karl, “A Prototyping Platform
to Validate and Verify Network Service Header-based Service Chains,” in IEEE
Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)
5GNetApp, Verona, 2018.
mla: Peuster, Manuel, et al. “A Prototyping Platform to Validate and Verify Network
Service Header-Based Service Chains.” IEEE Conference on Network Function Virtualisation
and Software Defined Networks (NFV-SDN) 5GNetApp, IEEE, 2018.
short: 'M. Peuster, S.B. Schneider, F. Christ, H. Karl, in: IEEE Conference on Network
Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp, IEEE,
Verona, 2018.'
conference:
end_date: 2018-11-29
location: Verona
name: IEEE Conference on Network Function Virtualisation and Software Defined Networks
(NFV-SDN) 5GNetApp
start_date: 2018-11-27
date_created: 2019-01-04T07:47:19Z
date_updated: 2022-01-06T07:03:07Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2019-01-04T07:46:21Z
date_updated: 2019-01-04T07:46:21Z
file_id: '6484'
file_name: main_for_ris.pdf
file_size: 541469
relation: main_file
file_date_updated: 2019-01-04T07:46:21Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
place: Verona
project:
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Conference on Network Function Virtualisation and Software Defined
Networks (NFV-SDN) 5GNetApp
publisher: IEEE
status: public
title: A Prototyping Platform to Validate and Verify Network Service Header-based
Service Chains
type: conference
user_id: '35343'
year: '2018'
...
---
_id: '6597'
author:
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
citation:
ama: Juhnke J. Models and Constructions for Secure Reputation Systems. Universität
Paderborn; 2018. doi:10.17619/UNIPB/1-570
apa: Juhnke, J. (2018). Models and Constructions for Secure Reputation Systems.
Universität Paderborn. https://doi.org/10.17619/UNIPB/1-570
bibtex: '@book{Juhnke_2018, title={Models and Constructions for Secure Reputation
Systems}, DOI={10.17619/UNIPB/1-570},
publisher={Universität Paderborn}, author={Juhnke, Jakob}, year={2018} }'
chicago: Juhnke, Jakob. Models and Constructions for Secure Reputation Systems.
Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-570.
ieee: J. Juhnke, Models and Constructions for Secure Reputation Systems.
Universität Paderborn, 2018.
mla: Juhnke, Jakob. Models and Constructions for Secure Reputation Systems.
Universität Paderborn, 2018, doi:10.17619/UNIPB/1-570.
short: J. Juhnke, Models and Constructions for Secure Reputation Systems, Universität
Paderborn, 2018.
date_created: 2019-01-10T07:51:07Z
date_updated: 2022-01-06T07:03:13Z
department:
- _id: '64'
doi: 10.17619/UNIPB/1-570
language:
- iso: eng
project:
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Models and Constructions for Secure Reputation Systems
type: dissertation
user_id: '477'
year: '2018'
...
---
_id: '6970'
abstract:
- lang: eng
text: "Dynamic allocation of resources is a key feature in network function virtualization
(NFV), enabling flexible adjustment of slices and contained network services to
ever-changing service demands. \r\nConsidering resource allocation across the
entire network, many authors have proposed approaches to optimize the placement
and chaining of virtual network function (VNF) instances and the allocation of
resources to these VNF instances. In doing so, various optimization objectives
are conceivable, e.g., minimizing certain required resources or the end-to-end
delay of the placed services.\r\n\r\nIn this paper, we investigate the relationship
between four typical optimization objectives when coordinating the placement and
resource allocation of chained VNF instances. We observe an interesting trade-off
between minimizing the overhead of starting/stopping VNF instances and all other
objectives when adapting to changed service demands."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Schneider SB, Dräxler S, Karl H. Trade-offs in Dynamic Resource Allocation
in Network Function Virtualization. In: IEEE Global Communications Conference
(GLOBECOM 2018). IEEE; 2018.'
apa: 'Schneider, S. B., Dräxler, S., & Karl, H. (2018). Trade-offs in Dynamic
Resource Allocation in Network Function Virtualization. In IEEE Global Communications
Conference (GLOBECOM 2018). Abu Dhabi, UAE: IEEE.'
bibtex: '@inproceedings{Schneider_Dräxler_Karl_2018, title={Trade-offs in Dynamic
Resource Allocation in Network Function Virtualization}, booktitle={IEEE Global
Communications Conference (GLOBECOM 2018)}, publisher={IEEE}, author={Schneider,
Stefan Balthasar and Dräxler, Sevil and Karl, Holger}, year={2018} }'
chicago: Schneider, Stefan Balthasar, Sevil Dräxler, and Holger Karl. “Trade-Offs
in Dynamic Resource Allocation in Network Function Virtualization.” In IEEE
Global Communications Conference (GLOBECOM 2018). IEEE, 2018.
ieee: S. B. Schneider, S. Dräxler, and H. Karl, “Trade-offs in Dynamic Resource
Allocation in Network Function Virtualization,” in IEEE Global Communications
Conference (GLOBECOM 2018), Abu Dhabi, UAE, 2018.
mla: Schneider, Stefan Balthasar, et al. “Trade-Offs in Dynamic Resource Allocation
in Network Function Virtualization.” IEEE Global Communications Conference
(GLOBECOM 2018), IEEE, 2018.
short: 'S.B. Schneider, S. Dräxler, H. Karl, in: IEEE Global Communications Conference
(GLOBECOM 2018), IEEE, 2018.'
conference:
location: Abu Dhabi, UAE
name: IEEE Global Communications Conference (GLOBECOM 2018)
date_created: 2019-01-24T13:53:22Z
date_updated: 2022-01-06T07:03:24Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2019-01-24T13:53:16Z
date_updated: 2019-01-24T13:53:16Z
file_id: '6971'
file_name: preprint_ris.pdf
file_size: 422196
relation: main_file
file_date_updated: 2019-01-24T13:53:16Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Global Communications Conference (GLOBECOM 2018)
publisher: IEEE
status: public
title: Trade-offs in Dynamic Resource Allocation in Network Function Virtualization
type: conference
user_id: '35343'
year: '2018'
...
---
_id: '6972'
abstract:
- lang: eng
text: "In recent years, a variety of different approaches\r\nhave been proposed
to tackle the problem of scaling and placing\r\nnetwork services, consisting of
interconnected virtual network\r\nfunctions (VNFs). This paper presents a placement
abstraction\r\nlayer (PAL) that provides a clear and simple northbound interface\r\nfor
using such algorithms while hiding their internal\r\nfunctionality and implementation.
Through its southbound interface,\r\nPAL can connect to different back ends that
evaluate\r\nthe calculated placements, e.g., using simulations, emulations, or\r\ntestbed
approaches. As an example for such evaluation back ends,\r\nwe introduce a novel
placement emulation framework (PEF)\r\nthat allows executing calculated placements
using real, containerbased\r\nVNFs on real-world network topologies. In a case
study,\r\nwe show how PAL and PEF facilitate reusing and evaluating\r\nplacement
algorithms as well as validating their underlying\r\nmodels and performance claims."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Schneider SB, Peuster M, Karl H. A Generic Emulation Framework for Reusing
and Evaluating VNF Placement Algorithms. In: IEEE Conference on Network Function
Virtualization and Software Defined Networks (NFV-SDN 2018). IEEE; 2018. doi:10.1109/NFV-SDN.2018.8725795'
apa: 'Schneider, S. B., Peuster, M., & Karl, H. (2018). A Generic Emulation
Framework for Reusing and Evaluating VNF Placement Algorithms. In IEEE Conference
on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018).
Verona, Italy: IEEE. https://doi.org/10.1109/NFV-SDN.2018.8725795'
bibtex: '@inproceedings{Schneider_Peuster_Karl_2018, title={A Generic Emulation
Framework for Reusing and Evaluating VNF Placement Algorithms}, DOI={10.1109/NFV-SDN.2018.8725795},
booktitle={IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN 2018)}, publisher={IEEE}, author={Schneider, Stefan Balthasar
and Peuster, Manuel and Karl, Holger}, year={2018} }'
chicago: Schneider, Stefan Balthasar, Manuel Peuster, and Holger Karl. “A Generic
Emulation Framework for Reusing and Evaluating VNF Placement Algorithms.” In IEEE
Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN
2018). IEEE, 2018. https://doi.org/10.1109/NFV-SDN.2018.8725795.
ieee: S. B. Schneider, M. Peuster, and H. Karl, “A Generic Emulation Framework for
Reusing and Evaluating VNF Placement Algorithms,” in IEEE Conference on Network
Function Virtualization and Software Defined Networks (NFV-SDN 2018), Verona,
Italy, 2018.
mla: Schneider, Stefan Balthasar, et al. “A Generic Emulation Framework for Reusing
and Evaluating VNF Placement Algorithms.” IEEE Conference on Network Function
Virtualization and Software Defined Networks (NFV-SDN 2018), IEEE, 2018, doi:10.1109/NFV-SDN.2018.8725795.
short: 'S.B. Schneider, M. Peuster, H. Karl, in: IEEE Conference on Network Function
Virtualization and Software Defined Networks (NFV-SDN 2018), IEEE, 2018.'
conference:
location: Verona, Italy
name: IEEE Conference on Network Function Virtualization and Software Defined Networks
(NFV-SDN 2018)
date_created: 2019-01-24T14:10:17Z
date_updated: 2022-01-06T07:03:24Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/NFV-SDN.2018.8725795
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2019-01-24T14:10:08Z
date_updated: 2019-01-24T14:25:23Z
file_id: '6973'
file_name: preprint_ris.pdf
file_size: 468396
relation: main_file
file_date_updated: 2019-01-24T14:25:23Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/abstract/document/8725795
oa: '1'
project:
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN 2018)
publisher: IEEE
status: public
title: A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms
type: conference
user_id: '35343'
year: '2018'
...
---
_id: '6974'
abstract:
- lang: eng
text: "A key challenge of network function virtualization\r\n(NFV) is the complexity
of developing and deploying new\r\nnetwork services. Currently, development requires
many manual\r\nsteps that are time-consuming and error-prone (e.g., for creating\r\nservice
descriptors). Furthermore, existing management and\r\norchestration (MANO) platforms
only offer limited support of\r\nstandardized descriptor models or package formats,
limiting the\r\nre-usability of network services.\r\n\r\nTo this end, we introduce
a fully integrated, open-source\r\nNFV service development kit (SDK) with multi-MANO
platform\r\nsupport. Our SDK simplifies many NFV service development\r\nsteps
by offering initial generation of descriptors, advanced\r\nproject management,
as well as fully automated packaging and\r\nsubmission for on-boarding. To achieve
multi-platform support,\r\nwe present a package format that extends ETSI’s VNF
package\r\nformat. In this demonstration, we present the end-to-end workflow\r\nto
develop an NFV service that is then packaged for multiple\r\nplatforms, i.e.,
5GTANGO and OSM."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Wouter
full_name: Tavernier, Wouter
last_name: Tavernier
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Schneider SB, Peuster M, Tavernier W, Karl H. A Fully Integrated Multi-Platform
NFV SDK. In: IEEE Conference on Network Function Virtualization and Software
Defined Networks (NFV-SDN 2018). IEEE; 2018. doi:10.1109/NFV-SDN.2018.8725794'
apa: 'Schneider, S. B., Peuster, M., Tavernier, W., & Karl, H. (2018). A Fully
Integrated Multi-Platform NFV SDK. In IEEE Conference on Network Function Virtualization
and Software Defined Networks (NFV-SDN 2018). Verona, Italy: IEEE. https://doi.org/10.1109/NFV-SDN.2018.8725794'
bibtex: '@inproceedings{Schneider_Peuster_Tavernier_Karl_2018, title={A Fully Integrated
Multi-Platform NFV SDK}, DOI={10.1109/NFV-SDN.2018.8725794},
booktitle={IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN 2018)}, publisher={IEEE}, author={Schneider, Stefan Balthasar
and Peuster, Manuel and Tavernier, Wouter and Karl, Holger}, year={2018} }'
chicago: Schneider, Stefan Balthasar, Manuel Peuster, Wouter Tavernier, and Holger
Karl. “A Fully Integrated Multi-Platform NFV SDK.” In IEEE Conference on Network
Function Virtualization and Software Defined Networks (NFV-SDN 2018). IEEE,
2018. https://doi.org/10.1109/NFV-SDN.2018.8725794.
ieee: S. B. Schneider, M. Peuster, W. Tavernier, and H. Karl, “A Fully Integrated
Multi-Platform NFV SDK,” in IEEE Conference on Network Function Virtualization
and Software Defined Networks (NFV-SDN 2018), Verona, Italy, 2018.
mla: Schneider, Stefan Balthasar, et al. “A Fully Integrated Multi-Platform NFV
SDK.” IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN 2018), IEEE, 2018, doi:10.1109/NFV-SDN.2018.8725794.
short: 'S.B. Schneider, M. Peuster, W. Tavernier, H. Karl, in: IEEE Conference on
Network Function Virtualization and Software Defined Networks (NFV-SDN 2018),
IEEE, 2018.'
conference:
location: Verona, Italy
name: IEEE Conference on Network Function Virtualization and Software Defined Networks
(NFV-SDN 2018)
date_created: 2019-01-24T14:17:58Z
date_updated: 2022-01-06T07:03:25Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/NFV-SDN.2018.8725794
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2019-01-24T14:17:29Z
date_updated: 2019-01-24T14:26:23Z
file_id: '6975'
file_name: Pre-print.pdf
file_size: 475022
relation: main_file
file_date_updated: 2019-01-24T14:26:23Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/abstract/document/8725794
oa: '1'
project:
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN 2018)
publisher: IEEE
status: public
title: A Fully Integrated Multi-Platform NFV SDK
type: conference
user_id: '35343'
year: '2018'
...
---
_id: '1046'
author:
- first_name: Thomas
full_name: John, Thomas
id: '3952'
last_name: John
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
citation:
ama: 'John T, Szopinski D. Towards explaining the popularity of the Business Model
Canvas: A dual coding approach. In: Proceedings of the Multikonferenz Wirtschaftsinformatik
2018 (MKWI), Lüneburg, Germany. ; 2018.'
apa: 'John, T., & Szopinski, D. (2018). Towards explaining the popularity of
the Business Model Canvas: A dual coding approach. Proceedings of the Multikonferenz
Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany.'
bibtex: '@inproceedings{John_Szopinski_2018, title={Towards explaining the popularity
of the Business Model Canvas: A dual coding approach}, booktitle={Proceedings
of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany}, author={John,
Thomas and Szopinski, Daniel}, year={2018} }'
chicago: 'John, Thomas, and Daniel Szopinski. “Towards Explaining the Popularity
of the Business Model Canvas: A Dual Coding Approach.” In Proceedings of the
Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany, 2018.'
ieee: 'T. John and D. Szopinski, “Towards explaining the popularity of the Business
Model Canvas: A dual coding approach,” 2018.'
mla: 'John, Thomas, and Daniel Szopinski. “Towards Explaining the Popularity of
the Business Model Canvas: A Dual Coding Approach.” Proceedings of the Multikonferenz
Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany, 2018.'
short: 'T. John, D. Szopinski, in: Proceedings of the Multikonferenz Wirtschaftsinformatik
2018 (MKWI), Lüneburg, Germany, 2018.'
date_created: 2017-12-13T09:24:01Z
date_updated: 2022-01-06T06:50:41Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: dsz
date_created: 2018-11-12T13:19:37Z
date_updated: 2018-11-12T13:19:37Z
file_id: '5499'
file_name: MKWI2018_Memorierung.pdf
file_size: 334833
relation: main_file
success: 1
file_date_updated: 2018-11-12T13:19:37Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI),
Lüneburg, Germany
status: public
title: 'Towards explaining the popularity of the Business Model Canvas: A dual coding
approach'
type: conference
user_id: '36372'
year: '2018'
...
---
_id: '1047'
author:
- first_name: Christian
full_name: Stummer, Christian
last_name: Stummer
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: Reinhold
full_name: Decker, Reinhold
last_name: Decker
citation:
ama: Stummer C, Kundisch D, Decker R. Platform Launch Strategies. Business &
Information Systems Engineering. 2018.
apa: Stummer, C., Kundisch, D., & Decker, R. (2018). Platform Launch Strategies.
Business & Information Systems Engineering.
bibtex: '@article{Stummer_Kundisch_Decker_2018, title={Platform Launch Strategies},
journal={Business & Information Systems Engineering}, publisher={Springer},
author={Stummer, Christian and Kundisch, Dennis and Decker, Reinhold}, year={2018}
}'
chicago: Stummer, Christian, Dennis Kundisch, and Reinhold Decker. “Platform Launch
Strategies.” Business & Information Systems Engineering, 2018.
ieee: C. Stummer, D. Kundisch, and R. Decker, “Platform Launch Strategies,” Business
& Information Systems Engineering, 2018.
mla: Stummer, Christian, et al. “Platform Launch Strategies.” Business &
Information Systems Engineering, Springer, 2018.
short: C. Stummer, D. Kundisch, R. Decker, Business & Information Systems Engineering
(2018).
date_created: 2017-12-13T09:26:38Z
date_updated: 2022-01-06T06:50:41Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: abursig
date_created: 2018-11-14T12:54:24Z
date_updated: 2018-11-14T12:54:24Z
file_id: '5610'
file_name: ICIS2018_TechnologyPivots.pdf
file_size: 808601
relation: main_file
success: 1
file_date_updated: 2018-11-14T12:54:24Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: Business & Information Systems Engineering
publication_status: published
publisher: Springer
status: public
title: Platform Launch Strategies
type: journal_article
user_id: '477'
year: '2018'
...
---
_id: '1208'
author:
- first_name: Arne
full_name: Schwabe, Arne
last_name: Schwabe
citation:
ama: Schwabe A. Data-Centre Traffic Optimisation Using Software-Defined Networks.
Universität Paderborn; 2018. doi:10.17619/UNIPB/1-287
apa: Schwabe, A. (2018). Data-Centre Traffic Optimisation using Software-Defined
Networks. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-287
bibtex: '@book{Schwabe_2018, title={Data-Centre Traffic Optimisation using Software-Defined
Networks}, DOI={10.17619/UNIPB/1-287},
publisher={Universität Paderborn}, author={Schwabe, Arne}, year={2018} }'
chicago: Schwabe, Arne. Data-Centre Traffic Optimisation Using Software-Defined
Networks. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-287.
ieee: A. Schwabe, Data-Centre Traffic Optimisation using Software-Defined Networks.
Universität Paderborn, 2018.
mla: Schwabe, Arne. Data-Centre Traffic Optimisation Using Software-Defined Networks.
Universität Paderborn, 2018, doi:10.17619/UNIPB/1-287.
short: A. Schwabe, Data-Centre Traffic Optimisation Using Software-Defined Networks,
Universität Paderborn, 2018.
date_created: 2018-03-13T10:22:51Z
date_updated: 2022-01-06T06:51:17Z
department:
- _id: '75'
doi: 10.17619/UNIPB/1-287
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subproject A2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
title: Data-Centre Traffic Optimisation using Software-Defined Networks
type: dissertation
user_id: '477'
year: '2018'
...
---
_id: '1369'
abstract:
- lang: eng
text: In budget games, players compete over resources with finite budgets. For every
resource, a player has a specific demand and as a strategy, he chooses a subset
of resources. If the total demand on a resource does not exceed its budget, the
utility of each player who chose that resource equals his demand. Otherwise, the
budget is shared proportionally. In the general case, pure Nash equilibria (NE)
do not exist for such games. In this paper, we consider the natural classes of
singleton and matroid budget games with additional constraints and show that for
each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential
function to prove that every matroid budget game has an approximate pure NE which
depends on the largest ratio between the different demands of each individual
player.
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash equilibria in restricted
budget games. Journal of Combinatorial Optimization. 2018. doi:10.1007/s10878-018-0269-7
apa: Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2018). Pure Nash
equilibria in restricted budget games. Journal of Combinatorial Optimization.
https://doi.org/10.1007/s10878-018-0269-7
bibtex: '@article{Drees_Feldotto_Riechers_Skopalik_2018, title={Pure Nash equilibria
in restricted budget games}, DOI={10.1007/s10878-018-0269-7},
journal={Journal of Combinatorial Optimization}, publisher={Springer Nature},
author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik,
Alexander}, year={2018} }'
chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
“Pure Nash Equilibria in Restricted Budget Games.” Journal of Combinatorial
Optimization, 2018. https://doi.org/10.1007/s10878-018-0269-7.
ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria
in restricted budget games,” Journal of Combinatorial Optimization, 2018.
mla: Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.”
Journal of Combinatorial Optimization, Springer Nature, 2018, doi:10.1007/s10878-018-0269-7.
short: M. Drees, M. Feldotto, S. Riechers, A. Skopalik, Journal of Combinatorial
Optimization (2018).
date_created: 2018-03-18T11:12:49Z
date_updated: 2022-01-06T06:51:42Z
ddc:
- '000'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/s10878-018-0269-7
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T16:56:13Z
date_updated: 2018-10-31T16:56:13Z
file_id: '5225'
file_name: Drees2018_Article_PureNashEquilibriaInRestricted.pdf
file_size: 561187
relation: main_file
file_date_updated: 2018-10-31T16:56:13Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: Journal of Combinatorial Optimization
publication_identifier:
issn:
- 1382-6905
- 1573-2886
publication_status: epub_ahead
publisher: Springer Nature
status: public
title: Pure Nash equilibria in restricted budget games
type: journal_article
user_id: '14052'
year: '2018'
...
---
_id: '5470'
author:
- first_name: Jiajia
full_name: Hoffmeister, Jiajia
last_name: Hoffmeister
citation:
ama: 'Hoffmeister J. Evaluation von Taxonomien: Ein Literaturüberblick.;
2018.'
apa: 'Hoffmeister, J. (2018). Evaluation von Taxonomien: Ein Literaturüberblick.'
bibtex: '@book{Hoffmeister_2018, place={Universität Paderborn}, title={Evaluation
von Taxonomien: Ein Literaturüberblick}, author={Hoffmeister, Jiajia}, year={2018}
}'
chicago: 'Hoffmeister, Jiajia. Evaluation von Taxonomien: Ein Literaturüberblick.
Universität Paderborn, 2018.'
ieee: 'J. Hoffmeister, Evaluation von Taxonomien: Ein Literaturüberblick.
Universität Paderborn, 2018.'
mla: 'Hoffmeister, Jiajia. Evaluation von Taxonomien: Ein Literaturüberblick.
2018.'
short: 'J. Hoffmeister, Evaluation von Taxonomien: Ein Literaturüberblick, Universität
Paderborn, 2018.'
date_created: 2018-11-12T09:16:54Z
date_updated: 2022-07-14T13:03:01Z
language:
- iso: other
place: Universität Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
status: public
supervisor:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: 'Evaluation von Taxonomien: Ein Literaturüberblick'
type: bachelorsthesis
user_id: '16205'
year: '2018'
...
---
_id: '4764'
author:
- first_name: Andreas
full_name: Valentin, Andreas
last_name: Valentin
citation:
ama: Valentin A. Zweiseitige Märkte und Plattformökonomie in der Information
Systems-Forschung - Ein klassifizierender Literaturüberblick. Universität
Paderborn; 2018.
apa: Valentin, A. (2018). Zweiseitige Märkte und Plattformökonomie in der Information
Systems-Forschung - Ein klassifizierender Literaturüberblick. Universität
Paderborn.
bibtex: '@book{Valentin_2018, title={Zweiseitige Märkte und Plattformökonomie in
der Information Systems-Forschung - Ein klassifizierender Literaturüberblick},
publisher={Universität Paderborn}, author={Valentin, Andreas}, year={2018} }'
chicago: Valentin, Andreas. Zweiseitige Märkte und Plattformökonomie in der Information
Systems-Forschung - Ein klassifizierender Literaturüberblick. Universität
Paderborn, 2018.
ieee: A. Valentin, Zweiseitige Märkte und Plattformökonomie in der Information
Systems-Forschung - Ein klassifizierender Literaturüberblick. Universität
Paderborn, 2018.
mla: Valentin, Andreas. Zweiseitige Märkte und Plattformökonomie in der Information
Systems-Forschung - Ein klassifizierender Literaturüberblick. Universität
Paderborn, 2018.
short: A. Valentin, Zweiseitige Märkte und Plattformökonomie in der Information
Systems-Forschung - Ein klassifizierender Literaturüberblick, Universität Paderborn,
2018.
date_created: 2018-10-16T13:45:46Z
date_updated: 2022-07-14T13:04:03Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: Zweiseitige Märkte und Plattformökonomie in der Information Systems-Forschung
- Ein klassifizierender Literaturüberblick
type: bachelorsthesis
user_id: '16205'
year: '2018'
...
---
_id: '4997'
author:
- first_name: Jana
full_name: Weigang, Jana
last_name: Weigang
citation:
ama: 'Weigang J. Das Konzept Der Kreativität in Der Wirtschaftsinformatik: Ein
Literaturüberblick.; 2018.'
apa: 'Weigang, J. (2018). Das Konzept der Kreativität in der Wirtschaftsinformatik:
Ein Literaturüberblick.'
bibtex: '@book{Weigang_2018, place={Universität Paderborn}, title={Das Konzept der
Kreativität in der Wirtschaftsinformatik: Ein Literaturüberblick}, author={Weigang,
Jana}, year={2018} }'
chicago: 'Weigang, Jana. Das Konzept Der Kreativität in Der Wirtschaftsinformatik:
Ein Literaturüberblick. Universität Paderborn, 2018.'
ieee: 'J. Weigang, Das Konzept der Kreativität in der Wirtschaftsinformatik:
Ein Literaturüberblick. Universität Paderborn, 2018.'
mla: 'Weigang, Jana. Das Konzept Der Kreativität in Der Wirtschaftsinformatik:
Ein Literaturüberblick. 2018.'
short: 'J. Weigang, Das Konzept Der Kreativität in Der Wirtschaftsinformatik: Ein
Literaturüberblick, Universität Paderborn, 2018.'
date_created: 2018-10-29T13:04:04Z
date_updated: 2022-07-14T13:03:40Z
language:
- iso: eng
place: Universität Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
status: public
supervisor:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: 'Das Konzept der Kreativität in der Wirtschaftsinformatik: Ein Literaturüberblick'
type: bachelorsthesis
user_id: '16205'
year: '2018'
...
---
_id: '5417'
abstract:
- lang: eng
text: "Molecular Dynamic (MD) simulations are computationally intensive and accelerating
them using specialized hardware is a topic of investigation in many studies. One
of the routines in the critical path of MD simulations is the three-dimensional
Fast Fourier Transformation (FFT3d). The potential in accelerating FFT3d using
hardware is usually bound by bandwidth and memory. Therefore, designing a high
throughput solution for an FPGA that overcomes this problem is challenging.\r\nIn
this thesis, the feasibility of offloading FFT3d computations to FPGA implemented
using OpenCL is investigated. In order to mask the latency in memory access, an
FFT3d that overlaps computation with communication is designed. The implementa-
tion of this design is synthesized for the Arria 10 GX 1150 FPGA and evaluated
with the FFTW benchmark. Analysis shows a better performance using FPGA over CPU
for larger FFT sizes, with the 643 FFT showing a 70% improvement in runtime using
FPGAs.\r\nThis FFT3d design is integrated with CP2K to explore the potential in
accelerating molecular dynamic simulations. Evaluation of CP2K simulations using
FPGA shows a 41% improvement in runtime in FFT3d computations over CPU for larger
FFT3d designs."
author:
- first_name: Arjun
full_name: Ramaswami, Arjun
id: '49171'
last_name: Ramaswami
orcid: https://orcid.org/0000-0002-0909-1178
citation:
ama: Ramaswami A. Accelerating Molecular Dynamic Simulations by Offloading Fast
Fourier Transformations to FPGA. Universität Paderborn; 2018.
apa: Ramaswami, A. (2018). Accelerating Molecular Dynamic Simulations by Offloading
Fast Fourier Transformations to FPGA. Universität Paderborn.
bibtex: '@book{Ramaswami_2018, title={Accelerating Molecular Dynamic Simulations
by Offloading Fast Fourier Transformations to FPGA}, publisher={Universität Paderborn},
author={Ramaswami, Arjun}, year={2018} }'
chicago: Ramaswami, Arjun. Accelerating Molecular Dynamic Simulations by Offloading
Fast Fourier Transformations to FPGA. Universität Paderborn, 2018.
ieee: A. Ramaswami, Accelerating Molecular Dynamic Simulations by Offloading
Fast Fourier Transformations to FPGA. Universität Paderborn, 2018.
mla: Ramaswami, Arjun. Accelerating Molecular Dynamic Simulations by Offloading
Fast Fourier Transformations to FPGA. Universität Paderborn, 2018.
short: A. Ramaswami, Accelerating Molecular Dynamic Simulations by Offloading Fast
Fourier Transformations to FPGA, Universität Paderborn, 2018.
date_created: 2018-11-07T16:08:32Z
date_updated: 2022-01-12T16:32:23Z
ddc:
- '000'
department:
- _id: '27'
- _id: '518'
file:
- access_level: closed
content_type: application/pdf
creator: arjunr
date_created: 2020-06-15T11:29:38Z
date_updated: 2020-06-15T11:29:38Z
file_id: '17093'
file_name: masterthesis.pdf
file_size: 1297585
relation: main_file
success: 1
file_date_updated: 2020-06-15T11:29:38Z
has_accepted_license: '1'
keyword:
- 'FFT: FPGA'
- CP2K
- OpenCL
language:
- iso: eng
main_file_link:
- open_access: '1'
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
name: SFB 901 - Subproject C2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
title: Accelerating Molecular Dynamic Simulations by Offloading Fast Fourier Transformations
to FPGA
type: mastersthesis
user_id: '49171'
year: '2018'
...
---
_id: '3873'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
citation:
ama: 'Blömer J, Eidens F, Juhnke J. Enhanced Security of Attribute-Based Signatures.
In: The International Conference on Cryptology And Network Security (CANS).
Vol 11124. Lecture Notes in Computer Science. Springer; 2018:235-255. doi:10.1007/978-3-030-00434-7_12'
apa: Blömer, J., Eidens, F., & Juhnke, J. (2018). Enhanced Security of Attribute-Based
Signatures. The International Conference on Cryptology And Network Security
(CANS), 11124, 235–255. https://doi.org/10.1007/978-3-030-00434-7_12
bibtex: '@inproceedings{Blömer_Eidens_Juhnke_2018, series={Lecture Notes in Computer
Science}, title={Enhanced Security of Attribute-Based Signatures}, volume={11124},
DOI={10.1007/978-3-030-00434-7_12},
booktitle={The International Conference on Cryptology And Network Security (CANS)},
publisher={Springer}, author={Blömer, Johannes and Eidens, Fabian and Juhnke,
Jakob}, year={2018}, pages={235–255}, collection={Lecture Notes in Computer Science}
}'
chicago: Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Enhanced Security of
Attribute-Based Signatures.” In The International Conference on Cryptology
And Network Security (CANS), 11124:235–55. Lecture Notes in Computer Science.
Springer, 2018. https://doi.org/10.1007/978-3-030-00434-7_12.
ieee: 'J. Blömer, F. Eidens, and J. Juhnke, “Enhanced Security of Attribute-Based
Signatures,” in The International Conference on Cryptology And Network Security
(CANS), Naples, Italy, 2018, vol. 11124, pp. 235–255, doi: 10.1007/978-3-030-00434-7_12.'
mla: Blömer, Johannes, et al. “Enhanced Security of Attribute-Based Signatures.”
The International Conference on Cryptology And Network Security (CANS),
vol. 11124, Springer, 2018, pp. 235–55, doi:10.1007/978-3-030-00434-7_12.
short: 'J. Blömer, F. Eidens, J. Juhnke, in: The International Conference on Cryptology
And Network Security (CANS), Springer, 2018, pp. 235–255.'
conference:
location: Naples, Italy
name: The International Conference on Cryptology And Network Security (CANS)
date_created: 2018-08-10T09:44:09Z
date_updated: 2023-01-10T10:26:13Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-030-00434-7_12
file:
- access_level: closed
content_type: application/pdf
creator: feidens
date_created: 2018-11-08T10:15:00Z
date_updated: 2018-11-08T10:15:00Z
file_id: '5427'
file_name: uc_abs.pdf
file_size: 574228
relation: main_file
file_date_updated: 2018-11-08T10:15:00Z
has_accepted_license: '1'
intvolume: ' 11124'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/874
oa: '1'
page: 235-255
project:
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '1'
name: SFB 901
publication: The International Conference on Cryptology And Network Security (CANS)
publication_identifier:
isbn:
- 978-3-030-00434-7
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Enhanced Security of Attribute-Based Signatures
type: conference
user_id: '25078'
volume: 11124
year: '2018'
...
---
_id: '2379'
abstract:
- lang: eng
text: 'In this paper, we introduce the notion of delegatable attribute-based anonymous
credentials (DAAC). Such systems offer fine-grained anonymous access control and
they give the credential holder the ability to issue more restricted credentials
to other users. In our model, credentials are parameterized with attributes that
(1) express what the credential holder himself has been certified and (2) define
which attributes he may issue to others. Furthermore, we present a practical construction
of DAAC. For this construction, we deviate from the usual approach of embedding
a certificate chain in the credential. Instead, we introduce a novel approach
for which we identify a new primitive we call dynamically malleable signatures
(DMS) as the main ingredient. This primitive may be of independent interest. We
also give a first instantiation of DMS with efficient protocols. '
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
citation:
ama: 'Blömer J, Bobolz J. Delegatable Attribute-based Anonymous Credentials from
Dynamically Malleable Signatures. In: ACNS 2018 Applied Cryptography &
Network Security. LNCS. doi:10.1007/978-3-319-93387-0_12'
apa: Blömer, J., & Bobolz, J. (n.d.). Delegatable Attribute-based Anonymous
Credentials from Dynamically Malleable Signatures. ACNS 2018 Applied Cryptography
& Network Security. The 16th International Conference on Applied Cryptography
and Network Security, Leuven, Belgium. https://doi.org/10.1007/978-3-319-93387-0_12
bibtex: '@inproceedings{Blömer_Bobolz, series={LNCS}, title={Delegatable Attribute-based
Anonymous Credentials from Dynamically Malleable Signatures}, DOI={10.1007/978-3-319-93387-0_12},
booktitle={ACNS 2018 Applied Cryptography & Network security}, author={Blömer,
Johannes and Bobolz, Jan}, collection={LNCS} }'
chicago: Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous
Credentials from Dynamically Malleable Signatures.” In ACNS 2018 Applied Cryptography
& Network Security. LNCS, n.d. https://doi.org/10.1007/978-3-319-93387-0_12.
ieee: 'J. Blömer and J. Bobolz, “Delegatable Attribute-based Anonymous Credentials
from Dynamically Malleable Signatures,” presented at the The 16th International
Conference on Applied Cryptography and Network Security, Leuven, Belgium, doi:
10.1007/978-3-319-93387-0_12.'
mla: Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous Credentials
from Dynamically Malleable Signatures.” ACNS 2018 Applied Cryptography &
Network Security, doi:10.1007/978-3-319-93387-0_12.
short: 'J. Blömer, J. Bobolz, in: ACNS 2018 Applied Cryptography & Network Security,
n.d.'
conference:
location: Leuven, Belgium
name: The 16th International Conference on Applied Cryptography and Network Security
date_created: 2018-04-17T12:28:25Z
date_updated: 2023-01-10T10:28:43Z
ddc:
- '004'
department:
- _id: '7'
- _id: '64'
doi: 10.1007/978-3-319-93387-0_12
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:41:16Z
date_updated: 2018-11-02T13:41:16Z
file_id: '5252'
file_name: 2018-340.pdf
file_size: 542171
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:41:16Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/340
oa: '1'
project:
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subproject C1
publication: ACNS 2018 Applied Cryptography & Network security
publication_status: accepted
series_title: LNCS
status: public
title: Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable
Signatures
type: conference
user_id: '25078'
year: '2018'
...
---
_id: '1588'
abstract:
- lang: eng
text: The exploration of FPGAs as accelerators for scientific simulations has so
far mostly been focused on small kernels of methods working on regular data structures,
for example in the form of stencil computations for finite difference methods.
In computational sciences, often more advanced methods are employed that promise
better stability, convergence, locality and scaling. Unstructured meshes are shown
to be more effective and more accurate, compared to regular grids, in representing
computation domains of various shapes. Using unstructured meshes, the discontinuous
Galerkin method preserves the ability to perform explicit local update operations
for simulations in the time domain. In this work, we investigate FPGAs as target
platform for an implementation of the nodal discontinuous Galerkin method to find
time-domain solutions of Maxwell's equations in an unstructured mesh. When maximizing
data reuse and fitting constant coefficients into suitably partitioned on-chip
memory, high computational intensity allows us to implement and feed wide data
paths with hundreds of floating point operators. By decoupling off-chip memory
accesses from the computations, high memory bandwidth can be sustained, even for
the irregular access pattern required by parts of the application. Using the Intel/Altera
OpenCL SDK for FPGAs, we present different implementation variants for different
polynomial orders of the method. In different phases of the algorithm, either
computational or bandwidth limits of the Arria 10 platform are almost reached,
thus outperforming a highly multithreaded CPU implementation by around 2x.
author:
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Gopinath
full_name: Mahale, Gopinath
last_name: Mahale
- first_name: Samer
full_name: Alhaddad, Samer
id: '42456'
last_name: Alhaddad
- first_name: Yevgen
full_name: Grynko, Yevgen
id: '26059'
last_name: Grynko
- first_name: Christian
full_name: Schmitt, Christian
last_name: Schmitt
- first_name: Ayesha
full_name: Afzal, Ayesha
last_name: Afzal
- first_name: Frank
full_name: Hannig, Frank
last_name: Hannig
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Kenter T, Mahale G, Alhaddad S, et al. OpenCL-based FPGA Design to Accelerate
the Nodal Discontinuous Galerkin Method for Unstructured Meshes. In: Proc.
Int. Symp. on Field-Programmable Custom Computing Machines (FCCM). IEEE; 2018.
doi:10.1109/FCCM.2018.00037'
apa: Kenter, T., Mahale, G., Alhaddad, S., Grynko, Y., Schmitt, C., Afzal, A., Hannig,
F., Förstner, J., & Plessl, C. (2018). OpenCL-based FPGA Design to Accelerate
the Nodal Discontinuous Galerkin Method for Unstructured Meshes. Proc. Int.
Symp. on Field-Programmable Custom Computing Machines (FCCM). Proc. Int. Symp.
on Field-Programmable Custom Computing Machines (FCCM). https://doi.org/10.1109/FCCM.2018.00037
bibtex: '@inproceedings{Kenter_Mahale_Alhaddad_Grynko_Schmitt_Afzal_Hannig_Förstner_Plessl_2018,
title={OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin
Method for Unstructured Meshes}, DOI={10.1109/FCCM.2018.00037},
booktitle={Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)},
publisher={IEEE}, author={Kenter, Tobias and Mahale, Gopinath and Alhaddad, Samer
and Grynko, Yevgen and Schmitt, Christian and Afzal, Ayesha and Hannig, Frank
and Förstner, Jens and Plessl, Christian}, year={2018} }'
chicago: Kenter, Tobias, Gopinath Mahale, Samer Alhaddad, Yevgen Grynko, Christian
Schmitt, Ayesha Afzal, Frank Hannig, Jens Förstner, and Christian Plessl. “OpenCL-Based
FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured
Meshes.” In Proc. Int. Symp. on Field-Programmable Custom Computing Machines
(FCCM). IEEE, 2018. https://doi.org/10.1109/FCCM.2018.00037.
ieee: 'T. Kenter et al., “OpenCL-based FPGA Design to Accelerate the Nodal
Discontinuous Galerkin Method for Unstructured Meshes,” presented at the Proc.
Int. Symp. on Field-Programmable Custom Computing Machines (FCCM), 2018, doi:
10.1109/FCCM.2018.00037.'
mla: Kenter, Tobias, et al. “OpenCL-Based FPGA Design to Accelerate the Nodal Discontinuous
Galerkin Method for Unstructured Meshes.” Proc. Int. Symp. on Field-Programmable
Custom Computing Machines (FCCM), IEEE, 2018, doi:10.1109/FCCM.2018.00037.
short: 'T. Kenter, G. Mahale, S. Alhaddad, Y. Grynko, C. Schmitt, A. Afzal, F. Hannig,
J. Förstner, C. Plessl, in: Proc. Int. Symp. on Field-Programmable Custom Computing
Machines (FCCM), IEEE, 2018.'
conference:
name: Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)
date_created: 2018-03-22T10:48:01Z
date_updated: 2023-09-26T11:47:52Z
ddc:
- '000'
department:
- _id: '27'
- _id: '518'
- _id: '61'
doi: 10.1109/FCCM.2018.00037
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:45:05Z
date_updated: 2018-11-02T14:45:05Z
file_id: '5282'
file_name: 08457652.pdf
file_size: 269130
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:45:05Z
has_accepted_license: '1'
keyword:
- tet_topic_hpc
language:
- iso: eng
project:
- _id: '33'
grant_number: 01|H16005A
name: HighPerMeshes
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subproject C2
publication: Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)
publisher: IEEE
quality_controlled: '1'
status: public
title: OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method
for Unstructured Meshes
type: conference
user_id: '15278'
year: '2018'
...
---
_id: '1204'
author:
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- first_name: Gavin Francis
full_name: Vaz, Gavin Francis
id: '30332'
last_name: Vaz
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Riebler H, Vaz GF, Kenter T, Plessl C. Automated Code Acceleration Targeting
Heterogeneous OpenCL Devices. In: Proc. ACM SIGPLAN Symposium on Principles
and Practice of Parallel Programming (PPoPP). ACM; 2018. doi:10.1145/3178487.3178534'
apa: Riebler, H., Vaz, G. F., Kenter, T., & Plessl, C. (2018). Automated Code
Acceleration Targeting Heterogeneous OpenCL Devices. Proc. ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming (PPoPP). https://doi.org/10.1145/3178487.3178534
bibtex: '@inproceedings{Riebler_Vaz_Kenter_Plessl_2018, title={Automated Code Acceleration
Targeting Heterogeneous OpenCL Devices}, DOI={10.1145/3178487.3178534},
booktitle={Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel
Programming (PPoPP)}, publisher={ACM}, author={Riebler, Heinrich and Vaz, Gavin
Francis and Kenter, Tobias and Plessl, Christian}, year={2018} }'
chicago: Riebler, Heinrich, Gavin Francis Vaz, Tobias Kenter, and Christian Plessl.
“Automated Code Acceleration Targeting Heterogeneous OpenCL Devices.” In Proc.
ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP).
ACM, 2018. https://doi.org/10.1145/3178487.3178534.
ieee: 'H. Riebler, G. F. Vaz, T. Kenter, and C. Plessl, “Automated Code Acceleration
Targeting Heterogeneous OpenCL Devices,” 2018, doi: 10.1145/3178487.3178534.'
mla: Riebler, Heinrich, et al. “Automated Code Acceleration Targeting Heterogeneous
OpenCL Devices.” Proc. ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming (PPoPP), ACM, 2018, doi:10.1145/3178487.3178534.
short: 'H. Riebler, G.F. Vaz, T. Kenter, C. Plessl, in: Proc. ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming (PPoPP), ACM, 2018.'
date_created: 2018-03-08T14:45:18Z
date_updated: 2023-09-26T11:47:23Z
ddc:
- '000'
department:
- _id: '27'
- _id: '518'
doi: 10.1145/3178487.3178534
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:43:37Z
date_updated: 2018-11-02T14:43:37Z
file_id: '5281'
file_name: p417-riebler.pdf
file_size: 447769
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:43:37Z
has_accepted_license: '1'
keyword:
- htrop
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subproject C2
publication: Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
(PPoPP)
publication_identifier:
isbn:
- '9781450349826'
publication_status: published
publisher: ACM
quality_controlled: '1'
status: public
title: Automated Code Acceleration Targeting Heterogeneous OpenCL Devices
type: conference
user_id: '15278'
year: '2018'
...
---
_id: '3291'
abstract:
- lang: eng
text: The microservice architecture uses independently running microservices as
build- ing blocks for applications. These microservices are clearly bounded for
each other and expose their functionality through, for instance, RESTful application
inter- faces. Particularly the clear boundaries between microservices enable the
reuse of microservice throughout different projects. Because of the increasing
use of microservices, the composition of multiple microservices in service composition
becomes a more important task. A challenging area in developing service compo-
sitions is that it involves two distinct layers with few junctions. On the one
hand, describes a service composition a business process, which involves multiple
com- ponents. On the other hand, involves the implementation of a service composition
topics like service discovery and message exchange protocols since the microser-
vices involved in a service composition are located within a network environment.
In this Bachelor’s Thesis, I describe a descriptions language to abstractly describe
the business logic of a service composition. Furthermore, I describe a genera-
tion process, which compiles this abstract description to a working microservice
realizing the specified service composition. In addition to that, I provide an
im- plementation of the generation process, as a proof of concept, and test it
within a Kubernetes-based cluster environment.
author:
- first_name: Andreas
full_name: Schürmann, Andreas
last_name: Schürmann
citation:
ama: Schürmann A. Microservice-Based Execution Environment for Service Compositions.
Universität Paderborn; 2017.
apa: Schürmann, A. (2017). Microservice-based Execution Environment for Service
Compositions. Universität Paderborn.
bibtex: '@book{Schürmann_2017, title={Microservice-based Execution Environment for
Service Compositions}, publisher={Universität Paderborn}, author={Schürmann, Andreas},
year={2017} }'
chicago: Schürmann, Andreas. Microservice-Based Execution Environment for Service
Compositions. Universität Paderborn, 2017.
ieee: A. Schürmann, Microservice-based Execution Environment for Service Compositions.
Universität Paderborn, 2017.
mla: Schürmann, Andreas. Microservice-Based Execution Environment for Service
Compositions. Universität Paderborn, 2017.
short: A. Schürmann, Microservice-Based Execution Environment for Service Compositions,
Universität Paderborn, 2017.
date_created: 2018-06-21T11:09:30Z
date_updated: 2022-01-06T06:59:09Z
department:
- _id: '75'
language:
- iso: eng
project:
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
title: Microservice-based Execution Environment for Service Compositions
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '2967'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Gennadij
full_name: Liske, Gennadij
last_name: Liske
citation:
ama: 'Blömer J, Liske G. Subtleties in Security Definitions for Predicate Encryption
with Public Index. In: Proceedings of the International Conference of Mathematical
Aspects of Computer and Information Sciences (MACIS). Vol 10693. Lecture Notes
in Computer Science. Cham: Springer International Publishing; 2017:438-453. doi:10.1007/978-3-319-72453-9_35'
apa: 'Blömer, J., & Liske, G. (2017). Subtleties in Security Definitions for
Predicate Encryption with Public Index. In Proceedings of the International
Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)
(Vol. 10693, pp. 438–453). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-72453-9_35'
bibtex: '@inproceedings{Blömer_Liske_2017, place={Cham}, series={Lecture Notes in
Computer Science}, title={Subtleties in Security Definitions for Predicate Encryption
with Public Index}, volume={10693}, DOI={10.1007/978-3-319-72453-9_35},
booktitle={Proceedings of the International Conference of Mathematical Aspects
of Computer and Information Sciences (MACIS)}, publisher={Springer International
Publishing}, author={Blömer, Johannes and Liske, Gennadij}, year={2017}, pages={438–453},
collection={Lecture Notes in Computer Science} }'
chicago: 'Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions
for Predicate Encryption with Public Index.” In Proceedings of the International
Conference of Mathematical Aspects of Computer and Information Sciences (MACIS),
10693:438–53. Lecture Notes in Computer Science. Cham: Springer International
Publishing, 2017. https://doi.org/10.1007/978-3-319-72453-9_35.'
ieee: J. Blömer and G. Liske, “Subtleties in Security Definitions for Predicate
Encryption with Public Index,” in Proceedings of the International Conference
of Mathematical Aspects of Computer and Information Sciences (MACIS), 2017,
vol. 10693, pp. 438–453.
mla: Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for
Predicate Encryption with Public Index.” Proceedings of the International Conference
of Mathematical Aspects of Computer and Information Sciences (MACIS), vol.
10693, Springer International Publishing, 2017, pp. 438–53, doi:10.1007/978-3-319-72453-9_35.
short: 'J. Blömer, G. Liske, in: Proceedings of the International Conference of
Mathematical Aspects of Computer and Information Sciences (MACIS), Springer International
Publishing, Cham, 2017, pp. 438–453.'
date_created: 2018-06-04T12:17:48Z
date_updated: 2022-01-06T06:58:49Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-319-72453-9_35
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:52:10Z
date_updated: 2018-11-02T14:52:10Z
file_id: '5286'
file_name: SubtletiesInSecurityDefinition.pdf
file_size: 463904
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:52:10Z
has_accepted_license: '1'
intvolume: ' 10693'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2017/453.pdf
oa: '1'
page: 438-453
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the International Conference of Mathematical Aspects of
Computer and Information Sciences (MACIS)
publication_identifier:
isbn:
- '9783319724522'
- '9783319724539'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Subtleties in Security Definitions for Predicate Encryption with Public Index
type: conference
user_id: '477'
volume: 10693
year: '2017'
...
---
_id: '116'
author:
- first_name: Gennadij
full_name: Liske, Gennadij
last_name: Liske
citation:
ama: Liske G. CCA-Security for Predicate Encryption Schemes. Universität
Paderborn; 2017. doi:10.17619/UNIPB/1-220
apa: Liske, G. (2017). CCA-Security for Predicate Encryption Schemes. Universität
Paderborn. https://doi.org/10.17619/UNIPB/1-220
bibtex: '@book{Liske_2017, title={CCA-Security for Predicate Encryption Schemes},
DOI={10.17619/UNIPB/1-220},
publisher={Universität Paderborn}, author={Liske, Gennadij}, year={2017} }'
chicago: Liske, Gennadij. CCA-Security for Predicate Encryption Schemes.
Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-220.
ieee: G. Liske, CCA-Security for Predicate Encryption Schemes. Universität
Paderborn, 2017.
mla: Liske, Gennadij. CCA-Security for Predicate Encryption Schemes. Universität
Paderborn, 2017, doi:10.17619/UNIPB/1-220.
short: G. Liske, CCA-Security for Predicate Encryption Schemes, Universität Paderborn,
2017.
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:04Z
department:
- _id: '64'
doi: 10.17619/UNIPB/1-220
main_file_link:
- url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-29690
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: CCA-Security for Predicate Encryption Schemes
type: dissertation
user_id: '25078'
year: '2017'
...