{"id":1015,"date":"2016-11-14T13:49:22","date_gmt":"2016-11-14T12:49:22","guid":{"rendered":"https:\/\/www.kth.se\/blogs\/prophet\/?p=1015"},"modified":"2025-04-28T15:45:19","modified_gmt":"2025-04-28T13:45:19","slug":"journal-publication-on-synthesizing-network-functions","status":"publish","type":"post","link":"https:\/\/www.kth.se\/blogs\/prophet\/2016\/11\/journal-publication-on-synthesizing-network-functions\/","title":{"rendered":"Journal Publication on Synthesizing Network Functions"},"content":{"rendered":"

In our recent journal article<\/a>, we analyzed NF(V) service chains to identify their traffic classes and associate each traffic class with a newly-synthesized network function. By doing so, we eliminated I\/O and processing redundancy and achieved 40 Gbps throughput with low latency on only one machine with 8 CPU cores. The full abstract is as follows:<\/p>\n

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.<\/p>\n<\/div>","protected":false},"excerpt":{"rendered":"

In our recent journal article, we analyzed NF(V) service chains to identify their traffic classes and associate each traffic class with a newly-synthesized network function. By doing so, we eliminated I\/O and processing redundancy and achieved 40 Gbps throughput with low latency on only one machine with 8 CPU cores. The full abstract is as […]<\/p>\n","protected":false},"author":621,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"inline_featured_image":false,"footnotes":"","jetpack_post_was_ever_published":false},"categories":[1],"tags":[],"class_list":["post-1015","post","type-post","status-publish","format-standard","hentry","category-okategoriserat"],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p7bjNp-gn","_links":{"self":[{"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/posts\/1015","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/users\/621"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/comments?post=1015"}],"version-history":[{"count":4,"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/posts\/1015\/revisions"}],"predecessor-version":[{"id":1020,"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/posts\/1015\/revisions\/1020"}],"wp:attachment":[{"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/media?parent=1015"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/categories?post=1015"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/tags?post=1015"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}