A presentation by the P4 Language Consortium and ONF in conjunction with ANCS 2019

Held at Cambridge, UK on September 23, 2019

EuroP4 2019 is the second P4 Language Consortium event in Europe.
It aims to bring together P4 and P4->NetFPGA researchers from Europe and from around the world, and to foster the growth of the P4 Community.

Topics of an interest include, but are not limited to:

  • All aspects of P4-based network protocol research including design, specification, verification, implementation, measurement, testing, and analysis.
  • Contributions to network architecture using P4, e.g., specific algorithms and protocols for network virtualization or future Internet architectures.
  • New applications and in-network computing enabled by P4
  • P4-based and P4-NetFPGA based programmable data planes
  • End-host networking with P4
  • Tools and frameworks for development using P4
  • Performance analysis and measurement of P4-based designs and systems
  • Contributions to the evolution of the P4 language

Papers are available here (Please, note that papers are accessible at the moment only for EuroP4 participats)


University of Cambridge
Department of Computer Science and Technology
The Computer Laboratory
William Gates Building
15 JJ Thomson Avenue, Cambridge CB3 0FD

Maps and directions


Registration is through ANCS 2019

Travel Grants

Refer to ANCS travel grants page

Camera Ready

Refer to ANCS Camera Ready page


  • 8:30 - 9:15am

    • Registration and Breakfast

  • 9:15 - 9:30

    • Welcome and Introductions

  • 9:30 - 10:30

    • Keynote: Undefined behaviours in P4 progams: find them, fix them or exploit them.

      Speaker: Professor Costin Raiciu (University Politehnica of Bucharest)

      Abstract P4 programs can exhibit a series of undefined behaviours including inexistent header accesses, infinite loops, parser errors, and so forth, much like C programs can include use-after-free errors, out-of-bounds accesses and so forth. Such bugs were found in most programs examined, be they small or large. A part of my talk will discuss what might happen if buggy programs are deployed in practice by examining how different P4 targets behave when undefined behaviours are present in P4 programs, finding that a range of exploits are possible whose severity depends on the target. Luckily, P4 is not Turing-complete and automated approaches at finding such bugs have been proposed and are quite promising. Works such as p4v, Vera or p4-assert can find all bugs before deployment as long as the programmer can provide table rules that will appear in practice or provide a control plane invariant which are predicates that table rules will obbey at runtime. Still, these tools place a significant verification burden on the programmer, and it the jury is still out on whether they will be used in practice. In the remainder of my talk I will cover existing approaches to find bugs in P4 programs, as well as presenting new work towards elliminating the need for programmer input in the verification process.
      Biography Costin Raiciu is Associate Professor at University Politehnica of Bucharest where he leads the Netsys group. Costin finished his PhD at UCL in 2011. His current research focus is on network verification. In his past work, Costin was one of the main people behind the development, implementation and standardization of Multipath TCP, a protocol that is now deployed by Apple and Samsung on their mobile devices. Recently, Costin worked on NDP, which is a radical redesign of the datacenter networking stack (ACM SIGCOMM 2017).

  • 10:30 - 11:00

    • Coffee break

  • 11:00 - 12:15

    • Offloading data plane functions to the multi-tenant Cloud Infrastructure using P4. Tomasz Osinski (Orange Labs & Warsaw University of Technology), Mateusz Kossakowski (Orange Labs & Warsaw University of Technology), Halina Tarasiuk (Warsaw University of Technology), Roland Picard (Orange Labs)

    • P4DNS: In-Network DNS. Jackson Woodruff (University of Cambridge), Murali Ramanujam (University of Cambridge), Noa Zilberman (University of Cambridge)

    • Cryptographic Hashing in P4 Data Planes. Dominik Scholz (Technical University of Munich), Andreas Oeldemann (Technical University of Munich), Fabien Geyer (Technical University of Munich), Sebastian Gallenmüller (Technical University of Munich), Henning Stubbe (Technical University of Munich), Thomas Wild (Technical University of Munich), Andreas Herkersdorf (Technical University of Munich), Georg Carle (Technical University of Munich)

  • 12:15 - 13:45

    • Lunch break

  • 13:45 - 15:00

    • daPIPE - A Data Plane Incremental Programming Environment. Mario Baldi (Politecnico di Torino)

    • Random Linear Network Coding on Programmable Switches. Diogo Gonçalves (University of Lisbon), Salvatore Signorello (University of Lisbon), Fernando M.V. Ramos (University of Lisbon), Muriel Medard (MIT)

    • Towards Understanding the Performance of P4 Programmable Hardware. Hasanin Harkous (Technical University of Munich/ Nokia Bell Labs), Michael Jarschel (Nokia Bell Labs), Mu He (Technical University of Munich), Rastin Pries (Nokia Bell Labs), Wolfgang Kellerer (Technical University of Munich)

  • 15:00 - 15:15

    • Posters and Demos introduction and pitch

  • 15:15 - 16:15

    • Coffee break with Posters and Demos

  • 16:15 - 17:15 (No Proceedings Track)

    • Towards Neural Network Inference on Programmable Switches. Jonatan Langlet (Karlstad University), Andreas Kassler (Karlstad University), Deval Bhamare (Karlstad University)

    • In-Network Traffic Redundancy Elimination over Programmable Data Plane. Hongrok Choi (Korea University), Seokwon Jang (Korea University), Sangheon Pack (Korea University)

    • Estimation of logarithmic and exponential functions entirely in P4-programmable data planes. Damu Ding (FBK CREATE-NET research center), Marco Savi (FBK CREATE-NET research center), Domenico Siracusa (FBK CREATE-NET research center)

    • Resource-Efficient Service Function Chaining in Programmable Data Plane. Hochan Lee (Korea University), Jaewook Lee (Korea University), Haneul Ko (Korea University), Sangheon Pack (Korea University)

    • How NRENs can benefit from P4. Mauro Campanella (GARR), Pavel Benacek (CESNET), Ivana Golub (PSNC), Xavier Jeannin (RENATER), Damian Parniewicz (PSNC), Marco Savi (FBK), Frederic Loui (RENATER)

  • 17:15 - 17:30

    • Closing

  • 18:00 onwards

    • Social Event This event will be held in conjuction with the IEEE ANCS reception. Check ANCS 2019 website for more information.

Accepted Posters

  • P4MT: Multi-Tenant Support Prototype for International P4 Testbed. Jim Hao Chen (iCAIR/Northwestern University), Buck Chung (National Chiao Tung University), Chien-Chao Tseng (National Chiao Tung University), Joe Mambretti (iCAIR/Northwestern University)

  • Sketch-based Entropy Estimation for Network Traffic Analysis using Programmable Data Plane ASICs. Yu-Kuen Lai (Chung-Yuan Christian University), Ku-Yeh Shih (Chung-Yuan Christian University), Po-Yu Huang (Chung-Yuan Christian University), Ho-Ping Lee (Chung-Yuan Christian University), Yu-Jau Lin (Chung-Yuan Christian University), Te-Lung Liu (Narlabs), Jim Chen (Northwestern University)

  • Graph-to-P4: A P4 boilerplate code generator for parse graphs. Eder Ollora Zaballa (Technical University of Denmark), Zifan Zhou (Technical University of Denmark)

  • Asynchronous Extern Functions in Programmable Software Data Planes. Daniel Horpacsi (ELTE Eötvös Loránd University, Budapest, Hungary), Sandor Laki (ELTE Eötvös Loránd University, Budapest, Hungary), Peter Voros (ELTE Eötvös Loránd University, Budapest, Hungary), Mate Tejfel (ELTE Eötvös Loránd University, Budapest, Hungary), Gergely Pongracz (Ericsson Research), Laszlo Molnar (Ericsson Research)

Accepted Demos

  • P4-NetFPGA-based network slicing solution for 5G MEC architectures. Ruben Ricart-Sanchez (University of the West of Scotland), Pedro Malagon (Universidad Politecnica de Madrid), Jose M. Alcaraz-Calero (University of the West of Scotland), Qi Wang (University of the West of Scotland)

  • Using P4 on Fixed-Pipeline and Programmable Stratum Switches. Brian O’Connor (ONF), Yi Tseng (ONF), Maximilian Pudelko (ONF), Alireza Ghaffarkhah (Google), Devjit Gopalpur (Google)

  • How to measure the speed of light with programmable data plane hardware?. Ralf Kundel (TU Darmstadt), Fridolin Siegmund (TU Darmstadt), Boris Koldehofe (TU Darmstadt)

General Chairs

Program Chairs

Web Chair

Technical Program Committee

Special Thanks to our Sponsors:

Stordis Delta
FCT Lasige