.png){kind=icon}
Return
ParaGraph: Subgraph-Level Network Function Composition With Delay Balanced Parallelism
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3035229.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recent efforts in the network function virtualization (NFV) field have targeted ameliorating end-to-end latency of service function chains (SFCs) using network function (NF) composition. NF composition breaks the NF into building blocks and decides the appropriate combination for these blocks. However, two issues remain in current NF composition methods: (1) In the sequential scope, the fine-grained function's block-level composition eliminates redundancy, but with the drawback of flexibility restriction. (2) In the vertical scope, complete NF parallelism adds overhead in packet copying and reordering. To reconcile this, here we present ParaGraph, a subgraph-level NF composition with delay-balanced parallelism. ParaGraph has three main components: an NF subgraph-extraction module that extrapolates right-grained core function subgraphs from NFs; an orchestrator that dynamically composes subgraphs with delay-balanced parallelism; and an infrastructure performing lightweight packet copying and merging. We implement a ParaGraph prototype based on Click and the Data Plane Development Kit (DPDK); extensive evaluations show that with minimum overhead, ParaGraph reaches line-speed packet processing and reduces latency by up to 55% compared to state-of-the-art methods.
Keywords:
Network function virtualization
datacenter
service function chain
network function composition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
Online Parallelized Service Function Chain Orchestration in Data Center Networks.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAIShareSaveVirtual Network Function Placement for Service Chaining by Relaxing Visit Order and Non-Loop ConstraintsIEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAIShareSaveShareSaveShareSave
View more