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

Flow-level state transition as a new switch primitive for SDN

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
50
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
2
2
2

Relationship

0
6

Authors

Journals

citations
Cited by 45 publications
(50 citation statements)
references
References 1 publication
0
50
0
Order By: Relevance
“…Therefore, we evaluated how the compiler's performance scales with policy size using the example programs from Table 3. Given that these programs are taken from recent papers and tools in the literature [5,21,8,36], we believe they form a fair benchmark for our evaluation. Except for TCP state machine, the example programs are similar in size and complexity to the DNS tunnel example ( §2).…”
Section: Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…Therefore, we evaluated how the compiler's performance scales with policy size using the example programs from Table 3. Given that these programs are taken from recent papers and tools in the literature [5,21,8,36], we believe they form a fair benchmark for our evaluation. Except for TCP state machine, the example programs are similar in size and complexity to the DNS tunnel example ( §2).…”
Section: Methodsmentioning
confidence: 99%
“…We have implemented several stateful network functions (Table 3) that are typically relegated to middleboxes in SNAP. Examples were taken from the Chimera [5], FAST [21], and Bohatei [8] systems. The code can be found in the extended version [42].…”
Section: Language Expressivenessmentioning
confidence: 99%
See 2 more Smart Citations
“…Pioneering research in this field has focused on the following key technical aspects: Identification of new programmable switch architectures. Examples: SDPA, FAST, and OpenState . High‐level programming languages and compilers which could exploit programmable data planes.…”
Section: Introductionmentioning
confidence: 99%