Pedrosa, Luis DavidIyer, Rishabh RameshZaostrovnykh, ArseniyFietz, JonasArgyraki, Katerina2018-12-042018-12-042018-12-042018-08-2110.1145/3230543.3230573https://infoscience.epfl.ch/handle/20.500.14299/151692Software network functions promise to simplify the deployment of network services and reduce network operation cost. However, they face the challenge of unpredictable performance. Given this performance variability, it is imperative that during deployment, network operators consider the performance of the NF not only for typical but also adversarial workloads. We contribute a tool that helps solve this challenge: it takes as input the LLVM code of a network function and outputs packet sequences that trigger slow execution paths. Under the covers, it combines directed symbolic execution with a sophisticated cache model to look for execution paths that incur many CPU cycles and involve adversarial memory-access patterns. We used our tool on 11 network functions that implement a variety of data structures and dis- covered workloads that can in some cases triple latency and cut throughput by 19% relative to typical testing workloads.text::conference output::conference paper not in proceedings