Performance Evaluation of Service Functions Chain Placement Algorithms in Edge Cloud

The emergence of Network Function Virtualization (NFV) paradigm has become a potential solution dealing with the rapid growth of the global Internet traffic in the last decades. There, network appliances are transformed into Virtual Network Functions (VNF) running on standard server. This promises to significantly reduce overall cost and energy consumption. Additionally, hardware-based network function chain is replaced by a chain of the VNFs, called Service Function Chain (SFC). The expected benefit of SFC is the reduction in the complexity when deploying heterogeneous network services. However, the considerable drawback of SFC is the distribution of the VNFs over different hosts. An inefficient placement of VNFs can induce a high latency within the chain and wasted server resources. In this work, we propose four placement algorithms that aim to efficiently place the SFC in servers with regard to minimizing service response time and resource utilization. Herein, heuristic approaches are evaluated against optimal solutions for the placement problems, which are formulated by using Integer Linear Programming. We evaluate and compare these placement strategies in a simulator. Our result shows that the optimized solutions produce lowest service response time and least server utilization in all types of simulated SFCs. On the other hand, the heuristic algorithms are also able to come close to the optimum by simple placing rules.