scholarly journals Path Mapping Approach for Network Function Virtualization Resource Allocation with Network Function Decomposition Support

Symmetry ◽  
2019 ◽  
Vol 11 (9) ◽  
pp. 1173 ◽  
Author(s):  
Basheer Raddwan ◽  
Khalil AL-Wagih ◽  
Ibrahim A. Al-Baltah ◽  
Mohamed A. Alrshah ◽  
Mohammed A. Al-Maqri
Keyword(s):  
Resource Allocation ◽  
Execution Time ◽  
Service Providers ◽  
Virtual Network ◽  
Network Function Virtualization ◽  
Network Function ◽  
Function Decomposition ◽  
Mapping Approach ◽  
Network Functions ◽  
The Impact

Recently, Network Function Virtualization (NFV) and Software Defined Networking (SDN) have attracted many mobile operators. For the flexible deployment of Network Functions (NFs) in an NFV environment, NF decompositions and control/user plane separation have been introduced in the literature. That is to map traditional functions into their corresponding Virtual Network Functions (VNFs). This mapping requires the NFV Resource Allocation (NFV-RA) for multi-path service graphs with a high number of virtual nodes and links, which is a complex NP-hard problem that inherited its complexity from the Virtual Network Embedding (VNE). This paper proposes a new path mapping approach to solving the NFV-RA problem for decomposed Network Service Chains (NSCs). The proposed solution has symmetrically considered optimizing an average embedding cost with an enhancement on average execution time. The proposed approach has been compared to two other existing schemes using 6 and 16 scenarios of short and long simulation runs, respectively. The impact of the number of nodes, links and paths of the service requests on the proposed scheme has been studied by solving more than 122,000 service requests. The proposed Integer Linear Programming (ILP) and heuristic schemes have reduced the execution time up to 39.58% and 6.42% compared to existing ILP and heuristic schemes, respectively. Moreover, the proposed schemes have also reduced the average embedding cost and increased the profit for the service providers.

NFV Practical Implementation

2018 ◽  
pp. 175-194
Author(s):  
Lalit Pandey
Keyword(s):  
Network Architecture ◽  
Software Implementation ◽  
Virtual Network ◽  
Network Function Virtualization ◽  
Practical Implementation ◽  
Network Function ◽  
Network Functions

This chapter is focused on the traditional network architecture limitations with NFV benefits. Discussion of NFV architecture and framework as well as management and orchestration has been discussed in this chapter. Cisco VNF portfolio and virtual network functions implementation is included with software implementation of the architecture of NFV (network function virtualization). Management and orchestration functional layers as per ETSI standard. The challenges in NFV implementation is also a concern today, which is a part of this chapter.

scholarly journals VNF Placement Optimization at the Edge and Cloud †

2019 ◽  
Vol 11 (3) ◽  
pp. 69 ◽  
Author(s):  
Aris Leivadeas ◽  
George Kesidis ◽  
Mohamed Ibnkahla ◽  
Ioannis Lambadaris
Keyword(s):  
Cloud Computing ◽  
Service Providers ◽  
Research Area ◽  
End Users ◽  
Network Function Virtualization ◽  
Future Research ◽  
Cloud Infrastructure ◽  
Network Function ◽  
Computing Paradigm ◽  
Network Functions

Network Function Virtualization (NFV) has revolutionized the way network services are offered to end users. Individual network functions are decoupled from expensive and dedicated middleboxes and are now provided as software-based virtualized entities called Virtualized Network Functions (VNFs). NFV is often complemented with the Cloud Computing paradigm to provide networking functions to enterprise customers and end-users remote from their premises. NFV along with Cloud Computing has also started to be seen in Internet of Things (IoT) platforms as a means to provide networking functions to the IoT traffic. The intermix of IoT, NFV, and Cloud technologies, however, is still in its infancy creating a rich and open future research area. To this end, in this paper, we propose a novel approach to facilitate the placement and deployment of service chained VNFs in a network cloud infrastructure that can be extended using the Mobile Edge Computing (MEC) infrastructure for accommodating mission critical and delay sensitive traffic. Our aim is to minimize the end-to-end communication delay while keeping the overall deployment cost to minimum. Results reveal that the proposed approach can significantly reduce the delay experienced, while satisfying the Service Providers’ goal of low deployment costs.

scholarly journals Securing Virtual Network Function (VNF) in Telco Cloud

2020 ◽  
Author(s):  
Bharathkumar Ravichandran
Keyword(s):  
General Purpose ◽  
Virtual Network ◽  
Network Function Virtualization ◽  
Communication Architecture ◽  
Network Function ◽  
Fifth Generation ◽  
Security Challenges ◽  
5G Network ◽  
Network Functions ◽  
Computing Platforms

In the fifth generation mobile communication architecture (5G), network functions which traditionally existed as discrete hardware entities based on custom architectures, are replaced with dynamic, scalable Virtual Network Functions (VNF) that run on general purpose (x86) cloud computing platforms, under the paradigm Network Function Virtualization (NFV). The shift towards a virtualized infrastructure poses its own set of security challenges that need to be addressed. One such challenge that we seek to address in this paper is providing integrity, authenticity and confidentiality protection for VNFs.

scholarly journals Network Function Virtualization in Content-Centric Networks

2019 ◽  
Author(s):  
José Castillo-Lema ◽  
Augusto José Venâncio Neto ◽  
Flavio de Oliveira Silva ◽  
Sergio Takeo Kofuji
Keyword(s):  
Ip Networks ◽  
General Purpose ◽  
Virtual Network ◽  
Network Function Virtualization ◽  
Network Function ◽  
The Past ◽  
Central Controller ◽  
Network Functions ◽  
Extensive Effort ◽  
Hardware Platforms

Network Functions Virtualization (NFV) offers an alternative way to design, deploy, and manage networking functions and services by leveraging virtualization technologies to consolidate network functions into general-purpose hardware platforms. On the past years extensive effort has been made to evolve and mature NFV tecnologies over IP networks. However, little or no attempts at all have been made to incorporate NFV into Information-Centric Networks (ICN). This work explores the use and implementation of virtual Network Funtions (VNFS)in Content-Centric Networks (CCN), and proposes the use of the Named Function Networking (NFN) paradigm as means to implement network functions and services in this kind of networks, distributing the network functions and services through the networks nodes and providing flexibility to dynamically place functions in the network as required and without the need of a central controller.

scholarly journals Impact of the Maximum Number of Switching Reconfigurations on the Cost Saving in Network Function Virtualization Environments with Elastic Optical Interconnection

2019 ◽  
Vol 9 (23) ◽  
pp. 5167
Author(s):  
Vincenzo Eramo ◽  
Francesco G. Lavacca ◽  
Tiziana Catena
Keyword(s):  
Computational Complexity ◽  
Cost Saving ◽  
Virtual Machines ◽  
New Technology ◽  
Network Function Virtualization ◽  
Optical Interconnection ◽  
Network Function ◽  
Network Functions ◽  
The Cost ◽  
The Impact

Network Function Virtualization is based on the virtualization of the network functions and it is a new technology allowing for a more flexible allocation of cloud and bandwidth resources. In order to employ the flexibility of the technology and to adapt its use according to the traffic variation, reconfigurations of the cloud and bandwidth resources are needed by means of both migration of the Virtual Machines executing the network functions and reconfiguration of circuits interconnecting the Virtual Machines. The objective of the paper is to study the impact of the maximum number of switch reconfigurations on the cost saving that the Networking Function Virtualization technology allows us to achieve. The problem is studied in the case of a scenario with an elastic optical network interconnecting datacenters in which the Virtual Machines are executed. The problem can be formulated as an Integer Linear Programming one introducing a constraint on the maximum number of switch reconfigurations but due to its computational complexity we propose a low computational complexity heuristic allowing for results close to the optimization ones. The results show how the limitation on the number of possible reconfigurations has to be taken into account to evaluate the effectiveness in terms of cost saving that the Virtual Machine migrations in Network Function Virtualization environment allows us to achieve.

scholarly journals A VNF modeling approach for verification purposes

2019 ◽  
Vol 9 (4) ◽  
pp. 2627
Author(s):  
Guido Marchetto ◽  
Riccardo Sisto ◽  
Matteo Virgilio ◽  
Jaloliddin Yusupov
Keyword(s):  
Formal Verification ◽  
Virtual Network ◽  
Network Function Virtualization ◽  
Network Function ◽  
Specific Input ◽  
Production Environments ◽  
Verification Tools ◽  
Network Functions ◽  
New Challenges ◽  
Java Library

<span lang="EN-US">Network Function Virtualization (NFV) architectures are emerging to increase networks flexibility. However, this renewed scenario poses new challenges, because virtualized networks, need to be carefully verified before being actually deployed in production environments in order to preserve network coherency (e.g., absence of forwarding loops, preservation of security on network traffic, etc.). Nowadays, model checking tools, SAT solvers, and Theorem Provers are available for formal verification of such properties in virtualized networks. Unfortunately, most of those verification tools accept input descriptions written in specification languages that are difficult to use for people not experienced in formal methods. Also, in order to enable the use of formal verification tools in real scenarios, vendors of Virtual Network Functions (VNFs) should provide abstract mathematical models of their functions, coded in the specific input languages of the verification tools. This process is error-prone, time-consuming, and often outside the VNF developers’ expertise. This paper presents a framework that we designed for automatically extracting verification models starting from a Java-based representation of a given VNF. It comprises a Java library of classes to define VNFs in a more developer-friendly way, and a tool to translate VNF definitions into formal verification models of different verification tools.</span>

scholarly journals Multiple instances mapping of Service Function Chain with parallel Virtual Network Functions

2019 ◽  
Vol 13 ◽  
pp. 174830261986853 ◽  
Author(s):  
Dong Zhang ◽  
Xiang Lin ◽  
Xiang Chen
Keyword(s):  
Queuing Theory ◽  
Virtual Network ◽  
Network Function Virtualization ◽  
Service Function ◽  
Network Function ◽  
Integer Programing ◽  
Service Function Chain ◽  
Network Functions ◽  
Simulation Results ◽  
Mapping Scheme

Network Function Virtualization addresses the defect of traditional middleboxes and enables operators to implement new services through a process named Service Function Chain mapping. Service Function Chain is composed by a sequence of Virtual Network Functions (VNFs) which is deployed in shared platforms. Service Function Chain with parallel VNFs is proposed to reduce the delivery latency. In this paper, a multiple instances mapping scheme named MIM is proposed to resolve the performance bottleneck introduced by the imbalance of parallel VNFs. A integer programing model is established to describe the multiple instances mapping problem based on queuing theory, and a double layer Genetic Algorithm is used to allocate parallel VNFs with multiple instances. Simulation results show that the multiple instances mapping scheme can improve the performance of Service Function Chain with parallel VNFs effectively.

scholarly journals The Value of Simple Heuristics for Virtualized Network Function Placement

2020 ◽  
Vol 12 (10) ◽  
pp. 161
Author(s):  
Zahra Jahedi ◽  
Thomas Kunz
Keyword(s):  
Mathematical Models ◽  
Optimization Model ◽  
Service Providers ◽  
Network Function Virtualization ◽  
Np Hard ◽  
Placement Problem ◽  
Network Function ◽  
Main Challenge ◽  
Wide Range ◽  
Network Functions

Network Function Virtualization (NFV) can lower the CAPEX and/or OPEX for service providers and allow for quick deployment of services. Along with the advantages come some challenges. The main challenge in the use of Virtualized Network Functions (VNF) is the VNFs’ placement in the network. There is a wide range of mathematical models proposed to place the Network Functions (NF) optimally. However, the critical problem of mathematical models is that they are NP-hard, and consequently not applicable to larger networks. In wireless networks, we are considering the scarcity of Bandwidth (BW) as another constraint that is due to the presence of interference. While there exist many efforts in designing a heuristic model that can provide solutions in a timely manner, the primary focus with such heuristics was almost always whether they provide results almost as good as optimal solution. Consequently, the heuristics themselves become quite non-trivial, and solving the placement problem for larger networks still takes a significant amount of time. In this paper, in contrast, we focus on designing a simple and scalable heuristic. We propose four heuristics, which are gradually becoming more complex. We compare their performance with each other, a related heuristic proposed in the literature, and a mathematical optimization model. Our results demonstrate that while more complex placement heuristics do not improve the performance of the algorithm in terms of the number of accepted placement requests, they take longer to solve and therefore are not applicable to larger networks.In contrast, a very simple heuristic can find near-optimal solutions much faster than the other more complicated heuristics while keeping the number of accepted requests close to the results achieved with an NP-hard optimization model.

scholarly journals Proactive VNF Scaling with Heterogeneous Cloud Resources: Fusing Long Short-Term Memory Prediction and Cooperative Allocation

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Ran Xu
Keyword(s):  
Short Term Memory ◽  
Service Providers ◽  
Network Function Virtualization ◽  
Dynamic Allocation ◽  
Short Term ◽  
Term Memory ◽  
Resource Allocation Algorithm ◽  
Network Function ◽  
Network Functions ◽  
Long Short Term Memory

Network function virtualization (NFV) is designed to implement network functions by software that replaces proprietary hardware devices in traditional networks. In response to the growing demand of resource-intensive services, for NFV cloud service providers, software-oriented network functions face a number of challenges, such as dynamic deployment of virtual network functions and efficient allocation of multiple resources. This study aims at the dynamic allocation and adjustment of network multiresources and multitype flows for NFV. First, to seek a proactive approach to provision new instances for overloaded VNFs ahead of time, a model called long short-term memory recurrent neural network (LSTM RNN) is proposed to estimate flows in this paper. Then, based on the estimated flow, a cooperative and complementary resource allocation algorithm is designed to reduce resource fragmentation and improve the utilization. The final results demonstrate the advantage of the LSTM model on predicting the network function flow requirements, and our algorithm achieves good results and performance improvement in dynamically expanding network functions and improving resource utilization.

Sign in / Sign up

Export Citation Format

Share Document