Av. Reina Mercedes s/n, 41012 (Seville)
In this paper we are going to do performance comparison between two new tc packet classification approaches added to the kernel recently, ebpf and flower in comparison with old lady u32. The talk is going to briefly discuss their differing philosophical approaches in solving the packet classification problem and then focus on their respective compute overheads from a black box perspective in a methodical way.
Different data path insertion points will be analyzed from a throughput perspective in conjunction with control plane overhead.
If time permits, the talk will dig into the algorithmic overheads inside each classifier black box and discuss any fixes or suggested fixes.