---
_id: '1592'
abstract:
- lang: eng
text: Compared to classical HDL designs, generating FPGA with high-level synthesis
from an OpenCL specification promises easier exploration of different design alternatives
and, through ready-to-use infrastructure and common abstractions for host and
memory interfaces, easier portability between different FPGA families. In this
work, we evaluate the extent of this promise. To this end, we present a parameterized
FDTD implementation for photonic microcavity simulations. Our design can trade-off
different forms of parallelism and works for two independent OpenCL-based FPGA
design flows. Hence, we can target FPGAs from different vendors and different
FPGA families. We describe how we used pre-processor macros to achieve this flexibility
and to work around different shortcomings of the current tools. Choosing the right
design configurations, we are able to present two extremely competitive solutions
for very different FPGA targets, reaching up to 172 GFLOPS sustained performance.
With the portability and flexibility demonstrated, code developers not only avoid
vendor lock-in, but can even make best use of real trade-offs between different
architectures.
author:
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- 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, Förstner J, Plessl C. Flexible FPGA design for FDTD using OpenCL.
In: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL).
IEEE; 2017. doi:10.23919/FPL.2017.8056844'
apa: Kenter, T., Förstner, J., & Plessl, C. (2017). Flexible FPGA design for
FDTD using OpenCL. Proc. Int. Conf. on Field Programmable Logic and Applications
(FPL). https://doi.org/10.23919/FPL.2017.8056844
bibtex: '@inproceedings{Kenter_Förstner_Plessl_2017, title={Flexible FPGA design
for FDTD using OpenCL}, DOI={10.23919/FPL.2017.8056844},
booktitle={Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)},
publisher={IEEE}, author={Kenter, Tobias and Förstner, Jens and Plessl, Christian},
year={2017} }'
chicago: Kenter, Tobias, Jens Förstner, and Christian Plessl. “Flexible FPGA Design
for FDTD Using OpenCL.” In Proc. Int. Conf. on Field Programmable Logic and
Applications (FPL). IEEE, 2017. https://doi.org/10.23919/FPL.2017.8056844.
ieee: 'T. Kenter, J. Förstner, and C. Plessl, “Flexible FPGA design for FDTD using
OpenCL,” 2017, doi: 10.23919/FPL.2017.8056844.'
mla: Kenter, Tobias, et al. “Flexible FPGA Design for FDTD Using OpenCL.” Proc.
Int. Conf. on Field Programmable Logic and Applications (FPL), IEEE, 2017,
doi:10.23919/FPL.2017.8056844.
short: 'T. Kenter, J. Förstner, C. Plessl, in: Proc. Int. Conf. on Field Programmable
Logic and Applications (FPL), IEEE, 2017.'
date_created: 2018-03-22T11:10:23Z
date_updated: 2023-09-26T13:24:38Z
ddc:
- '000'
department:
- _id: '27'
- _id: '518'
- _id: '61'
doi: 10.23919/FPL.2017.8056844
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:02:28Z
date_updated: 2018-11-02T15:02:28Z
file_id: '5291'
file_name: 08056844.pdf
file_size: 230235
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:02:28Z
has_accepted_license: '1'
keyword:
- tet_topic_hpc
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
- _id: '33'
grant_number: 01|H16005A
name: HighPerMeshes
- _id: '32'
grant_number: PL 595/2-1 / 320898746
name: Performance and Efficiency in HPC with Custom Computing
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)
publisher: IEEE
quality_controlled: '1'
status: public
title: Flexible FPGA design for FDTD using OpenCL
type: conference
user_id: '15278'
year: '2017'
...
---
_id: '198'
author:
- first_name: Bahar
full_name: Jazayeri, Bahar
id: '36399'
last_name: Jazayeri
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Jazayeri B, Platenius MC, Engels G, Kundisch D. Features of IT Service
Markets: A Systematic Literature Review (Supplementary Material). Universität
Paderborn; 2016.'
apa: 'Jazayeri, B., Platenius, M. C., Engels, G., & Kundisch, D. (2016). Features
of IT Service Markets: A Systematic Literature Review (Supplementary Material).
Universität Paderborn.'
bibtex: '@book{Jazayeri_Platenius_Engels_Kundisch_2016, title={Features of IT Service
Markets: A Systematic Literature Review (Supplementary Material)}, publisher={Universität
Paderborn}, author={Jazayeri, Bahar and Platenius, Marie Christin and Engels,
Gregor and Kundisch, Dennis}, year={2016} }'
chicago: 'Jazayeri, Bahar, Marie Christin Platenius, Gregor Engels, and Dennis Kundisch.
Features of IT Service Markets: A Systematic Literature Review (Supplementary
Material). Universität Paderborn, 2016.'
ieee: 'B. Jazayeri, M. C. Platenius, G. Engels, and D. Kundisch, Features of
IT Service Markets: A Systematic Literature Review (Supplementary Material).
Universität Paderborn, 2016.'
mla: 'Jazayeri, Bahar, et al. Features of IT Service Markets: A Systematic Literature
Review (Supplementary Material). Universität Paderborn, 2016.'
short: 'B. Jazayeri, M.C. Platenius, G. Engels, D. Kundisch, Features of IT Service
Markets: A Systematic Literature Review (Supplementary Material), Universität
Paderborn, 2016.'
date_created: 2017-10-17T12:41:30Z
date_updated: 2022-01-06T06:54:13Z
ddc:
- '040'
department:
- _id: '276'
- _id: '66'
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: bahareh
date_created: 2018-11-12T19:11:20Z
date_updated: 2018-11-12T19:11:20Z
file_id: '5534'
file_name: MarketSurvey_Techreport (1).pdf
file_size: 1024328
relation: main_file
success: 1
file_date_updated: 2018-11-12T19:11:20Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subprojekt C5
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: 'Features of IT Service Markets: A Systematic Literature Review (Supplementary
Material)'
type: report
user_id: '477'
year: '2016'
...
---
_id: '199'
abstract:
- lang: eng
text: The provision of IT solutions over electronic marketplaces became prominent
in recent years. We call such marketplaces IT service markets. IT service markets
have some core architectural building blocks that impact the quality attributes
of these markets. However, these building blocks and their impacts are not well-known.
Thus, design choices for IT service markets have been made ad-hoc until now. Furthermore,
only single aspects of such markets have been investigated until now, but a comprehensive
view is missing.In this paper, we identify common features and their interrelations
on the basis of a systematic literature review of 60 publications using grounded
theory.This knowledge provides an empirical evidence on the interdisciplinary
design choices of IT service markets and it serves as a basis to support market
providers and developers to integrate market features. Thereby, we make a first
step towards the creation of a reference model for IT service markets that provides
a holistic integrated view that can be used to create and maintain successful
markets in the future.
author:
- first_name: Bahar
full_name: Jazayeri, Bahar
id: '36399'
last_name: Jazayeri
- first_name: Marie
full_name: Platenius, Marie
last_name: Platenius
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Jazayeri B, Platenius M, Engels G, Kundisch D. Features of IT Service Markets:
A Systematic Literature Review. In: Proceedings of the 14th International Conference
on Service Oriented Computing (ICSOC). Vol 9936. Lecture Notes in Computer
Science (LNCS). Banff, Canada: Springer; 2016:301-316. doi:10.1007/978-3-319-46295-0_19'
apa: 'Jazayeri, B., Platenius, M., Engels, G., & Kundisch, D. (2016). Features
of IT Service Markets: A Systematic Literature Review. In Proceedings of the
14th International Conference on Service Oriented Computing (ICSOC) (Vol.
9936, pp. 301–316). Banff, Canada: Springer. https://doi.org/10.1007/978-3-319-46295-0_19'
bibtex: '@inproceedings{Jazayeri_Platenius_Engels_Kundisch_2016, place={Banff, Canada},
series={Lecture Notes in Computer Science (LNCS)}, title={Features of IT Service
Markets: A Systematic Literature Review}, volume={9936}, DOI={10.1007/978-3-319-46295-0_19},
booktitle={Proceedings of the 14th International Conference on Service Oriented
Computing (ICSOC)}, publisher={Springer}, author={Jazayeri, Bahar and Platenius,
Marie and Engels, Gregor and Kundisch, Dennis}, year={2016}, pages={301–316},
collection={Lecture Notes in Computer Science (LNCS)} }'
chicago: 'Jazayeri, Bahar, Marie Platenius, Gregor Engels, and Dennis Kundisch.
“Features of IT Service Markets: A Systematic Literature Review.” In Proceedings
of the 14th International Conference on Service Oriented Computing (ICSOC),
9936:301–16. Lecture Notes in Computer Science (LNCS). Banff, Canada: Springer,
2016. https://doi.org/10.1007/978-3-319-46295-0_19.'
ieee: 'B. Jazayeri, M. Platenius, G. Engels, and D. Kundisch, “Features of IT Service
Markets: A Systematic Literature Review,” in Proceedings of the 14th International
Conference on Service Oriented Computing (ICSOC), 2016, vol. 9936, pp. 301–316.'
mla: 'Jazayeri, Bahar, et al. “Features of IT Service Markets: A Systematic Literature
Review.” Proceedings of the 14th International Conference on Service Oriented
Computing (ICSOC), vol. 9936, Springer, 2016, pp. 301–16, doi:10.1007/978-3-319-46295-0_19.'
short: 'B. Jazayeri, M. Platenius, G. Engels, D. Kundisch, in: Proceedings of the
14th International Conference on Service Oriented Computing (ICSOC), Springer,
Banff, Canada, 2016, pp. 301–316.'
date_created: 2017-10-17T12:41:30Z
date_updated: 2022-01-06T06:54:14Z
ddc:
- '040'
department:
- _id: '66'
- _id: '276'
- _id: '76'
doi: 10.1007/978-3-319-46295-0_19
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:15:24Z
date_updated: 2018-03-21T12:15:24Z
file_id: '1526'
file_name: 199-chp_3A10.1007_2F978-3-319-46295-0_19.pdf
file_size: 765410
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:15:24Z
has_accepted_license: '1'
intvolume: ' 9936'
language:
- iso: eng
page: 301-316
place: Banff, Canada
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subprojekt C5
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 14th International Conference on Service Oriented
Computing (ICSOC)
publisher: Springer
series_title: Lecture Notes in Computer Science (LNCS)
status: public
title: 'Features of IT Service Markets: A Systematic Literature Review'
type: conference
user_id: '477'
volume: 9936
year: '2016'
...
---
_id: '213'
author:
- first_name: Laurens
full_name: Porzenheim, Laurens
last_name: Porzenheim
citation:
ama: Porzenheim L. Comparison of Different Definitions of Chosen-Ciphertext Security
in Encryption Schemes. Universität Paderborn; 2016.
apa: Porzenheim, L. (2016). Comparison of different Definitions of Chosen-Ciphertext
Security in Encryption schemes. Universität Paderborn.
bibtex: '@book{Porzenheim_2016, title={Comparison of different Definitions of Chosen-Ciphertext
Security in Encryption schemes}, publisher={Universität Paderborn}, author={Porzenheim,
Laurens}, year={2016} }'
chicago: Porzenheim, Laurens. Comparison of Different Definitions of Chosen-Ciphertext
Security in Encryption Schemes. Universität Paderborn, 2016.
ieee: L. Porzenheim, Comparison of different Definitions of Chosen-Ciphertext
Security in Encryption schemes. Universität Paderborn, 2016.
mla: Porzenheim, Laurens. Comparison of Different Definitions of Chosen-Ciphertext
Security in Encryption Schemes. Universität Paderborn, 2016.
short: L. Porzenheim, Comparison of Different Definitions of Chosen-Ciphertext Security
in Encryption Schemes, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:53Z
department:
- _id: '64'
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: Comparison of different Definitions of Chosen-Ciphertext Security in Encryption
schemes
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '214'
author:
- first_name: Kai Sören
full_name: Bemmann, Kai Sören
last_name: Bemmann
citation:
ama: Bemmann KS. Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn; 2016.
apa: Bemmann, K. S. (2016). Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn.
bibtex: '@book{Bemmann_2016, title={Commitment Schemes - Definitions, Variants,
and Security}, publisher={Universität Paderborn}, author={Bemmann, Kai Sören},
year={2016} }'
chicago: Bemmann, Kai Sören. Commitment Schemes - Definitions, Variants, and
Security. Universität Paderborn, 2016.
ieee: K. S. Bemmann, Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn, 2016.
mla: Bemmann, Kai Sören. Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn, 2016.
short: K.S. Bemmann, Commitment Schemes - Definitions, Variants, and Security, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:58Z
department:
- _id: '64'
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: Commitment Schemes - Definitions, Variants, and Security
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '215'
abstract:
- lang: eng
text: 'We present three robust overlay networks: First, we present a network that
organizes the nodes into an expander and is resistant to even massive adversarial
churn. Second, we develop a network based on the hypercube that maintains connectivity
under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log
log n)-late adversary which only has access to topological information that is
at least Omega(log log n) rounds old. Finally, we develop a network that combines
both churn- and DoS-resistance. The networks gain their robustness through constant
network reconfiguration, i.e., the topology of the networks changes constantly.
Our reconguration algorithms are based on node sampling primitives for expanders
and hypercubes that allow each node to sample a logarithmic number of nodes uniformly
at random in O(log log n) communication rounds. These primitives are specific
to overlay networks and their optimal runtime represents an exponential improvement
over known techniques. Our results have a wide range of applications, for example
in the area of scalable and robust peer-to-peer systems.'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based
on Network Reconfiguration. In: Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA). ; 2016:417--427. doi:10.1145/2935764.2935783'
apa: Drees, M., Gmyr, R., & Scheideler, C. (2016). Churn- and DoS-resistant
Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427).
https://doi.org/10.1145/2935764.2935783
bibtex: '@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant
Overlay Networks Based on Network Reconfiguration}, DOI={10.1145/2935764.2935783},
booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler,
Christian}, year={2016}, pages={417--427} }'
chicago: Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant
Overlay Networks Based on Network Reconfiguration.” In Proceedings of the 28th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 417--427,
2016. https://doi.org/10.1145/2935764.2935783.
ieee: M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks
Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.
mla: Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based
on Network Reconfiguration.” Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783.
short: 'M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.'
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:55:02Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1145/2935764.2935783
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:41:40Z
date_updated: 2018-03-21T10:41:40Z
file_id: '1518'
file_name: 215-SPAA16-Drees_Gmyr_Scheideler.pdf
file_size: 352996
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:41:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 417--427
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
type: conference
user_id: '14955'
year: '2016'
...
---
_id: '207'
abstract:
- lang: eng
text: We consider a scheduling problem where machines need to be rented from the
cloud in order to process jobs. There are two types of machines available which
can be rented for machine-type dependent prices and for arbitrary durations. However,
a machine-type dependent setup time is required before a machine is available
for processing. Jobs arrive online over time, have machine-type dependent sizes
and have individual deadlines. The objective is to rent machines and schedule
jobs so as to meet all deadlines while minimizing the rental cost. Since we observe
the slack of jobs to have a fundamental influence on the competitiveness, we study
the model when instances are parameterized by their (minimum) slack. An instance
is called to have a slack of $\beta$ if, for all jobs, the difference between
the job's release time and the latest point in time at which it needs to be started
is at least $\beta$. While for $\beta series = {LNCS}
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling
on Machines from the Cloud. In: Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA). ; 2016:578--592.
doi:10.1007/978-3-319-48749-6_42'
apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016).
Cost-efficient Scheduling on Machines from the Cloud. In Proceedings of the
10th Annual International Conference on Combinatorial Optimization and Applications
(COCOA) (pp. 578--592). https://doi.org/10.1007/978-3-319-48749-6_42
bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient
Scheduling on Machines from the Cloud}, DOI={10.1007/978-3-319-48749-6_42},
booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Mäcker, Alexander and Malatyali,
Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={578--592}
}'
chicago: Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” In Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 578--592, 2016. https://doi.org/10.1007/978-3-319-48749-6_42.
ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient
Scheduling on Machines from the Cloud,” in Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp.
578--592.
mla: Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”
Proceedings of the 10th Annual International Conference on Combinatorial Optimization
and Applications (COCOA), 2016, pp. 578--592, doi:10.1007/978-3-319-48749-6_42.
short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 2016, pp. 578--592.'
date_created: 2017-10-17T12:41:32Z
date_updated: 2022-01-06T06:54:33Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-48749-6_42
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:18:51Z
date_updated: 2018-11-02T14:18:51Z
file_id: '5268'
file_name: Cost-EfficientSchedulingOnMach.pdf
file_size: 608614
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:18:51Z
has_accepted_license: '1'
language:
- iso: eng
page: 578--592
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
status: public
title: Cost-efficient Scheduling on Machines from the Cloud
type: conference
user_id: '477'
year: '2016'
...
---
_id: '208'
abstract:
- lang: eng
text: This paper presents a new framework for constructing fully CCA-secure predicate
encryption schemes from pair encoding schemes. Our construction is the first in
the context of predicate encryption which uses the technique of well-formedness
proofs known from public key encryption. The resulting constructions are simpler
and more efficient compared to the schemes achieved using known generic transformations
from CPA-secure to CCA-secure schemes. The reduction costs of our framework are
comparable to the reduction costs of the underlying CPA-secure framework. We achieve
this last result by applying the dual system encryption methodology in a novel
way.
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. Construction of Fully CCA-Secure Predicate Encryptions
from Pair Encoding Schemes. In: Proceedings of the CT-RSA 2016. LNCS. ;
2016:431-447. doi:10.1007/978-3-319-29485-8_25'
apa: Blömer, J., & Liske, G. (2016). Construction of Fully CCA-Secure Predicate
Encryptions from Pair Encoding Schemes. In Proceedings of the CT-RSA 2016
(pp. 431–447). https://doi.org/10.1007/978-3-319-29485-8_25
bibtex: '@inproceedings{Blömer_Liske_2016, series={LNCS}, title={Construction of
Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes}, DOI={10.1007/978-3-319-29485-8_25},
booktitle={Proceedings of the CT-RSA 2016}, author={Blömer, Johannes and Liske,
Gennadij}, year={2016}, pages={431–447}, collection={LNCS} }'
chicago: Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure
Predicate Encryptions from Pair Encoding Schemes.” In Proceedings of the CT-RSA
2016, 431–47. LNCS, 2016. https://doi.org/10.1007/978-3-319-29485-8_25.
ieee: J. Blömer and G. Liske, “Construction of Fully CCA-Secure Predicate Encryptions
from Pair Encoding Schemes,” in Proceedings of the CT-RSA 2016, 2016, pp.
431–447.
mla: Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate
Encryptions from Pair Encoding Schemes.” Proceedings of the CT-RSA 2016,
2016, pp. 431–47, doi:10.1007/978-3-319-29485-8_25.
short: 'J. Blömer, G. Liske, in: Proceedings of the CT-RSA 2016, 2016, pp. 431–447.'
date_created: 2017-10-17T12:41:32Z
date_updated: 2022-01-06T06:54:39Z
ddc:
- '040'
department:
- _id: '64'
doi: 10.1007/978-3-319-29485-8_25
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:43:36Z
date_updated: 2018-03-21T10:43:36Z
file_id: '1521'
file_name: 208-aCCA_P-KEM_final.pdf
file_size: 462666
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:43:36Z
has_accepted_license: '1'
page: 431-447
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the CT-RSA 2016
series_title: LNCS
status: public
title: Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes
type: conference
user_id: '477'
year: '2016'
...
---
_id: '223'
abstract:
- lang: eng
text: We consider the problem of aggregation in overlay networks. We use a synchronous
time model in which each node has polylogarithmic memory and can send at most
a polylogarithmic number of messages per round. We investigate how to quickly
compute the result of an aggregate functionf over elements that are distributed
among the nodes of the network such that the result is eventually known by a selected
root node. We show how to compute distributive aggregate functions such as SUM,
MAX, and OR in time $O(\log n / \log\log n)$ using a tree that is created in a
pre-processing phase. If only a polylogarithmic number of data items need to be
aggregated, we show how to compute the result in time $O(\sqrt{\log n / \log\log
n})$. Furthermore, we show how to compute holistic aggregate functions such as
DISTINCT, SMALLEST(k) and MODE(k) in time $O(\log n / \log\log n)$. Finally, we
show a lower bound of $\Omega(\sqrt{\log n / \log\log n})$ for deterministic algorithms
that compute any of the aggregate functions in the scope of the thesis.
author:
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
citation:
ama: Hinnenthal K. Aggregation in Overlay Networks. Universität Paderborn;
2016.
apa: Hinnenthal, K. (2016). Aggregation in Overlay Networks. Universität
Paderborn.
bibtex: '@book{Hinnenthal_2016, title={Aggregation in Overlay Networks}, publisher={Universität
Paderborn}, author={Hinnenthal, Kristian}, year={2016} }'
chicago: Hinnenthal, Kristian. Aggregation in Overlay Networks. Universität
Paderborn, 2016.
ieee: K. Hinnenthal, Aggregation in Overlay Networks. Universität Paderborn,
2016.
mla: Hinnenthal, Kristian. Aggregation in Overlay Networks. Universität Paderborn,
2016.
short: K. Hinnenthal, Aggregation in Overlay Networks, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:35Z
date_updated: 2022-01-06T06:55:30Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:35:39Z
date_updated: 2018-03-21T10:35:39Z
file_id: '1510'
file_name: 223-MasterarbeitHinnenthal.pdf
file_size: 1127144
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:35:39Z
has_accepted_license: '1'
language:
- iso: eng
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: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Aggregation in Overlay Networks
type: mastersthesis
user_id: '15504'
year: '2016'
...
---
_id: '219'
abstract:
- lang: eng
text: Existing software markets like Google Play allow users to search among available
Apps and select one based on the description provided for the App or based on
its rating. Future software markets facilitate on-the-fly composition of such
Apps based on users’ individual wishes. Realizing such On-The-Fly Computing (OTF)
markets requires support of sophisticated software features. In addition, suitable
orchestration among such features needs to ensure well-alignment of business and
IT aspects in case of run-time changes like market dynamics. However, all these
introduce new architectural and management complexities, which are specific to
such markets. An architecture framework for OTF markets will include design solutions
to overcome these complexities. In my PhD, I aim at identifying an architecture
framework for OTF markets including main architectural building blocks and a systematic
development process. Such an architecture framework enables the development of
OTF markets in the future. Furthermore, this knowledge can be used as a basis
to improve existing software markets by integrating missing functionalities.
author:
- first_name: Bahar
full_name: Jazayeri, Bahar
id: '36399'
last_name: Jazayeri
citation:
ama: 'Jazayeri B. Architectural Management of On-The-Fly Computing Markets. In:
Proceedings of the 10th European Conference on Software Architecture (ECSA
Workshops). Copenhagen, Denmark: ACM; 2016:42. doi:10.1145/2993412.3010821'
apa: 'Jazayeri, B. (2016). Architectural Management of On-The-Fly Computing Markets.
In Proceedings of the 10th European Conference on Software Architecture (ECSA
Workshops) (p. 42). Copenhagen, Denmark: ACM. https://doi.org/10.1145/2993412.3010821'
bibtex: '@inproceedings{Jazayeri_2016, place={Copenhagen, Denmark}, title={Architectural
Management of On-The-Fly Computing Markets}, DOI={10.1145/2993412.3010821},
booktitle={Proceedings of the 10th European Conference on Software Architecture
(ECSA Workshops)}, publisher={ACM}, author={Jazayeri, Bahar}, year={2016}, pages={42}
}'
chicago: 'Jazayeri, Bahar. “Architectural Management of On-The-Fly Computing Markets.”
In Proceedings of the 10th European Conference on Software Architecture (ECSA
Workshops), 42. Copenhagen, Denmark: ACM, 2016. https://doi.org/10.1145/2993412.3010821.'
ieee: B. Jazayeri, “Architectural Management of On-The-Fly Computing Markets,” in
Proceedings of the 10th European Conference on Software Architecture (ECSA
Workshops), 2016, p. 42.
mla: Jazayeri, Bahar. “Architectural Management of On-The-Fly Computing Markets.”
Proceedings of the 10th European Conference on Software Architecture (ECSA
Workshops), ACM, 2016, p. 42, doi:10.1145/2993412.3010821.
short: 'B. Jazayeri, in: Proceedings of the 10th European Conference on Software
Architecture (ECSA Workshops), ACM, Copenhagen, Denmark, 2016, p. 42.'
date_created: 2017-10-17T12:41:34Z
date_updated: 2022-01-06T06:55:19Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1145/2993412.3010821
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:38:17Z
date_updated: 2018-03-21T10:38:17Z
file_id: '1514'
file_name: 219-a42-jazayeri.pdf
file_size: 169229
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:38:17Z
has_accepted_license: '1'
language:
- iso: eng
page: '42'
place: Copenhagen, Denmark
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subprojekt C5
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 10th European Conference on Software Architecture
(ECSA Workshops)
publisher: ACM
status: public
title: Architectural Management of On-The-Fly Computing Markets
type: conference
user_id: '36399'
year: '2016'
...
---
_id: '220'
author:
- first_name: Matthias
full_name: Keller, Matthias
last_name: Keller
citation:
ama: Keller M. Application Deployment at Distributed Clouds. Universität
Paderborn; 2016.
apa: Keller, M. (2016). Application Deployment at Distributed Clouds. Universität
Paderborn.
bibtex: '@book{Keller_2016, title={Application Deployment at Distributed Clouds},
publisher={Universität Paderborn}, author={Keller, Matthias}, year={2016} }'
chicago: Keller, Matthias. Application Deployment at Distributed Clouds.
Universität Paderborn, 2016.
ieee: M. Keller, Application Deployment at Distributed Clouds. Universität
Paderborn, 2016.
mla: Keller, Matthias. Application Deployment at Distributed Clouds. Universität
Paderborn, 2016.
short: M. Keller, Application Deployment at Distributed Clouds, Universität Paderborn,
2016.
date_created: 2017-10-17T12:41:34Z
date_updated: 2022-01-06T06:55:22Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:37:11Z
date_updated: 2018-03-21T10:37:11Z
file_id: '1513'
file_name: 220-Keller_PhD-Theses_01.pdf
file_size: 7467820
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:37:11Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _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: Application Deployment at Distributed Clouds
type: dissertation
user_id: '477'
year: '2016'
...
---
_id: '726'
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. DCT2Gen: A traffic generator for data centers.
Computer Communications. 2016:45--58. doi:10.1016/j.comcom.2015.12.001'
apa: 'Wette, P., & Karl, H. (2016). DCT2Gen: A traffic generator
for data centers. Computer Communications, 45--58. https://doi.org/10.1016/j.comcom.2015.12.001'
bibtex: '@article{Wette_Karl_2016, title={DCT2Gen: A traffic generator
for data centers}, DOI={10.1016/j.comcom.2015.12.001},
journal={Computer Communications}, author={Wette, Philip and Karl, Holger}, year={2016},
pages={45--58} }'
chicago: 'Wette, Philip, and Holger Karl. “DCT2Gen: A Traffic Generator
for Data Centers.” Computer Communications, 2016, 45--58. https://doi.org/10.1016/j.comcom.2015.12.001.'
ieee: 'P. Wette and H. Karl, “DCT2Gen: A traffic generator for data centers,”
Computer Communications, pp. 45--58, 2016.'
mla: 'Wette, Philip, and Holger Karl. “DCT2Gen: A Traffic Generator for
Data Centers.” Computer Communications, 2016, pp. 45--58, doi:10.1016/j.comcom.2015.12.001.'
short: P. Wette, H. Karl, Computer Communications (2016) 45--58.
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:31Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1016/j.comcom.2015.12.001
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:59:29Z
date_updated: 2018-11-02T15:59:29Z
file_id: '5319'
file_name: WetteKarl.pdf
file_size: 1671431
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:59:29Z
has_accepted_license: '1'
language:
- iso: eng
page: 45--58
project:
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publication: Computer Communications
status: public
title: 'DCT²Gen: A traffic generator for data centers'
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '730'
abstract:
- lang: eng
text: "Allocating resources to virtualized network functions and services to meet
service level agreements is a challenging task for NFV management and orchestration
systems. This becomes even more challenging when agile development methodologies,
like DevOps, are applied. In such scenarios, management and orchestration systems
are continuously facing new versions of functions and services which makes it
hard to decide how much resources have to be allocated to them to provide the
expected service performance. \r\nOne solution for this problem is to support
resource allocation decisions with performance behavior information obtained by
profiling techniques applied to such network functions and services.\r\n\r\nIn
this position paper, we analyze and discuss the components needed to generate
such performance behavior information within the NFV DevOps workflow. We also
outline research questions that identify open issues and missing pieces for a
fully integrated NFV profiling solution. Further, we introduce a novel profiling
mechanism that is able to profile virtualized network functions and entire network
service chains under different resource constraints before they are deployed on
production infrastructure."
author:
- 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: 'Peuster M, Karl H. Understand Your Chains: Towards Performance Profile-Based
Network Service Management. In: Fifth European Workshop on Software-Defined
Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016. ; 2016:7--12.
doi:10.1109/EWSDN.2016.9'
apa: 'Peuster, M., & Karl, H. (2016). Understand Your Chains: Towards Performance
Profile-Based Network Service Management. In Fifth European Workshop on Software-Defined
Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016 (pp.
7--12). Den Haag. https://doi.org/10.1109/EWSDN.2016.9'
bibtex: '@inproceedings{Peuster_Karl_2016, title={Understand Your Chains: Towards
Performance Profile-Based Network Service Management}, DOI={10.1109/EWSDN.2016.9},
booktitle={Fifth European Workshop on Software-Defined Networks, EWSDN 2016, Den
Haag, The Netherlands, October 10-11, 2016}, author={Peuster, Manuel and Karl,
Holger}, year={2016}, pages={7--12} }'
chicago: 'Peuster, Manuel, and Holger Karl. “Understand Your Chains: Towards Performance
Profile-Based Network Service Management.” In Fifth European Workshop on Software-Defined
Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016, 7--12,
2016. https://doi.org/10.1109/EWSDN.2016.9.'
ieee: 'M. Peuster and H. Karl, “Understand Your Chains: Towards Performance Profile-Based
Network Service Management,” in Fifth European Workshop on Software-Defined
Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016, Den
Haag, 2016, pp. 7--12.'
mla: 'Peuster, Manuel, and Holger Karl. “Understand Your Chains: Towards Performance
Profile-Based Network Service Management.” Fifth European Workshop on Software-Defined
Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016, 2016,
pp. 7--12, doi:10.1109/EWSDN.2016.9.'
short: 'M. Peuster, H. Karl, in: Fifth European Workshop on Software-Defined Networks,
EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016, 2016, pp. 7--12.'
conference:
location: Den Haag
name: Fifth European Workshop on Software-Defined Networks (EWSDN
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:33Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/EWSDN.2016.9
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2018-06-25T13:10:10Z
date_updated: 2018-06-25T13:16:56Z
file_id: '3353'
file_name: main_ris.pdf
file_size: 966702
relation: main_file
file_date_updated: 2018-06-25T13:16:56Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://ieeexplore.ieee.org/document/7956044/
oa: '1'
page: 7--12
project:
- _id: '25'
call_identifier: 5G PPP Phase 1
grant_number: '671517'
name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
Networks'
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: Fifth European Workshop on Software-Defined Networks, EWSDN 2016, Den
Haag, The Netherlands, October 10-11, 2016
publication_status: published
status: public
title: 'Understand Your Chains: Towards Performance Profile-Based Network Service
Management'
type: conference
urn: '7309'
user_id: '13271'
year: '2016'
...
---
_id: '731'
abstract:
- lang: eng
text: "Traditional cellular networks are forced to remain active regardless of the
actual amount of traffic that is currently produced/requested, with a clear waste
of energy. Two-layer mobile networks with separated signalling and data layers
have been recently proposed for energy savings in future implementations. These
networks are able to switch off unneeded data cells completely while maintaining
full coverage with their signalling cells, thus saving energy. In this demonstration,
we showcase a testbed that uses Wi-Fi access points to emulate small cells of
the data layer and a publicly available cellular connection as the signalling
layer. We use off-the-shelf Android smartphones with an ad-hoc networking management
module and a MultiPath TCP-enabled kernel to manage the Wi-Fi and cellular interfaces
simultaneously.\r\nThe testbed is used to demonstrate the general feasibility
of this layered architecture and to facilitate experiments with network-wide resource
optimization. "
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Alessandro
full_name: Enrico Redondi, Alessandro
last_name: Enrico Redondi
- first_name: Antonio
full_name: Capone, Antonio
last_name: Capone
citation:
ama: 'Peuster M, Karl H, Enrico Redondi A, Capone A. Demonstrating on-demand cell
switching with a two-layer mobile network testbed. In: IEEE Conference on Computer
Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA, USA, April
10-14, 2016. ; 2016:1015--1016. doi:10.1109/INFCOMW.2016.7562232'
apa: Peuster, M., Karl, H., Enrico Redondi, A., & Capone, A. (2016). Demonstrating
on-demand cell switching with a two-layer mobile network testbed. In IEEE Conference
on Computer Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA,
USA, April 10-14, 2016 (pp. 1015--1016). San Francisco. https://doi.org/10.1109/INFCOMW.2016.7562232
bibtex: '@inproceedings{Peuster_Karl_Enrico Redondi_Capone_2016, title={Demonstrating
on-demand cell switching with a two-layer mobile network testbed}, DOI={10.1109/INFCOMW.2016.7562232},
booktitle={IEEE Conference on Computer Communications Workshops, INFOCOM Workshops
2016, San Francisco, CA, USA, April 10-14, 2016}, author={Peuster, Manuel and
Karl, Holger and Enrico Redondi, Alessandro and Capone, Antonio}, year={2016},
pages={1015--1016} }'
chicago: Peuster, Manuel, Holger Karl, Alessandro Enrico Redondi, and Antonio Capone.
“Demonstrating On-Demand Cell Switching with a Two-Layer Mobile Network Testbed.”
In IEEE Conference on Computer Communications Workshops, INFOCOM Workshops
2016, San Francisco, CA, USA, April 10-14, 2016, 1015--1016, 2016. https://doi.org/10.1109/INFCOMW.2016.7562232.
ieee: M. Peuster, H. Karl, A. Enrico Redondi, and A. Capone, “Demonstrating on-demand
cell switching with a two-layer mobile network testbed,” in IEEE Conference
on Computer Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA,
USA, April 10-14, 2016, San Francisco, 2016, pp. 1015--1016.
mla: Peuster, Manuel, et al. “Demonstrating On-Demand Cell Switching with a Two-Layer
Mobile Network Testbed.” IEEE Conference on Computer Communications Workshops,
INFOCOM Workshops 2016, San Francisco, CA, USA, April 10-14, 2016, 2016, pp.
1015--1016, doi:10.1109/INFCOMW.2016.7562232.
short: 'M. Peuster, H. Karl, A. Enrico Redondi, A. Capone, in: IEEE Conference on
Computer Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA,
USA, April 10-14, 2016, 2016, pp. 1015--1016.'
conference:
location: San Francisco
name: IEEE Conference on Computer Communications Workshops, INFOCOM
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:34Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/INFCOMW.2016.7562232
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:11:50Z
date_updated: 2018-11-02T14:11:50Z
file_id: '5264'
file_name: 07562232.pdf
file_size: 2080026
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:11:50Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://ieeexplore.ieee.org/document/7562232/
page: 1015--1016
project:
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Conference on Computer Communications Workshops, INFOCOM Workshops
2016, San Francisco, CA, USA, April 10-14, 2016
publication_status: published
status: public
title: Demonstrating on-demand cell switching with a two-layer mobile network testbed
type: conference
user_id: '477'
year: '2016'
...
---
_id: '738'
abstract:
- lang: eng
text: "Virtualized network services consisting of multiple individual network functions
are already today deployed across multiple sites, so called multi-PoP (points
of presence) environments. This allows to improve service performance by optimizing
its placement in the network. But prototyping and testing of these complex distributed
software systems becomes extremely challenging. The reason is that not only the
network service as such has to be tested but also its integration with management
and orchestration systems. Existing solutions, like simulators, basic network
emulators, or local cloud testbeds, do not support all aspects of these tasks.\r\n\r\nTo
this end, we introduce MeDICINE, a novel NFV prototyping platform that is able
to execute production-ready network functions, provided as software containers,
in an emulated multi-PoP environment. These network functions can be controlled
by any third-party management and orchestration system that connects to our platform
through standard interfaces. Based on this, a developer can use our platform to
prototype and test complex network services in a realistic environment running
on his laptop.\r\n"
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Steven
full_name: van Rossem, Steven
last_name: van Rossem
citation:
ama: 'Peuster M, Karl H, van Rossem S. MeDICINE: Rapid Prototyping of Production-Ready
Network Services in Multi-PoP Environments. In: IEEE Conference on Network
Function Virtualization and Software Defined Networks (NFV-SDN). ; 2016. doi:10.1109/NFV-SDN.2016.7919490'
apa: 'Peuster, M., Karl, H., & van Rossem, S. (2016). MeDICINE: Rapid Prototyping
of Production-Ready Network Services in Multi-PoP Environments. In IEEE Conference
on Network Function Virtualization and Software Defined Networks (NFV-SDN).
Palo Alto. https://doi.org/10.1109/NFV-SDN.2016.7919490'
bibtex: '@inproceedings{Peuster_Karl_van Rossem_2016, title={MeDICINE: Rapid Prototyping
of Production-Ready Network Services in Multi-PoP Environments}, DOI={10.1109/NFV-SDN.2016.7919490},
booktitle={IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN)}, author={Peuster, Manuel and Karl, Holger and van Rossem,
Steven}, year={2016} }'
chicago: 'Peuster, Manuel, Holger Karl, and Steven van Rossem. “MeDICINE: Rapid
Prototyping of Production-Ready Network Services in Multi-PoP Environments.” In
IEEE Conference on Network Function Virtualization and Software Defined Networks
(NFV-SDN), 2016. https://doi.org/10.1109/NFV-SDN.2016.7919490.'
ieee: 'M. Peuster, H. Karl, and S. van Rossem, “MeDICINE: Rapid Prototyping of Production-Ready
Network Services in Multi-PoP Environments,” in IEEE Conference on Network
Function Virtualization and Software Defined Networks (NFV-SDN), Palo Alto,
2016.'
mla: 'Peuster, Manuel, et al. “MeDICINE: Rapid Prototyping of Production-Ready Network
Services in Multi-PoP Environments.” IEEE Conference on Network Function Virtualization
and Software Defined Networks (NFV-SDN), 2016, doi:10.1109/NFV-SDN.2016.7919490.'
short: 'M. Peuster, H. Karl, S. van Rossem, in: IEEE Conference on Network Function
Virtualization and Software Defined Networks (NFV-SDN), 2016.'
conference:
location: Palo Alto
name: IEEE Conference on Network Function Virtualization and Software Defined Networks
(NFV-SDN)
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:36Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/NFV-SDN.2016.7919490
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2018-06-25T13:06:47Z
date_updated: 2018-06-25T13:17:34Z
file_id: '3349'
file_name: main_ris.pdf
file_size: 848438
relation: main_file
file_date_updated: 2018-06-25T13:17:34Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/pdf/1606.05995.pdf
oa: '1'
project:
- _id: '25'
call_identifier: 5G PPP Phase 1
grant_number: '671517'
name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
Networks'
- _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)
publication_status: published
status: public
title: 'MeDICINE: Rapid Prototyping of Production-Ready Network Services in Multi-PoP
Environments'
type: conference
urn: '7384'
user_id: '13271'
year: '2016'
...
---
_id: '5418'
author:
- first_name: Christian
full_name: Tölke, Christian
last_name: Tölke
citation:
ama: Tölke C. Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik
-- Anforderungen Und Umsetzung. Universität Paderborn; 2016.
apa: Tölke, C. (2016). Sicherheit von hybriden FPGA-Systemen in der industriellen
Automatisierungstechnik -- Anforderungen und Umsetzung. Universität Paderborn.
bibtex: '@book{Tölke_2016, title={Sicherheit von hybriden FPGA-Systemen in der industriellen
Automatisierungstechnik -- Anforderungen und Umsetzung}, publisher={Universität
Paderborn}, author={Tölke, Christian}, year={2016} }'
chicago: Tölke, Christian. Sicherheit von Hybriden FPGA-Systemen in Der Industriellen
Automatisierungstechnik -- Anforderungen Und Umsetzung. Universität Paderborn,
2016.
ieee: C. Tölke, Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik
-- Anforderungen und Umsetzung. Universität Paderborn, 2016.
mla: Tölke, Christian. Sicherheit von Hybriden FPGA-Systemen in Der Industriellen
Automatisierungstechnik -- Anforderungen Und Umsetzung. Universität Paderborn,
2016.
short: C. Tölke, Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik
-- Anforderungen Und Umsetzung, Universität Paderborn, 2016.
date_created: 2018-11-07T16:10:00Z
date_updated: 2022-01-06T07:01:52Z
department:
- _id: '27'
- _id: '518'
language:
- iso: eng
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: Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik
-- Anforderungen und Umsetzung
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '5420'
author:
- first_name: Gunnar
full_name: Wüllrich, Gunnar
last_name: Wüllrich
citation:
ama: Wüllrich G. Dynamic OpenCL Task Scheduling for Energy and Performance in
a Heterogeneous Environment. Universität Paderborn; 2016.
apa: Wüllrich, G. (2016). Dynamic OpenCL Task Scheduling for Energy and Performance
in a Heterogeneous Environment. Universität Paderborn.
bibtex: '@book{Wüllrich_2016, title={Dynamic OpenCL Task Scheduling for Energy and
Performance in a Heterogeneous Environment}, publisher={Universität Paderborn},
author={Wüllrich, Gunnar}, year={2016} }'
chicago: Wüllrich, Gunnar. Dynamic OpenCL Task Scheduling for Energy and Performance
in a Heterogeneous Environment. Universität Paderborn, 2016.
ieee: G. Wüllrich, Dynamic OpenCL Task Scheduling for Energy and Performance
in a Heterogeneous Environment. Universität Paderborn, 2016.
mla: Wüllrich, Gunnar. Dynamic OpenCL Task Scheduling for Energy and Performance
in a Heterogeneous Environment. Universität Paderborn, 2016.
short: G. Wüllrich, Dynamic OpenCL Task Scheduling for Energy and Performance in
a Heterogeneous Environment, Universität Paderborn, 2016.
date_created: 2018-11-07T16:15:51Z
date_updated: 2022-01-06T07:01:53Z
department:
- _id: '27'
- _id: '518'
language:
- iso: eng
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: Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous
Environment
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '166'
abstract:
- lang: eng
text: Network function virtualization and software-defined networking allow services
consisting of virtual network functions to be designed and implemented with great
flexibility by facilitating automatic deployments, migrations, and reconfigurations
for services and their components. For extended flexibility, we go beyond seeing
services as a fixed chain of functions. We present a YANG model for describing
the service structure in deployment requests in a flexible way that enables changing
the order of functions in case the order of traversing them does not affect the
functionality of the service. Upon receiving such requests, the network orchestration
system can choose the optimal composition of service components that gives the
best results for placement of services in the network. This introduces new complexities
to the placement problem by greatly increasing the number of possible ways a service
can be composed. In this paper, we describe a heuristic solution that selects
a Pareto set of the possible compositions of a service as well as possible combinations
of different services, with respect to different resource requirements of the
services. Our evaluations show that the selected combinations consist of representative
samples of possible structures and requirements and therefore, can result in optimal
or close-to-optimal placement results.
author:
- 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: 'Dräxler S, Karl H. Placement of Services with Flexible Structures Specified
by a YANG Data Model. In: Proceedings of the 2nd International IEEE Conference
on Network Softwarization (NetSoft). ; 2016:184--192. doi:10.1109/NETSOFT.2016.7502412'
apa: Dräxler, S., & Karl, H. (2016). Placement of Services with Flexible Structures
Specified by a YANG Data Model. In Proceedings of the 2nd International IEEE
Conference on Network Softwarization (NetSoft) (pp. 184--192). https://doi.org/10.1109/NETSOFT.2016.7502412
bibtex: '@inproceedings{Dräxler_Karl_2016, title={Placement of Services with Flexible
Structures Specified by a YANG Data Model}, DOI={10.1109/NETSOFT.2016.7502412},
booktitle={Proceedings of the 2nd International IEEE Conference on Network Softwarization
(NetSoft)}, author={Dräxler, Sevil and Karl, Holger}, year={2016}, pages={184--192}
}'
chicago: Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures
Specified by a YANG Data Model.” In Proceedings of the 2nd International IEEE
Conference on Network Softwarization (NetSoft), 184--192, 2016. https://doi.org/10.1109/NETSOFT.2016.7502412.
ieee: S. Dräxler and H. Karl, “Placement of Services with Flexible Structures Specified
by a YANG Data Model,” in Proceedings of the 2nd International IEEE Conference
on Network Softwarization (NetSoft), 2016, pp. 184--192.
mla: Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures
Specified by a YANG Data Model.” Proceedings of the 2nd International IEEE
Conference on Network Softwarization (NetSoft), 2016, pp. 184--192, doi:10.1109/NETSOFT.2016.7502412.
short: 'S. Dräxler, H. Karl, in: Proceedings of the 2nd International IEEE Conference
on Network Softwarization (NetSoft), 2016, pp. 184--192.'
date_created: 2017-10-17T12:41:24Z
date_updated: 2022-01-06T06:52:53Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/NETSOFT.2016.7502412
file:
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2018-06-25T07:53:54Z
date_updated: 2018-06-25T07:53:54Z
file_id: '3322'
file_name: RIS.pdf
file_size: 1471937
relation: main_file
file_date_updated: 2018-06-25T07:53:54Z
has_accepted_license: '1'
main_file_link:
- url: http://ieeexplore.ieee.org/search/searchresult.jsp?newsearch=true&queryText=10.1109%2FNETSOFT.2016.7502412
oa: '1'
page: 184--192
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
- _id: '25'
call_identifier: 5G PPP Phase 1
grant_number: '671517'
name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
Networks'
publication: Proceedings of the 2nd International IEEE Conference on Network Softwarization
(NetSoft)
status: public
title: Placement of Services with Flexible Structures Specified by a YANG Data Model
type: conference
urn: '1665'
user_id: '31764'
year: '2016'
...
---
_id: '167'
author:
- first_name: Peter
full_name: Günther, Peter
last_name: Günther
citation:
ama: Günther P. Physical Attacks on Pairing-Based Cryptography. Universität
Paderborn; 2016.
apa: Günther, P. (2016). Physical attacks on pairing-based cryptography.
Universität Paderborn.
bibtex: '@book{Günther_2016, title={Physical attacks on pairing-based cryptography},
publisher={Universität Paderborn}, author={Günther, Peter}, year={2016} }'
chicago: Günther, Peter. Physical Attacks on Pairing-Based Cryptography.
Universität Paderborn, 2016.
ieee: P. Günther, Physical attacks on pairing-based cryptography. Universität
Paderborn, 2016.
mla: Günther, Peter. Physical Attacks on Pairing-Based Cryptography. Universität
Paderborn, 2016.
short: P. Günther, Physical Attacks on Pairing-Based Cryptography, Universität Paderborn,
2016.
date_created: 2017-10-17T12:41:24Z
date_updated: 2022-01-06T06:52:54Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:43:21Z
date_updated: 2018-03-21T12:43:21Z
file_id: '1542'
file_name: 167-thesis_peter_guenther.pdf
file_size: 9456552
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:43:21Z
has_accepted_license: '1'
main_file_link:
- url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24853
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: Physical attacks on pairing-based cryptography
type: dissertation
user_id: '25078'
year: '2016'
...
---
_id: '172'
author:
- first_name: Florian
full_name: Stapel, Florian
last_name: Stapel
citation:
ama: Stapel F. Ontology-Based Representation of Abstract Optimization Models
for Model Formulation and System Generation. Universität Paderborn; 2016.
apa: Stapel, F. (2016). Ontology-based representation of abstract optimization
models for model formulation and system generation. Universität Paderborn.
bibtex: '@book{Stapel_2016, title={Ontology-based representation of abstract optimization
models for model formulation and system generation}, publisher={Universität Paderborn},
author={Stapel, Florian}, year={2016} }'
chicago: Stapel, Florian. Ontology-Based Representation of Abstract Optimization
Models for Model Formulation and System Generation. Universität Paderborn,
2016.
ieee: F. Stapel, Ontology-based representation of abstract optimization models
for model formulation and system generation. Universität Paderborn, 2016.
mla: Stapel, Florian. Ontology-Based Representation of Abstract Optimization
Models for Model Formulation and System Generation. Universität Paderborn,
2016.
short: F. Stapel, Ontology-Based Representation of Abstract Optimization Models
for Model Formulation and System Generation, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:25Z
date_updated: 2022-01-06T06:53:06Z
ddc:
- '040'
department:
- _id: '19'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:39:19Z
date_updated: 2018-03-21T12:39:19Z
file_id: '1537'
file_name: 172-FStapelDissertation.pdf
file_size: 9301431
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:39:19Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '15'
name: SFB 901 - Subprojekt C3
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Lena
full_name: Suhl, Lena
last_name: Suhl
title: Ontology-based representation of abstract optimization models for model formulation
and system generation
type: dissertation
user_id: '477'
year: '2016'
...