Communication management method, chip, electronic equipment and storage medium
By performing erasure coding and reversible scrambling operations on the hash table data, the hash data is generated, which solves the problem of wasted resource storage and duplication of index values, and improves the filling rate and search efficiency of the hash table.
Patent Information
- Application Number
- CN202310809845.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-06-30
- Publication Date
- 2025-01-07
AI Technical Summary
When storing and searching for communication address data, existing hash tables require a large amount of storage resources and repeated index values lead to a decrease in the fill rate, which affects the accuracy of the search results.
By performing erasure coding operations on compressed data, deleting the values in the preset interval, and performing reversible scrambling operations, generating index data and characterizing data, splicing and forming hash data, and generating hash tables to improve the random characteristics of index data. and reduce repetition.
It improves the filling rate of the hash table, reduces the RAM usage, and improves the reading speed of the hash table and the correctness of the search results.
Smart Images
Figure CN119276947A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of communication technology, and in particular to a data compression method, chip, electronic device and storage medium of a hash table. Background Art
[0002] At present, in some network devices or communication modules, protocol communication is performed through communication address data and communication strategy data in a hash table, such as Ethernet switching, Internet Protocol (IP) routing, and flow classification data. The hash table is stored in the static storage space (RAM) of the network device. When the network device searches for address data in the hash table, it calculates the index value of the hash table according to the communication address key value (key) of the requesting party received, reads the communication address data corresponding to the index value, and communicates with the requesting party when it is confirmed that the communication address key value is the same as the communication address data. At present, the hash table needs to store complete key values to ensure the correctness of the search results of the address data, which requires a large amount of storage resources. In order to save storage resources, the key value is usually compressed by a compression method. In the mainstream compression algorithm (such as the CRC algorithm), the generated index value is related to the regularity of the key value and does not have a good random characteristic. In some scenarios, the index value is repeated, which leads to a decrease in the fill rate of the hash table, thereby reducing the correctness of the search result. Summary of the invention
[0003] The main purpose of this application is to provide a communication management method, chip, electronic device and storage medium for managing the communication process between multiple terminal devices to improve the efficiency of fault locating in the communication process.
[0004] In a first aspect, an embodiment of the present application provides a method for compressing data of a hash table, the method comprising:
[0005] Acquire data to be compressed, the data to be compressed includes multiple key values, the key value includes multiple values, the bit width of all the values of the key value is n, perform erasure coding operation on all the values of the key value to generate first data with a bit width of m, wherein n>m;
[0006] Delete the value in a preset interval in the key value to generate second data, where the bit width of the preset interval is m;
[0007] Performing a reversible scrambling operation on the first data to generate third data, wherein the third data includes index data and characterization data;
[0008] The characterization data and the corresponding second data are concatenated to generate hash data, and the hash data is arranged according to the index data to generate the hash table.
[0009] In a second aspect, an embodiment of the present application provides a chip, the chip comprising: a data indexing module, a data compression module, a data scrambling module and a result generation module;
[0010] A data index module, used to obtain data to be compressed, wherein the data to be compressed includes multiple key values, the key values include multiple values, the bit width of all the values of the key values is n, and perform erasure coding operation on all the values of the key values to generate first data with a bit width of m, wherein n>m;
[0011] A data compression module, used for deleting the values in a preset interval in the key value to generate second data, wherein the bit width of the preset interval is m;
[0012] A data scrambling module, configured to perform a reversible scrambling operation on the first data to generate third data, wherein the third data includes index data and characterization data;
[0013] The result generation module is used to concatenate the representation data and the corresponding second data to generate hash data, arrange the hash data according to the index data, and generate the hash table.
[0014] In a third aspect, an embodiment of the present application provides an electronic device, characterized in that it includes a memory, a processor, a program stored in the memory and executable on the processor, and a data bus for realizing connection communication between the processor and the memory, wherein when the program is executed by the processor, the steps of the communication management method as described in any one of the embodiments of the present application are realized.
[0015] In a fourth aspect, an embodiment of the present application provides a storage medium for computer-readable storage, wherein the storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to implement the steps of a communication management method as described in any one of the embodiments of the present application.
[0016] An embodiment of the present application provides a communication management method, including: obtaining data to be compressed, the data to be compressed includes multiple key values, the key values include multiple numerical values, the bit width of all the numerical values of the key values is n, performing correction and erasure code operations on all the numerical values of the key values to generate first data with a bit width of m, wherein n>m; deleting the numerical values within a preset interval in the key value to generate second data, the bit width of the preset interval is m; performing a reversible scrambling operation on the first data to generate third data, the third data includes index data and representation data; splicing the representation data and the corresponding second data to generate hash data, arranging the hash data according to the index data, and generating a hash table. In the above process, first data is generated according to all numerical values of the key value compression, the numerical value in the preset interval of the key value is deleted to generate second data, and the first data is subjected to a reversible scrambling operation to obtain index data and characterization data, thereby improving the random characteristics of the index data and the characterization data to prevent and reduce duplication of the index data, and then the hash data generated by splicing the characterization data and the second data is sorted according to the index data obtained by the reversible scrambling operation to generate a hash table, thereby preventing the fill rate of the hash table from decreasing by improving the random characteristics of the index data, and compressing the key value in the hash table to the same data bit width as the index data, thereby reducing RAM occupancy and improving the reading speed of the hash table. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] Figure 1 is a schematic flow chart of a first hash table data compression method provided in an embodiment of the present application;
[0018] Figure 2 is a schematic flow chart of a second hash table data compression method provided in an embodiment of the present application;
[0019] Figure 3 is a schematic block diagram of a data compression device provided in an embodiment of the present application;
[0020] Figure 4 is a schematic diagram of a mapping table provided in an embodiment of the present application;
[0021] Figure 5 is a schematic diagram of a mapping table provided in an embodiment of the present application;
[0022] Figure 6 is a schematic diagram of a reversible matrix provided in an embodiment of the present application;
[0023] Figure 7 is a schematic block diagram of a chip provided in an embodiment of the present application;
[0024] Figure 8 It is a structural block diagram of a terminal device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0025] In order to enable those skilled in the art to better understand the technical solution of the present disclosure, the heat dissipation device and base station equipment provided by the present disclosure are described in detail below in conjunction with the accompanying drawings.
[0026] Example embodiments will be described more fully below with reference to the accompanying drawings, but the example embodiments may be embodied in different forms and should not be construed as limited to the embodiments set forth herein. On the contrary, the purpose of providing these embodiments is to make the present disclosure thorough and complete and to enable those skilled in the art to fully understand the scope of the present disclosure.
[0027] In the absence of conflict, the various embodiments of the present disclosure and the various features therein may be combined with each other.
[0028] As used herein, the term "and / or" includes any and all combinations of one or more of the associated listed items.
[0029] The terms used herein are only used to describe specific embodiments and are not intended to limit the present disclosure. As used herein, the singular forms "a", "an" and "the" are also intended to include the plural forms, unless the context clearly indicates otherwise. It will also be understood that when the terms "comprising" and / or "made of" are used in this specification, the presence of the features, wholes, steps, operations, elements and / or components is specified, but the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or groups thereof is not excluded.
[0030] Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by those of ordinary skill in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the relevant art and the present disclosure, and will not be interpreted as having an idealized or overly formal meaning unless explicitly defined as such herein.
[0031] Erasure coding (EC) is a data protection method that divides data into fragments, expands and encodes redundant data blocks, and stores them in different locations, such as disks, storage nodes, or other geographical locations. Through erasure coding, the input data can be compressed into a fixed-bit width value. In erasure coding, commonly used codes include: parity code, cyclic redundancy check code (CRC) and checksums.
[0032] At present, network devices or communication modules often use CRC algorithms to perform index calculations on key values in hash tables. The CRC algorithm obtains the result of XORing some values in the key values with each other, which does not have a high random characteristic, causing the fill rate of the hash table to fluctuate greatly, and the performance of the hash table storing hash entries is reduced. The mainstream index compression algorithm is based on the CRC algorithm, and performs CRC operations on some key values, which also has the problem of not having a high random characteristic, which in turn causes the fill rate of the hash table to fluctuate greatly.
[0033] See also Figure 1 , Figure 1 The following is a schematic flow chart showing a first method for compressing data in a hash table according to an embodiment of the present application. Figure 1 As shown, the data compression method of the hash table provided in the embodiment of the present application comprises the following specific steps: S101-S104.
[0034] S101. Obtain data to be compressed, where the data to be compressed includes multiple key values, each of which includes multiple numerical values. The bit width of all the numerical values of the key values is n. Perform erasure coding operation on all the numerical values of the key values to generate first data with a bit width of m, where n>m.
[0035] Exemplarily, the data to be compressed is a plurality of hash entries, each hash entry includes a key value and a result value, wherein after a hash table is generated according to the hash entry, the key value is used to index the hash entry in the hash table, thereby obtaining the result value in the hash entry. In an embodiment of the present application, the compression of the hash entry is achieved by compressing the bit width of the key value, thereby achieving compression of the hash table.
[0036] In the process of processing the data to be compressed, taking the CRC algorithm to implement the erasure code operation as an example, the CRC-16 algorithm is used to compress all the values of the key value with a longer bit width into the first data with a shorter bit width. For example, the bit width of all the values of the key value is 48, and the CRC-16 algorithm is used to compress the first data with a bit width of 16, and the unit of the bit width is bits. It should be noted that the CRC algorithm can be changed to output erasure codes of multiple bit widths. For example, the CRC-16 algorithm outputs an erasure code with a bit width of 16, and the CRC-32 algorithm outputs an erasure code with a bit width of 32.
[0037] In the embodiment of the present application, by compressing the entire value of the key value, the random characteristics and hash effect of the compression result can be improved compared to compressing part of the key value.
[0038] S102, deleting the value in the preset interval of the key value to generate second data, where the bit width of the preset interval is m.
[0039] Exemplarily, m=16, the bit width of the preset interval is 16, then the preset interval can be the interval of the upper 16 bits in the value of the key value, or the interval of the lower 16 bits in the value of the key value, or the interval of 16 bits at any position in the value of the key value, which can be set by the user. It should be noted that each group of data to be compressed can only use the same preset interval, and different groups of data to be compressed can use different preset intervals to avoid data confusion.
[0040] S103: Perform a reversible scrambling operation on the first data to generate third data, where the third data includes index data and characterization data.
[0041] Exemplarily, the first data is obtained by compressing all the values of the key value through the erasure code operation. Although it has certain random characteristics and hash effects, there may still be a correlation between the key value and the first data. Therefore, it is necessary to destroy the correlation between the key value and the first data through a reversible scrambling operation so that the third data has certain random characteristics and hash effects. For example, the reversible scrambling operation includes a substitution operation and a permutation operation to generate third data with a certain avalanche effect. The third data includes index data and characterization data. Since the regularity between the values of multiple first data is destroyed to prevent the values obtained from different key value mappings from being consistent, the index data in the third data obtained can improve the fill rate of the hash table.
[0042] The bit width of the index data can be determined according to the storage specification of the hash table. For example, the bit width of the third data is 16 bits, and the storage specification of the hash table is 8192 rows. Then, the index data only needs 13 bits to complete the indexing of 8192 rows. The third data with a bit width of 16 bits can be divided into index data with a bit width of 13 bits and representation data with a bit width of 3 bits.
[0043] It should be noted that after the reversible scrambling operation, the first data and the third data have a mapping relationship, that is, the first data and the third data correspond one-to-one, that is, there is no repeated value in the input and output. Based on the mapping relationship, the corresponding first data can be determined by the third data.
[0044] S104: concatenate the representation data and the corresponding second data to generate hash data, arrange the hash data according to the index data, and generate a hash table.
[0045] For example, the third data with a bit width of 16 bits can be divided into index data with a bit width of 13 bits and representation data with a bit width of 3 bits. The index data is used to index the storage location of 8192 rows of the hash table, and the representation data with a bit width of 3 bits is spliced into the hash data. When indexing, it is necessary to compare not only the second data but also the representation data. In this way, the correctness of the search match can be ensured.
[0046] When storing hash data, the number of rows corresponding to the index data is calculated, and the hash data corresponding to the index data is filled into the number of rows corresponding to the index data in the hash table to generate a hash table.
[0047] In the above process, first data is generated according to all numerical values of the key value compression, the numerical value in the preset interval of the key value is deleted to generate second data, and the first data is subjected to a reversible scrambling operation to obtain index data and characterization data, thereby improving the random characteristics of the index data and the characterization data to prevent and reduce duplication of the index data, and then the hash data generated by splicing the characterization data and the second data is sorted according to the index data obtained by the reversible scrambling operation to generate a hash table, thereby preventing the fill rate of the hash table from decreasing by improving the random characteristics of the index data, and compressing the key value in the hash table to the same bit width as the index data, thereby reducing RAM occupancy and improving the reading speed of the hash table.
[0048] In order to more clearly introduce the technical solution of the present application, the technical solution of the present application will be introduced through a specific embodiment below. It should be noted that the specific embodiment is used to expand the technical solution of the present application, but is not intended to limit the present application.
[0049] In one embodiment, see Figure 2 , Figure 2 The following is a schematic flow chart showing a second method for compressing data in a hash table according to an embodiment of the present application. Figure 2 As shown, the second hash table data compression method provided in the embodiment of the present application comprises the following specific implementation steps: S201-S207.
[0050] S201. Obtain data to be compressed, wherein the data to be compressed includes multiple key values, the key values include multiple numerical values, the bit width of all the numerical values of the key values is n, and perform correction and erasure coding operation on all the numerical values of the key values to generate first data with a bit width of m, wherein n>m.
[0051] Exemplarily, the CRC-16 algorithm is used to perform erasure code calculation to generate first data with a bit width of 16 bits. The bit width n of the key value must be greater than 16, for example, n=48.
[0052] S202: Delete the numerical value in the preset interval of the key value to generate second data, where the bit width of the preset interval is m.
[0053] S203: Perform a reversible scrambling operation on the first data to generate third data, where the third data includes index data and characterization data.
[0054] S204 . Perform erasure coding operation on the second data to generate fourth data with a bit width of m.
[0055] Exemplarily, here the same CRC-16 algorithm as in S201 is used to perform erasure coding operation on the second data to generate fourth data with a bit width of m.
[0056] S205. Perform a reversible scrambling operation on the fourth data to generate fifth data, where the bit width of the fifth data is m.
[0057] Exemplarily, in order to add random characteristics to the fourth data, a reversible scrambling operation is performed on the fourth data to obtain the fifth data. It should be noted that since the fifth data and the third data need to be processed in the subsequent process, it is necessary to ensure that the bit widths of the fifth data and the third data are the same.
[0058] S206 , performing a reversible logic operation on the first data and the fifth data to generate sixth data, where the sixth data includes index data and characterization data.
[0059] Exemplarily, a reversible logic operation is performed on the first data and the fifth data by an XOR algorithm to generate the sixth data. The algorithm for implementing the reversible logic operation also includes addition.
[0060] S207: Concatenate the representation data and the corresponding second data to generate hash data, sort the hash data according to the index data, and generate a hash table.
[0061] In the second hash table data compression method provided in an embodiment of the present application, the fifth data obtained by performing correction and erasure coding operation and reversible scrambling operation on the second data is subjected to a reversible logical operation on the first data to generate the sixth data, thereby further enhancing the random characteristics of the index data in the sixth data, thereby making the fill rate of the hash table more stable.
[0062] In some embodiments, see Figure 3 , Figure 3 A schematic block diagram of a data compression device provided by an embodiment of the present application is shown. Figure 3As shown, the data compression device 100 includes a main computing module 101, a scrambling operation module 102 and a logic operation module 103. The main computing module 101 is used to implement entanglement code operation, the scrambling operation module 102 is used to implement reversible scrambling operation, and the logic operation module 103 is used to implement reversible logic operation.
[0063] In some embodiments, a reversible scrambling operation is performed on the first data, including: splitting the first data into multiple value groups according to a preset bit width, and the bit width of the value group is equal to the preset bit width; replacing the value group with a mapping group according to a preset mapping table, and generating third data according to the mapping group.
[0064] For example, the scrambling operation is a substitution operation, referred to as an S-box (Substitution-box), which is used to replace a fixed bit value with another value, and the bit width of the input value and the output value are the same. Take the 4-bit substitution S-box with 16-bit input as an example. When 16-bit data K is input into the S-box, the S-box splits the data K into 4 4-bit data, i.e., k 1 , k 2 , k 3 and k 4 , for k 1 , k 2 , k 3 and k 4 Perform 4-bit substitution of S-box operation. The substitution formula of S-box is: R n =S(k n ), where n = 1, 2, 3 and 4, S(k n ) is the mapping relationship of S-box operation.
[0065] See also Figure 4 , Figure 4 A schematic diagram of a mapping table provided in an embodiment of the present application is shown. Figure 4 As shown, k n and S(k n ) have a one-to-one correspondence, that is, one input has only one corresponding output. 1 , k 2 , k 3 and k 4 After inputting into the S box, we get R 1 , R 2 , R 3 and R 4 , according to R 1 , R 2 , R 3 and R 4 Generate an output value R, that is, R is the third data.
[0066] After the first data is scrambled by substitution operation, the third data with avalanche effect is generated, so that the random characteristics between the index data and the hash table are better, and the correctness of the search and match can be ensured.
[0067] In some embodiments, performing a reversible scrambling operation on the first data includes: replacing the value of the first data with a mapping value according to a preset mapping table; and generating third data according to the mapping value.
[0068] For example, the scrambling operation is a permutation operation, referred to as a P-box (Permutation-box), which is used to replace each value of the input data with a corresponding unique mapping value, and the bit width of the input value and the output value are the same. Take the 16-bit input 16-bit permutation P-box as an example, the 16-bit data L is output in the P-box, and the P-box records L as L 0 L 1 L 2 ...L 14 L 15 , the permutation formula of P box is: U n =L M(n) , n = 0, 1, 2, ..., 14 and 15, L M(n ) is the mapping relationship of the P box.
[0069] See also Figure 5 , Figure 5 A schematic diagram of a mapping table provided in an embodiment of the present application is shown. Figure 5 As shown, n and M n There is a one-to-one correspondence, that is, one input has only one corresponding output. 0 L 1 L 2 ...L 14 L 15 After inputting into the P box, we get U 0 U 1 U 2 ...U 14 U 15 , according to U 0 U 1 U 2 ...U 14 U 15 Generate an output value U, that is, U is the third data.
[0070] After the first data is scrambled by the permutation operation, the third data with the avalanche effect is generated, so that the random characteristics between the index data and the hash table are better, and the correctness of the search and matching can be ensured.
[0071] In some embodiments, a reversible scrambling operation is performed on the first data, including: importing the numerical value corresponding to the first data into a preset reversible matrix to generate a matrix multiplication replacement value, the bit width of the matrix multiplication replacement value is equal to the bit width of the numerical value of the first data; and generating third data according to the matrix multiplication replacement group.
[0072] Exemplarily, the scrambling operation is a matrix multiplication operation, which is used to convert the value of the fixed area into a matrix multiplication replacement value by a matrix multiplication operation of a finite field, wherein the matrix used in the matrix multiplication operation is a reversible matrix, and the bit width of the input value and the output value is the same. Taking the P box of 16-bit matrix multiplication with 16-bit input as an example, the input 16-bit data J is recorded as J 0 J 1 J 2 ...J 14 J 15 , the matrix multiplication formula of the P box is Among them, C n,m is the invertible matrix for matrix multiplication. See Figure 6 , Figure 6 A schematic diagram of a reversible matrix provided in an embodiment of the present application is shown. Figure 6 The matrix shown ensures that X n and J m There is a bijective relationship. Through this matrix, J 0 J 1 J 2 ...J 14 J 15 Convert to matrix multiplication replacement value X 0 X 1 X 2 ...X 14 X 15 , output X, that is, X is the third data.
[0073] After the first data is scrambled by matrix multiplication operation, the third data with avalanche effect is generated, so that the random characteristics between the index data and the hash table are better, and the correctness of the search and matching can be ensured.
[0074] In some embodiments, performing a reversible scrambling operation on the first data includes: performing a reversible scrambling operation on the first data according to a preset operation, the preset operation includes one or more of a substitution operation, a permutation operation, and a matrix multiplication operation, wherein the matrix used in the matrix multiplication operation is a reversible matrix.
[0075] Exemplarily, when using a reversible scrambling operation to perturb the first data, one preset operation can be used, or multiple preset operations can be used. Using only any one of substitution operation, permutation operation, and matrix multiplication operation to perturb the first data can also have a certain avalanche effect, but to obtain a better avalanche effect, multiple preset operations can be used in combination, for example, using substitution operation, permutation operation, and matrix multiplication operation to perform reversible scrambling operation, and scrambling the data in the order of "substitution operation-permutation operation-matrix multiplication operation", so that a better avalanche effect can be obtained, so that the generated third data has extremely high random characteristics, thereby making the fill rate of the hash table more stable.
[0076] In some embodiments, the order and number of times the substitution operation, permutation operation, and matrix multiplication operation are used may be changed.
[0077] Exemplarily, on the basis of using a plurality of preset operations to perform reversible scrambling budget on the first data, the scrambling effect can also be improved by changing the order and number of times of use of the plurality of preset operations. For example, scrambling is performed in the order of "substitution operation-permutation operation-matrix multiplication operation-substitution operation-permutation operation", wherein the number of times the substitution operation and the permutation operation are used is two, and before and after the matrix multiplication operation, the substitution operation and the permutation operation are used for scrambling to improve the avalanche effect of the third data. It should be noted that the above-mentioned order of use and number of times of use are only used to explain the corresponding technical solutions, and are not intended to limit the present application. The combination of preset operations set by the order of use and the number of times of use are all within the protection scope of the present application.
[0078] It should be noted that, in the embodiment of the present application, the technical solution for performing scrambling operation on the first data is also applicable to performing scrambling operation on the fourth data.
[0079] See also Figure 7 , Figure 7 A schematic block diagram of a chip is shown, and the chip 300 is used to execute any one of the hash table data compression methods provided in the embodiments of the present application. Figure 7 As shown, the chip 300 includes a data indexing module 301, a data compression module 302, a data scrambling module 303 and a result generating module 304, and the above modules are computing power modules in the chip 300.
[0080] The data index module 301 is used to obtain the data to be compressed, the data to be compressed includes multiple key values, the key values include multiple numerical values, the bit width of all the key value numerical values is n, and the erasure code operation is performed on all the key value numerical values to generate the first data with a bit width of m, where n>m.
[0081] The data compression module 302 is used to delete the values in a preset interval in the key value to generate second data, and the bit width of the preset interval is m.
[0082] The data scrambling module 303 is used to perform a reversible scrambling operation on the first data to generate third data, where the third data includes index data and characterization data.
[0083] When the data scrambling module 303 is used to implement a reversible scrambling operation on the first data, it is specifically used to implement: according to a preset bit width, split the first data into multiple value groups, and the bit width of the value group is equal to the preset bit width; according to a preset mapping table, replace the value group with a mapping group, and generate the third data according to the mapping group.
[0084] When the data scrambling module 303 is used to implement a reversible scrambling operation on the first data, it is specifically used to implement: according to a preset mapping table, replacing the value of the first data with a mapping value; and generating the third data according to the mapping value.
[0085] When the data scrambling module 303 is used to implement a reversible scrambling operation on the first data, it is specifically used to implement: importing the numerical value of the first data into a preset reversible matrix to generate a matrix multiplication replacement value, the bit width of the matrix multiplication replacement value is equal to the bit width of the numerical value of the first data; and generating the third data according to the matrix multiplication replacement group.
[0086] When the data scrambling module 303 is used to implement a reversible scrambling operation on the first data, it is specifically used to implement: performing a reversible scrambling operation on the first data according to a preset operation, the preset operation includes one or more of a substitution operation, a permutation operation and a matrix multiplication operation, wherein the matrix used in the matrix multiplication operation is a reversible matrix.
[0087] The result generation module 304 is used to concatenate the representation data and the corresponding second data to generate hash data, arrange the hash data according to the index data, and generate a hash table.
[0088] See also Figure 8 , Figure 8 The following figure shows a structural block diagram of a terminal device. Figure 8 As shown, an embodiment of the present application proposes a terminal device 20, which includes a memory 21, a processor 22, a program stored in the memory and executable on the processor, and a data bus 23 for realizing connection communication between the processor 21 and the memory 22. When the program is executed by the processor, the steps of the communication management method as described in any one of the embodiments of the present application are realized.
[0089] An embodiment of the present application provides a communication system, the communication system includes a routing device and a terminal device, and the terminal device is any one of the terminal devices provided in the embodiments of the present application.
[0090] An embodiment of the present application provides a storage medium for computer-readable storage, wherein the storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to implement the steps of any communication management method provided in the embodiment of the present application.
[0091] The preferred embodiments of the present application are described above with reference to the accompanying drawings, but the scope of the present application is not limited thereby. Any modification, equivalent substitution and improvement made by a person skilled in the art without departing from the scope and essence of the present application shall be within the scope of the present application.
Claims
1. A data compression method for a hash table, characterized in that: The method comprises: Acquire data to be compressed, the data to be compressed includes multiple key values, the key value includes multiple values, the bit width of all the values of the key value is n, perform erasure coding operation on all the values of the key value to generate first data with a bit width of m, wherein n>m; Delete the value in a preset interval in the key value to generate second data, where the bit width of the preset interval is m; Performing a reversible scrambling operation on the first data to generate third data, wherein the third data includes index data and characterization data; The characterization data and the corresponding second data are concatenated to generate hash data, and the hash data is arranged according to the index data to generate the hash table.
2. The data compression method of a hash table according to claim 1, characterized in that: After performing a reversible scrambling operation on the first data to generate third data, the method further includes: Performing an erasure code operation on the second data to generate fourth data with a bit width of m; Perform a reversible scrambling operation on the fourth data to generate fifth data, where the bit width of the fifth data is m; Performing a reversible logic operation on the first data and the fifth data to generate sixth data, wherein the sixth data includes index data and characterization data; The characterization data and the corresponding second data are concatenated to generate hash data, and the hash data is sorted according to the index data to generate the hash table.
3. The data compression method of a hash table according to claim 1, characterized in that: The performing a reversible scrambling operation on the first data includes: According to a preset bit width, the first data is divided into a plurality of value groups, wherein the bit width of the value group is equal to the preset bit width; According to a preset mapping table, the value group is replaced with a mapping group, and the third data is generated according to the mapping group.
4. The data compression method of a hash table according to claim 1, characterized in that: The performing a reversible scrambling operation on the first data includes: According to a preset mapping table, the value of the first data is replaced with a mapping value; The third data is generated according to the mapping value.
5. The data compression method of a hash table according to claim 1, characterized in that: The performing a reversible scrambling operation on the first data includes: Importing the value of the first data into a preset reversible matrix to generate a matrix-product replacement value, wherein the bit width of the matrix-product replacement value is equal to the bit width of the value of the first data; The third data is generated according to the matrix multiplication substitution group.
6. The data compression method of a hash table according to claim 1, characterized in that: The performing a reversible scrambling operation on the first data includes: A reversible scrambling operation is performed on the first data according to a preset operation, wherein the preset operation includes one or more of a substitution operation, a permutation operation, and a matrix multiplication operation, wherein the matrix used in the matrix multiplication operation is a reversible matrix.
7. The data compression method of a hash table as claimed in claim 6, characterized in that: The order and number of times the substitution operation, the permutation operation, and the matrix multiplication operation are used may be changed.
8. A chip, characterized in that: The chip comprises: A data index module, used to obtain data to be compressed, wherein the data to be compressed includes multiple key values, the key values include multiple values, the bit width of all the values of the key values is n, and perform erasure coding operation on all the values of the key values to generate first data with a bit width of m, wherein n>m; A data compression module, used for deleting the values in a preset interval in the key value to generate second data, wherein the bit width of the preset interval is m; A data scrambling module, configured to perform a reversible scrambling operation on the first data to generate third data, wherein the third data includes index data and characterization data; The result generation module is used to concatenate the representation data and the corresponding second data to generate hash data, arrange the hash data according to the index data, and generate the hash table.
9. An electronic device, characterized in that: It includes a memory, a processor, a program stored in the memory and executable on the processor, and a data bus for realizing connection and communication between the processor and the memory. When the program is executed by the processor, the steps of the data compression method of the hash table as described in any one of claims 1 to 7 are realized.
10. A storage medium for computer-readable storage, characterized in that: The storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to implement the steps of the hash table data compression method as described in any one of claims 1-7.