Johannes Krude, Matthias Eichholz, Maximilian Winck, Klaus Wehrle, Mira Mezini
ACM SIGCOMM Workshop on Networking and Programming Languages (NetPL '19), August 2019. ACM. pp. 1–1.
With the move of Software-defined networking from fixed to programmable data planes, network functions are written with P4 or eBPF for targets such as programmable switches, CPU based flow processors [5] and commodity CPUs [7]. These data plane programs are, however, limited in per-packet time budget [3] (e.g., 67.2 ns at 10GbE) and program size, making program optimization imperative [6]. Existing approaches focus on optimizing the distribution of flow rules in fixed data planes [4] or they are limited to a single switch [2]. We see great potential in integrating the network topology into program optimization.
@inproceedings{2019_krude_optimizing-data-plane-programs,
author = {Krude, Johannes and Eichholz, Matthias and Winck, Maximilian and Wehrle, Klaus and Mezini, Mira},
title = {{Optimizing Data Plane Programs for the Network}},
booktitle = {{ACM SIGCOMM Workshop on Networking and Programming Languages}},
series = {{NetPL '19}},
year = {2019},
month = aug,
pages = {1},
numpages = {1},
location = {Beijing, China},
publisher = {{ACM}},
doi = {10.1145/3341561.3349590},
url = {https://krude.name/publications/2019_krude_optimizing-data-plane-programs.pdf},
}