skip to main content
research-article

Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN

Published: 27 August 2013 Publication History

Abstract

In Software Defined Networking (SDN) the control plane is physically separate from the forwarding plane. Control software programs the forwarding plane (e.g., switches and routers) using an open interface, such as OpenFlow. This paper aims to overcomes two limitations in current switching chips and the OpenFlow protocol: i) current hardware switches are quite rigid, allowing ``Match-Action'' processing on only a fixed set of fields, and ii) the OpenFlow specification only defines a limited repertoire of packet processing actions. We propose the RMT (reconfigurable match tables) model, a new RISC-inspired pipelined architecture for switching chips, and we identify the essential minimal set of action primitives to specify how headers are processed in hardware. RMT allows the forwarding plane to be changed in the field without modifying hardware. As in OpenFlow, the programmer can specify multiple match tables of arbitrary width and depth, subject only to an overall resource limit, with each table configurable for matching on arbitrary fields. However, RMT allows the programmer to modify all header fields much more comprehensively than in OpenFlow. Our paper describes the design of a 64 port by 10 Gb/s switch chip implementing the RMT model. Our concrete design demonstrates, contrary to concerns within the community, that flexible OpenFlow hardware switch implementations are feasible at almost no additional cost or power.

References

[1]
P. Bosshart. Low power TCAM. US Patent 8,125,810, Feb. 2012.
[2]
P. Bosshart et al. Forwarding Metamorphosis: Fast Programmable Match-Action Processing in Hardware for SDN (Extended Version). 2013. http://yuba. stanford.edu/~grg/docs/chip-techreport-2013.pdf.
[3]
Brocade. Software-Defined Networking. http://www.brocade.com/launch/sdn/index.html.
[4]
F. Chung et al. Parallelism versus memory allocation in pipelined router forwarding engines. Theory of Computing Systems, 39(6):829--849, 2006.
[5]
Cisco. QuantumFlow Processor. http://newsroom.cisco.com/dlls/2008/hd_030408b.html.
[6]
L. De Carli et al. PLUG: exible lookup modules for rapid deployment of new protocols in high-speed routers. SIGCOMM '09.
[7]
M. Dobrescu et al. RouteBricks: exploiting parallelism to scale software routers. In Proc. SOSP '09.
[8]
N. Dukkipati. Rate Control Protocol (RCP). PhD thesis, Stanford University, 2008.
[9]
EZchip. NP-5 Network Processor. http://www.ezchip.com/p_np5.htm.
[10]
D. Fotakis et al. Space efficient hash tables with worst case constant access time. Theory of Computing Systems, 38:229--248, 2005.
[11]
J. Fu and J. Rexford. Efficient IP-address lookup with a shared forwarding table for multiple virtual routers. In Proc. ACM CoNEXT '08.
[12]
S. Han et al. PacketShader: a GPU-accelerated software router. SIGCOMM '10.
[13]
U. Hölzle. OpenFlow@Google. In Open Networking Summit, April 2012. http://opennetsummit.org/archives/apr12/hoelzle-tue-openflow.pdf.
[14]
HP. OpenFlow--Software-Defined Network (SDN). http://www.hp.com/OpenFlow/.
[15]
IEEE Std 802.1ag-2007: Amendment 5: Connectivity Fault Management. 2007.
[16]
IEEE Std 802.1ah-2008: Amendment 7: Provider Backbone Bridges. 2008.
[17]
IETF. RFC 5810 ForCES Protocol Specification, March 2010.
[18]
IETF. RFC 6052 IPv6 Addressing of IPv4/IPv6 Translators, October 2010.
[19]
IETF. NVGRE: Network Virtualization using Generic Routing Encapsulation, Feb. 2013. https://tools.ietf.org/html/draft-sridharan-virtualization-nvgre-02.
[20]
IETF. Overlay Transport Virtualization, Feb. 2013. https://tools.ietf.org/html/draft-hasmit-otv-04.
[21]
IETF. A Stateless Transport Tunneling Protocol for Network Virtualization (STT), Mar. 2013. https://tools.ietf.org/html/draft-davie-stt-03.
[22]
IETF. VXLAN: A Framework for Overlaying Virtualized Layer 2 Networks over Layer 3 Networks, May 2013. https://tools.ietf.org/html/draft-mahalingam-dutt-dcops-vxlan-04.
[23]
Indigo--Open Source OpenFlow Switches. http://www.openflowhub.org/display/Indigo/Indigo+-+Open+Source+OpenFlow+Switches.
[24]
Intel Ethernet Switch Silicon FM6000.http://ark.intel.com/products/series/64370.
[25]
ITU-T. OAM Functions and Mechanisms for Ethernet Based Networks G.8013/Y.1731, 2011.
[26]
A. Kirsch et al. More Robust Hashing: Cuckoo Hashing with a Stash. SIAM J. Comput., 39(4):1543--1561, Dec. 2009.
[27]
N. McKeown et al. OpenFlow: enabling innovation in campus networks. SIGCOMM '08.
[28]
NEC. ProgrammableFlow Networking. http://www.necam.com/SDN/.
[29]
Netronome. NFP-6xxx Flow Processor. http://www.netronome.com/pages/flow-processors/.
[30]
Open Networking Foundation. Fowarding Abstractions Working Group. https://www.opennetworking.org/working-groups/forwarding-abstractions.
[31]
Open Networking Foundation. OpenFlow Switch Specification. Version 1.3.1.
[32]
R. Pagh and F. F. Rodler. Cuckoo hashing. In Journal of Algorithms, pages 122--144, 2004.
[33]
S. Ramabhadran and G. Varghese. Efficient implementation of a statistics counter architecture. In Proc. SIGMETRICS '03.
[34]
M. Reitblatt et al. Abstractions for network update. SIGCOMM '12.
[35]
Xilinx. 7 series FPGA overview. http://www.xilinx.com/support/documentation/data_sheets/ds180_7Series_Overview.pdf.

Cited By

View all

Index Terms

  1. Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM SIGCOMM Computer Communication Review
    ACM SIGCOMM Computer Communication Review  Volume 43, Issue 4
    October 2013
    595 pages
    ISSN:0146-4833
    DOI:10.1145/2534169
    Issue’s Table of Contents
    • cover image ACM Conferences
      SIGCOMM '13: Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
      August 2013
      580 pages
      ISBN:9781450320566
      DOI:10.1145/2486001
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 27 August 2013
    Published in SIGCOMM-CCR Volume 43, Issue 4

    Check for updates

    Author Tags

    1. reconfigurable match tables
    2. rmt model
    3. sdn

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)903
    • Downloads (Last 6 weeks)145
    Reflects downloads up to 07 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media