PROJECT TITLE :

Real-Time Verification of Network Properties Using Atomic Predicates

ABSTRACT:

Network management will benefit from automated tools primarily based upon formal ways. Several such tools are revealed in the literature. We gift a brand new formal methodology for a replacement tool, Atomic Predicates (AP) Verifier, that is much more time and space economical than existing tools. Given a set of predicates representing packet filters, AP Verifier computes a set of atomic predicates, that is minimum and distinctive. The use of atomic predicates dramatically quickens computation of network reachability. We tend to evaluated the performance of AP Verifier using forwarding tables and ACLs from three giant real networks. The atomic predicate sets of these networks were computed very quickly and their sizes are surprisingly little. Real networks are subject to dynamic state changes over time as a results of rule insertion and deletion by protocols and operators, failure and recovery of links and boxes, etc. During a software-outlined network, the network state can be observed in real time and therefore could be controlled in real time. AP Verifier includes algorithms to method such events and check compliance with network policies and properties in real time. We compare time and house prices of AP Verifier with Header House and NetPlumber using datasets from the $64000 networks.