Network Verification via Compressed Header Space Bitmaps
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network verification systems face challenges in efficiently verifying large-scale networks in real-time due to complexity, high computational requirements, and the need for extensive data analysis, leading to delays and potential network downtimes.
Innovation Solution
A network verification system that pre-computes compressed data structures representing header spaces and uses bitmaps to identify changed network paths, allowing for faster incremental verification and real-time monitoring of reachability, loop detection, and isolation, while reducing memory consumption and redundant calculations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If network verification is performed in real-time using existing systems, then network state can be monitored continuously, but computational complexity and processing time increase significantly
Solution Approach 1:
The system pre-computes and stores compressed data structures representing network header spaces before verification is needed. These pre-computed structures capture the essential network state information in a condensed format, allowing real-time verification to proceed quickly by comparing current snapshots against the pre-computed baseline without performing full network analysis at verification time.
Solution Approach 2:
The patent transforms the network verification problem by changing the representation parameters from full network state data to compressed bitmap structures. Each bitmap efficiently encodes network path information using bit-level operations, fundamentally altering how network state is stored and compared, thereby reducing computational complexity while maintaining verification accuracy.
2Measurement precision
If full network snapshots are analyzed for verification, then comprehensive network state coverage is achieved, but memory consumption and computational resources increase
Solution Approach 1:
The system extracts only the essential verification-relevant information from complete network snapshots by computing compressed data structures that represent header spaces. These extracted compressed structures retain the critical network path information needed for verification while discarding redundant data, achieving comprehensive state coverage with minimal memory footprint through selective information extraction.
Solution Approach 2:
The patent applies dimensionality reduction by transforming multi-dimensional network state data into compressed bitmap representations. The compression ratio achieved is substantial, mapping large network state spaces into compact bitmap structures that consume significantly less memory while preserving all verification-necessary information through efficient bit-level encoding.
3Adaptability or versatility
If network configuration changes are made frequently to meet customer demands, then network adaptability improves, but verification complexity and risk of errors increase
Solution Approach 1:
By pre-computing compressed data structures that capture the essential network configuration state, the system establishes a baseline against which future configuration changes can be quickly verified. This preliminary computation enables rapid detection of verification failures after configuration changes, allowing frequent network adaptations while maintaining verification simplicity through efficient snapshot comparison of compressed structures.
Data Source
AI summary
A network state is verified in real-time by precomputing a data structure representing header spaces of data packets in respective equivalence classes (ECs) in a first snapshot of the network and in a second snapshot of the network at a later time. The data structure includes respective bitmaps indicating for each data packet forwarding rule for each node in the network a forwarding action to be taken for each EC in the network. The respective bitmaps store bits indicating for each data packet forwarding rule whether the data packet forwarding rule applies to the respective ECs in the network. The snapshots are compared to identify network paths that have changed between a time of the first snapshot and the second snapshot of the network and network verification operations are performed on the changed network paths as a logical function of a bitmap corresponding to each changed network path.