@inproceedings{13292, abstract = {{Building on 5G and network function virtualization (NFV), smart manufacturing has the potential to drastically increase productivity, reduce cost, and introduce novel, flexible manufacturing services. Current work mostly focuses on high-level scenarios or emulation-based prototype deployments. Extending our previous work, we showcase one of the first cloud-native 5G verticals focusing on the deployment of smart manufacturing use cases on production infrastructure. In particular, we use the 5GTANGO service platform to deploy our developed network services on Kubernetes. For this demo, we implemented a series of cloud-native virtualized network functions (VNFs) and created suitable service descriptors. Their light-weight, stateless deployment on Kubernetes enables quick instantiation, scalability, and robustness.}}, author = {{Schneider, Stefan Balthasar and Peuster, Manuel and Hannemann, Kai and Behnke, Daniel and Müller, Marcel and Bök, Patrick-Benjamin and Karl, Holger}}, booktitle = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN) Demo Track}}, keywords = {{5G, NFV, Smart Manufacturing, Cloud-Native, Kubernetes}}, location = {{Dallas, TX, USA}}, publisher = {{IEEE}}, title = {{{"Producing Cloud-Native": Smart Manufacturing Use Cases on Kubernetes}}}, year = {{2019}}, } @article{10325, author = {{Peuster, Manuel and Marchetti, Michael and García de Blas, Gerardo and Karl, Holger}}, issn = {{1687-1499}}, journal = {{EURASIP Journal on Wireless Communications and Networking}}, publisher = {{Springer}}, title = {{{Automated testing of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based smoke testing}}}, doi = {{10.1186/s13638-019-1493-2}}, year = {{2019}}, } @inproceedings{2474, author = {{Afifi, Haitham and Auroux, Sébastien and Karl, Holger}}, publisher = {{Proc. of IEEE Wireless Communications and Networking Conference (WCNC)}}, title = {{{MARVELO: Wireless Virtual Network Embedding for Overlay Graphs with Loops}}}, year = {{2018}}, } @inproceedings{2476, author = {{Shiferaw Heyi, Binyam and Karl, Holger}}, publisher = {{Proc. of IEEE Wireless Communications and Networking Conference (WCNC)}}, title = {{{Modelling Time-Limited Capacity of a Wireless Channel as aMarkov Reward Process}}}, year = {{2018}}, } @inproceedings{2480, abstract = {{Understanding the behavior of the components of service function chains (SFCs) in different load situations is important for efficient and automatic management and orches- tration of services. For this purpose and for practical research in network function virtualization in general, there is a great need for benchmarks and experimental data. In this paper, we describe our experiments for characterizing the relationship between resource demands of virtual network functions (VNFs) and the expected performance of the SFC, considering the individual performance of the VNFs as well as the interdependencies among VNFs within the SFC. We have designed our experiments focusing on video streaming, an important application in this context. We present examples of models for predicting the interdependence between resource demands and performance characteristics of SFCs using support vector regression and polynomial regression models. We also show practical evidence from our experiments that VNFs need to be benchmarked in their final chain setup, rather than individually, to capture important interdependencies that affect their performance. The data gathered from our experiments is publicly available.}}, author = {{Dräxler, Sevil and Peuster, Manuel and Illian, Marvin and Karl, Holger}}, booktitle = {{4th IEEE International Conference on Network Softwarization (NetSoft 2018)}}, location = {{Montreal}}, pages = {{318----322}}, publisher = {{IEEE}}, title = {{{Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case}}}, doi = {{10.1109/NETSOFT.2018.8460029}}, year = {{2018}}, } @inproceedings{2481, abstract = {{Network function virtualization requires scaling and placement, deciding the number and the location of function instances. Current approaches are limited in flexibility and practical applicability. Specifically, we study dynamic, single-step, joint scaling and placement of network services with bidirectional flows traversing Physical or Virtual Network Functions (VNFs) and returning to their sources. We develop models to support stateful components and legacy network functions with fixed locations in these network services as well as the possibility of reusing VNFs across network services. We formalize the problem of jointly scaling and placing such network services as a mixed- integer linear program (MILP). We show that this problem is NP-complete and also present a heuristic algorithm to find good solutions in short time. In an extensive evaluation with realistic scenarios, we investigate the capabilities of the two approaches.}}, author = {{Dräxler, Sevil and Schneider, Stefan Balthasar and Karl, Holger}}, booktitle = {{4th IEEE International Conference on Network Softwarization (NetSoft 2018)}}, location = {{Montreal}}, pages = {{123----131}}, publisher = {{IEEE}}, title = {{{ Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions}}}, year = {{2018}}, } @techreport{2483, abstract = {{Understanding the behavior of distributed cloud service components in different load situations is important for efficient and automatic management and orchestration of these services. For this purpose and for practical research in distributed cloud computing in general, there is need for benchmarks and experimental data. In this paper, we describe our experiments for characterizing the relationship between resource demands of application components and the expected performance of applica- tions. We present initial results for predicting the interdependence between resource demands and performance characteristics using support vector regression and polynomial regression models. The data gathered from our experiments is publicly available.}}, author = {{Dräxler, Sevil and Peuster, Manuel and Illian, Marvin and Karl, Holger}}, title = {{{Towards Predicting Resource Demands and Performance of Distributed Cloud Services}}}, year = {{2018}}, } @inproceedings{2472, author = {{Auroux, Sébastien and Karl, Holger}}, publisher = {{Proc. of IEEE Wireless Communications and Networking Conference (WCNC)}}, title = {{{Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks}}}, doi = {{ 10.1109/WCNC.2018.8377335}}, year = {{2018}}, } @inproceedings{3217, author = {{Demirel, Burak and Ramaswamy, Arunselvan and Quevedo, Daniel and Karl, Holger}}, title = {{{DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling}}}, doi = {{10.1109/LCSYS.2018.2847721}}, year = {{2018}}, } @inproceedings{3345, abstract = {{Dynamically steering flows through virtualized net- work function instances is a key enabler for elastic, on-demand deployments of virtualized network functions. This becomes par- ticular challenging when stateful functions are involved, necessi- tating state management. The problem with existing solutions is that they typically embrace state migration and flow rerouting jointly, imposing a huge set of requirements on the on-boarded VNFs, e.g., solution-specific state management interfaces. In this paper, we introduce the seamless handover proto- col (SHarP). It provides an easy-to-use, loss-less, and order- preserving flow rerouting mechanism that is not fixed to a single state management approach. This allows VNF vendors to implement or use the state management solution of their choice. SHarP supports these solutions with additional information when flows are migrated. Further, we show how SHarP significantly reduces the buffer usage at a central (SDN) controller, which is a typical bottleneck in existing solutions. Our experiments show that SHarP uses a constant amount of controller buffer, irrespective of the time taken to migrate the VNF state.}}, author = {{Peuster, Manuel and Küttner, Hannes and Karl, Holger}}, booktitle = {{4th IEEE International Conference on Network Softwarization (NetSoft 2018)}}, location = {{Montreal}}, title = {{{ Let the state follow its flows: An SDN-based flow handover protocol to support state migration}}}, doi = {{10.1109/NETSOFT.2018.8460007}}, year = {{2018}}, } @inproceedings{3346, abstract = {{Developing a virtualized network service does not only involve the implementation and configuration of the network functions it is composed of but also its integration and test with management solutions that will control the service in its production environment. These integration tasks require testbeds that offer the needed network function virtualization infrastructure~(NFVI), like OpenStack, introducing a lot of management and maintenance overheads. Such testbed setups become even more complicated when the multi point-of-presence~(PoP) case, with multiple infrastructure installations, is considered. In this demo, we showcase an emulation platform that executes containerized network services in user-defined multi-PoP topologies. The platform does not only allow network service developers to locally test their services but also to connect real-world management and orchestration solutions to the emulated PoPs. During our interactive demonstration we focus on the integration between the emulated infrastructure and state-of-the-art orchestration solutions like SONATA or OSM.}}, author = {{Peuster, Manuel and Kampmeyer, Johannes and Karl, Holger}}, booktitle = {{4th IEEE International Conference on Network Softwarization (NetSoft 2018)}}, location = {{Montreal}}, title = {{{Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains}}}, doi = {{10.1109/NETSOFT.2018.8459905}}, year = {{2018}}, } @inproceedings{3347, abstract = {{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. In 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 = {{Peuster, Manuel and Marchetti, Michael and Garcia de Blas, Gerado and Karl, Holger}}, booktitle = {{European Conference on Networks and Communications (EuCNC)}}, location = {{Ljubljana}}, title = {{{Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments}}}, doi = {{10.1109/EuCNC.2018.8442701}}, year = {{2018}}, } @article{3152, abstract = {{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.}}, author = {{Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}}, journal = {{IEEE Transactions on Network and Service Management}}, publisher = {{IEEE}}, title = {{{JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services}}}, doi = {{10.1109/TNSM.2018.2846572}}, year = {{2018}}, } @inproceedings{6016, author = {{Peuster, Manuel and Karl, Holger}}, booktitle = {{IEEE/IFIP 14th International Conference on Network and Service Management (CNSM)}}, location = {{Rome}}, publisher = {{IEEE/IFIP}}, title = {{{Understand your chains and keep your deadlines: Introducing time-constrained profiling for NFV}}}, year = {{2018}}, } @inproceedings{6483, author = {{Peuster, Manuel and Schneider, Stefan Balthasar and Christ, Frederic and Karl, Holger}}, booktitle = {{IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp}}, location = {{Verona}}, publisher = {{IEEE}}, title = {{{A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains}}}, year = {{2018}}, } @techreport{6485, author = {{Rosa, Raphael Vicente and Rothenberg, Christian Esteve and Peuster, Manuel and Karl, Holger}}, publisher = {{IETF}}, title = {{{Methodology for VNF Benchmarking Automation}}}, year = {{2018}}, } @inproceedings{6970, abstract = {{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. Considering 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. In 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 = {{Schneider, Stefan Balthasar and Dräxler, Sevil and Karl, Holger}}, booktitle = {{IEEE Global Communications Conference (GLOBECOM 2018)}}, location = {{Abu Dhabi, UAE}}, publisher = {{IEEE}}, title = {{{Trade-offs in Dynamic Resource Allocation in Network Function Virtualization}}}, year = {{2018}}, } @inproceedings{6972, abstract = {{In recent years, a variety of different approaches have been proposed to tackle the problem of scaling and placing network services, consisting of interconnected virtual network functions (VNFs). This paper presents a placement abstraction layer (PAL) that provides a clear and simple northbound interface for using such algorithms while hiding their internal functionality and implementation. Through its southbound interface, PAL can connect to different back ends that evaluate the calculated placements, e.g., using simulations, emulations, or testbed approaches. As an example for such evaluation back ends, we introduce a novel placement emulation framework (PEF) that allows executing calculated placements using real, containerbased VNFs on real-world network topologies. In a case study, we show how PAL and PEF facilitate reusing and evaluating placement algorithms as well as validating their underlying models and performance claims.}}, author = {{Schneider, Stefan Balthasar and Peuster, Manuel and Karl, Holger}}, booktitle = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)}}, location = {{Verona, Italy}}, publisher = {{IEEE}}, title = {{{A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms}}}, doi = {{10.1109/NFV-SDN.2018.8725795}}, year = {{2018}}, } @inproceedings{6974, abstract = {{A key challenge of network function virtualization (NFV) is the complexity of developing and deploying new network services. Currently, development requires many manual steps that are time-consuming and error-prone (e.g., for creating service descriptors). Furthermore, existing management and orchestration (MANO) platforms only offer limited support of standardized descriptor models or package formats, limiting the re-usability of network services. To this end, we introduce a fully integrated, open-source NFV service development kit (SDK) with multi-MANO platform support. Our SDK simplifies many NFV service development steps by offering initial generation of descriptors, advanced project management, as well as fully automated packaging and submission for on-boarding. To achieve multi-platform support, we present a package format that extends ETSI’s VNF package format. In this demonstration, we present the end-to-end workflow to develop an NFV service that is then packaged for multiple platforms, i.e., 5GTANGO and OSM.}}, author = {{Schneider, Stefan Balthasar and Peuster, Manuel and Tavernier, Wouter and Karl, Holger}}, booktitle = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)}}, location = {{Verona, Italy}}, publisher = {{IEEE}}, title = {{{A Fully Integrated Multi-Platform NFV SDK}}}, doi = {{10.1109/NFV-SDN.2018.8725794}}, year = {{2018}}, } @phdthesis{1208, author = {{Schwabe, Arne}}, publisher = {{Universität Paderborn}}, title = {{{Data-Centre Traffic Optimisation using Software-Defined Networks}}}, doi = {{10.17619/UNIPB/1-287}}, year = {{2018}}, }