Abstract: Techniques and architecture are described for abstracting a real physical twin network wherein security policies are mapped as an overlay on a graphical representation of the network topology. The techniques include receiving, at a computing device, a first security policy) for a first network device. The computing device processes the first security policy to generate a plurality of first access control entries. The computing device creates first graph nodes corresponding to the first access control entries. Based at least in part on a processing order of the first security policy on the first network device, the computing device links the first graph nodes into a graph. The computing device displays the graph on a display, wherein the graph is displayed as an overlay on a network topology graph that includes the first network device.

Abstract: Methods are presented herein for a reduced state machine that describes nodes and relationship dynamics representing real network elements (networking devices and software processes) in a computer/data network, and abstracted logical items. Logical states of networking features of the network elements are reflected in the graph, while configuration data is stored for completeness. A method called a “Versioner Algorithm” is provided to record the temporal history of a node and its state over time within the node's metadata itself, while recorded relationships represent logical relations between observed nodes. A method is also provided to time-travel back to observe a historical view of the network. Further still, a method is provided to a difference of two historical topologies and return that data in human-readable or machine consumable form.

Abstract: Techniques and architecture are described for abstracting a real physical twin network wherein security policies are mapped as an overlay on a graphical representation of the network topology. The techniques include receiving, at a computing device, a first security policy) for a first network device. The computing device processes the first security policy to generate a plurality of first access control entries. The computing device creates first graph nodes corresponding to the first access control entries. Based at least in part on a processing order of the first security policy on the first network device, the computing device links the first graph nodes into a graph. The computing device displays the graph on a display, wherein the graph is displayed as an overlay on a network topology graph that includes the first network device.

Abstract: Methods are presented herein for a reduced state machine that describes nodes and relationship dynamics representing real network elements (networking devices and software processes) in a computer/data network, and abstracted logical items. Logical states of networking features of the network elements are reflected in the graph, while configuration data is stored for completeness. A method called a “Versioner Algorithm” is provided to record the temporal history of a node and its state over time within the node's metadata itself, while recorded relationships represent logical relations between observed nodes. A method is also provided to time-travel back to observe a historical view of the network. Further still, a method is provided to a difference of two historical topologies and return that data in human-readable or machine consumable form.