.png){kind=icon}
Return
Composing and deploying parallelized service function chains
.png){kind=icon}
OA
AI
DOI：10.1016/j.jnca.2020.102637.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Network Function Virtualization (NFV) provides great flexibility in solving the problem of deploying service function chains (SFCs). The existing serial SFCs organize virtual network functions (VNFs) in a predefined order and execute the VNFs one by one, which can result in high SFC delay as the lengths of the SFCs increases. In order to address this problem, in this work, the SFC parallelization is adopted to accelerate the SFCs. Furthermore, a heuristic algorithm is proposed to solve the problem of deploying parallelized SFCs. Specifically, a distributed NFV architecture is used to implement parallelized SFCs, and an effective algorithm is developed to parallelize serial SFCs based on the VNF dependency. Further, a heuristic algorithm is proposed to deploy the parallelized SFCs onto a distributed network with the objective to minimize the average SFC delay. The simulation results show that the proposed algorithm can significantly reduce the SFC delay, increase the utilization efficiency of node resources, and obtain a high acceptance rate of user requests.
Keywords:
Service function chain parallelism
Service acceleration
Parallel processing architecture
Network function virtualization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8
Papers:
3.6K
Citations:
1.1W
Organization
Cited Papers
Online Parallelized Service Function Chain Orchestration in Data Center Networks.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAIShareSave
ShareSaveShareSaveShareSaveShareSave
View more