@inproceedings{732, abstract = {{Elastic deployments of virtualized network functions~(VNF) can automatically scale the amount of used resources in relation to their workload. This is often done by starting new VNF instances or stopping old ones. A problem of these scale operations is that most network functions are stateful and their internal state is not automatically migrated when traffic is redistributed in the deployment. As a result, mechanisms are needed to exchange or migrate internal network function state between VNF instances. This paper presents a state management framework that creates a logically distributed state store on top of elastically deployed virtual network functions. We also introduce a novel programming model that provides both a local and a global view of the state to each VNF instance. We discuss the integration of our framework into existing network function virtualization architectures and compare the performance of our prototype to a centralized and a distributed state store solution.}}, author = {{Peuster, Manuel and Karl, Holger}}, booktitle = {{IEEE NetSoft Conference and Workshops, NetSoft 2016, Seoul, South Korea, June 6-10, 2016}}, location = {{Seoul}}, pages = {{6----10}}, title = {{{E-State: Distributed state management in elastic network function deployments}}}, doi = {{10.1109/NETSOFT.2016.7502432}}, year = {{2016}}, } @inproceedings{735, author = {{Auroux, Sébastien and Parruca, Donald and Karl, Holger}}, booktitle = {{27th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, {PIMRC} 2016, Valencia, Spain, September 4-8, 2016}}, pages = {{1----6}}, title = {{{Joint real-time scheduling and interference coordination for wireless factory automation}}}, doi = {{10.1109/PIMRC.2016.7794927}}, year = {{2016}}, } @inproceedings{738, abstract = {{Virtualized network services consisting of multiple individual network functions are already today deployed across multiple sites, so called multi-PoP (points of presence) environments. This allows to improve service performance by optimizing its placement in the network. But prototyping and testing of these complex distributed software systems becomes extremely challenging. The reason is that not only the network service as such has to be tested but also its integration with management and orchestration systems. Existing solutions, like simulators, basic network emulators, or local cloud testbeds, do not support all aspects of these tasks. To this end, we introduce MeDICINE, a novel NFV prototyping platform that is able to execute production-ready network functions, provided as software containers, in an emulated multi-PoP environment. These network functions can be controlled by any third-party management and orchestration system that connects to our platform through standard interfaces. Based on this, a developer can use our platform to prototype and test complex network services in a realistic environment running on his laptop. }}, author = {{Peuster, Manuel and Karl, Holger and van Rossem, Steven}}, booktitle = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)}}, location = {{Palo Alto}}, title = {{{MeDICINE: Rapid Prototyping of Production-Ready Network Services in Multi-PoP Environments}}}, doi = {{10.1109/NFV-SDN.2016.7919490}}, year = {{2016}}, } @inproceedings{985, author = {{v. Rossem, S. and Tavernier, W. and Peuster, Manuel and Colle, D. and Pickavet, M. and Demeester, P.}}, booktitle = {{Proc. IEEE Conference on Network Function Virtualization and Software Defined Network (NFV-SDN), Demo Track}}, title = {{{Monitoring and debugging using an SDK for NFV-powered telecom applications}}}, year = {{2016}}, } @inproceedings{166, abstract = {{Network function virtualization and software-defined networking allow services consisting of virtual network functions to be designed and implemented with great flexibility by facilitating automatic deployments, migrations, and reconfigurations for services and their components. For extended flexibility, we go beyond seeing services as a fixed chain of functions. We present a YANG model for describing the service structure in deployment requests in a flexible way that enables changing the order of functions in case the order of traversing them does not affect the functionality of the service. Upon receiving such requests, the network orchestration system can choose the optimal composition of service components that gives the best results for placement of services in the network. This introduces new complexities to the placement problem by greatly increasing the number of possible ways a service can be composed. In this paper, we describe a heuristic solution that selects a Pareto set of the possible compositions of a service as well as possible combinations of different services, with respect to different resource requirements of the services. Our evaluations show that the selected combinations consist of representative samples of possible structures and requirements and therefore, can result in optimal or close-to-optimal placement results.}}, author = {{Dräxler, Sevil and Karl, Holger}}, booktitle = {{Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)}}, pages = {{184----192}}, title = {{{Placement of Services with Flexible Structures Specified by a YANG Data Model}}}, doi = {{10.1109/NETSOFT.2016.7502412}}, year = {{2016}}, } @inproceedings{1627, author = {{Gutierrez, P. A. Aranda and Rojas, E. and Schwabe, A. and Stritzke, C. and Doriguzzi-Corin, R. and Leckey, A. and Petralia, G. and Marsico, A. and Phemius, K. and Tamurejo, S.}}, booktitle = {{2016 IEEE NetSoft Conference and Workshops (NetSoft)}}, isbn = {{9781467394864}}, publisher = {{IEEE}}, title = {{{NetIDE: All-in-one framework for next generation, composed SDN applications}}}, doi = {{10.1109/netsoft.2016.7502408}}, year = {{2016}}, } @inproceedings{1630, author = {{Marsico, Antonio and Doriguzzi-Corin, Roberto and Gerola, Matteo and Siracusa, Domenico and Schwabe, Arne}}, booktitle = {{NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium}}, isbn = {{9781509002238}}, publisher = {{IEEE}}, title = {{{A non-disruptive automated approach to update SDN applications at runtime}}}, doi = {{10.1109/noms.2016.7502946}}, year = {{2016}}, } @inproceedings{1632, author = {{Doriguzzi-Corin, Roberto and Siracusa, Domenico and Salvador, Elio and Schwabe, Arne}}, booktitle = {{NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium}}, isbn = {{9781509002238}}, publisher = {{IEEE}}, title = {{{Empowering network operating systems with memory management techniques}}}, doi = {{10.1109/noms.2016.7502889}}, year = {{2016}}, } @article{1373, author = {{Herlich, Matthias and Bredenbals, Nico and Karl, Holger}}, issn = {{2210-5379}}, journal = {{Sustainable Computing: Informatics and Systems}}, pages = {{48--55}}, publisher = {{Elsevier BV}}, title = {{{Delayed (de-)activation in servers with a sleep mode}}}, doi = {{10.1016/j.suscom.2016.04.002}}, volume = {{10}}, year = {{2016}}, } @inproceedings{252, abstract = {{Video streaming is in high demand by mobile users. In cellular networks, however, the unreliable wireless channel leads to two major problems. Poor channel states degrade video quality and interrupt the playback when a user cannot sufficiently fill its local playout buffer: buffer underruns occur. In contrast, good channel conditions cause common greedy buffering schemes to buffer too much data. Such over-buffering wastes expensive wireless channel capacity. Assuming that we can anticipate future data rates, we plan the quality and download time of video segments ahead. This anticipatory download scheduling avoids buffer underruns by downloading a large number of segments before a drop in available data rate occurs, without wasting wireless capacity by excessive buffering.We developed a practical anticipatory scheduling algorithm for segmented video streaming protocols (e.g., HLS or MPEG DASH). Simulation results and testbed measurements show that our solution essentially eliminates playback interruptions without significantly decreasing video quality.}}, author = {{Dräxler, Martin and Blobel, Johannes and Dreimann, Philipp and Valentin, Stefan and Karl, Holger}}, booktitle = {{Proceedings of the 2nd International Conference on Networked Systems (NetSys)}}, pages = {{1----8}}, title = {{{SmarterPhones: Anticipatory Download Scheduling for Wireless Video Streaming}}}, doi = {{10.1109/NetSys.2015.7089073}}, year = {{2015}}, } @inproceedings{287, abstract = {{The size of modern data centers is constantly increasing. As it is not economic to interconnect all machines in the data center using a full-bisection-bandwidth network, techniques have to be developed to increase the efficiency of data-center networks. The Software-Defined Network paradigm opened the door for centralized traffic engineering (TE) in such environments. Up to now, there were already a number of TE proposals for SDN-controlled data centers that all work very well. However, these techniques either use a high amount of flow table entries or a high flow installation rate that overwhelms available switching hardware, or they require custom or very expensive end-of-line equipment to be usable in practice. We present HybridTE, a TE technique that uses (uncertain) information about large flows. Using this extra information, our technique has very low hardware requirements while maintaining better performance than existing TE techniques. This enables us to build very low-cost, high performance data-center networks.}}, author = {{Wette, Philip and Karl, Holger}}, booktitle = {{Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)}}, pages = {{1----7}}, title = {{{HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks}}}, doi = {{10.1109/EWSDN.2015.57}}, year = {{2015}}, } @inproceedings{247, abstract = {{Multi-rooted trees are becoming the norm for modern data-center networks. In these networks, scalable flow routing is challenging owing to vast number of flows. Current approaches either employ a central controller that can have scalability issues or a scalable decentralized algorithm only considering local information. In this paper we present a new decentralized approach to least-congested path routing in software-defined data center networks that has neither of these issues: By duplicating the initial (or SYN) packet of a flow and estimating the data rate of multiple flows in parallel, we exploit TCP’s habit to fill buffers to find the least congested path. We show that our algorithm significantly improves flow completion time without the need for a central controller or specialized hardware.}}, author = {{Schwabe, Arne and Karl, Holger}}, booktitle = {{Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)}}, pages = {{37--42}}, title = {{{SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics}}}, doi = {{10.1109/EWSDN.2015.58}}, year = {{2015}}, } @phdthesis{264, author = {{Wette, Philip}}, publisher = {{Universität Paderborn}}, title = {{{Optimizing Software-Defined Networks using Application-Layer Knowledge}}}, year = {{2015}}, } @inproceedings{739, author = {{A. Aranda-Gutierrez, Pedro and Karl, Holger and Rojas, Elisa and Leckey, Alec}}, booktitle = {{2015 European Conference on Networks and Communications, EuCNC 2015, Paris, France, June 29 - July 2, 2015}}, pages = {{429----433}}, title = {{{On Network Application representation and controller independence in {SDN}}}, doi = {{10.1109/EuCNC.2015.7194112}}, year = {{2015}}, } @inproceedings{742, author = {{Blanckenstein, Johannes and Nardin, Cristina and Klaue, Jirka and Karl, Holger}}, booktitle = {{{IEEE} International Conference on Communication, {ICC} 2015, London, United Kingdom, June 8-12, 2015, Workshop Proceedings}}, pages = {{2363----2368}}, title = {{{Error characterization of multi-access point WSNs in an aircraft cabin}}}, doi = {{10.1109/ICCW.2015.7247534}}, year = {{2015}}, } @inproceedings{743, author = {{Schwabe, Arne and Karl, Holger}}, booktitle = {{2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015}}, pages = {{6122----6127}}, title = {{{Topology model to generate realistic latency for simulations}}}, doi = {{10.1109/ICC.2015.7249298}}, year = {{2015}}, } @inproceedings{745, author = {{Dräxler, Martin and Blobel, Johannes and Karl, Holger}}, booktitle = {{8th IFIP Wireless and Mobile Networking Conference, WMNC 2015, Munich, Germany, October 5-7, 2015}}, pages = {{136----143}}, title = {{{Anticipatory Download Scheduling in Wireless Video Streaming with Uncertain Data Rate Prediction}}}, doi = {{10.1109/WMNC.2015.21}}, year = {{2015}}, } @inproceedings{746, author = {{Wette, Philip and Schwabe, Arne and Splietker, Malte and Karl, Holger}}, booktitle = {{Proceedings of the 1st {IEEE} Conference on Network Softwarization, NetSoft 2015, London, United Kingdom, April 13-17, 2015}}, pages = {{1----2}}, title = {{{Extending Hadoop's Yarn Scheduler Load Simulator with a highly realistic network & traffic model}}}, doi = {{10.1109/NETSOFT.2015.7116169}}, year = {{2015}}, } @inproceedings{747, author = {{Auroux, Sébastien and Karl, Holger}}, booktitle = {{26th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, PIMRC 2015, Hong Kong, China, August 30 - September 2, 2015}}, pages = {{1850----1855}}, title = {{{Flexible reassignment of flow processing-aware controllers in future wireless networks}}}, doi = {{10.1109/PIMRC.2015.7343600}}, year = {{2015}}, } @inproceedings{748, author = {{Auroux, Sébastien and Karl, Holger}}, booktitle = {{2015 IEEE Wireless Communications and Networking Conference, WCNC 2015, New Orleans, LA, USA, March 9-12, 2015}}, pages = {{1787----1792}}, title = {{{Efficient flow processing-aware controller placement in future wireless networks}}}, doi = {{10.1109/WCNC.2015.7127739}}, year = {{2015}}, }