DPPx: A P4-based Data Plane Programmability and Exposure framework to enhance NFV services

Both network function virtualization (NFV) and edge computing (EC), especially the latter, are attracting more and more attention in recent years. A growing number of network service providers are migrating their services from the cloud to the edge for better QoS services, while the recent researches on NFV also concentrate on deploying NFV services in edge computing networks. However, NFV deployment in edge networks is a troublesome challenge and is fairly alien from conventional NFV deployment problems in data centres. Edge network differs from the data center network in the following two aspects: firstly, edge nodes are constrained in computing capacity, and secondly, the network connections between edge nodes are unstable and dynamic, which may show large variance over time. This means edge computing should be designed for high-efficient use of physical edge nodes’ resources. To address the challenges above, we investigate a new NFV Service Chain Placement problem in edge computing environments (NSCP-EC) in this paper. We first prove that the NSCP-EC problem is NP-complete. Then we propose a new metric which can better measure the capacity utilization rate of physical resources, and analyze its advantages with details. Based on the new metric, we propose two heuristic but efficient algorithms called MINI and MINI-tree. To confirm the performance of the two algorithms, we conduct simulations. The result demonstrates that MINI gains an advantage over genetic algorithm (GA) and MINI-tree orevails over MINI in tree topology conditions in the aspects of physical resource utilization, acceptance rate and running time. Both theoretical analysis and simulation results confirm the feasibility of the algorithms.

Network Function Virtualization (NFV) has promoted the implementation of network functions from expensive hardwares to software middleboxes. These software middleboxes, also called Virtual Network Functions (VNFs), are executed on switch-connected servers. Efficiently deploying such VNFs on servers is challenging because the traffic rate of flows must be fully processed by their requested VNFs when they reach destinations, and the deployed positions of VNFs are restricted by the server capacity. In addition, each network function offers non-uniform VNF models (types) with different configurations of processing volumes and costs. This paper focuses on minimizing the total cost of deploying VNFs for providing a specific network function to all flows in tree-structured networks. First, we prove the NP-hardness of non-uniform VNF deployment in a tree topology and propose a dynamic programming based solution with a pseudo-polynomial time complexity. Then we narrow it down to three simplified cases by focusing on either uniform VNFs or the linear line topology. Specifically, three algorithms are introduced: an improved dynamic programming based algorithm for deploying uniform VNFs in a tree topology, a performance-guaranteed algorithm for deploying non-uniform VNFs in a linear line topology, and an optimal greedy algorithm for deploying uniform VNFs in a linear line topology. Additionally, we generalize our approach to a case of deploying a service chain, which consists of multiple network functions applied to flows in a specific order. We propose two solutions: one is optimal but time-consuming while another is heuristic but efficient. Extensive simulations are conducted to evaluate our algorithms.

The discovery process of OPC Unified Architecture (OPC-UA) is well defined but lacks flexibility when implemented in large networks. While the standard provides concepts for local and global discovery services, the core assumption is that all clients and servers are aware of the discovery server(s) in the network. This dependency is a barrier for Plug-and-Play installations and is overcome by self announces via the multicast Domain Name System (mDNS), however, this scales badly with an increasing number of network nodes and deployed servers. We propose a discovery approach based on Software-Defined Networking (SDN) and Network Function Virtualization (NFV), that installs a plug-and-play mechanism for global OPC-UA discovery in modern virtualized networks.

5G networks represent a paradigm shift from their 4G predecessors, engineered to cater to the burgeoning demands of densely populated areas and the high data throughput requirements of the Internet of Things (IoT) and smart city infrastructures. Beyond enhancing fundamental network attributes such as reliability, availability, and security, 5G introduces architectural innovations to accommodate these advanced needs. This paper delves into the architectural nuances of 5G, focusing primarily on the Standalone (SA) deployment method, distinguished by its utilization of network slicing. This approach leverages cutting-edge virtual network technologies, including Software-Defined Networking (SDN) and Network Function Virtualization (NFV), to forge virtual network slices tailored to diverse consumer needs. Such customization is imperative for meeting the expansive and varied connectivity demands characteristic of 5G networks.To navigate the complexities of 5G architecture, this study advocates for the adoption of Reference Architectures (RAs), which provide a high-level abstraction framework for dissecting and understanding intricate systems. By proposing a model that outlines the standalone architecture of 5G networks, our research lays the groundwork for evolving this model into a comprehensive RA for 5G. This foundational work is instrumental in equipping system designers with the tools necessary for generalizing systems to manage design and deployment challenges effectively, as well as the heterogeneity inherent in system components. Additionally, our proposed model facilitates the establishment of a common vocabulary, promoting a coherent understanding of component interactions and offering a unified system perspective. Ultimately, this paper contributes a pivotal model that not only enhances our comprehension of 5G network architecture but also paves the way for future advancements in network design and deployment, promising to significantly impact the development of smart cities and IoT ecosystems.Keywords: 5G, 5G architecture, Reference architecture, patterns. Network slicing, Network Function Virtualization, Virtual Network Function.

Introduction The design of a mobile network architecture aims at defining network elements (e.g. Base Stations [BSs], switches, routers, user devices) and their interaction in order to ensure a consistent system operation. This chapter discusses basic considerations and provides an overview of current research activities. Network architecture can be considered from different angles that are needed in order to fulfill objectives like integration of technical components into an overall system, proper interworking of multi-vendor equipment and efficient design of physical networks from cost and performance point of view. As 5G systems have to integrate a plethora of partly contradicting requirements, enablers such as Network Function Virtualization (NFV) and Software Defined Networking (SDN) are to be applied in order to provide the needed flexibility of future networks, especially for the core network. Applying these tools may require a rethinking of some traditional aspects of network architecture design. This chapter will give the reader an impression of the most important topics influencing architecture design of future networks. NFV and SDN Today's operator networks include a large and increasing variety of hardware appliances. Launching new services often requires integration of complex hardware dedicated to the service including costly procedure design and is associated with lengthy time to market. On the other hand, hardware life cycles become shorter as technology and service innovation accelerates. At the end of 2012, network operators have started an initiative on NFV [1]. NFV aims at consolidating the variety of network equipment onto industry-standard high-volume servers. These servers can be located at the different network nodes as well as end-user premises. In this context, NFV relies upon but differs from traditional server virtualization. Unlike server virtualization, Virtualized Network Functions (VNF) may consist of one or more virtual machines running different software and processes in order to replace custom hardware appliances (Figure 3.1). As a rule, multiple VNFs are to be used in sequence in order to provide meaningful services to the customer. NFV requires an orchestration framework that enables proper instantiation, monitoring and operation of VNFs and Network Functions (NFs) (e.g. modulation, coding, multiple access, ciphering, etc.).

Attack-aware Security Function Management

The integration of software-defined networking (S-DN) and network function virtualization (NFV) is expected to achieve the convenient management and flexible deployment of various sophisticated network functions, and support user applications with guaranteed quality of service (QoS). In this paper, we jointly study route selection and network function placement problem. To stress the service sensitivity on delay, we formulate an optimization problem which minimizes the total end-to-end delay subject to data transmission, service requirement and various available resource constraints. As the formulated problem is an NP-hard problem, which cannot be solved easily, we transform it into three subproblems, i.e., route selection subproblem, network function placement subproblem and resource sharing subproblem of user flows, and solve the three subproblems by applying the K-shortest paths algorithm, Kuhn-Munkres (K-M) algorithm and Lagrangian dual method, respectively. Numerical results demonstrate the effectiveness of the proposed algorithm.

The design, management, and operation of network infrastructure have evolved during the last few years, leveraging on innovative technologies and architectures. With such a huge trend, due to the flexibility and significant economic potential of these technologies, software-defined networking (SDN) and network functions virtualization (NFV) are emerging as the most indispensable key catalysers. SDN/NFV enhancing the infrastructure agility, thus network operators and service providers are able to program their own network functions (e.g., gateways, routers, load balancers) on vendor-independent hardware substrate. One of the most important considerations in NFV deployment is how to allocate the virtual resources that are needed to provide flexible virtual network services in an NFV-based network infrastructure. Thus, the most important prerequisite for NFV deployment is achieved fast, scalable and dynamic composition and allocation of networks functions (NFs) to implement network services (NSs). We have proposed a revised RA algorithm that integrates embedding and scheduling of virtual network functions (VNFs) simultaneously. In this paper, performance evaluation of the revised RA algorithm is performed and the proposed algorithm is applied more effectively in NFV environment where the demand for resources is flexible and concentrated.

Network Function Virtualization (NFV) technology facilitates flexible and fast service provisioning by deploying network functions in wished positions and chaining order as Service Function Chain (SFC). Empirically, if the processing inside some Virtual Network Functions (VNFs) does not relate to each other, parallel chaining them can further improve the performance, such as reducing the end-to-end hops of SFCs. However, it is often ignored that parallel deploy VNFs will also introduce additional VNFs to replicate, distribute, and merge data. This will add hops and increase resource consumption. Will parallel deployment of VNFs in SFCs necessarily bring benefits? Regarding multiple parallel forms of an SFC, which one is the best? Further, how does the service process of the NFV network affect the parallel decisions of VNFs? In this paper, we design an NFV orchestrator, DP-NFVO, to maximize the revenue of NFV Service Providers and provide quantitative insights into the impact of parallel VNFs deploy-ment. Precisely, we first refine existing VNF parallelism rules and discuss the impact of VNF parallelism on latency and resource consumption, and analyze the optimal form of parallelism for SFCs. Second, we decompose the service request process in NFV networks into multiple stages and provide a joint model of VNF parallelism and deployment. Further, we design a VNF online deployment and parallelism decision policy for DP-NFVO based on Proximal Policy Optimization (PPO) to maximize revenue. Finally, we demonstrate the effectiveness and adaptability of DP-NFVO on parallel processing and the requests service process with extensive experiments.

A virtualized network infrastructure is composed of multiple virtualized network functions (VNF) interconnected by well defined interfaces, and thus forming a VNF-graph. The initial deployment of such a VNF-graph inside a data center (DC) is a complex task with multidimensional aspects compared to deploying a single VNF that may represent a single network function. The problem space becomes more complex when each VNF is further decomposed into multiple VNF components (VNFC), where each VNFC embodies a subset of network functions attributed to the respective VNF. The challenge is to ensure that the deployment strategy meets the intra-functional constraints between the multiple VNFCs constituting the VNF-graph while ensuring service, performance and operational integrity, and also ensures optimal utilization of the underlying resources of the DC infrastructure (DCI). In this article we analyze the cost incurred by two “constraint-based heuristically applied” initial VNF/VNFC deployment strategies with reference to a virtualized mobile network infrastructure providing EPCaaS (evolved packet core as a service) while taking into consideration functional and administrative constraints. The cost of deployment is measured in terms of the utilization of DC infrastructure resources such as compute and networking. We also present the discussion in view of the ETSI NFV MANO framework, undergoing standardization, that is responsible for management and orchestration of NFV systems including VNF deployment.

Fault tolerant placement of stateful VNFs and dynamic fault recovery in cloud networks

We study how to allocate spectrum and IT resources jointly for realizing efficient virtual network function (VNF) service chaining in inter-datacenter elastic optical networks. We first formulate an integer linear programming model to solve the problem exactly, and then a longest common subsequence-based heuristic is proposed. The simulation results indicate that the proposed algorithms can reuse the deployed VNFs efficiently and arrange the spectrum utilization in a much more load-balanced manner.

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 work-flow to develop an NFV service that is then packaged for multiple platforms, i.e., 5GTANGO and OSM.

It is our great pleasure to welcome you to the 2018 ACM International Workshop on Security in Software Defined Networks & Network Function Virtualization - SDN-NFV Security'18. SDN-NFV Security'18 offers a unique opportunity by bringing together researchers from academic, industry, as well as government agencies to discuss security challenges faced by two emerging networking paradigms, Software-Defined Networking (SDN) and Network Function Virtualization (NFV). SDN-NFV Security'18 solicits the submission of original unpublished ideas in 6-page long papers and 4-page short papers that address the latest practices, experiences, and lessons learned on SDN and NFV security. The call for papers attracted submissions from Europe and the United States. SDN-NFV Security'18 accepted 3 full papers be presented in this workshop, after a rigorous review process (at least 4 reviews for each paper) and discussion phase. In addition, we have invited 8 papers (5 full papers and 3 short papers) from domain experts to be presented in the workshop.

The Virtual Customer Premises Equipment (vCPE) technology has recently emerged to reduce telecom operators' OPEX and CAPEX. It evolved from Network Function Virtualization (NFV) and Software Defined Networking (SDN) technologies. This paper proposes a flexible vCPE framework to enable dynamic chaining of Virtual Network Functions (VNF) by using Programmable Protocol-independent Packet Processors (P4) switches. It can obtain a much better packet processing performance compared to the pure software vCPE solution. The OpenFlow switch provides similar hardware acceleration, but it executes the flow tables in a fixed order, and it is not possible to skip the flow tables, which are not subscribed to by a customer. However, P4, the domain-specific language used to describe how to process packets on a data plane (DP), gives more flexibility than the OpenFlow. It provides a way to avoid the fixed flow table execution order and can introduce a new service on the fly. Our flexible vCPE framework can be achieved by the synergies between an NFV controller on the cloud and a P4 switch at the edge. In this paper, an Open Network Operating System (ONOS) controller with P4Runtime is used as a VNF control plane and a P4 Behavioral Model (BMv2) software switch is used as a DP. Finally, dynamic function chaining is realized using three possible implementations, viz. multi-instance, clone, and resubmit. P4 language is used for the implementations. Experimental results show that a multi-instance based solution is better than a resubmit and clone.