Frenetic: a network programming language
The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Abstract
Modern networks provide a variety of interrelated services including routing, traffic monitoring, load balancing, and access control. Unfortunately, the languages used to program today's networks lack modern features - they are usually defined at the low level of abstraction supplied by the underlying hardware and they fail to provide even rudimentary support for modular programming. As a result, network programs tend to be complicated, error-prone, and difficult to maintain. This paper presents Frenetic, a high-level language for programming distributed collections of network switches. Frenetic provides a declarative query language for classifying and aggregating network traffic as well as a functional reactive combinator library for describing high-level packet-forwarding policies. Unlike prior work in this domain, these constructs are - by design - fully compositional, which facilitates modular reasoning and enables code reuse. This important property is enabled by Frenetic's novel run-time system which manages all of the details related to installing, uninstalling, and querying low-level packet-processing rules on physical switches. Overall, this paper makes three main contributions: (1) We analyze the state-of-the art in languages for programming networks and identify the key limitations; (2) We present a language design that addresses these limitations, using a series of examples to motivate and validate our choices; (3) We describe an implementation of the language and evaluate its performance on several benchmarks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
McKeown (2008) · doi:10.1145/1355734.1355746 · Cited by 8,513
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
Kohler, E., Morris, R., Chen, B., Jannotti, J., & Kaashoek, M. F. (2000) · ACM Transactions on Computer Systems · doi:10.1145/354871.354874 · Cited by 2,413
VL2: a scalable and flexible data center network
Greenberg, A., Hamilton, J. R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D. A., Patel, P., & Sengupta, S. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592576 · Cited by 2,111
TinyDB: an acquisitional query processing system for sensor networks
Madden, S. R., Franklin, M. J., Hellerstein, J. M., & Hong, W. (2005) · ACM Transactions on Database Systems · doi:10.1145/1061318.1061322 · Cited by 1,899
A network in a laptop: rapid prototyping for software-defined networks
Lantz, B., Heller, B., & McKeown, N. (2010) · Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks · doi:10.1145/1868447.1868466 · Cited by 1,826
The Esterel synchronous programming language: design, semantics, implementation
Berry, G., & Gonthier, G. (1992) · Science of Computer Programming · doi:10.1016/0167-6423(92)90005-v · Cited by 1,739
NOX: towards an operating system for networks
Gude, N., Koponen, T., Pettit, J., Pfaff, B., Casado, M., McKeown, N., & Shenker, S. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1384609.1384625 · Cited by 1,446
Onix: a distributed control platform for large-scale production networks
Koponen, T., Casado, M., Gude, N. S., Stribling, J., Poutievski, L., Zhu, M., Ramanathan, R., Iwata, Y., Inoue, H., Hama, T., et al. (2010) · doi:10.5555/1924943.1924968 · Cited by 1,212
The CQL continuous query language: semantic foundations and query execution
Arasu, A., Babu, S., & Widom, J. (2006) · The VLDB Journal · doi:10.1007/s00778-004-0147-z · Cited by 1,170
StreamIt: A Language for Streaming Applications
Thies, W., Karczmarek, M., & Amarasinghe, S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45937-5_14 · Cited by 1,104
(2010) · doi:10.5555/1855711.1855728 · Cited by 970
Cisco Systems NetFlow Services Export Version 9
(2004) · doi:10.17487/rfc3954 · Cited by 954
Gigascope: a stream database for network applications
Cranor, C., Johnson, T., Spataschek, O., & Shkapenyuk, V. (2003) · Proceedings of the 2003 ACM SIGMOD international conference on Management of data · doi:10.1145/872757.872838 · Cited by 687
EXPOSURE : Finding malicious domains using passive DNS analysis
Bilge, L. (2011) · Graduate School and Research Center in Digital Science (EURECOM) · Cited by 661
Fast portscan detection using sequential hypothesis testing
Jung, J., Paxson, V., Berger, A. W., & Balakrishnan, H. (2004) · IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004 · doi:10.1109/secpri.2004.1301325 · Cited by 660
SEQUEL: A structured English query language
Chamberlin, D. D., & Boyce, R. F. (1976) · Proceedings of the 1976 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control - FIDET '76 · doi:10.1145/800296.811515 · Cited by 584
OpenFlow-based server load balancing gone wild
Wang, R., Butnariu, D., & Rexford, J. (2011) · USENIX conference on Hot topics in management of internet, cloud, and enterprise networks and services · Cited by 450
Self-citationDynamic load balancing without packet reordering
Kandula, S., Katabi, D., Sinha, S., & Berger, A. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1232919.1232925 · Cited by 402
MULTOPS: A Data-Structure for Bandwidth Attack Detection
Gil, T. M., & Poletto, M. (2001) · Defense Technical Information Center (DTIC) · doi:10.21236/ada401819 · Cited by 365
Implementing declarative overlays
Loo, B. T., Condie, T., Hellerstein, J. M., Maniatis, P., Roscoe, T., & Stoica, I. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095818 · Cited by 292
Maestro: A System for Scalable OpenFlow Control
Cai, Z., Cox, A. L., & Ng, T. S. E. (2010) · Rice Research Repository (Rice University) · Cited by 290
Carving research slices out of your production networks with OpenFlow
Sherwood, R., Chan, M., Covington, A., Gibb, G., Flajslik, M., Handigol, N., Huang, T.-Y., Kazemian, P., Kobayashi, M., Naous, J., et al. (2010) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1672308.1672333 · Cited by 218
Declarative routing: extensible routing with declarative queries
Loo, B. T., Hellerstein, J. M., Stoica, I., & Ramakrishnan, R. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080126 · Cited by 211
Operator placement for in-network stream query processing
Srivastava, U., Munagala, K., & Widom, J. (2005) · Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1065167.1065199 · Cited by 207
Resonance: dynamic access control for enterprise networks
Nayak, A. K., Reimers, A., Feamster, N., & Clark, R. (2009) · Proceedings of the 1st ACM workshop on Research on enterprise networking · doi:10.1145/1592681.1592684 · Cited by 196
Practical declarative network management
Hinrichs, T. L., Gude, N. S., Casado, M., Mitchell, J. C., & Shenker, S. (2009) · Proceedings of the 1st ACM workshop on Research on enterprise networking · doi:10.1145/1592681.1592683 · Cited by 194
Rethinking Enterprise Network Control
Casado, M., Freedman, M. J., Pettit, J., Luo, J., Gude, N., McKeown, N., & Shenker, S. (2009) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2009.2026415 · Cited by 187
Self-citationFlapjax: a programming language for Ajax applications
Meyerovich, L. A., Guha, A., Baskin, J., Cooper, G. H., Greenberg, M., Bromfield, A., & Krishnamurthi, S. (2009) · ACM SIGPLAN Notices · doi:10.1145/1639949.1640091 · Cited by 169
Optimal semijoins for distributed database systems
Mullin, J. K. (1990) · IEEE Transactions on Software Engineering · doi:10.1109/32.52778 · Cited by 158
CSAMP: A System for Network-Wide Flow Monitoring
Sekar, V., Reiter, M. K., Willinger, W., Zhang, H., Kompella, R. R., & Andersen, D. G. (2018) · KiltHub Repository · doi:10.1184/r1/6604580 · Cited by 140
Adaptive functional programming
Acar, U. A., Blelloch, G. E., & Harper, R. W. (2006) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1186632.1186634 · Cited by 120
Frenetic: a high-level language for OpenFlow networks
Foster, N., Freedman, M. J., Harrison, R., Rexford, J., Meola, M. L., & Walker, D. (2010) · doi:10.1145/1921151.1921160 · Cited by 89
Self-citationFlask: staged functional programming for sensor networks
Mainland, G., Morrisett, G., & Welsh, M. (2008) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/1411204.1411251 · Cited by 72
Flask: staged functional programming for sensor networks
Mainland, G., Morrisett, G., & Welsh, M. (2008) · ACM SIGPLAN Notices · doi:10.1145/1411203.1411251 · Cited by 64
Nettle: Functional Reactive Programming for OpenFlow Networks
Voellmy, A., Agarwal, A., & Hudak, P. (2010) · doi:10.21236/ada555162 · Cited by 61
A Universal Calculus for Stream Processing Languages
Soulé, R., Hirzel, M. J., Grimm, R., Gedik, B., Andrade, H. C. M., Kumar, V., & Wu, K. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11957-6_27 · Cited by 46
Declarative routing: extensible routing with declarative queries
Loo, B. T., Hellerstein, J. M., Stoica, I. G., & Ramakrishnan, R. (2005) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1090191.1080126 · Cited by 38
Continuous distributed monitoring
Cormode, G. (2011) · doi:10.1145/2031792.2031793 · Cited by 33
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 of Software-Defined Networking: Past, Present, and Future of Programmable Networks
Nunes, B. A. A., Mendonca, M., Nguyen, X.-N., Obraczka, K., & Turletti, T. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2014.012214.00180 · Cited by 2,203
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
A survey on software-defined network and openflow: From concept to implementation
Hu, F., Hao, Q., & Bao, K. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2326417 · Cited by 752
Towards secure and dependable software-defined networks
Kreutz, D., Ramos, F. M. V., & Verissimo, P. (2013) · Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking · doi:10.1145/2491185.2491199 · Cited by 697
Metadata
- Authors
- Foster, N., Harrison, R., Freedman, M. J., Monsanto, C., Rexford, J., Story, A., & Walker, D.
- Venue
- ACM SIGPLAN Notices
- Published
- 2011-09-18
- Volume
- 46
- Issue
- 9
- Pages
- 279-291
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W2099501333
- Cited by
- 584
- References
- 39
- FWCI
- 60.75
- 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
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.