Aggregation Service Function Chain Mapping Plan based on Beetle Antennae Search Algorithm

The advent of NFV is a major revolution in the field of networking. The mapping planning of service function chains has an important influence on the performance of NFV, so it has always been the focus of research. Existing algorithms can't consider the problem well with resource consumption and link delay and find the effective mapping path. To address this issue, we propose an aggregation service chain mapping plan based on the improved BAS algorithm. First, we aggregate the service chains with the same start point and end point, then apply the improved BAS algorithm with K-shortest path algorithm(MASFC) to search the best mapping plan iteratively. The experiment result shows that the algorithm can find the effective mapping plan with the restriction of resource. It also reduces the amount of calculation, thus reduces the consumption of computing resource, and has a good performance in network delay and mapping cost.