Poster: High-Performance Centralized Parallel Data-Plane Verification for Hyper-Scale DCNs

Existing data-plane verifiers face severe performance challenges in verifying hyper-scale underlay data center networks (DCNs) - centralized verifiers often fail to fully exploit the parallelism offered by the modern multi-core CPUs, while distributed verifiers suffer from high overhead due to task distribution and inter-node communication. To overcome these limitations, this paper introduces HeTu, a high-performance centralized parallel data-plane verifier specifically for verifying hyper-scale underlay DCNs via three key designs: (1) a fully parallel verification framework with small graph construction overhead, (2) a new binary decision diagram management strategy that uses separated storage and selectively caching network-level predicates to reduce redundant operations, and (3) an optimized forwarding graph model that aggregates parallel tasks to eliminate redundant computation. Extensive evaluations on synthetic FatTree and large-scale production datasets show that HeTu outperforms state-of-the-art algorithms in runtime by at least 250× with the same-order memory usage, demonstrating its superior efficiency in data-plane verification of hyper-scale DCNs.