scholarly journals Uma Abordagem Holística para a Definição de Service Chains Utilizando Click-on-OSv sobre Diferentes Plataformas NFV

2018 ◽  
Author(s):  
Alexandre Huff ◽  
Giovanni Venâncio ◽  
Leonardo da C. Marcuzzo ◽  
Vinícius F. Garcia ◽  
Carlos R. P. dos Santos ◽  
...  
Keyword(s):  
Virtual Network ◽  
Service Function ◽  
Service Function Chain ◽  
Network Functions

A implantação de serviços em redes virtualizadas pode ser feita através da composição de várias funções implementadas como VNFs (Virtual Network Functions). A instanciação de VNFs e o encaminhamento do tráfego em uma ordem definida através das mesmas forma uma SFC (Service Function Chain). Este trabalho propõe um framework para a composição e o gerenciamento do ciclo de vida de SFCs formadas por VNFs programadas sobre o Click-on-OSv. Além disso, a proposta deste artigo amplia este contexto, possibilitando a execução de SFCs em diferentes orquestradores NFV. A abordagem proposta define uma APIúnica para a composição de SFCs que permite abstrair as especificidades dos orquestradores NFV. Um protótipo do framework foi implementado para realizar a composição e o gerenciamento de SFCs formadas por VNFs programadas com Click-on-OSv sobre o orquestrador NFV OpenStack Tacker.

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 Efficient Placement of Service Function Chains in Cloud Computing Environments

Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 323
Author(s):  
Marwa A. Abdelaal ◽  
Gamal A. Ebrahim ◽  
Wagdy R. Anis
Keyword(s):  
Energy Consumption ◽  
Load Balancing ◽  
Response Time ◽  
Optimization Problem ◽  
Service Providers ◽  
Virtual Network ◽  
Placement Problem ◽  
Service Function ◽  
Network Functions ◽  
Bandwidth Consumption

The widespread adoption of network function virtualization (NFV) leads to providing network services through a chain of virtual network functions (VNFs). This architecture is called service function chain (SFC), which can be hosted on top of commodity servers and switches located at the cloud. Meanwhile, software-defined networking (SDN) can be utilized to manage VNFs to handle traffic flows through SFC. One of the most critical issues that needs to be addressed in NFV is VNF placement that optimizes physical link bandwidth consumption. Moreover, deploying SFCs enables service providers to consider different goals, such as minimizing the overall cost and service response time. In this paper, a novel approach for the VNF placement problem for SFCs, called virtual network functions and their replica placement (VNFRP), is introduced. It tries to achieve load balancing over the core links while considering multiple resource constraints. Hence, the VNF placement problem is first formulated as an integer linear programming (ILP) optimization problem, aiming to minimize link bandwidth consumption, energy consumption, and SFC placement cost. Then, a heuristic algorithm is proposed to find a near-optimal solution for this optimization problem. Simulation studies are conducted to evaluate the performance of the proposed approach. The simulation results show that VNFRP can significantly improve load balancing by 80% when the number of replicas is increased. Additionally, VNFRP provides more than a 54% reduction in network energy consumption. Furthermore, it can efficiently reduce the SFC placement cost by more than 67%. Moreover, with the advantages of a fast response time and rapid convergence, VNFRP can be considered as a scalable solution for large networking environments.

scholarly journals Service Function Chain Placement in Distributed Scenarios: a Systematic Review

2021 ◽  
Author(s):  
Guto Leoni Santos ◽  
Diego de Freitas Bezerra ◽  
Élisson da Silva Rocha ◽  
Leylane Ferreira ◽  
André Moreira ◽  
...  
Keyword(s):  
Systematic Review ◽  
Network Performance ◽  
Network Function Virtualization ◽  
Service Function ◽  
Network Function ◽  
Network Flexibility ◽  
Specific Order ◽  
Service Function Chain ◽  
Network Functions ◽  
Traffic Oscillations

Abstract The network function virtualization (NFV) paradigm is an emerging technology that provides network flexibility by allowing the allocation of network functions over commodity hardware, like legacy servers in an IT infrastructure. In comparison with traditional network functions, implemented by dedicated hardware, the use of NFV reduces the operating and capital expenses and improves service deployment. In some scenarios, a complete network service can be composed of several functions, following a specific order, known as a service function chain (SFC). SFC placement is a complex task, already proved to be NP-hard. Moreover, in highly distributed scenarios, the network performance can also be impacted by other factors, such as traffic oscillations and high delays. Therefore, a given SFC placement strategy must be carefully developed to meet the network operator service constraints. In this paper, we present a systematic review of SFC placement advances in distributed scenarios. Differently from the current literature, we examine works over the last 10 years which addressed this problem while focusing on distributed scenarios. We then discuss the main scenarios where SFC placement has been deployed, as well as the several techniques used to create the placement strategies. We also present the main goals considered to create SFC placement strategies and highlight the metrics used to evaluate them.

scholarly journals Optimal Service Function Chain Composition in Network Functions Virtualization

2017 ◽  
pp. 62-76 ◽  
Author(s):  
Andrés F. Ocampo ◽  
Juliver Gil-Herrera ◽  
Pedro H. Isolani ◽  
Miguel C. Neves ◽  
Juan F. Botero ◽  
...  
Keyword(s):  
Service Function ◽  
Optimal Service ◽  
Chain Composition ◽  
Service Function Chain ◽  
Network Functions

scholarly journals Multi-SFC: Orquestração de SFCs Distribuídas sobre Múltiplas Nuvens em Múltiplos Domínios com Múltiplas Plataformas NFV

2019 ◽  
Author(s):  
Alexandre Huff ◽  
Giovanni Venâncio ◽  
Elias P. Duarte Jr.
Keyword(s):  
Virtual Network ◽  
Network Function Virtualization ◽  
Service Function ◽  
Network Function ◽  
Network Functions

A arquitetura NFV-MANO, amplamente adotada por soluções NFV (Network Function Virtualization) inclui o elemento NFVO (NFV Orchestrator) para apoiar a orquestração de SFC (Service Function Chaining). Este trabalho propõe uma estratégia para a orquestração de Multi-SFCs: SFCs distribuídas sobre múltiplas nuvens, possivelmente em múltiplos domínios, orquestradas por NFVOs de múltiplas plataformas NFV. Soluções existentes são monolíticas, pois se restringem a SFCs compostas por VNFs (Virtual Network Functions) de uma única nuvem/domínio/orquestrador. A estratégia proposta estabelece túneis através da instanciação de VNFs em pontos específicos da Multi-SFC, permitindo a instanciação e comunicação segura de recursos em múltiplos domínios. Diversas tarefas de gerenciamento, incluindo a configuração das infraestruturas NFV são transparentes para o operador. Resultados experimentais avaliam a solução, comparando a abordagem proposta em termos de desempenho e consumo de recursos.

Tabu Search For Service Function Chain Composition In NFV

2021 ◽  
Vol 19 (01) ◽  
pp. 17-25
Author(s):  
Juliver Gil Herrera ◽  
Juan Felipe Botero
Keyword(s):  
Tabu Search ◽  
Service Function ◽  
Chain Composition ◽  
Service Function Chain
Sign in / Sign up

Export Citation Format

Share Document