@inproceedings{9809,
  abstract     = {{Remarkable advantages of Containers (CNs) over Virtual Machines (VMs) such as lower overhead and faster startup has gained the attention of Communication Service Providers (CSPs) as using CNs for providing Virtual Network Functions (VNFs) can save costs while increasing the service agility. However, as it is not feasible to realise all types of VNFs in CNs, the coexistence of VMs and CNs is proposed. To put VMs and CNs together, an orchestration framework that can chain services across distributed and heterogeneous domains is required. To this end, we implemented a framework by extending and consolidating state-of-the-art tools and technologies originated from Network Function Virtualization (NFV), Software-defined Networking (SDN) and cloud computing environments. This framework chains services provisioned across Kubernetes and OpenStack domains. During the demo, we deploy a service consist of CN- and VM-based VNFs to demonstrate different features provided by our framework.}},
  author       = {{Razzaghi Kouchaksaraei, Hadi and Karl, Holger}},
  booktitle    = {{13th ACM International Conference on Distributed and Event-based Systems}},
  keywords     = {{Network Function Virtualization, Software-defined Networking, Cloud Computing, service orchestration, OpenStack, Kubernetes}},
  location     = {{Darmstadt}},
  title        = {{{Service Function Chaining Across OpenStack and Kubernetes Domains}}},
  doi          = {{10.1145/3328905.3332505}},
  year         = {{2019}},
}

@article{9824,
  author       = {{Peuster, Manuel and Schneider, Stefan Balthasar and Zhao, Mengxuan and Xilouris, George and Trakadas, Panagiotis and Vicens, Felipe and Tavernier, Wouter and Soenen, Thomas and Vilalta, Ricard and Andreou, George and Kyriazis, Dimosthenis and Karl, Holger}},
  issn         = {{0163-6804}},
  journal      = {{IEEE Communications Magazine}},
  pages        = {{96--102}},
  title        = {{{Introducing Automated Verification and Validation for Virtualized Network Functions and Services}}},
  doi          = {{10.1109/mcom.2019.1800873}},
  year         = {{2019}},
}

@inproceedings{12912,
  author       = {{Razzaghi Kouchaksaraei, Hadi and Karl, Holger}},
  booktitle    = {{15th International Conference on Network and Service Management (CNSM)}},
  location     = {{Halifax, Canada}},
  title        = {{{Quantitative Analysis of Dynamically Provisioned Heterogeneous Network Services}}},
  year         = {{2019}},
}

@inproceedings{15369,
  author       = {{Müller, Marcel and Behnke, Daniel and Bök, Patrick-Benjamin and Peuster, Manuel and Schneider, Stefan Balthasar and Karl, Holger}},
  booktitle    = {{IEEE 17th International Conference on Industrial Informatics (IEEE-INDIN)}},
  publisher    = {{IEEE}},
  title        = {{{5G as Key Technology for Networked Factories: Application of Vertical-specific Network Services for Enabling Flexible Smart Manufacturing}}},
  year         = {{2019}},
}

@inproceedings{15371,
  abstract     = {{More and more management and orchestration approaches for (software) networks are based on machine learning paradigms and solutions. These approaches depend not only on their program code to operate properly, but also require enough input data to train their internal models. However, such training data is barely available for the software networking domain and most presented solutions rely on their own, sometimes not even published, data sets. This makes it hard, or even infeasible, to reproduce and compare many of the existing solutions. As a result, it ultimately slows down the adoption of machine learning approaches in softwarised networks. To this end, we introduce the "softwarised network data zoo" (SNDZoo), an open collection of software networking data sets aiming to streamline and ease machine learning research in the software networking domain. We present a general methodology to collect, archive, and publish those data sets for use by other researches and, as an example, eight initial data sets, focusing on the performance of virtualised network functions.
}},
  author       = {{Peuster, Manuel and Schneider, Stefan Balthasar and Karl, Holger}},
  booktitle    = {{IEEE/IFIP 15th International Conference on Network and Service Management (CNSM)}},
  publisher    = {{IEEE/IFIP}},
  title        = {{{The Softwarised Network Data Zoo}}},
  year         = {{2019}},
}

@inproceedings{15373,
  abstract     = {{Offloading packet processing tasks to programmable switches and/or to programmable network interfaces, so called “SmartNICs”, is one of the key concepts to prepare softwarized networks for the high traffic demands of the future. However, implementing network functions that make use of those offload- ing technologies is still challenging and usually requires the availability of specialized hardware. It becomes even harder if heterogeneous services, making use of different offloading and network virtualization technologies, should be developed.
In this paper, we introduce FOP4 (Function Offloading Pro- totyping with P4), a novel prototyping platform that allows to prototype heterogeneous software network scenarios, including container-based, P4-switch-based, and SmartNIC-based network functions. The presented work substantially extends our existing Containernet platform with the means to prototype offloading scenarios. Besides presenting the platform’s system design, we evaluate its scalability and show that it can run scenarios with more than 64 P4 switch or SmartNIC nodes on a single laptop. Finally, we presented a case study in which we use the presented platform to prototype an extended in-band network telemetry use case.}},
  author       = {{Moro, Daniele and Peuster, Manuel and Karl, Holger and Capone, Antonio}},
  booktitle    = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)}},
  publisher    = {{IEEE}},
  title        = {{{FOP4: Function Offloading Prototyping in Heterogeneous and Programmable Network Scenarios}}},
  year         = {{2019}},
}

@inproceedings{15374,
  abstract     = {{Emulation platforms supporting Virtual Network Functions (VNFs) allow developers to rapidly prototype network services. None of the available platforms, however, supports experimenting with programmable data planes to enable VNF offloading. In this demonstration, we show FOP4, a flexible platform that provides support for Docker-based VNFs, and VNF offloading, by means of P4-enabled switches. The platform provides interfaces to program the P4 devices and to deploy network functions. We demonstrate FOP4 with two complex example scenarios, demonstrating how developers can exploit data plane programmability to implement network functions.}},
  author       = {{Moro, Daniele and Peuster, Manuel and Karl, Holger and Capone, Antonio}},
  booktitle    = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)}},
  publisher    = {{IEEE}},
  title        = {{{Demonstrating FOP4: A Flexible Platform to Prototype NFV Offloading Scenarios}}},
  year         = {{2019}},
}

@phdthesis{14851,
  author       = {{Mäcker, Alexander}},
  title        = {{{On Scheduling with Setup Times}}},
  doi          = {{10.17619/UNIPB/1-828}},
  year         = {{2019}},
}

@phdthesis{13124,
  author       = {{Dräxler, Sevil}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Scaling, placement, and routing for pliable virtualized composed services}}},
  year         = {{2019}},
}

@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}},
}

@misc{10344,
  author       = {{Pukrop, Simon}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine}}},
  year         = {{2019}},
}

@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{2484,
  abstract     = {{We study the classic bin packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio while repacking items sparingly between updates. Formally, each item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur a movement cost gamma * c_i, either in the worst case, or in an amortized sense, for alpha, gamma as small as possible. We call gamma the recourse of the algorithm. This is motivated by cloud storage applications, where fully-dynamic bin packing models the problem of data backup to minimize the number of disks used, as well as communication incurred in moving file backups between disks. Since the set of files changes over time, we could recompute a solution periodically from scratch, but this would give a high number of disk rewrites, incurring a high energy cost and possible wear and tear of the disks. In this work, we present optimal tradeoffs between number of bins used and number of items repacked, as well as natural extensions of the latter measure.}},
  author       = {{Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh, Guru and Kumar, Amit  and Riechers, Sören and Wajc, David}},
  booktitle    = {{45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}},
  editor       = {{Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, Donald}},
  isbn         = {{978-3-95977-076-7}},
  issn         = {{1868-8969}},
  location     = {{Prag}},
  pages        = {{51:1--51:24}},
  publisher    = {{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}},
  title        = {{{Fully-Dynamic Bin Packing with Little Repacking}}},
  doi          = {{10.4230/LIPIcs.ICALP.2018.51}},
  volume       = {{107}},
  year         = {{2018}},
}

@article{2848,
  author       = {{Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm}},
  journal      = {{Algorithmica}},
  number       = {{5}},
  pages        = {{1556–1574}},
  publisher    = {{Springer}},
  title        = {{{Towards Flexible Demands in Online Leasing Problems. }}},
  doi          = {{10.1007/s00453-018-0420-y}},
  volume       = {{80}},
  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{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}},
}

