IP Network Topology Caching via Pre-built Mapping Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network discovery tools are overwhelmed by high-speed networks due to the creation of numerous relationships between network entities, leading to data redundancy and unnecessary packet processing.
Innovation Solution
A system that caches network traffic using a processor and database with node and communication fact tables to identify nodes, track communications, and maintain discovery times, reducing data redundancy and avoiding redundant packet processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If network discovery tools create relationship fields between all discovered network entities, then complete network topology knowledge is achieved, but data redundancy increases and processing overhead becomes unmanageable at high speeds
Solution Approach 1:
The patent applies preliminary action by pre-establishing a many-to-many mapping table that defines all possible relationships between network entities before packet processing begins. This allows the system to quickly lookup whether entities are related without dynamically creating relationship fields during packet processing, thus preserving complete topology knowledge while maintaining high processing speeds.
Solution Approach 2:
The patent extracts the relationship definition functionality from the packet processing flow by separating it into a dedicated many-to-many mapping table. This extraction allows relationship lookups to be performed independently and efficiently, reducing the processing burden on the main packet handling system while still providing complete network topology information when needed.
2Reliability
If discovery tools process every packet to create relationship fields, then current network topology is accurately reflected, but the tools become overwhelmed by large packet flow rates
Solution Approach 1:
The system performs preliminary action by pre-populating a many-to-many mapping table with all known network entity relationships before entering high-speed packet processing mode. During packet processing, the system simply queries this pre-built table rather than dynamically analyzing and creating relationships, thereby maintaining accurate topology information while achieving high throughput.
Solution Approach 2:
The patent introduces an intermediary many-to-many mapping table that mediates between packet processing and topology knowledge. This intermediary structure allows the system to maintain reliable topology accuracy by consulting the pre-established mapping relationships, while simultaneously achieving high packet processing throughput by avoiding repeated dynamic relationship creation during packet analysis.
3Loss of information
If relationship fields are recreated for each packet analysis, then up-to-date network entity relationships are maintained, but unnecessary packet processing occurs and efficiency is reduced
Solution Approach 1:
The patent applies preliminary action by establishing the many-to-many relationship mapping table in advance, before packet processing begins. This pre-established mapping allows the system to quickly determine current relationships by simple table lookups during packet analysis, eliminating the need to recreate relationship fields for each packet while still maintaining up-to-date relationship information.
Solution Approach 2:
The system creates a static copy of the network entity relationships in the many-to-many mapping table, which can be efficiently queried during packet processing. This copying approach allows the system to maintain relationship currency by having the relationships pre-defined, while significantly reducing processing time by avoiding repeated relationship creation operations during packet analysis.
Data Source
AI summary
In accordance with one embodiment of the present disclosure, a system for caching network traffic includes an interface configured to receive traffic from a plurality of nodes communicating in a network, a processor coupled to the interface and configured to identify each of the plurality of nodes communicating in the network, and a database. The database includes a node object dimension table that includes an entry for each identified node. Each entry in the node object dimension table includes a node identification and an address for locating the node in the network. The database also includes a communication fact table that includes an entry for each communication in the network. Each entry in the communication fact table includes a source node identification that includes the node identification for the source node, a communication identification, and a destination node identification that includes the node identification for the destination node.