Prioritized Deployment of Dynamic Service Function Chains

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