NDD: A Decision Diagram for Network Verification
summary
Introduces Network Decision Diagram (NDD), a two-layer structure that groups header bits into fields and builds per-field BDDs while assembling them with nodes whose edges are labeled with BDDs, so each edge encodes a whole field value rather than single bits. Re-implements five BDD-based verifiers (including Batfish and control-plane tools) with minor code changes and observes a 100× memory reduction and 100× speedup, plus fewer equivalence classes and shallower recursion.
AI-written summary · about
chapters (6)
- 0:00Introduction and background
- 1:57BDD overview and limitations
- 3:31Analyzing BDD limitations
- 7:19Introducing NDD
- 11:37NDD evaluation and results
- 14:41Conclusion and Q&A
related talks
17mDifferential Network Analysis
18mReachability Analysis of the Domain Name System
25mDataplane equivalence and its applications
25mEnsuring Connectivity via Data Plane Mechanisms
12mMetha: Network Verifiers Need To Be Correct Too!
18mLiveness Verification of Stateful Network Functions
14mEPVerifier: Accelerating Update Storms Verification with Edge-Predicate
25mNetwork Change Validation with Relational NetKAT
