Forwarding Chip Hash Index Generation via Data Replication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The use of the Cyclical Redundancy Check (CRC) algorithm as a Hash function in forwarding chips results in index values with high correlation between bits, affecting the stability of the optimal fill rate of the Hash table.
Innovation Solution
A data processing method that involves acquiring an input parameter, performing data replication to generate multiple input parameters, applying corresponding data mapping processing to obtain output variables, and integrating these variables to generate an index value, thereby reducing bit correlation and algorithm delay.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the CRC algorithm is used as the Hash function in the forwarding chip, then the implementation is simple and fast, but the bits in the index value have high correlation which affects the stability of the optimal fill rate
Solution Approach 1:
The patent divides the index value generation process into multiple independent stages: first generating a preliminary index through CRC algorithm, then separately generating correction bits through additional processing, and finally combining them. This segmentation reduces bit correlation by ensuring that different parts of the index value are derived from independent processing paths, while maintaining overall execution speed.
Solution Approach 2:
The patent changes the parameter structure of the hash function output by introducing separate correction bits that are independently generated and then combined with the preliminary index. This parameter change transforms the correlated bit structure into a less correlated structure, improving fill rate stability while preserving computational efficiency.
2Speed
If the CRC algorithm is used to generate index values, then the computation is fast, but the bit correlation in the index value reduces the stability of Hash table optimal fill rate
Solution Approach 1:
The patent segments the index value into multiple components: a preliminary index from CRC processing and correction bits from additional processing. By generating these components through separate processing paths and then combining them, the system maintains fast computation while reducing bit correlation that would otherwise destabilize the optimal fill rate.
Solution Approach 2:
The patent introduces correction bits as an intermediary element between the preliminary index and the final index value. These correction bits act as a mediator that adjusts the preliminary index to reduce bit correlation, thereby stabilizing the optimal fill rate while maintaining computational speed through efficient combination operations.
3Reliability
If data replication processing is performed to reduce bit correlation, then the stability of optimal fill rate improves, but the device complexity increases
Solution Approach 1:
The patent segments the data processing into distinct functional modules: CRC processing unit, correction bit generation unit, and combination unit. This segmentation manages complexity by organizing the data replication and processing operations into independent, manageable modules that can be implemented systematically while achieving the goal of reduced bit correlation and improved fill rate stability.
Data Source
AI summary
Disclosed are a data processing method, a forwarding chip, a non-transitory computer-readable storage medium and a program product. The data processing method may include: acquiring an input parameter used for generating an index value to be filled in a hash table; performing data replication processing on the input parameter to obtain a plurality of input parameters; performing corresponding data mapping processing on each of the plurality of input parameters to obtain a plurality of output variables; and performing data integration processing on the plurality of output variables to obtain the index value.