Availability- and Traffic-Aware Placement of Parallelized SFC in Data Center Networks

Abstract

Network Function Virtualization (NFV) brings flexible provisioning and great convenience for enterprises outsource their network functions to the Data Center Networks (DCNs). Network service in NFV is deployed as a Service Function Chain (SFC), which includes an ordered set of Virtual Network Functions (VNFs). However, in one SFC, the SFC delay increases linearly as the length of SFC increases. SFC parallelism can achieve high performance of SFC. In this article, we focus on the parallelized SFC placement problem in DCN considering availability guarantee and resource optimization. Firstly, we define the parallelized SFC and propose a multi-flow backup model. The parallelized SFC consists of multiple parallelized sub-SFCs. We split large data flow into multiple small sub-flows, each of them can be transmitted in one sub-SFC. The backup model provides backup sub-SFCs for working sub-SFCs to improve availability. Finally, we design three placement strategies and a Hybrid Placement Algorithm (HPA) aimed at mapping SFCs to DCN. Evaluation results show that our proposed solutions outperform the related work. We can reduce SFC delay (30%) and optimize link consumption (reduce 40%) while guaranteeing availability (99.999%).