BIER BitString Compression via Valid Bit Extraction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing BIER technology faces challenges due to the large message space occupied by BitStrings, which results in increased computational overhead and inefficient data packet forwarding caused by a significant amount of invalid data.
Innovation Solution
A data compression method is introduced that generates compressed bit string information by extracting valid bit data and their corresponding positions from the standard bit string information, reducing the information length and eliminating invalid data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a standard BitString is used to indicate all network edge nodes in BIER, then all destination nodes can be marked, but the message space becomes excessively large and computational overhead increases
Solution Approach 1:
The patent extracts only the necessary bits from the full BitString that correspond to actual destination nodes. By identifying and removing invalid bits (those corresponding to non-destination nodes), the system maintains the ability to mark all destination nodes while significantly reducing the quantity of data transmitted and processed.
Solution Approach 2:
The BitString is segmented into valid portions and invalid portions. The patent processes only the valid segments containing destination node information, separating the useful data from the redundant invalid bits. This segmentation allows the system to maintain completeness for destination marking while reducing overall message space.
2Reliability
If a long BitString is used to indicate all possible destination nodes, then complete forwarding information is available, but computational overhead and processing time increase
Solution Approach 1:
The patent extracts and processes only the necessary portions of the BitString that contain valid destination node information. By removing invalid bits from the processing pipeline, the system maintains complete forwarding information for actual destinations while significantly reducing computational overhead and processing time.
Solution Approach 2:
Instead of processing the entire BitString (excessive action), the patent implements partial action by processing only the valid portions. This approach ensures reliability for actual destination forwarding while avoiding the computational waste of processing invalid bits.
3Adaptability or versatility
If invalid bits are included in the BitString, then all possible nodes are accounted for, but data compression efficiency decreases
Solution Approach 1:
The patent extracts and removes invalid bits from the BitString, retaining only the necessary valid bits for actual destination nodes. This extraction process maintains node coverage for all active destinations while significantly improving data compression efficiency by eliminating redundant invalid data.
Solution Approach 2:
The patent discards invalid bits that do not contribute to forwarding decisions and recovers the essential valid information. This discarding and recovering process maintains adaptability for all destination nodes while optimizing compression efficiency by removing useless data.
Data Source
Figure 1~2
Figure 3~4
Figure 5~6
AI summary
A data compression method and apparatus, a network device, and a storage medium are disclosed. The method includes: determining at least one valid bit data in bit string information corresponding to a data packet and a valid position of each valid bit data in standard bit string information according to to-be-forwarded device information in the data packet, to form compressed bit string information (S110); and encapsulating the data packet according to the compressed bit string information, to form to-be-transmitted data (S120).