Network services (e.g., Firewalls, Network Address Translators (NATs), load balancers and Intrusion Detection Systems (IDSs )) are nowadays considered as a key component in keeping the network running at all times. The time and cost of deploying these services are recently considered as critical challenges for network providers. Network Functions Virtualization (NFV) is a promising solution to offer cost-efficient, scalable and more rapid deployment of such services. It allows the implementation of fine-grained services as a chain of Virtual Network Functions (VNFs). These chains need to be deployed and operated in the network. The chain placement is critical since it effects on both quality of service (QoS) and the provider cost.
In order to provide cost efficiency, we proposed a Cost-efficient Centrality-based VNF Placement and chaining algorithm (CCVP)  as one of the recent solution for cost-efficient network service provisioning.
The CCVP uses the Betweenness centrality and flow source modification(FSM) techniques. The objective of CCVP is to find the optimal number of VNFs along with their locations in such a manner that the provider cost is minimized.
CCVP has been already simulated, evaluated and also compared with the integer linear program (ILP) proposed in .However, we are going to evaluate CCVP in a real platform SoftFIRE  in order to further evaluate the algorithm and to compare experimental results with the simulation outcomes. Implementing CCVP in SoftFIRE gives the great opportunity of evaluating the CCVP on a federated and distributed platform that suits the CCVP goals.
 S. Ahvar, H. Pann Phyu, S. M. Buddhacharya, E. Ahvar, N. Crespi, R. Glitho, “CCVP: Cost-efficient Centrality-based VNF Placement and Chaining algorithm for network service provisioning”, NetSoft 2017.
- Projects 6
- Followers 340