---
_id: '3347'
abstract:
- lang: eng
text: "Management and orchestration~(MANO) systems are the key components of future
large-scale NFV environments. They will manage resources of hundreds or even thousands
of NFV infrastructure installations, so called points of presence~(PoP). Such
scenarios need to be automatically tested during the development phase of a MANO
system. This task becomes very challenging because large-scale NFV testbeds are
hard to maintain, too expensive, or simply not available.\r\n\r\nIn this paper,
we present a multi-PoP NFV infrastructure emulation platform that enables automated,
large-scale testing of MANO stacks. We show that our platform can easily emulate
hundreds of PoPs on a single physical machine and reduces the setup time of a
test PoP by a factor of 232x compared to a DevStack-based test PoP installation.
Further, we present a case study in which we test ETSI's Open Source MANO~(OSM)
against our proposed system to gain insights about OSM's behaviour in large-scale
NFV deployments."
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Michael
full_name: Marchetti, Michael
last_name: Marchetti
- first_name: Gerado
full_name: Garcia de Blas, Gerado
last_name: Garcia de Blas
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Marchetti M, Garcia de Blas G, Karl H. Emulation-based Smoke Testing
of NFV Orchestrators in Large Multi-PoP Environments. In: European Conference
on Networks and Communications (EuCNC). Ljubljana. doi:10.1109/EuCNC.2018.8442701'
apa: Peuster, M., Marchetti, M., Garcia de Blas, G., & Karl, H. (n.d.). Emulation-based
Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments. In European
Conference on Networks and Communications (EuCNC). Ljubljana. https://doi.org/10.1109/EuCNC.2018.8442701
bibtex: '@inproceedings{Peuster_Marchetti_Garcia de Blas_Karl, place={Ljubljana},
title={Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments},
DOI={10.1109/EuCNC.2018.8442701},
booktitle={European Conference on Networks and Communications (EuCNC)}, author={Peuster,
Manuel and Marchetti, Michael and Garcia de Blas, Gerado and Karl, Holger} }'
chicago: Peuster, Manuel, Michael Marchetti, Gerado Garcia de Blas, and Holger Karl.
“Emulation-Based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments.”
In European Conference on Networks and Communications (EuCNC). Ljubljana,
n.d. https://doi.org/10.1109/EuCNC.2018.8442701.
ieee: M. Peuster, M. Marchetti, G. Garcia de Blas, and H. Karl, “Emulation-based
Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments,” in European
Conference on Networks and Communications (EuCNC), Ljubljana.
mla: Peuster, Manuel, et al. “Emulation-Based Smoke Testing of NFV Orchestrators
in Large Multi-PoP Environments.” European Conference on Networks and Communications
(EuCNC), doi:10.1109/EuCNC.2018.8442701.
short: 'M. Peuster, M. Marchetti, G. Garcia de Blas, H. Karl, in: European Conference
on Networks and Communications (EuCNC), Ljubljana, n.d.'
conference:
location: Ljubljana
name: European Conference on Networks and Communications (EuCNC)
date_created: 2018-06-25T12:27:59Z
date_updated: 2022-01-06T06:59:12Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/EuCNC.2018.8442701
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2018-07-05T11:13:29Z
date_updated: 2018-07-05T11:13:29Z
file_id: '3430'
file_name: main_ris.pdf
file_size: 713495
relation: main_file
file_date_updated: 2018-07-05T11:13:29Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/8442701/
oa: '1'
place: Ljubljana
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: European Conference on Networks and Communications (EuCNC)
publication_status: accepted
status: public
title: Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments
type: conference
urn: '33477'
user_id: '13271'
year: '2018'
...
---
_id: '3551'
author:
- first_name: Jürgen
full_name: König, Jürgen
id: '22358'
last_name: König
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- 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: König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with interjob
communication on parallel processors. Journal of Combinatorial Optimization.
2018;36(4):1356-1379. doi:10.1007/s10878-018-0325-3
apa: König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2018).
Scheduling with interjob communication on parallel processors. Journal of Combinatorial
Optimization, 36(4), 1356–1379. https://doi.org/10.1007/s10878-018-0325-3
bibtex: '@article{König_Mäcker_Meyer auf der Heide_Riechers_2018, title={Scheduling
with interjob communication on parallel processors}, volume={36}, DOI={10.1007/s10878-018-0325-3},
number={4}, journal={Journal of Combinatorial Optimization}, author={König, Jürgen
and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören},
year={2018}, pages={1356–1379} }'
chicago: 'König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören
Riechers. “Scheduling with Interjob Communication on Parallel Processors.” Journal
of Combinatorial Optimization 36, no. 4 (2018): 1356–79. https://doi.org/10.1007/s10878-018-0325-3.'
ieee: J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling
with interjob communication on parallel processors,” Journal of Combinatorial
Optimization, vol. 36, no. 4, pp. 1356–1379, 2018.
mla: König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.”
Journal of Combinatorial Optimization, vol. 36, no. 4, 2018, pp. 1356–79,
doi:10.1007/s10878-018-0325-3.
short: J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial
Optimization 36 (2018) 1356–1379.
date_created: 2018-07-13T09:57:48Z
date_updated: 2022-01-06T06:59:24Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s10878-018-0325-3
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:20:24Z
date_updated: 2018-11-02T15:20:24Z
file_id: '5299'
file_name: SchedulingWithInterjobCommunic.pdf
file_size: 745708
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:20:24Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '4'
language:
- iso: eng
page: 1356-1379
project:
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
status: public
title: Scheduling with interjob communication on parallel processors
type: journal_article
user_id: '477'
volume: 36
year: '2018'
...
---
_id: '3152'
abstract:
- lang: eng
text: To adapt to continuously changing workloads in networks, components of the
running network services may need to be replicated (scaling the network service)
and allocated to physical resources (placement) dynamically, also necessitating
dynamic re-routing of flows between service components. In this paper, we propose
JASPER, a fully automated approach to jointly optimizing scaling, placement, and
routing for complex network services, consisting of multiple (virtualized) components.
JASPER handles multiple network services that share the same substrate network;
services can be dynamically added or removed and dynamic workload changes are
handled. Our approach lets service designers specify their services on a high
level of abstraction using service templates. JASPER automatically makes scaling,
placement and routing decisions, enabling quick reaction to changes. We formalize
the problem, analyze its complexity, and develop two algorithms to solve it. Extensive
empirical results show the applicability and effectiveness of the proposed approach.
article_type: original
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
- first_name: Zoltan Adam
full_name: Mann, Zoltan Adam
last_name: Mann
citation:
ama: 'Dräxler S, Karl H, Mann ZA. JASPER: Joint Optimization of Scaling, Placement,
and Routing of Virtual Network Services. IEEE Transactions on Network and Service
Management. 2018. doi:10.1109/TNSM.2018.2846572'
apa: 'Dräxler, S., Karl, H., & Mann, Z. A. (2018). JASPER: Joint Optimization
of Scaling, Placement, and Routing of Virtual Network Services. IEEE Transactions
on Network and Service Management. https://doi.org/10.1109/TNSM.2018.2846572'
bibtex: '@article{Dräxler_Karl_Mann_2018, title={JASPER: Joint Optimization of Scaling,
Placement, and Routing of Virtual Network Services}, DOI={10.1109/TNSM.2018.2846572},
journal={IEEE Transactions on Network and Service Management}, publisher={IEEE},
author={Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}, year={2018} }'
chicago: 'Dräxler, Sevil, Holger Karl, and Zoltan Adam Mann. “JASPER: Joint Optimization
of Scaling, Placement, and Routing of Virtual Network Services.” IEEE Transactions
on Network and Service Management, 2018. https://doi.org/10.1109/TNSM.2018.2846572.'
ieee: 'S. Dräxler, H. Karl, and Z. A. Mann, “JASPER: Joint Optimization of Scaling,
Placement, and Routing of Virtual Network Services,” IEEE Transactions on Network
and Service Management, 2018.'
mla: 'Dräxler, Sevil, et al. “JASPER: Joint Optimization of Scaling, Placement,
and Routing of Virtual Network Services.” IEEE Transactions on Network and
Service Management, IEEE, 2018, doi:10.1109/TNSM.2018.2846572.'
short: S. Dräxler, H. Karl, Z.A. Mann, IEEE Transactions on Network and Service
Management (2018).
date_created: 2018-06-11T06:55:05Z
date_updated: 2022-01-06T06:59:00Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/TNSM.2018.2846572
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:25:49Z
date_updated: 2018-11-02T15:25:49Z
file_id: '5302'
file_name: 08382313.pdf
file_size: 1767054
relation: main_file
success: 1
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2019-01-21T16:12:36Z
date_updated: 2019-01-21T16:12:36Z
file_id: '6950'
file_name: TNSM2846572_RIS.pdf
file_size: 2878350
relation: main_file
file_date_updated: 2019-01-21T16:12:36Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.10839
oa: '1'
project:
- _id: '23'
grant_number: '762057'
name: 5G Programmable Infrastructure Converging disaggregated neTwork and compUte
Resources
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Transactions on Network and Service Management
publisher: IEEE
status: public
title: 'JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network
Services'
type: journal_article
urn: '31522'
user_id: '31764'
year: '2018'
...
---
_id: '63'
author:
- first_name: Ernst
full_name: Althaus, Ernst
last_name: Althaus
- first_name: Andre
full_name: Brinkmann, Andre
last_name: Brinkmann
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Lars
full_name: Nagel, Lars
last_name: Nagel
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Jiri
full_name: Sgall, Jiri
last_name: Sgall
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
citation:
ama: Althaus E, Brinkmann A, Kling P, et al. Scheduling Shared Continuous Resources
on Many-Cores. Journal of Scheduling. 2018;21(1):77-92. doi:10.1007/s10951-017-0518-0
apa: Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L.,
Riechers, S., Sgall, J., & Suess, T. (2018). Scheduling Shared Continuous
Resources on Many-Cores. Journal of Scheduling, 21(1), 77–92. https://doi.org/10.1007/s10951-017-0518-0
bibtex: '@article{Althaus_Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Sgall_Suess_2018,
title={Scheduling Shared Continuous Resources on Many-Cores}, volume={21}, DOI={10.1007/s10951-017-0518-0},
number={1}, journal={Journal of Scheduling}, publisher={Springer}, author={Althaus,
Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm
and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Suess, Tim}, year={2018},
pages={77–92} }'
chicago: 'Althaus, Ernst, Andre Brinkmann, Peter Kling, Friedhelm Meyer auf der
Heide, Lars Nagel, Sören Riechers, Jiri Sgall, and Tim Suess. “Scheduling Shared
Continuous Resources on Many-Cores.” Journal of Scheduling 21, no. 1 (2018):
77–92. https://doi.org/10.1007/s10951-017-0518-0.'
ieee: 'E. Althaus et al., “Scheduling Shared Continuous Resources on Many-Cores,”
Journal of Scheduling, vol. 21, no. 1, pp. 77–92, 2018, doi: 10.1007/s10951-017-0518-0.'
mla: Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.”
Journal of Scheduling, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:10.1007/s10951-017-0518-0.
short: E. Althaus, A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S.
Riechers, J. Sgall, T. Suess, Journal of Scheduling 21 (2018) 77–92.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:03:00Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/s10951-017-0518-0
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:16:59Z
date_updated: 2018-03-21T13:16:59Z
file_id: '1577'
file_name: 63-main_05.pdf
file_size: 466808
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:16:59Z
has_accepted_license: '1'
intvolume: ' 21'
issue: '1'
language:
- iso: eng
page: 77-92
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Scheduling
publisher: Springer
status: public
title: Scheduling Shared Continuous Resources on Many-Cores
type: journal_article
user_id: '15415'
volume: 21
year: '2018'
...
---
_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: '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: '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: '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: '79'
abstract:
- lang: eng
text: Consider a problem in which $n$ jobs that are classified into $k$ types arrive
over time at their release times and are to be scheduled on a single machine so
as to minimize the maximum flow time.The machine requires a setup taking $s$ time
units whenever it switches from processing jobs of one type to jobs of a different
type.We consider the problem as an online problem where each job is only known
to the scheduler as soon as it arrives and where the processing time of a job
only becomes known upon its completion (non-clairvoyance).We are interested in
the potential of simple ``greedy-like'' algorithms.We analyze a modification of
the FIFO strategy and show its competitiveness to be $\Theta(\sqrt{n})$, which
is optimal for the considered class of algorithms.For $k=2$ types it achieves
a constant competitiveness.Our main insight is obtained by an analysis of the
smoothed competitiveness.If processing times $p_j$ are independently perturbed
to $\hat p_j = (1+X_j)p_j$, we obtain a competitiveness of $O(\sigma^{-2} \log^2
n)$ when $X_j$ is drawn from a uniform or a (truncated) normal distribution with
standard deviation $\sigma$.The result proves that bad instances are fragile and
``practically'' one might expect a much better performance than given by the $\Omega(\sqrt{n})$-bound.
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. Non-Clairvoyant
Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In: Proceedings
of the 15th Workshop on Approximation and Online Algorithms (WAOA). Vol 10787.
Lecture Notes in Computer Science. Springer; 2017:207-222. doi:10.1007/978-3-319-89441-6'
apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017).
Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.
In Proceedings of the 15th Workshop on Approximation and Online Algorithms
(WAOA) (Vol. 10787, pp. 207–222). Springer. https://doi.org/10.1007/978-3-319-89441-6
bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, series={Lecture
Notes in Computer Science}, title={Non-Clairvoyant Scheduling to Minimize Max
Flow Time on a Machine with Setup Times}, volume={10787}, DOI={10.1007/978-3-319-89441-6},
booktitle={Proceedings of the 15th Workshop on Approximation and Online Algorithms
(WAOA)}, publisher={Springer}, author={Mäcker, Alexander and Malatyali, Manuel
and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2017}, pages={207–222},
collection={Lecture Notes in Computer Science} }'
chicago: Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine
with Setup Times.” In Proceedings of the 15th Workshop on Approximation and
Online Algorithms (WAOA), 10787:207–22. Lecture Notes in Computer Science.
Springer, 2017. https://doi.org/10.1007/978-3-319-89441-6.
ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-Clairvoyant
Scheduling to Minimize Max Flow Time on a Machine with Setup Times,” in Proceedings
of the 15th Workshop on Approximation and Online Algorithms (WAOA), 2017,
vol. 10787, pp. 207–222.
mla: Mäcker, Alexander, et al. “Non-Clairvoyant Scheduling to Minimize Max Flow
Time on a Machine with Setup Times.” Proceedings of the 15th Workshop on Approximation
and Online Algorithms (WAOA), vol. 10787, Springer, 2017, pp. 207–22, doi:10.1007/978-3-319-89441-6.
short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings
of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer,
2017, pp. 207–222.'
date_created: 2017-10-17T12:41:06Z
date_updated: 2022-01-06T07:03:47Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-89441-6
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:59:22Z
date_updated: 2018-11-02T14:59:22Z
file_id: '5289'
file_name: Non-clairvoyantSchedulingToMin.pdf
file_size: 380629
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:59:22Z
has_accepted_license: '1'
intvolume: ' 10787'
language:
- iso: eng
page: 207-222
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 15th Workshop on Approximation and Online Algorithms
(WAOA)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup
Times
type: conference
user_id: '477'
volume: 10787
year: '2017'
...
---
_id: '58'
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 define the service structure in a flexible
way that enables changing the order of functions in case the functionality of
the service is not influenced by this, and propose a YANG data model for expressing
this flexibility. Flexible structures allow the network orchestration system to
choose the optimal composition of service components that for example gives the
best results for placement of services in the network. When number of flexible
services and number of components in each service increase, combinatorial explosion
limits the practical use of this flexibility. In this paper, we describe a selection
heuristic that gives a Pareto set of the possible compositions of a service as
well as possible combinations of different services, with respect to different
optimization objectives. Moreover, we present a heuristic algorithm for placement
of a combination of services, which aims at placing service components along shortest
paths that have enough capacity for accommodating the services. By applying these
solutions, we show that allowing flexibility in the service structure is feasible.
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. Specification, Composition, and Placement of Network Services
with Flexible Structures. International Journal of Network Management.
2017;(2):1--16. doi:10.1002/nem.1963
apa: Dräxler, S., & Karl, H. (2017). Specification, Composition, and Placement
of Network Services with Flexible Structures. International Journal of Network
Management, (2), 1--16. https://doi.org/10.1002/nem.1963
bibtex: '@article{Dräxler_Karl_2017, title={Specification, Composition, and Placement
of Network Services with Flexible Structures}, DOI={10.1002/nem.1963},
number={2}, journal={International Journal of Network Management}, publisher={Wiley
Online Library}, author={Dräxler, Sevil and Karl, Holger}, year={2017}, pages={1--16}
}'
chicago: 'Dräxler, Sevil, and Holger Karl. “Specification, Composition, and Placement
of Network Services with Flexible Structures.” International Journal of Network
Management, no. 2 (2017): 1--16. https://doi.org/10.1002/nem.1963.'
ieee: S. Dräxler and H. Karl, “Specification, Composition, and Placement of Network
Services with Flexible Structures,” International Journal of Network Management,
no. 2, pp. 1--16, 2017.
mla: Dräxler, Sevil, and Holger Karl. “Specification, Composition, and Placement
of Network Services with Flexible Structures.” International Journal of Network
Management, no. 2, Wiley Online Library, 2017, pp. 1--16, doi:10.1002/nem.1963.
short: S. Dräxler, H. Karl, International Journal of Network Management (2017) 1--16.
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:02:42Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1002/nem.1963
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:18:13Z
date_updated: 2018-06-13T09:15:42Z
file_id: '1579'
file_name: 58-preprint-ijnm.pdf
file_size: 2765738
relation: hidden
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2018-06-13T09:22:37Z
date_updated: 2018-06-13T09:22:37Z
file_id: '3197'
file_name: 58-accepted-ijnm.pdf
file_size: 2766920
relation: main_file
file_date_updated: 2018-06-13T09:22:37Z
has_accepted_license: '1'
issue: '2'
oa: '1'
page: 1--16
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: International Journal of Network Management
publisher: Wiley Online Library
status: public
title: Specification, Composition, and Placement of Network Services with Flexible
Structures
type: journal_article
urn: '582'
user_id: '477'
year: '2017'
...
---
_id: '59'
abstract:
- lang: eng
text: We consider a scheduling problem on $m$ identical processors sharing an arbitrarily
divisible resource. In addition to assigning jobs to processors, the scheduler
must distribute the resource among the processors (e.g., for three processors
in shares of 20\%, 15\%, and 65\%) and adjust this distribution over time. Each
job $j$ comes with a size $p_j \in \mathbb{R}$ and a resource requirement $r_j
> 0$. Jobs do not benefit when receiving a share larger than $r_j$ of the resource.
But providing them with a fraction of the resource requirement causes a linear
decrease in the processing efficiency. We seek a (non-preemptive) job and resource
assignment minimizing the makespan.Our main result is an efficient approximation
algorithm which achieves an approximation ratio of $2 + 1/(m-2)$. It can be improved
to an (asymptotic) ratio of $1 + 1/(m-1)$ if all jobs have unit size. Our algorithms
also imply new results for a well-known bin packing problem with splittable items
and a restricted number of allowed item parts per bin.Based upon the above solution,
we also derive an approximation algorithm with similar guarantees for a setting
in which we introduce so-called tasks each containing several jobs and where we
are interested in the average completion time of tasks (a task is completed when
all its jobs are completed).
author:
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- 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: 'Kling P, Mäcker A, Riechers S, Skopalik A. Sharing is Caring: Multiprocessor
Scheduling with a Sharable Resource. In: Proceedings of the 29th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA). ; 2017:123--132. doi:10.1145/3087556.3087578'
apa: 'Kling, P., Mäcker, A., Riechers, S., & Skopalik, A. (2017). Sharing is
Caring: Multiprocessor Scheduling with a Sharable Resource. In Proceedings
of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
(pp. 123--132). https://doi.org/10.1145/3087556.3087578'
bibtex: '@inproceedings{Kling_Mäcker_Riechers_Skopalik_2017, title={Sharing is Caring:
Multiprocessor Scheduling with a Sharable Resource}, DOI={10.1145/3087556.3087578},
booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Kling, Peter and Mäcker, Alexander and Riechers,
Sören and Skopalik, Alexander}, year={2017}, pages={123--132} }'
chicago: 'Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik.
“Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In Proceedings
of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
123--132, 2017. https://doi.org/10.1145/3087556.3087578.'
ieee: 'P. Kling, A. Mäcker, S. Riechers, and A. Skopalik, “Sharing is Caring: Multiprocessor
Scheduling with a Sharable Resource,” in Proceedings of the 29th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.'
mla: 'Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a
Sharable Resource.” Proceedings of the 29th ACM Symposium on Parallelism in
Algorithms and Architectures (SPAA), 2017, pp. 123--132, doi:10.1145/3087556.3087578.'
short: 'P. Kling, A. Mäcker, S. Riechers, A. Skopalik, in: Proceedings of the 29th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp.
123--132.'
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:02:46Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1145/3087556.3087578
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:17:33Z
date_updated: 2018-03-21T13:17:33Z
file_id: '1578'
file_name: 59-progress.pdf
file_size: 784867
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:17:33Z
has_accepted_license: '1'
language:
- iso: eng
page: 123--132
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: 'Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource'
type: conference
user_id: '477'
year: '2017'
...
---
_id: '64'
abstract:
- lang: eng
text: 'A current trend in networking and cloud computing is to provide compute resources
at widely distributed sites; this is exemplified by developments such as Network
Function Virtualisation. This paves the way for wide-area service deployments
with improved service quality: e.g. user-perceived response times can be reduced
by offering services at nearby sites. But always assigning users to the nearest
site can be a bad decision if this site is already highly utilised. This paper
formalises two related decisions of allocating compute resources at different
sites and assigning users to them with the goal of minimising the response times
while the total number of resources to be allocated is limited – a non-linear
capacitated Facility Location Problem with integrated queuing systems. To efficiently
handle its non-linearity, we introduce five linear problem linearisations and
adapt the currently best heuristic for a similar scenario to our scenario. All
six approaches are compared in experiments for solution quality and solving time.
Surprisingly, our best optimisation formulation outperforms the heuristic in both
time and quality. Additionally, we evaluate the influence of distributions of
available compute resources in the network on the response time: The time was
halved for some configurations. The presented formulation techniques for our problem
linearisations are applicable to a broader optimisation domain.'
author:
- first_name: Matthias
full_name: Keller, Matthias
last_name: Keller
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Keller M, Karl H. Response-Time-Optimised Service Deployment: MILP Formulations
of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer
Functions. IEEE Transactions on Network and Service Management. 2017;(1):121--135.
doi:10.1109/TNSM.2016.2611590'
apa: 'Keller, M., & Karl, H. (2017). Response-Time-Optimised Service Deployment:
MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate
Mixed-integer Functions. IEEE Transactions on Network and Service Management,
(1), 121--135. https://doi.org/10.1109/TNSM.2016.2611590'
bibtex: '@article{Keller_Karl_2017, title={Response-Time-Optimised Service Deployment:
MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate
Mixed-integer Functions}, DOI={10.1109/TNSM.2016.2611590},
number={1}, journal={IEEE Transactions on Network and Service Management}, publisher={IEEE},
author={Keller, Matthias and Karl, Holger}, year={2017}, pages={121--135} }'
chicago: 'Keller, Matthias, and Holger Karl. “Response-Time-Optimised Service Deployment:
MILP Formulations of Piece-Wise Linear Functions Approximating Non-Linear Bivariate
Mixed-Integer Functions.” IEEE Transactions on Network and Service Management,
no. 1 (2017): 121--135. https://doi.org/10.1109/TNSM.2016.2611590.'
ieee: 'M. Keller and H. Karl, “Response-Time-Optimised Service Deployment: MILP
Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate
Mixed-integer Functions,” IEEE Transactions on Network and Service Management,
no. 1, pp. 121--135, 2017.'
mla: 'Keller, Matthias, and Holger Karl. “Response-Time-Optimised Service Deployment:
MILP Formulations of Piece-Wise Linear Functions Approximating Non-Linear Bivariate
Mixed-Integer Functions.” IEEE Transactions on Network and Service Management,
no. 1, IEEE, 2017, pp. 121--135, doi:10.1109/TNSM.2016.2611590.'
short: M. Keller, H. Karl, IEEE Transactions on Network and Service Management (2017)
121--135.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:03:03Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/TNSM.2016.2611590
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:15:53Z
date_updated: 2018-03-21T13:15:53Z
file_id: '1576'
file_name: 64-07572217.pdf
file_size: 1505773
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:15:53Z
has_accepted_license: '1'
issue: '1'
page: 121--135
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: IEEE Transactions on Network and Service Management
publisher: IEEE
status: public
title: 'Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise
Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions'
type: journal_article
user_id: '477'
year: '2017'
...
---
_id: '704'
author:
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: Riechers S. Scheduling with Scarce Resources. Universität Paderborn;
2017. doi:10.17619/UNIPB/1-231
apa: Riechers, S. (2017). Scheduling with Scarce Resources. Universität Paderborn.
https://doi.org/10.17619/UNIPB/1-231
bibtex: '@book{Riechers_2017, title={Scheduling with Scarce Resources}, DOI={10.17619/UNIPB/1-231}, publisher={Universität
Paderborn}, author={Riechers, Sören}, year={2017} }'
chicago: Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn,
2017. https://doi.org/10.17619/UNIPB/1-231.
ieee: S. Riechers, Scheduling with Scarce Resources. Universität Paderborn,
2017.
mla: Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn,
2017, doi:10.17619/UNIPB/1-231.
short: S. Riechers, Scheduling with Scarce Resources, Universität Paderborn, 2017.
date_created: 2017-11-15T07:51:07Z
date_updated: 2022-01-06T07:03:27Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.17619/UNIPB/1-231
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-11-14T15:18:37Z
date_updated: 2018-11-14T15:18:37Z
file_id: '5673'
file_name: thesisStable.pdf
file_size: 1491627
relation: main_file
success: 1
file_date_updated: 2018-11-14T15:18:37Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Scheduling with Scarce Resources
type: dissertation
user_id: '14052'
year: '2017'
...
---
_id: '706'
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. Journal of Combinatorial Optimization. 2017;36(4):1168-1194.
doi:10.1007/s10878-017-0198-x
apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017).
Cost-efficient Scheduling on Machines from the Cloud. Journal of Combinatorial
Optimization, 36(4), 1168–1194. https://doi.org/10.1007/s10878-017-0198-x
bibtex: '@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, title={Cost-efficient
Scheduling on Machines from the Cloud}, volume={36}, DOI={10.1007/s10878-017-0198-x},
number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer},
author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm
and Riechers, Sören}, year={2017}, pages={1168–1194} }'
chicago: 'Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” Journal
of Combinatorial Optimization 36, no. 4 (2017): 1168–94. https://doi.org/10.1007/s10878-017-0198-x.'
ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient
Scheduling on Machines from the Cloud,” Journal of Combinatorial Optimization,
vol. 36, no. 4, pp. 1168–1194, 2017.
mla: Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”
Journal of Combinatorial Optimization, vol. 36, no. 4, Springer, 2017,
pp. 1168–94, doi:10.1007/s10878-017-0198-x.
short: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, Journal of
Combinatorial Optimization 36 (2017) 1168–1194.
date_created: 2017-11-15T10:21:34Z
date_updated: 2022-01-06T07:03:27Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/s10878-017-0198-x
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T12:21:34Z
date_updated: 2018-03-14T12:21:34Z
file_id: '1210'
file_name: 706-chp_3A10.1007_2F978-3-319-48749-6_42.pdf
file_size: 608614
relation: main_file
success: 1
file_date_updated: 2018-03-14T12:21:34Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '4'
language:
- iso: eng
page: 1168-1194
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
publisher: Springer
status: public
title: Cost-efficient Scheduling on Machines from the Cloud
type: journal_article
user_id: '15415'
volume: 36
year: '2017'
...
---
_id: '717'
abstract:
- lang: eng
text: In conventional large-scale networks, creation and management of network services
are costly and complex tasks that often consume a lot of resources, including
time and manpower. Network softwarization and network function virtualization
have been introduced to tackle these problems, aiming at decreasing costs and
complexity of implementing new services, maintaining the implemented services,
and managing available resources in service provisioning platforms and underlying
infrastructures. To experience the full potential of these approaches, innovative
development support tools and service provisioning environments are needed. To
answer these needs, we introduce the architecture of the open-source SONATA system,
a service programming, orchestration, and management framework. We present a development
toolchain for virtualized network services, fully integrated with a service platform
and orchestration system. We introduce the modular and flexible architecture of
our system and discuss its main components and features, such as function- and
service-specific managers that allow fine-grained service management, slicing
support to facilitate multi-tenancy, recursiveness for improved scalability, and
full-featured DevOps support.
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
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Hadi
full_name: Razzaghi Kouchaksaraei, Hadi
id: '60845'
last_name: Razzaghi Kouchaksaraei
- first_name: Michael
full_name: Bredel, Michael
last_name: Bredel
- first_name: Johannes
full_name: Lessmann, Johannes
last_name: Lessmann
- first_name: Thomas
full_name: Soenen, Thomas
last_name: Soenen
- first_name: Wouter
full_name: Tavernier, Wouter
last_name: Tavernier
- first_name: Sharon
full_name: Mendel-Brin, Sharon
last_name: Mendel-Brin
- first_name: George
full_name: Xilouris, George
last_name: Xilouris
citation:
ama: 'Dräxler S, Karl H, Peuster M, et al. SONATA: Service programming and orchestration
for virtualized software networks. In: 2017 IEEE International Conference on
Communications Workshops (ICC Workshops). IEEE; 2017. doi:10.1109/iccw.2017.7962785'
apa: 'Dräxler, S., Karl, H., Peuster, M., Razzaghi Kouchaksaraei, H., Bredel, M.,
Lessmann, J., … Xilouris, G. (2017). SONATA: Service programming and orchestration
for virtualized software networks. In 2017 IEEE International Conference on
Communications Workshops (ICC Workshops). Paris, France: IEEE. https://doi.org/10.1109/iccw.2017.7962785'
bibtex: '@inproceedings{Dräxler_Karl_Peuster_Razzaghi Kouchaksaraei_Bredel_Lessmann_Soenen_Tavernier_Mendel-Brin_Xilouris_2017,
title={SONATA: Service programming and orchestration for virtualized software
networks}, DOI={10.1109/iccw.2017.7962785},
booktitle={2017 IEEE International Conference on Communications Workshops (ICC
Workshops)}, publisher={IEEE}, author={Dräxler, Sevil and Karl, Holger and Peuster,
Manuel and Razzaghi Kouchaksaraei, Hadi and Bredel, Michael and Lessmann, Johannes
and Soenen, Thomas and Tavernier, Wouter and Mendel-Brin, Sharon and Xilouris,
George}, year={2017} }'
chicago: 'Dräxler, Sevil, Holger Karl, Manuel Peuster, Hadi Razzaghi Kouchaksaraei,
Michael Bredel, Johannes Lessmann, Thomas Soenen, Wouter Tavernier, Sharon Mendel-Brin,
and George Xilouris. “SONATA: Service Programming and Orchestration for Virtualized
Software Networks.” In 2017 IEEE International Conference on Communications
Workshops (ICC Workshops). IEEE, 2017. https://doi.org/10.1109/iccw.2017.7962785.'
ieee: 'S. Dräxler et al., “SONATA: Service programming and orchestration
for virtualized software networks,” in 2017 IEEE International Conference on
Communications Workshops (ICC Workshops), Paris, France, 2017.'
mla: 'Dräxler, Sevil, et al. “SONATA: Service Programming and Orchestration for
Virtualized Software Networks.” 2017 IEEE International Conference on Communications
Workshops (ICC Workshops), IEEE, 2017, doi:10.1109/iccw.2017.7962785.'
short: 'S. Dräxler, H. Karl, M. Peuster, H. Razzaghi Kouchaksaraei, M. Bredel, J.
Lessmann, T. Soenen, W. Tavernier, S. Mendel-Brin, G. Xilouris, in: 2017 IEEE
International Conference on Communications Workshops (ICC Workshops), IEEE, 2017.'
conference:
end_date: 2017-05-25
location: Paris, France
name: 2017 IEEE International Conference on Communications Workshops (ICC Workshops)
start_date: 2017-05-21
date_created: 2017-11-22T09:42:59Z
date_updated: 2022-01-06T07:03:28Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/iccw.2017.7962785
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:22:10Z
date_updated: 2018-11-02T14:22:10Z
file_id: '5270'
file_name: 07962785.pdf
file_size: 821211
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:22:10Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/pdf/1605.05850.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: 2017 IEEE International Conference on Communications Workshops (ICC Workshops)
publication_identifier:
isbn:
- '9781509015252'
publication_status: published
publisher: IEEE
status: public
title: 'SONATA: Service programming and orchestration for virtualized software networks'
type: conference
user_id: '31764'
year: '2017'
...
---
_id: '87'
abstract:
- lang: eng
text: Management of complex network services requires flexible and efficient service
provisioning as well as optimized handling of continuous changes in the workload
of the service.To adapt to changes in the demand, service components need to be
replicated (scaling) and allocated to physical resources (placement) dynamically.
In this paper, we propose a fullyautomated approach to the joint optimization
problem of scaling and placement, enabling quick reaction to changes. We formalize
the problem, analyze its complexity, and develop two algorithms to solve it. Extensive
empirical results show the applicability andeffectiveness of the proposed approach.
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
- first_name: Zoltan Adam
full_name: Mann, Zoltan Adam
last_name: Mann
citation:
ama: 'Dräxler S, Karl H, Mann ZA. Joint Optimization of Scaling and Placement of
Virtual Network Services. In: Proceedings of the 17th IEEE/ACM International
Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017). ; 2017. doi:10.1109/CCGRID.2017.25'
apa: Dräxler, S., Karl, H., & Mann, Z. A. (2017). Joint Optimization of Scaling
and Placement of Virtual Network Services. In Proceedings of the 17th IEEE/ACM
International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017).
https://doi.org/10.1109/CCGRID.2017.25
bibtex: '@inproceedings{Dräxler_Karl_Mann_2017, title={Joint Optimization of Scaling
and Placement of Virtual Network Services}, DOI={10.1109/CCGRID.2017.25},
booktitle={Proceedings of the 17th IEEE/ACM International Symposium on Cluster,
Cloud and Grid Computing (CCGrid 2017)}, author={Dräxler, Sevil and Karl, Holger
and Mann, Zoltan Adam}, year={2017} }'
chicago: Dräxler, Sevil, Holger Karl, and Zoltan Adam Mann. “Joint Optimization
of Scaling and Placement of Virtual Network Services.” In Proceedings of the
17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid
2017), 2017. https://doi.org/10.1109/CCGRID.2017.25.
ieee: S. Dräxler, H. Karl, and Z. A. Mann, “Joint Optimization of Scaling and Placement
of Virtual Network Services,” in Proceedings of the 17th IEEE/ACM International
Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017), 2017.
mla: Dräxler, Sevil, et al. “Joint Optimization of Scaling and Placement of Virtual
Network Services.” Proceedings of the 17th IEEE/ACM International Symposium
on Cluster, Cloud and Grid Computing (CCGrid 2017), 2017, doi:10.1109/CCGRID.2017.25.
short: 'S. Dräxler, H. Karl, Z.A. Mann, in: Proceedings of the 17th IEEE/ACM International
Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017), 2017.'
date_created: 2017-10-17T12:41:08Z
date_updated: 2022-01-06T07:03:59Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/CCGRID.2017.25
file:
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2018-06-25T08:07:43Z
date_updated: 2018-06-25T08:07:43Z
file_id: '3324'
file_name: RIS.pdf
file_size: 2229109
relation: main_file
file_date_updated: 2018-06-25T08:07:43Z
has_accepted_license: '1'
oa: '1'
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 17th IEEE/ACM International Symposium on Cluster,
Cloud and Grid Computing (CCGrid 2017)
status: public
title: Joint Optimization of Scaling and Placement of Virtual Network Services
type: conference
urn: '873'
user_id: '31764'
year: '2017'
...
---
_id: '981'
abstract:
- lang: eng
text: "Benchmarking and profiling virtual network functions (VNFs) generates input\r\nknowledge
for resource management decisions taken by \r\nmanagement and orchestration systems.
\r\nSuch VNFs are usually not executed in isolation but are often deployed as
part of a service function chain (SFC) that connects single functions into complex
\r\nstructures. To manage such chains, isolated performance\r\nprofiles of single
functions have to be combined to get insights into \r\nthe overall behavior of
an SFC. This becomes particularly\r\nchallenging in highly agile DevOps environments
in which profiling\r\nprocesses need to be fully automated and detailed insights
about a chain's\r\ninternal structures are not always available. \r\n\r\nIn this
paper, we introduce a\r\nfully automatable, flexible, and platform-agnostic profiling\r\nsystem
that allows to profile entire SFCs at once. This obviates \r\nmanual modeling
procedures to combine profiling results from single\r\nVNFs to reflect SFC performance.
\r\nWe use a case study with different SFC configurations to show that it\r\nis
hard to model the resulting SFC performance based on single-VNF measurements and
that\r\nperformance interactions between real, non-trivial functions that are
deployed in a\r\nchain exist. "
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. Profile Your Chains, Not Functions. Automated Network Service
Profiling in DevOps Environments. In: IEEE Conference on Network Function Virtualisation
and Software Defined Networks (NFV-SDN). Berlin; 2017. doi:10.1109/NFV-SDN.2017.8169826'
apa: Peuster, M., & Karl, H. (2017). Profile Your Chains, Not Functions. Automated
Network Service Profiling in DevOps Environments. In IEEE Conference on Network
Function Virtualisation and Software Defined Networks (NFV-SDN). Berlin. https://doi.org/10.1109/NFV-SDN.2017.8169826
bibtex: '@inproceedings{Peuster_Karl_2017, place={Berlin}, title={Profile Your Chains,
Not Functions. Automated Network Service Profiling in DevOps Environments}, DOI={10.1109/NFV-SDN.2017.8169826},
booktitle={IEEE Conference on Network Function Virtualisation and Software Defined
Networks (NFV-SDN)}, author={Peuster, Manuel and Karl, Holger}, year={2017} }'
chicago: Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions.
Automated Network Service Profiling in DevOps Environments.” In IEEE Conference
on Network Function Virtualisation and Software Defined Networks (NFV-SDN).
Berlin, 2017. https://doi.org/10.1109/NFV-SDN.2017.8169826.
ieee: M. Peuster and H. Karl, “Profile Your Chains, Not Functions. Automated Network
Service Profiling in DevOps Environments,” in IEEE Conference on Network Function
Virtualisation and Software Defined Networks (NFV-SDN), Berlin, 2017.
mla: Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions. Automated
Network Service Profiling in DevOps Environments.” IEEE Conference on Network
Function Virtualisation and Software Defined Networks (NFV-SDN), 2017, doi:10.1109/NFV-SDN.2017.8169826.
short: 'M. Peuster, H. Karl, in: IEEE Conference on Network Function Virtualisation
and Software Defined Networks (NFV-SDN), Berlin, 2017.'
conference:
location: Berlin
name: IEEE Conference on Network Function Virtualisation and Software Defined Networks
(NFV-SDN)
date_created: 2017-11-27T10:22:29Z
date_updated: 2022-01-06T07:04:22Z
ddc:
- '004'
department:
- _id: '75'
doi: 10.1109/NFV-SDN.2017.8169826
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2018-07-05T11:14:00Z
date_updated: 2018-07-05T11:14:00Z
file_id: '3431'
file_name: main_ris.pdf
file_size: 2642306
relation: main_file
file_date_updated: 2018-07-05T11:14:00Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
place: Berlin
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 Virtualisation and Software Defined
Networks (NFV-SDN)
publication_status: published
status: public
title: Profile Your Chains, Not Functions. Automated Network Service Profiling in
DevOps Environments
type: conference
urn: '9810'
user_id: '13271'
year: '2017'
...