Proceedings of the 2016 ACM SIGCOMM Conference 2016
DOI: 10.1145/2934872.2934875
|View full text |Cite
|
Sign up to set email alerts
|

OpenBox

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
35
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 147 publications
(35 citation statements)
references
References 20 publications
0
35
0
Order By: Relevance
“…In addition to the works discussed throughout the paper, the work on NFV performance acceleration can be classified into three categories: 1 relies on hardware accelerators to improve processing speed by offloading (part of) packet processing into an FPGA, GPU, or modern NIC [20,28,45,52,53,69,87,96,98,101,104,105]; 2 focuses on NFV execution models and tries to improve the performance of either the pipeline/parallelism model [43,55,61,86,103] or run-to-completion (RTC) model [37,76]; and 3 improves the performance of NFV by reducing/eliminating redundant operations and/or merging similar packet processing elements into (one) consolidated optimized equivalent [1,12,40,44,55,85]. The second category also includes efforts toward better scheduling & load balancing [4,5,7,41,50,94] or more efficient I/O [24,25].…”
Section: Related Workmentioning
confidence: 99%
“…In addition to the works discussed throughout the paper, the work on NFV performance acceleration can be classified into three categories: 1 relies on hardware accelerators to improve processing speed by offloading (part of) packet processing into an FPGA, GPU, or modern NIC [20,28,45,52,53,69,87,96,98,101,104,105]; 2 focuses on NFV execution models and tries to improve the performance of either the pipeline/parallelism model [43,55,61,86,103] or run-to-completion (RTC) model [37,76]; and 3 improves the performance of NFV by reducing/eliminating redundant operations and/or merging similar packet processing elements into (one) consolidated optimized equivalent [1,12,40,44,55,85]. The second category also includes efforts toward better scheduling & load balancing [4,5,7,41,50,94] or more efficient I/O [24,25].…”
Section: Related Workmentioning
confidence: 99%
“…To the best of our knowledge, no existing work has explored this problem: specifically, merging two weighted DAGs into one while maximizing overlap. The most closely related works [8,43] provide suboptimal results, we elaborate on them in Section 9. Next, we more formally describe the problem.…”
Section: Merging Optimizationmentioning
confidence: 99%
“…The problem of merging two DAGs has been explored by several others [8,28,43]. At a high level, our work differs in two ways: first, we investigate a different formulation objective and second, we prove the complexity of the DAG merge problem and provide a more efficient heuristic based on simulated annealing.…”
Section: Dag-mergingmentioning
confidence: 99%
See 1 more Smart Citation
“…(1) a factor of 8 better efficiency, (2) almost 3x lower and predictable latency, and (3) 50% higher throughput than the OpenBox [16] data plane, a state of the art NFV system.…”
Section: Introductionmentioning
confidence: 99%