ParaGraph: Subgraph-Level Network Function Composition With Delay Balanced Parallelism

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.

[1]  Vyas Sekar,et al.  Design and Implementation of a Consolidated Middlebox Architecture , 2012, NSDI.

[2]  K. K. Ramakrishnan,et al.  NetVM: High Performance and Flexible Networking Using Virtualization on Commodity Platforms , 2014, IEEE Transactions on Network and Service Management.

[3]  Yongqiang Xiong,et al.  ClickNP: Highly Flexible and High Performance Network Processing with Reconfigurable Hardware , 2016, SIGCOMM.

[4]  Thomas D. Nadeau,et al.  Problem Statement for Service Function Chaining , 2015, RFC.

[5]  Carlos Pignataro,et al.  Service Function Chaining (SFC) Architecture , 2015, RFC.

[6]  Giacomo Verticale,et al.  Impact of processing costs on service chain placement in network functions virtualization , 2015, 2015 IEEE Conference on Network Function Virtualization and Software Defined Network (NFV-SDN).

[7]  Hongbo Zhu,et al.  Dynamic Embedding and Scheduling of Service Function Chains for Future SDN/NFV-Enabled Networks , 2019, IEEE Access.

[8]  Roberto Bifulco,et al.  ClickOS and the Art of Network Function Virtualization , 2014, NSDI.

[9]  Laurent Mathy,et al.  Fast userspace packet processing , 2015, 2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[10]  Wenfei Wu,et al.  Redundant Logic Elimination in Network Functions , 2018, SIGCOMM Posters and Demos.

[11]  Julije Ozegovic,et al.  Enhancing VNF's performance using DPDK driven OVS user-space forwarding , 2017, 2017 25th International Conference on Software, Telecommunications and Computer Networks (SoftCOM).

[12]  Anat Bremler-Barr,et al.  OpenBox: A Software-Defined Framework for Developing, Deploying, and Managing Network Functions , 2016, SIGCOMM.

[13]  Shunsuke Homma,et al.  Service Function Chaining Use Cases In Data Centers , 2017 .

[14]  Diego Lopez,et al.  Service Function Chaining Use Cases in Mobile Networks , 2019 .

[15]  Scott Shenker,et al.  E2: a framework for NFV applications , 2015, SOSP.

[16]  Wei Chang,et al.  Implementation of Multipath Network Virtualization With SDN and NFV , 2018, IEEE Access.

[17]  Ion Stoica,et al.  A policy-aware switching layer for data centers , 2008, SIGCOMM '08.

[18]  Meral Shirazipour,et al.  StEERING: A software-defined networking for inline service chaining , 2013, 2013 21st IEEE International Conference on Network Protocols (ICNP).

[19]  Mohamed Ahmed,et al.  Enabling dynamic network processing with clickOS , 2012, SIGCOMM '12.

[20]  Mira Mezini,et al.  Towards safe modular composition of network functions , 2018, Programming.

[21]  Gerald Q. Maguire,et al.  SNF: Synthesizing high performance NFV service chains , 2016, PeerJ Prepr..

[22]  Katerina J. Argyraki,et al.  RouteBricks: exploiting parallelism to scale software routers , 2009, SOSP '09.

[23]  David S. Johnson,et al.  A 71/60 theorem for bin packing , 1985, J. Complex..

[24]  Eddie Kohler,et al.  The Click modular router , 1999, SOSP.

[25]  Georgios Xilouris,et al.  Enhancing VNF performance by exploiting SR-IOV and DPDK packet processing acceleration , 2015, 2015 IEEE Conference on Network Function Virtualization and Software Defined Network (NFV-SDN).

[26]  Chen Sun,et al.  NFP: Enabling Network Function Parallelism in NFV , 2017, SIGCOMM.

[27]  K. K. Ramakrishnan,et al.  OpenNetVM: A Platform for High Performance NFV Service Chains , 2018, SOSR.

[28]  Bo Han,et al.  ParaBox: Exploiting Parallelism for Virtual Network Functions in Service Chaining , 2017, SOSR.

[29]  Mingwei Xu,et al.  SmartChain: Enabling High-Performance Service Chain Partition between SmartNIC and CPU , 2020, ICC 2020 - 2020 IEEE International Conference on Communications (ICC).

[30]  Nick Feamster,et al.  A slick control plane for network middleboxes , 2013, HotSDN '13.

[31]  Robert Ricci,et al.  Fast and flexible: Parallel packet processing with GPUs and click , 2013, Architectures for Networking and Communications Systems.

[32]  David A. Maltz,et al.  Network traffic characteristics of data centers in the wild , 2010, IMC '10.

[33]  Wolfgang Kellerer,et al.  QoS-driven function placement reducing expenditures in NFV deployments , 2017, 2017 IEEE International Conference on Communications (ICC).

[34]  Eiji Oki,et al.  Virtual Network Function Placement for Service Chaining by Relaxing Visit Order and Non-Loop Constraints , 2019, IEEE Access.

[35]  Mohsen Guizani,et al.  Online Parallelized Service Function Chain Orchestration in Data Center Networks , 2019, IEEE Access.

[36]  Nick Feamster,et al.  Programming slick network functions , 2015, SOSR.