Logo image
Finding the Optimal Reconfiguration for Network Function Virtualization Orchestration with Time-varied Workload
Conference paper

Finding the Optimal Reconfiguration for Network Function Virtualization Orchestration with Time-varied Workload

Satyajit Padhy and Jerry Chou
SNTA 2020 - Proceedings of the 3rd International Workshop on Systems and Network Telemetry and Analytics, pp.49-52
06/2020

Abstract

NFV orchestration optimization reconfiguration Computational Theory and Mathematics Computer Science Applications Software
Network Function Virtualization (NFV) replaces proprietary network appliances by softwarizing them in commodity servers and they are called as Virtual Network Functions(VNFs). As the network traffic changes dynamically, it is challenging to find the exact number of VNFs that can process the increase in demand. Moreover a VNF reconfiguration solution like migration or scaling has to be carefully chosen so that the increased traffic can be processed without violating the Quality of Service. We call this problem as VNF reconfiguration problem and provide an Integer Linear Programming formulation with implementation in CPLEX solver. From our simulations, we have concluded that our optimal formulation returns an efficient VNF embedding solution while reducing the reconfiguration costs. Scaling up VNFs are the most preferred choice but as the traffic increases significantly, scaling out VNFs are chosen more than other solution. Moreover our reconfiguration method has 30% less reconfiguration cost compared to other methods.

Metrics

1 Record Views

Details

Logo image