A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Are Graph Databases Fast Enough for Static P4 Code Analysis?
2020
International Conference on Applied Informatics
P4 is a new protocol-programming language for smart switches and virtual network functions linked up in vast software defined networks (SDNs). Our current work in progress is focused on analysing the execution cost of P4 programs using hierarchical control flow graphs (CFGs). We found that cost analysis of P4 requires storing and working with diverse information about various execution environments. In theory, versatile graph backends, such as graph databases (GDBs) could provide a unifying
dblp:conf/icai3/LukacsPT20
fatcat:3zd6cunlzzfyfitjxdhxy55foi