UCLA

We present an object-oriented representation of routing policies to encode BGP-related configuration information. We demonstrate how router policies can be represented as pseudocode functions, making it easier to understand a router's configured policy. We discuss the C-representation of router policies that allow for the use of symbolic execution to explore all paths through a single router and produce test announcements. We generate router configurations compatible for Quagga to emulate the network slice, send test announcements, and observe the resulting routing table. We describe a method to guarantee equivalence given any two routers' BGP configurations with functional equivalence.