Cost-efficient virtual network function chaining over NFV-based telecommunications networks
Carlos Galdamez, RAJ SEKHAR PAMULA, Zilong Ye · 2017
Network Function Visualization (NFV) enables the softwarization of network functions on standardized commodity hardware, which is promising to help the network carriers to achieve a lower investment cost, a shorter time to deployment, as well as a more flexible and dynamic way of network configuration and management. One of the key challenges is how to efficiently place and chain the software-based virtual network functions in the physical substrate to provision the requested network service while minimizing the physical network cost. In this paper, we mathematically formulate the virtual network function chaining problem using Integer Linear Programming (ILP), in order to facilitate an optimal solution. In addition, we propose a set of heuristic algorithms to efficiently solve this problem. The proposed Close To Destination (CTD) algorithm can achieve a near-optimal physical network cost that is close to the optimal result obtained from the ILP solution, but with a very low computational complexity. Comprehensive simulations are conducted to evaluate the proposed approaches, and the results demonstrate the effectiveness of the proposed CTD algorithm.