Prioritized Deployment of Dynamic Service Function Chains

Service Function Chaining and Network Function Virtualization are enabling technologies that provide dynamic network services with diverse QoS requirements. Regarding the limited infrastructure resources, service providers need to prioritize service requests and even reject some of low-priority requests to satisfy the requirements of high-priority services. In this paper, we study the problem of deployment and reconfiguration of a set of chains with different priorities with the objective of maximizing the service provider's profit; wherein, we also consider management concerns including the ability to control the migration of virtual functions. We show the problem is more practical and comprehensive than the previous studies, and propose an MILP formulation of it along with two solving algorithms. The first algorithm is a fast polynomial-time heuristic that calculates an initial feasible solution to the problem. The second algorithm is an exact method that utilizes the initial feasible solution to achieve the optimal solution quickly. Using extensive simulations, we evaluate the algorithms and show the proposed heuristic can find a feasible solution in at least 83% of the simulation runs in less than 7 seconds, and the exact algorithm can achieve 25% more profit 8 times faster than the state-of-the-art MILP solving methods.

Automated summary

This paper studies the problem of deployment and reconfiguration of a set of chains with different priorities with the objective of maximizing the service provider's profit. It proposes a MILP formulation and two solving algorithms, showing that the proposed heuristic can find a feasible solution in at least 83% of simulation runs in less than 7 seconds. The exact algorithm achieves 25% more profit 8 times faster than state-of-the-art MILP solving methods.