Network Graph Time-Travel for Topology Analysis
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network troubleshooting methods lack the ability to effectively track and visualize temporal changes across independent logical domains, such as Layer 2 connectivity and various protocols, making it difficult to correlate and assess impacts during investigations.
Innovation Solution
A method is introduced that generates a network graph using configuration and operational data from networking devices, employing a 'Versioner Algorithm' to record temporal changes and allow for historical analysis, enabling time-travel functionality and comparison of historical topologies.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If traditional network troubleshooting methods are used, then the investigation process is simple, but the ability to track and visualize temporal changes across independent logical domains is insufficient
Solution Approach 1:
The patent adds a temporal dimension to traditional network topology visualization by implementing time-travel functionality. The system maintains multiple historical versions of network graphs, allowing users to navigate through different time points and observe how network topology changes over time. This transforms a static 2D graph into a dynamic 4D representation (adding time as the fourth dimension), enabling comprehensive tracking of temporal changes while preserving cross-domain dependencies.
Solution Approach 2:
The patent segments the network investigation process into distinct temporal snapshots. By dividing the continuous network evolution into discrete time-point graphs, the system enables focused analysis of specific moments while maintaining the ability to compare across time. Each snapshot captures the network state at a particular moment, allowing investigators to break down complex temporal changes into manageable segments for detailed examination.
2Reliability
If network topology changes are tracked in real-time, then visibility into network states is enhanced, but the complexity of managing and analyzing topological changes increases
Solution Approach 1:
The system performs preliminary actions by pre-capturing and storing network topology snapshots at various time points. Instead of computing temporal changes on-demand, the system proactively records the network state at each change event, creating a library of historical topologies. This preliminary capture of data simplifies subsequent analysis, as all temporal information is already organized and stored when needed for investigation.
Solution Approach 2:
The patent creates copies of the network topology at different time points rather than maintaining a single evolving structure. Each historical snapshot is a complete copy of the network graph at that moment, preserving all nodes, edges, and their relationships. This copying approach enables reliable reconstruction of past states without interfering with current network operations, enhancing visibility while managing complexity through replicated structures.
3Loss of information
If discrete changes in independent logical domains are preserved, then cross-domain dependency correlation is improved, but the difficulty of detecting and measuring changes increases
Solution Approach 1:
The patent implements a universal graph structure that can represent multiple independent logical domains (Layer 2 connectivity, BGP, IPSEC, LLDP, LISP, OSPF, ARP, etc.) within a single unified framework. This multi-functional graph model uses standardized node and edge representations that can accommodate different protocol types and domain-specific attributes, enabling consistent tracking and correlation across diverse domains while simplifying the detection and measurement of changes through a common interface.
Data Source
AI summary
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.