Are Graph Databases Fast Enough for Static P4 Code Analysis?

Dániel Lukács, Gergely Pongrácz, Máté Tejfel
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
more » ... esentation in which we can store, access and traverse the CFGs and the environment information together. On the other hand, analysis efficiency is a requirement both for large-scale testing and end user application. Unfortunately, we cannot conclusively assess -without trying it out in practice -whether GDB disk and memory reads will ruin our performance or not.
dblp:conf/icai3/LukacsPT20 fatcat:3zd6cunlzzfyfitjxdhxy55foi