scholarly journals CloudSimSDN‐NFV: Modeling and simulation of network function virtualization and service function chaining in edge computing environments

2019 ◽  
Vol 49 (12) ◽  
pp. 1748-1764
Author(s):  
Jungmin Son ◽  
TianZhang He ◽  
Rajkumar Buyya
Keyword(s):  
Modeling And Simulation ◽  
Edge Computing ◽  
Network Function Virtualization ◽  
Service Function ◽  
Network Function ◽  
Computing Environments

scholarly journals Dynamic Service Function Chaining Orchestration in a Multi-Domain: A Heuristic Approach Based on SRv6

Sensors ◽  
2021 ◽  
Vol 21 (19) ◽  
pp. 6563
Author(s):  
Yutong Wu ◽  
Jinhe Zhou
Keyword(s):  
Virtual Machines ◽  
Search Algorithm ◽  
Resource Consumption ◽  
Network Function Virtualization ◽  
Ant Colony Optimization Algorithm ◽  
Network Resource ◽  
Load Pressure ◽  
Service Function ◽  
Network Function ◽  
Series Of Experiments

With the emergence of virtualization technology, Network Function Virtualization (NFV) and Software Defined Networking (SDN) make the network function abstract from the hardware and allow it to be run on virtual machines. These technologies can help to provide more efficient services to users by Service Function Chaining (SFC). The sequence of multiple VNFs required by network operators to perform traffic steering is called SFC. Mapping and deploying SFC on the physical network can enable users to obtain customized services in time. At present, a key problem in deploying SFC is how to reduce network resource consumption and load pressure while ensuring the corresponding services for users. In this paper, we first introduce an NFV architecture for SFC deployment, and illustrate the SFC orchestration process which is based on SRv6 in multi-domain scenario. Then, we propose an effective SFC dynamic orchestration algorithm. First, we use Breadth-First Search algorithm to traverse network and find the shortest path for deploying VNFs. Next, we use the improved Ant Colony Optimization algorithm to generate the optimal deployment scheme. Finally, we conduct a series of experiments to verify the performance of our algorithm. Compared with other deployment algorithms, the results show that our solution effectively optimizes end-to-end delay, bandwidth resource consumption and load balancing.

scholarly journals Path Load Adaptive Migration for Routing and Bandwidth Allocation in Mobile-Aware Service Function Chain

Electronics ◽  
2021 ◽  
Vol 11 (1) ◽  
pp. 57
Author(s):  
Hefei Hu ◽  
Chen Yang ◽  
Lingyi Xu ◽  
Tangyijia Song ◽  
Bonaho Bocochi Dalia
Keyword(s):  
Failure Rate ◽  
Bandwidth Allocation ◽  
Arrival Time ◽  
Network Function Virtualization ◽  
Estimation Model ◽  
Migration Strategy ◽  
Service Function ◽  
Network Function ◽  
Service Function Chain

With network function virtualization (NFV) expanding from network center to edge, the service function chain (SFC) will gradually approach users to provide lower delay and higher-quality services. User mobility seriously affects the quality of service (QoS) provided by the mobile-aware SFC. Therefore, we must migrate the SFC to provide continuous services. In the user estimable movement scenario with a known mobile path and estimable arrival time, we establish the estimation model of user arrival time to obtain the estimated arrival time. Then, to reduce the time that the user is waiting for the migration completion, we propose a softer migration strategy migrating mobile-aware SFC before the user arrives at the corresponding access node. Moreover, for the problem of routing and bandwidth allocation (RBA), to reduce the migration failure rate, the paper proposes a path load adaptive routing and bandwidth allocation (PLARBA) algorithm adjusting the migration bandwidth according to the path load. The experimental results show that the proposed algorithm has significant advantages in reducing the user’s waiting time by more than 90%, decreasing migration failure rate by up to 75%, and improving QoS compared to the soft migration strategy and two RBA algorithms.

scholarly journals Low-Latency and Resource-Efficient Service Function Chaining Orchestration in Network Function Virtualization

2020 ◽  
Vol 7 (7) ◽  
pp. 5760-5772 ◽  
Author(s):  
Gang Sun ◽  
Zhu Xu ◽  
Hongfang Yu ◽  
Xi Chen ◽  
Victor Chang ◽  
...  
Keyword(s):  
Network Function Virtualization ◽  
Low Latency ◽  
Service Function ◽  
Network Function

scholarly journals An Availability-Enhanced Service Function Chain Placement Scheme in Network Function Virtualization

2019 ◽  
Vol 8 (2) ◽  
pp. 34
Author(s):  
Yansen Xu ◽  
Ved P. Kafle
Keyword(s):  
Single Point ◽  
Computation Time ◽  
Network Services ◽  
Network Function Virtualization ◽  
Placement Problem ◽  
Service Function ◽  
Network Function ◽  
Multiple Substrate ◽  
Service Function Chain ◽  
End To End

A service function chain (SFC) is an ordered virtual network function (VNF) chain for processing traffic flows to deliver end-to-end network services in a virtual networking environment. A challenging problem for an SFC in this context is to determine where to deploy VNFs and how to route traffic between VNFs of an SFC on a substrate network. In this paper, we formulate an SFC placement problem as an integer linear programing (ILP) model, and propose an availability-enhanced VNF placing scheme based on the layered graphs approach. To improve the availability of SFC deployment, our scheme distributes VNFs of an SFC to multiple substrate nodes to avoid a single point of failure. We conduct numerical analysis and computer simulation to validate the feasibility of our SFC scheme. The results show that the proposed scheme outperforms well in different network scenarios in terms of end-to-end delay of the SFC and computation time cost.

Sign in / Sign up

Export Citation Format

Share Document