Abstract
The algebraic model and logical representations of a real network are important but very challenging issues in automatic network verification. In this paper, we abstract the concrete network to its corresponding abstract graph with enhanced vertices and edges by splitting the vertices according to the protocols that they run. Based on classical routing algebra, we consider combining the interactions of different protocols and routing records and then give a newly modified algebraic structure. To apply the abstract modified algebra routing into the concrete network, we make use of the SMT solver to encode the components of algebra into logical constraints motivated by the work of Ryan Beckett et al. By encoding the network behaviors and properties into logical formulas, we can compute whether the experimental network that we configured satisfies any property, including reachability, routing loop, and so on. In the previous work, the routing algebra or the representation of the network is only applied to several network properties. However, in this paper, we extract all kinds of properties into exact logical formulas.
Highlights
A network is composed of a control plane configuring the behavior of the data plane, which in turn is in charge of forwarding the actual packet
Much research focuses on raising the level of abstraction of network configuration files and the mechanism of routing protocols, which is an effective and unified way to synchronize the structure of different networks [9], [10]
Since we model the network to a graph with a well-defined algebraic structure, we need an approach to concrete the algebraic structure to calculate the real network behaviors and verify some network properties
Summary
A network is composed of a control plane configuring the behavior of the data plane, which in turn is in charge of forwarding the actual packet. An effective way is to translate network configuration files into logical formulas capturing the stable states to which the network forwards This method will converge as a result of interactions between routing protocols, such as OSPF [4], BGP [5], [6], and static routes. Covering the control plane is hard work because devices may run different kinds of routing protocols From this point of view, our goal is to modify the basic routing algebra to model the dynamic network and explore more abstract and concise logical representations of network behaviors and properties based on our approach of the algebraic model. Much research focuses on raising the level of abstraction of network configuration files and the mechanism of routing protocols, which is an effective and unified way to synchronize the structure of different networks [9], [10].
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
