skip to main content
research-article

Concurrent NetCore: from policies to pipelines

Published:19 August 2014Publication History
Skip Abstract Section

Abstract

In a Software-Defined Network (SDN), a central, computationally powerful controller manages a set of distributed, computationally simple switches. The controller computes a policy describing how each switch should route packets and populates packet-processing tables on each switch with rules to enact the routing policy. As network conditions change, the controller continues to add and remove rules from switches to adjust the policy as needed.

Recently, the SDN landscape has begun to change as several proposals for new, reconfigurable switching architectures, such as RMT [5] and FlexPipe [14] have emerged. These platforms provide switch programmers with many, flexible tables for storing packet-processing rules, and they offer programmers control over the packet fields that each table can analyze and act on. These reconfigurable switch architectures support a richer SDN model in which a switch configuration phase precedes the rule population phase [4]. In the configuration phase, the controller sends the switch a graph describing the layout and capabilities of the packet processing tables it will require during the population phase. Armed with this foreknowledge, the switch can allocate its hardware (or software) resources more efficiently.

We present a new, typed language, called Concurrent NetCore, for specifying routing policies and graphs of packet-processing tables. Concurrent NetCore includes features for specifying sequential, conditional and concurrent control-flow between packet-processing tables. We develop a fine-grained operational model for the language and prove this model coincides with a higher-level denotational model when programs are well-typed. We also prove several additional properties of well-typed programs, including strong normalization and determinism. To illustrate the utility of the language, we develop linguistic models of both the RMT and FlexPipe architectures and we give a multi-pass compilation algorithm that translates graphs and routing policies to the RMT model.

References

  1. Concurrent netcore: From policies to pipelines. See http://tinyurl.com/k2z8lz5.Google ScholarGoogle Scholar
  2. Openflow forwarding abstractions working group charter, April 2013. See http://goo.gl/TtLtw0.Google ScholarGoogle Scholar
  3. Carolyn Jane Anderson, Nate Foster, Arjun Guha, Jean-Baptiste Jeannin, Dexter Kozen, Cole Schlesinger, and David Walker. NetKAT: Semantic foundations for networks. In POPL, January 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Pat Bosshart, Dan Daly, Martin Izzard, Nick McKeown, Jennifer Rexford, Dan Talayco, Amin Vahdat, George Varghese, and David Walker. Programming protocol-independent packet processors. See http://arxiv.org/abs/1312.1719, December 2013.Google ScholarGoogle Scholar
  5. Pat Bosshart, Glen Gibb, Hun-Seok Kim, George Varghese, Nick McKeown, Martin Izzard, Fernando A. Mujica, and Mark Horowitz. Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN. In SIGCOMM, pages 99--110, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Broadcom BCM56846 StrataXGS 10/40 GbE switch. See http://www.broadcom.com/products/features/BCM56846.php, 2014.Google ScholarGoogle Scholar
  7. C. A. R. Hoare, Bernhard Moller, Georg Struth, and Ian Wehrman. Concurrent kleene algebra. In CONCUR, pages 399--414, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Sushant Jain, Alok Kumar, Subhasree Mandal, Joon Ong, Leon Poutievski, Arjun Singh, Subbaiah Venkata, Jim Wanderer, Junlan Zhou, Min Zhu, Jonathan Zolla, Urs Hölzle, Stephen Stuart, and Amin Vahdat. B4: Experience with a globally-deployed software defined WAN. In SIGCOMM, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Nick McKeown, Tom Anderson, Hari Balakrishnan, Guru Parulkar, Larry Peterson, Jennifer Rexford, Scott Shenker, and Jonathan Turner. OpenFlow: Enabling innovation in campus networks. SIGCOMM Computing Communications Review, 38(2):69--74, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Christopher Monsanto, Nate Foster, Rob Harrison, and David Walker. A compiler and run-time system for network programming languages. In POPL, January 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Christopher Monsanto, Joshua Reich, Nate Foster, Jennifer Rexford, and David Walker. Composing software-defined networks. In NSDI, April 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Tim Nelson, Arjun Guha, Daniel J. Dougherty, Kathi Fisler, and Shriram Krishnamurthi. A balance of power: Expressive, analyzable controller programming. In HotSDN, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Recep Ozdag. Intel Ethernet Switch FM6000 Series - software defined networking. See goo.gl/AnvOvX, 2012.Google ScholarGoogle Scholar
  14. Andreas Voellmy, Hyojoon Kim, and Nick Feamster. Procera: A language for high-level reactive network control. In HotSDN, pages 43--48, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Andreas Voellmy, Junchang Wang, Y. Richard Yang, Bryan Ford, and Paul Hudak. Maple: Simplifying SDN programming using algorithmic policies. In SIGCOMM, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Nate Foster, Rob Harrison, Michael J. Freedman, Christopher Monsanto, Jennifer Rexford, Alec Story, and David Walker. Frenetic: A network programming language. In ICFP, September 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Concurrent NetCore: from policies to pipelines

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!