The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A compiler and run-time system for network programming languages
Abstract
Software-defined networks (SDNs) are a new kind of network architecture in which a controller machine manages a distributed collection of switches by instructing them to install or uninstall packet-forwarding rules and report traffic statistics. The recently formed Open Networking Consortium, whose members include Google, Facebook, Microsoft, Verizon, and others, hopes to use this architecture to transform the way that enterprise and data center networks are implemented. In this paper, we define a high-level, declarative language, called NetCore, for expressing packet-forwarding policies on SDNs. NetCore is expressive, compositional, and has a formal semantics. To ensure that a majority of packets are processed efficiently on switches---instead of on the controller---we present new compilation algorithms for NetCore and couple them with a new run-time system that issues rule installation commands and traffic-statistics queries to switches. Together, the compiler and run-time system generate efficient rules whenever possible and outperform the simple, manual techniques commonly used to program SDNs today. In addition, the algorithms we develop are generic, assuming only that the packet-matching capabilities available on switches satisfy some basic algebraic laws. Overall, this paper delivers a new design for a high-level network programming language; an improved set of compiler algorithms; a new run-time system for SDN architectures; the first formal semantics and proofs of correctness in this domain; and an implementation and evaluation that demonstrates the performance benefits over traditional manual techniques.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bro: a system for detecting network intruders in real-time
Paxson, V. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00112-7 · Cited by 2,636
(2010) · doi:10.5555/1855711.1855728 · Cited by 970
Cited by
Software-Defined Networking: A Comprehensive Survey
Kreutz, D., Ramos, F. M. V., Esteves Verissimo, P., Esteve Rothenberg, C., Azodolmolky, S., & Uhlig, S. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2371999 · Cited by 5,050
A Survey on Software-Defined Networking
Xia, W., Wen, Y., Foh, C. H., Niyato, D., & Xie, H. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2330903 · Cited by 1,096
Security in Software Defined Networks: A Survey
Ahmad, I., Namal, S., Ylianttila, M., & Gurtov, A. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2474118 · Cited by 504
The beacon openflow controller
Erickson, D. (2013) · Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking · doi:10.1145/2491185.2491189 · Cited by 431
SPHINX: Detecting Security Attacks in Software-Defined Networks
Dhawan, M., Poddar, R., Mahajan, K., & Mann, V. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23064 · Cited by 378
Metadata
- Authors
- Monsanto, C., Foster, N., Harrison, R., & Walker, D.
- Venue
- ACM SIGPLAN Notices
- Published
- 2012-01-18
- Volume
- 47
- Issue
- 1
- Pages
- 217-230
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W2047339217
- Cited by
- 201
- References
- 2
- FWCI
- 36.72
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A compiler and run-time system for network programming languages. https://app.cochat.ai/papers/10.1145/2103621.2103685
- The paper
- Monsanto, C., Foster, N., Harrison, R., & Walker, D. (2012). A compiler and run-time system for network programming languages. ACM SIGPLAN Notices. https://doi.org/10.1145/2103621.2103685
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.