This file was created by the TYPO3 extension bib --- Timezone: UTC Creation date: 2024-12-03 Creation time: 16-52-49 --- Number of references 1 inproceedings 2019-krude-chain-opt 2019 8 23 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 and commodity CPUs. These data plane programs are, however, limited in per-packet time budget (e.g., 67.2 ns at 10GbE) and program size, making program optimization imperative. Existing approaches focus on optimizing the distribution of flow rules in fixed data planes or they are limited to a single switch. We see great potential in integrating the network topology into program optimization. maki https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-krude-chain-opt.pdf ACM NetPL '19: ACM SIGCOMM Workshop on Networking and Programming Languages Beijing, China 978-1-4503-6877-3/19/08 10.1145/3341561.3349590 1 JohannesKrude MatthiasEichholz MaximilianWinck KlausWehrle MiraMezini