Graph-To-P4: A P4 boilerplate code generator for parse graphs

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    Abstract

    The work described in this paper presents Graph-to-P4, a toolset for generating P4 boilerplate code from parse graphs. The purpose of such a toolset is to provide a higher level of abstraction to program pipelines in order to fill the knowledge gap that some students may encounter when diving into P4. While P4 is not difficult to learn, Graph-to-P4 offers the possibility first draw parse graphs, generate P4 starter code and finally let programmers develop the specific data plane behavior (actions, tables, etc.). We have experienced that this toolset offers a smooth introduction to P4 and the intrinsic networking concepts attached to it. We show that the toolset has potential to provide a larger set of high-level abstractions (tables, actions, etc.)and an extension to provide a two-way code transformation.

    Original languageEnglish
    Title of host publicationProceedings of 2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems
    PublisherIEEE
    Publication date1 Sep 2019
    Article number8901873
    ISBN (Electronic)9781728143873
    DOIs
    Publication statusPublished - 1 Sep 2019
    Event2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems - Cambridge, United Kingdom
    Duration: 24 Sep 201925 Sep 2019
    https://ieeexplore.ieee.org/xpl/conhome/8891060/proceeding

    Conference

    Conference2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems
    Country/TerritoryUnited Kingdom
    CityCambridge
    Period24/09/201925/09/2019
    Internet address
    Series2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2019

    Keywords

    • High-level abstraction
    • P4
    • Parse graph
    • Web

    Fingerprint

    Dive into the research topics of 'Graph-To-P4: A P4 boilerplate code generator for parse graphs'. Together they form a unique fingerprint.

    Cite this