@inproceedings{beckett2017a,
author = {Beckett, Ryan and Gupta, Aarti and Mahajan, Ratul and Walker, David},
title = {A General Approach to Network Configuration Verification},
booktitle = {Proceedings of SIGCOMM '17, Los Angeles, CA, USA, August 21-25, 2017},
year = {2017},
month = {August},
abstract = {We present Minesweeper, a tool to verify that a network satisfies a wide range of intended properties such as reachability or isolation among nodes, waypointing, black holes, bounded path length, load-balancing, functional equivalence of two routers, and fault-tolerance. Minesweeper translates network configuration files into a logical formula that captures the stable states to which the network forwarding will converge as a result of interactions between routing protocols such as OSPF, BGP and static routes. It then combines the formula with constraints that describe the intended property. If the combined formula is satisfiable, there exists a stable state of the network in which the property does not hold. Otherwise, no stable state (if any) violates the property. We used Minesweeper to check four properties of 152 real networks from a large cloud provider. We found 120 violations, some of which are potentially serious security vulnerabilities. We also evaluated Minesweeper on synthetic benchmarks, and found that it can verify rich properties for networks with hundreds of routers in under five minutes. This performance is due to a suite of model-slicing and hoisting optimizations that we developed, which reduce runtime by over 460x for large networks.},
publisher = {ACM - Association for Computing Machinery},
url = {http://approjects.co.za/?big=en-us/research/publication/general-approach-network-configuration-verification/},
pages = {14},
edition = {Proceedings of SIGCOMM ’17, Los Angeles, CA, USA, August 21-25, 2017},
}