Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Normal Forms for Match-Action Programs
MTA-BME Network Softwarization Research Group.
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science, Communication Systems, CoS, Network Systems Laboratory (NS Lab).ORCID iD: 0000-0002-9675-9729
MTA-BME Information Systems Research Group.
2019 (English)In: Proceedings CoNEXT 2019 - The 15th International Conference on emerging Networking EXperiments and Technologies / [ed] ACM, ACM Digital Library, 2019Conference paper, Published paper (Refereed)
Abstract [en]

Packet processing programs may have multiple semantically equivalent representations in terms of the match-action abstraction exposed by the underlying data plane. Some representations may encode the entire packet processing program into one large table allowing packets to be matched in a single lookup, while others may encode the same functionality decomposed into a pipeline of smaller match-action tables, maximizing modularity at the cost of increased lookup latency. In this paper, we provide the first systematic study of match-action program representations in order to assist network programmers in navigating this vast design space. Borrowing from relational database and formal language theory, we define a framework for the equivalent transformation of match-action programs to obtain certain irredundant representations that we call ``normal forms''. We find that normalization generally improves the capacity of the control plane to program the data-plane and to observe its state, at the same time having negligible, or positive, performance impact.

Place, publisher, year, edition, pages
ACM Digital Library, 2019.
Keywords [en]
programmable data plane, P4; OpenFlow, match-action tables, program transformation, formal languages, relational model
National Category
Communication Systems Computer Sciences
Research subject
Information and Communication Technology; Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-264777DOI: 10.1145/3359989.3365417Scopus ID: 2-s2.0-85077234928ISBN: 978-1-4503-6998-5 (electronic)OAI: oai:DiVA.org:kth-264777DiVA, id: diva2:1375005
Conference
CoNEXT 2019 - The 15th International Conference on emerging Networking EXperiments and Technologies, Orlando, Florida, U.S., December 9-12, 2019
Note

QC 20191216

Available from: 2019-12-03 Created: 2019-12-03 Last updated: 2020-03-09Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopusConference website

Authority records BETA

Chiesa, Marco

Search in DiVA

By author/editor
Chiesa, Marco
By organisation
Network Systems Laboratory (NS Lab)
Communication SystemsComputer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 73 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf