A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Filters
A fast compiler for NetKAT
2015
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming - ICFP 2015
Preserved Fulltext
Other Versions
This paper presents a new compiler for the NetKAT language that handles rich features including regular paths and virtual networks, and yet is several orders of magnitude faster than previous compilers ...
Making matters worse, existing compilers can take tens of minutes to generate the forwarding state for the network, even on relatively small inputs. ...
•Figure 14 : 14 Compilation time: since the global compiler leverages FDDs, we can expect automaton generation to be fast. ...
doi:10.1145/2784731.2784761
dblp:conf/icfp/SmolkaEFG15
fatcat:q2tv34ihvffylevwtnijha5xne
A fast compiler for NetKAT
2015
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
This paper presents a new compiler for the NetKAT language that handles rich features including regular paths and virtual networks, and yet is several orders of magnitude faster than previous compilers ...
Making matters worse, existing compilers can take tens of minutes to generate the forwarding state for the network, even on relatively small inputs. ...
•Figure 14 : 14 Compilation time: since the global compiler leverages FDDs, we can expect automaton generation to be fast. ...
doi:10.1145/2858949.2784761
fatcat:sg7dou6cajdjjg3nmpfbsfenjq
Temporal NetKAT
2016
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We have also implemented a compiler for temporal NetKAT, evaluated its performance on a range of benchmarks, and studied the effectiveness of several optimizations. ...
In this paper, we present a new, unified framework, called Temporal NetKAT, capable of facilitating all of these tasks at once. ...
Steffen Smolka and Nate Foster gave helpful advice on NetKAT automata and compilation strategies. This work was supported in part by the NSF under grant CNS 1111520 and in part by a gift from CISCO. ...
doi:10.1145/2980983.2908108
fatcat:ue465yzk3nhixjlcotcd6xyiua
Temporal NetKAT
2016
Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2016
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We have also implemented a compiler for temporal NetKAT, evaluated its performance on a range of benchmarks, and studied the effectiveness of several optimizations. ...
In this paper, we present a new, unified framework, called Temporal NetKAT, capable of facilitating all of these tasks at once. ...
Steffen Smolka and Nate Foster gave helpful advice on NetKAT automata and compilation strategies. This work was supported in part by the NSF under grant CNS 1111520 and in part by a gift from CISCO. ...
doi:10.1145/2908080.2908108
dblp:conf/pldi/BeckettGW16
fatcat:cqcsc2ljkbhb7idou6bnufkhtu
Event-driven network programming
2016
Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2016
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We define an extension of the NetKAT language with mutable state, give semantics to stateful programs using NESs, and discuss provably-correct strategies for implementing NESs in SDNs. ...
Acknowledgments Many thanks to the anonymous PLDI reviewers for offering helpful and constructive comments, as well as Zach Tatlock for shepherding our paper and providing useful feedback. ...
We interface with Frenetic's NetKAT compiler to produce flow-table rules for each of these NetKAT programs. • We modified the OpenFlow 1.0 reference implementation to support the custom switch/controller ...
doi:10.1145/2908080.2908097
dblp:conf/pldi/McClurgHFC16
fatcat:yeb5gkkqkfaefpr4u22fthugx4
Event-driven network programming
2016
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
We define an extension of the NetKAT language with mutable state, give semantics to stateful programs using NESs, and discuss provably-correct strategies for implementing NESs in SDNs. ...
Acknowledgments Many thanks to the anonymous PLDI reviewers for offering helpful and constructive comments, as well as Zach Tatlock for shepherding our paper and providing useful feedback. ...
We interface with Frenetic's NetKAT compiler to produce flow-table rules for each of these NetKAT programs. • We modified the OpenFlow 1.0 reference implementation to support the custom switch/controller ...
doi:10.1145/2980983.2908097
fatcat:zuiktfwr2bctviz6wxgabd7sza
Kleene Algebra Modulo Theories
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2021 pre-print arXiv:1707.02894v4 fatcat:xi5raxh46zb3xkadbw3epjql2qOther Versions
Our framework is based on pushback, a way of specifying how predicates and actions interact, first used in Temporal NetKAT. ...
Finally, we provide an OCaml implementation that closely matches the theory: with only a few declarations, users can automatically derive an automata-theoretic decision procedure for a KAT. ...
We offer a fast path to a "minimum viable model" for those wishing to explore KATs formally or in code.
What is a KAT? ...
arXiv:1707.02894v5
fatcat:d5xytniwxngdnjrrlyu523etky
Clippy(ing) Network Functions: Towards Better Abstractions for Checking and Designing Network Programs
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In keeping with this view, we present a unique approach for adding and generating both static checks and dynamic contracts for specifying and checking packet processing operations. ...
When programming network functions, changes within a packet tend to have consequences---side effects which must be accounted for by network programmers or administrators via arbitrary logic and an innate ...
NetBricks uses DPDK [31] for fast packet I/O, which we have properly set up within the VM and container. ...
arXiv:1812.11145v1
fatcat:xlbsv24mzjan7iixrbrisbcijy
SNAP
2016
Proceedings of the 2016 conference on ACM SIGCOMM 2016 Conference - SIGCOMM '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The SNAP compiler relieves programmers of having to worry about how to distribute, place, and optimize access to these stateful arrays by doing it all for them. ...
We have implemented a prototype compiler and applied it to about 20 SNAP programs over various topologies to demonstrate our techniques' scalability. ...
We thank our shepherd, Sujata Banerjee, and the anonymous reviewers for their thoughtful feedback; Changhoon Kim, Nick McKeown, Arjun Guha, and Anirudh Sivaraman for helpful discussions; and Nick Feamster ...
doi:10.1145/2934872.2934892
dblp:conf/sigcomm/ArashlooK0RW16
fatcat:4xw26mrdavgnzjksaqmeyrvujm
P4CEP
2018
Proceedings of the 2018 Morning Workshop on In-Network Computing - NetCompute '18
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2018 pre-print arXiv:1806.04385v1 fatcat:6ds4muleqfguplenwqgwozjvrm
In this paper, we present a novel case for in-network computing, namely, Complex Event Processing (CEP). ...
We show that it is feasible to express CEP operations in P4 and also present a tool to compile CEP operations, formulated in our P4CEP rule specification language, to P4 code. ...
Stateful NetKAT is a language for event-driven network programming [14] , extending the NetKAT language by mutable state. ...
doi:10.1145/3229591.3229593
dblp:conf/sigcomm/0001MDMBR18
fatcat:lgz75hvmrvf67bhz7d6sbk3ivq
SNAP: Stateful Network-Wide Abstractions for Packet Processing
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The SNAP compiler relieves programmers of having to worry about how to distribute, place, and optimize access to these stateful arrays by doing it all for them. ...
We have implemented a prototype compiler and applied it to about 20 SNAP programs over various topologies to demonstrate our techniques' scalability. ...
We thank our SIG-COMM'16 shepherd, Sujata Banerjee, and the anonymous SIGCOMM'16 reviewers for their thoughtful feedback; Changhoon Kim, Nick McKeown, Arjun Guha, and Anirudh Sivaraman for helpful discussions ...
arXiv:1512.00822v2
fatcat:cpjequdeovbo7d23h2wph66lam
Abstractions for software-defined networks
2014
Communications of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our work is supported by NSF grant CNS-1111698, ONR award N00014-12-1-0757, a Sloan Research Fellowship, and a Google Research Award. ...
The authors wish to thank Shrutarshi Basu, Andrew Ferguson, Anil Madhavapeddy, Mark Reitblatt, Jennifer Rexford, Mooly Sagiv, Steffen Smolka, Robert Soulé, David Walker, and the CACM reviewers for helpful ...
For planned changes, this may be acceptable, but when reacting to failures, a fast response is essential [39] . ...
doi:10.1145/2661061.2661063
fatcat:zci2j5qbubdijed2n2u24vvos4
Modeling and Analysis of SDN Control Applications using Vector Spaces
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
There is a great need for a framework to reason about the behavior of the various SDN applications. ...
Finally, we present an analytical formulation for such framework, and discuss a use-case. For simplicity, we only consider the case of OpenFlow version 1.0. ...
The authors would like to thank Jason Jaskolka for his invaluable remarks on an earlier draft of the paper. ...
arXiv:1710.05252v1
fatcat:k2qpv4pnhvg3dopfmthv7cjdbm
From model to implementation: a network algorithm programming language
2020
Science China Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
and expansion of network devices and constraints; (3) a declarative paradigm for the fast design of forwarding policies; (4) a built-in library for complex algorithm implementation; (5) full compatibility ...
with C++ programming; and (6) userfriendly debugging support when compiling NAPL into highly readable C++ codes. ...
devices and constraints; (3) a declarative paradigm for fast forwarding-policy design; (4) a built-in library for complex algorithm implementation; (5) easy embedding of C++ libraries and code fragments ...
doi:10.1007/s11432-019-2644-8
fatcat:3pxvjexhpjcafa5ddcxruiaegq
Genesis: synthesizing forwarding tables in multi-tenant networks
2017
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Acknowledgments We thank the anonymous reviewers, Nate Foster, Aaron Gember-Jacobson, Raajay Viswanathan and Brent Stephens for their insightful feedback and suggestions. ...
NetKAT is a domain-specific language and logic for specifying and verifying network packet-processing functions for SDN, based on Kleene algebra with tests (KAT). ...
While this encoding is fast when updating a single path, we do not see a way to extend it to our global synthesis setting. ...
doi:10.1145/3009837.3009845
fatcat:75gwprmoajfilp5ijrhdd2h5ky
« Previous
Showing results 1 — 15 out of 54 results