Open AccessSNF: synthesizing high performance NFV service chains
Author(s) -
Georgios P. Katsikas,
Marcel Enguehard,
Maciej Kuźniar,
Gerald Q. Maguire,
Dejan Kostić
Publication year - 2016
Publication title -
peerj computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.927
H-Index - 70
ISSN - 2376-5992
DOI - 10.7717/peerj-cs.98
Subject(s) - stateful firewall , network functions virtualization , computer science , openflow , computer network , service (business) , software defined networking , set (abstract data type) , baseline (sea) , network packet , distributed computing , operating system , programming language , cloud computing , oceanography , economy , economics , geology
In this paper we introduce SNF, a framework that synthesizes (S) network function (NF) service chains by eliminating redundant I/O and repeated elements, while consolidating stateful cross layer packet operations across the chain. SNF uses graph composition and set theory to determine traffic classes handled by a service chain composed of multiple elements. It then synthesizes each traffic class using a minimal set of new elements that apply single-read-single-write and early-discard operations. Our SNF prototype takes a baseline state of the art network functions virtualization (NFV) framework to the level of performance required for practical NFV service deployments. Software-based SNF realizes long (up to 10 NFs) and stateful service chains that achieve line-rate 40 Gbps throughput (up to 8.5x greater than the baseline NFV framework). Hardware-assisted SNF, using a commodity OpenFlow switch, shows that our approach scales at 40 Gbps for Internet Service Provider-level NFV deployments.
QC 20170626
European Union Horizon 2020 BEhavioural BAsed forwarding (BEBA)European Research Council (ERC) PROPHEAccelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom