scholarly journals Joint Optimization of Service Function Chaining and Resource Allocation in Network Function Virtualization

IEEE Access ◽  
2016 ◽  
Vol 4 ◽  
pp. 8084-8094 ◽  
Author(s):  
Luhan Wang ◽  
Zhaoming Lu ◽  
Xiangming Wen ◽  
Raymond Knopp ◽  
Rohit Gupta
Sensors ◽  
2021 ◽  
Vol 21 (19) ◽  
pp. 6563
Author(s):  
Yutong Wu ◽  
Jinhe Zhou

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.


Electronics ◽  
2021 ◽  
Vol 11 (1) ◽  
pp. 57
Author(s):  
Hefei Hu ◽  
Chen Yang ◽  
Lingyi Xu ◽  
Tangyijia Song ◽  
Bonaho Bocochi Dalia

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.


2020 ◽  
Vol 7 (7) ◽  
pp. 5760-5772 ◽  
Author(s):  
Gang Sun ◽  
Zhu Xu ◽  
Hongfang Yu ◽  
Xi Chen ◽  
Victor Chang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document