NetDiceSyn: Multi-Property Probabilistic Verification of Network Configurations

In recent years, probabilistic network analysis has received significant attention as a crucial aspect of network management. With the increasing use of distributed routing protocols in networks, computing the probabilities of multiple properties becomes a challenging task, as different property violations derive from different failure scenarios. While some previous work has attempted to prune the space of failure scenarios by identifying a set of links whose failure does not change whether a property holds, this approach often requires multiple calls to the system, leading to redundant computation when verifying multiple properties. To solve this problem, we propose NetDiceSyn, a scalable multi-property probabilistic network configuration analyzer. As verifying each property requires exploring a state tree, NetDiceSyn proposes to explore all state trees synchronously and compute a shared data plane for multiple states in different state trees, thus reducing the redundant computation between different state trees and verifying multiple properties simultaneously. Besides, we design a state sharing method to reduce the redundant storage of states during synchronous exploration. Additionally, we propose abstract topology to merge equivalent states within a state tree to speed up probabilistic verification in series link networks. Extensive experiments are conducted with real-world network topologies, and the results show that NetDiceSyn outperforms state-of-the-art methods, providing up to an order of magnitude speedup when verifying hundreds of properties for networks with hundreds of links.