This post explores the performance of BPF LPM tries, a critical data structure used for IP matching. It delves into the trie algorithm, presents benchmark data, and explains how the current kernel implementation’s design choices lead to performance bottlenecks.