ProbNV: probabilistic verification of network control planes

Citations Over Time

Abstract

ProbNV is a new framework for probabilistic network control plane verification that strikes a balance between generality and scalability. ProbNV is general enough to encode a wide range of features from the most common protocols (eBGP and OSPF) and yet scalable enough to handle challenging properties, such as probabilistic all-failures analysis of medium-sized networks with 100-200 devices. When there are a small, bounded number of failures, networks with up to 500 devices may be verified in seconds. ProbNV operates by translating raw CISCO configurations into a probabilistic and functional programming language designed for network verification. This language comes equipped with a novel type system that characterizes the sort of representation to be used for each data structure: concrete for the usual representation of values; symbolic for a BDD-based representation of sets of values; and multi-value for an MTBDD-based representation of values that depend upon symbolics. Careful use of these varying representations speeds execution of symbolic simulation of network models. The MTBDD-based representations are also used to calculate probabilistic properties of network models once symbolic simulation is complete. We implement the language and evaluate its performance on benchmarks constructed from real network topologies and synthesized routing policies.

Related Papers

• → Is there a well-founded solution to the generality problem?(2014)13 cited
• → Generality of treatment effects with parents as therapists: A review of assessment and implementation procedures(1977)160 cited
• → Contextual Learning: Towards Using Contexts to Achieve Generality(2000)
• Simultaneous Extension of Cultural Generality and Individuality in Globaliza tion(2004)
• → Exploring the Generality of Norms in Multi-Agent Systems(2023)