A Recommendation Approach using Forwarding Graph to Analyze Mapping Algorithms for Virtual Network Functions

2019 ◽  
Vol 12 ◽  
Author(s):  
Lyes Bouali ◽  
Selma Khebbache ◽  
Samia Bouzefrane ◽  
Mehammed Daoui
Keyword(s):  
Virtual Network ◽  
Search Procedure ◽  
Adaptive Search ◽  
Mapping Algorithms ◽  
Network Function ◽  
Np Hard Problem ◽  
Substrate Network ◽  
Network Functions ◽  
Cost Efficient ◽  
Virtual Network Function

: The advent of Network Functions Virtualization (NFV) has revolutionized numerous network based applications due to its score of benefits such as flexibility, agility, scalability and Multi-tenancy. In this paper, we focus on the mapping of Virtual Network Function Forwarding Graphs (VNF-FGs) on a Substrate Network. To cope with this NP-Hard problem, we designed an algorithm based on Greedy Randomized Adaptive Search Procedure (GRASP), a cost-efficient meta-heuristic algorithm, in which the main objective is to minimize the mapping cost. Another method named MARA (Most Available Resource Algorithm) was devised with the objective of reducing the Substrate Network’s resources use at the bottleneck clusters. Performance analysis based on simulations are given to show the behavior and efficiency of our approaches.

scholarly journals CoNTe: A Core Network Temporal Blockchain for 5G

Sensors ◽  
2020 ◽  
Vol 20 (18) ◽  
pp. 5281
Author(s):  
Steven Platt ◽  
Luis Sanabria-Russo ◽  
Miquel Oliver
Keyword(s):  
Paradigm Shift ◽  
Virtual Network ◽  
Core Network ◽  
Network Function ◽  
Distributed Ledger ◽  
Distributed Ledger Technology ◽  
Network Operations ◽  
Network Functions ◽  
Network Functionality ◽  
Virtual Network Function

Virtual Network Functions allow the effective separation between hardware and network functionality, a strong paradigm shift from previously tightly integrated monolithic, vendor, and technology dependent deployments. In this virtualized paradigm, all aspects of network operations can be made to deploy on demand, dynamically scale, as well as be shared and interworked in ways that mirror behaviors of general cloud computing. To date, although seeing rising demand, distributed ledger technology remains largely incompatible in such elastic deployments, by its nature as functioning as an immutable record store. This work focuses on the structural incompatibility of current blockchain designs and proposes a novel, temporal blockchain design built atop federated byzantine agreement, which has the ability to dynamically scale and be packaged as a Virtual Network Function (VNF) for the 5G Core.

scholarly journals Scalable Cost-Efficient Placement and Chaining of Virtual Network Functions

2018 ◽  
Author(s):  
Marcelo Luizelli ◽  
Luciana Buriol ◽  
Luciano Gaspary
Keyword(s):  
Cost Model ◽  
Service Level ◽  
Virtual Network ◽  
Network Function Virtualization ◽  
Full Potential ◽  
Research Activity ◽  
Production Chain ◽  
Network Function ◽  
Network Functions ◽  
Cost Efficient

While Network Function Virtualization (NFV) is increasingly gaining momentum, with promising benefits of flexible service function deployment and reduced operations and management costs, there are several challenges that remain to be properly tackled, so that it can realize its full potential. One of these challenges, which has a significant impact on the NFV production chain, is effectively and (cost) efficiently deploying service functions, while ensuring that service level agreements are satisfied and making wise allocations of network resources. Despite recent research activity in the field, little has been done towards scalable and cost-efficient placement & chaining of virtual network functions (VNFs) – a key feature for the effective success of NFV. In this thesis, we approach VNF placement and chaining as an optimization problem in the context of Interand Intra-datacenter. We formalize the Virtual Network Function Placement and Chaining (VNFPC) problem and propose a mathematical model to solve it. Our model has established one of the first baseline comparison in the field of resource management in NFV and has been widely used in the recent literature. We also address scalability of VNFPC problem to solve large instances by proposing a novel fix-and-optimize-based heuristic algorithm for tackling it. Further, we extensively measure the performance limitations of realistic NFV deployments. Based on that, we propose an analytical model that accurately predict incurred operational costs. Then, we develop an optimal Intra-datacenter service chain deployment mechanism based on our cost model. Finally, we tackle the problem of monitoring service chains in NFV-based environments efficiently.

Sign in / Sign up

Export Citation Format

Share Document