Probabilistic Verification of Network Configurations
Samuel Steffen, Timon Gehr, Petar Tsankov, Laurent Vanbever, Martin Vechev · 2020
Not all important network properties need to be enforced all the time. Often, what matters instead is the fraction of time / probability these properties hold. Computing the probability of a property in a network relying on complex inter-dependent routing protocols is challenging and requires determining all failure scenarios for which the property is violated. Doing so at scale and accurately goes beyond the capabilities of current network analyzers.