Alon Rashelbach
Trading Memory Accesses for Computations in Packet Processing and Beyond
Range matching plays a crucial role in computer systems, including networking, security, and storage. It serves the purpose of locating a range that encompasses a given input number from a vast collection of ranges. Address translators in operating systems and longest-prefix matching in networks heavily rely on range matching. However, existing range matching algorithms are limited in scalability and performance due to their reliance on pointer-chasing techniques.
We have developed NuevoMatch, an algorithm for multi-field packet classification that leverages RQRMI models (SIGCOMM’20), and successfully integrated it into the critical path of Open vSwitch, a broadly used virtual switch (NSDI’22). Through the utilization of RQRMI, we have achieved remarkable scalability, enabling Open vSwitch to handle 500 times more routing rules while experiencing a throughput speedup of up to 160 times. Furthermore, our work demonstrates the versatility of RQRMI beyond software. Specifically, we observed up to 20X reduction in the memory footprint required for DNA hardware accelerators (BCB’23) and developed hardware for enhancing the scalability of network packet processors (MICRO’23).