Table item storage and retrieval method capable of being dynamically reconfigured

Abstract

The invention relates to a dynamically reconfigurable table item storage and retrieval method, and belongs to the field of network communication processing. According to the method, the to-be-stored table item content is mapped into the index value with the uniform length, and the index value is used for achieving storage and retrieval of the stored table item content. Wherein the mapping algorithm and the unified length can be dynamically reconfigured and online replaced according to the actual storage capacity and retrieval rate requirements, and index value conflicts are reduced by adopting a linear expansion exploration method. According to the method, efficient storage and retrieval of dynamically reconfigurable table item data can be achieved, high-speed retrieval of table item content is achieved, the requirement for table item storage capacity is lowered, and the utilization rate of storage space is increased.

Description

Technical Field

[0001] This invention belongs to the field of network communication processing, and specifically relates to a method for dynamically reconfigurable table entry storage and retrieval. Background Technology

[0002] With the rapid development of information technology, applications such as cloud computing, 5G, and the Internet of Things have brought about massive amounts of data. This data needs to be rapidly forwarded, filtered, and queried between nodes such as network devices and data centers, which requires high-speed network packet lookup operations to meet the demand for high-speed packet data transmission.

[0003] Traditional software lookup methods suffer from performance bottlenecks such as frequent memory accesses and instruction branch prediction failures, making it difficult to meet the requirements of line-speed network processing. Dedicated ASIC lookup chips have disadvantages such as long development cycles, high usage costs, and fixed functional protocols, making it difficult to dynamically change the table data configuration parameters in real time to adapt to complex and changing network environments.

[0004] To address the challenge of high-speed storage and retrieval of table entry data in complex network environments, this invention employs a dynamically configurable mapping algorithm and parameters to perform one-to-one mapping, storage, and retrieval operations on table entry data. Furthermore, it resolves index value conflicts within limited storage space using a linear expansion exploration method. This achieves high-speed storage and retrieval of table entry data, reduces the required table entry storage capacity, and improves storage space utilization. Summary of the Invention

[0005] (a) Technical problems to be solved

[0006] The technical problem to be solved by this invention is how to provide a dynamically reconfigurable table entry storage and retrieval method to solve the problem of high-speed storage and retrieval of table entry data in complex network environments.

[0007] (II) Technical Solution

[0008] To address the aforementioned technical problems, this invention proposes a dynamically reconfigurable table entry storage and retrieval method. This method includes: inputting table entry data, using a dynamically reconfigurable mapping algorithm to calculate the data and obtain the corresponding index value, and then storing and retrieving the table entry data based on the index value. If multiple table entry data correspond to the same index value, a conflict is identified, and a linear expansion exploration method is used to resolve the table entry index conflict problem.

[0009] (III) Beneficial Effects

[0010] This invention proposes a dynamically reconfigurable table entry storage and retrieval method. It maps the content of table entries to be stored to index values ​​of uniform length, using these index values ​​to store and retrieve the table entry content. The mapping algorithm and uniform length can be dynamically reconfigured and changed online according to actual storage capacity and retrieval speed requirements, and a linear expansion exploration method is employed to reduce index value conflicts. Ultimately, this method achieves efficient storage and retrieval of dynamically reconfigurable table entry data. It enables high-speed retrieval of table entry content, reduces the need for table entry storage capacity, and improves storage space utilization. Attached Figure Description

[0011] Figure 1 This is a flowchart illustrating the dynamically reconfigurable table entry storage and retrieval method of the present invention.

[0012] Figure 2 A functional block diagram of a dynamically reconfigurable table entry storage and retrieval method;

[0013] Figure 3 A diagram illustrating dynamic reconfiguration of the mapping algorithm;

[0014] Figure 4 A schematic diagram for exploring linear expansion. Detailed Implementation

[0015] To make the objectives, contents, and advantages of the present invention clearer, the specific embodiments of the present invention will be described in further detail below with reference to the accompanying drawings and examples.

[0016] The purpose of this invention is to provide a dynamically reconfigurable table entry storage and retrieval method to solve the aforementioned problems in the prior art.

[0017] This invention proposes a dynamically reconfigurable table entry storage and retrieval method, comprising: after inputting table entry data, using a dynamically reconfigurable mapping algorithm to calculate the data to obtain the corresponding index value, and storing and retrieving the table entry data according to the index value. If multiple table entry data correspond to the same index value, a conflict occurs, and a linear expansion exploration method is used to resolve the table entry index conflict problem.

[0018] According to an embodiment of the dynamically reconfigurable table entry storage and retrieval method of the present invention, the mapping algorithm, storage capacity, linear expansion exploration step size, etc., can all be dynamically reconfigured as algorithms, parameters, or values.

[0019] According to an embodiment of the dynamically reconfigurable table entry storage and retrieval method of the present invention, a mapping algorithm is used to calculate variable-length table entry data into a one-to-one corresponding fixed-length value, which is the table entry data index value.

[0020] According to an embodiment of the dynamically reconfigurable table entry storage and retrieval method of the present invention, operations such as adding, inserting, updating, deleting, and retrieving table entry data can be performed.

[0021] According to an embodiment of the dynamically reconfigurable table entry storage and retrieval method of the present invention, if multiple table entry data corresponding to the same index value are detected, the index value is linearly incremented, and the new index value obtained after incrementing is used to re-determine the conflict; if the re-determination still results in a conflict, the incrementing process continues until the incrementing exceeds a predetermined step size. Through linear incrementing, the empty storage space of discrete index values ​​is filled, thereby improving the storage space utilization rate.

[0022] Example 1:

[0023] like Figures 1 to 3 As shown, the present invention provides a dynamically reconfigurable table entry storage and retrieval method, comprising the following functional components: data input interface 1, table entry data mapping 2, index value conflict detection 3, linear expansion exploration 4, data operation processing 5, and data output interface 6. The connection relationships between the functional modules are as follows: Figure 2 As shown.

[0024] like Figure 2 As shown, the present invention provides a dynamically reconfigurable table entry storage and retrieval method. The processing flow is as follows: After table entry data is input through data input interface 1, the data is calculated using dynamically reconfigurable table entry data mapping 2 to obtain the corresponding index value. Conflict detection 3 is performed on the index value; if a conflict occurs, linear expansion exploration 4 is used to obtain a new index value. Then, based on the index value, data storage and retrieval operations are performed on the table entry 5, and the processing result is output through data output interface 6.

[0025] like Figure 3 As shown, this invention provides a dynamically reconfigurable table entry storage and retrieval method, wherein the table entry data mapping 2 includes data preprocessing and a mapping algorithm. A new mapping algorithm B can be input through a dynamic configuration interface to replace the old mapping algorithm A, enabling dynamic reconfiguration of different algorithms such as mapping algorithm A and mapping algorithm B.

[0026] like Figure 4As shown, this invention provides a dynamically reconfigurable table entry storage and retrieval method. In the linear expansion exploration 4, if multiple table entries corresponding to the same index value (i.e., data A, data B, data C, etc., correspond to the same index), the index value is linearly incremented, and the resulting new index value (Index+1, Index+2, ..., Index+N-1, Index+N) is used to re-determine conflicts. If conflicts still occur after re-determining, the incrementing process continues until it exceeds a predetermined step size (N). This linear incrementing process fills the empty storage space of discrete index values, thereby improving storage space utilization.

[0027] Example 2:

[0028] A dynamically reconfigurable table entry storage and retrieval method is proposed. The method works as follows: after inputting table entry data, a dynamically reconfigurable mapping algorithm is used to calculate the corresponding index value. The table entry data is then stored and retrieved based on the index value. If multiple table entries correspond to the same index value, a conflict occurs, and a linear expansion exploration method is used to resolve the table entry index conflict problem.

[0029] Furthermore, the mapping algorithm, storage capacity, linear expansion exploration step size, etc., can all be dynamically reconfigured in terms of algorithm, parameters, or values.

[0030] Furthermore, this method dynamically changes the mapping algorithm during operation to adapt to different table entry storage and retrieval needs.

[0031] Furthermore, this method calculates variable-length table entries into a one-to-one corresponding fixed-length value, which is the table entry index value.

[0032] Furthermore, this includes operations such as adding, inserting, updating, deleting, and retrieving table entries.

[0033] Furthermore, if multiple table entries are detected to correspond to the same index value, the index value is linearly incremented, and the new index value is used to re-determine the conflict. If a conflict still occurs after the re-determination, the incrementing process continues until the increment exceeds the limit step size.

[0034] Furthermore, this method fills the empty storage space of discrete index values ​​through linear addition, thereby improving the utilization rate of storage space.

[0035] Furthermore, the index value length can be dynamically configured while the system is in operation.

[0036] Furthermore, the defined step size can be dynamically configured during operation.

[0037] This invention provides a dynamically reconfigurable table entry storage and retrieval method. It maps the content of table entries to be stored to index values ​​of uniform length, and uses these index values ​​to store and retrieve the table entry content. The mapping algorithm and uniform length can be dynamically reconfigured and changed online according to actual storage capacity and retrieval speed requirements, and a linear expansion exploration method is used to reduce index value conflicts. Ultimately, this invention achieves efficient storage and retrieval of dynamically reconfigurable table entry data, enabling high-speed retrieval of table entry content, reducing the need for table entry storage capacity, and improving storage space utilization.

[0038] The above description is only a preferred embodiment of the present invention. It should be noted that for those skilled in the art, several improvements and modifications can be made without departing from the technical principles of the present invention, and these improvements and modifications should also be considered within the scope of protection of the present invention.

Claims

1. A method of dynamically reconfigurable table entry storage and retrieval, characterized by, The method includes: after inputting table entry data, using a dynamically reconfigurable mapping algorithm to calculate the data and obtain the corresponding index value, and storing and retrieving the table entry data according to the index value; if multiple table entry data correspond to the same index value, a conflict is generated, and a linear expansion exploration method is used to resolve the table entry index conflict problem.

2. The dynamically reconfigurable table entry storage and retrieval method of claim 1, wherein, The mapping algorithm, storage capacity, and linear expansion exploration step size are all dynamically reconfigured algorithms, parameters, or values.

3. The dynamically reconfigurable table entry storage and retrieval method of claim 1, wherein, The mapping algorithm is used to calculate a one-to-one fixed-length value for variable-length table entries, which is the table entry index value.

4. The dynamically reconfigurable table entry storage and retrieval method of claim 3, wherein, If multiple table entries are detected to correspond to the same index value, the index value is linearly incremented, and the new index value is used to re-determine the conflict. If a conflict still occurs after the re-determination, the incrementing continues until the increment exceeds the limit step size. The empty storage space of discrete index values ​​is filled through linear incrementing.

5. The dynamically reconfigurable table entry storage and retrieval method of claim 1, wherein, After table entry data is input through the data input interface, the data is calculated using a dynamically reconfigurable table entry data mapping to obtain the corresponding index value; conflict detection is performed on the index value, and if a conflict occurs, a linear expansion is used to explore and obtain a new index value; then, the table entry is stored and retrieved based on the index value, and the processing result is output through the data output interface.

6. The dynamically reconfigurable table entry storage and retrieval method of claim 5, wherein, The table entry data mapping includes data preprocessing and mapping algorithms. The new mapping algorithm B is input through a dynamic configuration interface to replace the old mapping algorithm A, thereby realizing the dynamic reconfiguration of mapping algorithm A and mapping algorithm B.

7. The dynamically reconfigurable table entry storage and retrieval method of claim 5, wherein, If multiple table entries are found to correspond to the same index value, the linear expansion exploration will linearly increase the index value and use the new index values ​​Index+1, Index+2, ..., Index+N-1, Index+N to re-determine the conflict. If a conflict still occurs after reassessment, the increment process continues until the increment exceeds the limit step size N.

8. The dynamically reconfigurable table entry storage and retrieval method of claim 7 wherein, The mapping algorithm can be dynamically changed while the system is in operation to adapt to different table entry storage and retrieval needs.

9. The dynamically reconfigurable table entry storage and retrieval method as described in claim 7, characterized in that, The index value length is dynamically configured while the system is in operation.

10. The dynamically reconfigurable table entry storage and retrieval method as described in claim 7, characterized in that, The step size is dynamically configured during operation.

Images