CN115426315A - Information processing method, device and equipment - Google Patents
Information processing method, device and equipment Download PDFInfo
- Publication number
- CN115426315A CN115426315A CN202211382175.4A CN202211382175A CN115426315A CN 115426315 A CN115426315 A CN 115426315A CN 202211382175 A CN202211382175 A CN 202211382175A CN 115426315 A CN115426315 A CN 115426315A
- Authority
- CN
- China
- Prior art keywords
- result
- policy table
- target
- storage area
- storing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
The invention provides an information processing method, an information processing device and information processing equipment, wherein the method comprises the following steps: acquiring at least one policy table; storing the at least one policy table in a target memory area of a double-rate synchronous dynamic random access memory (DDR SDRAM), wherein the DDR SDRAM comprises at least two memory areas, and the addresses of two adjacent memory areas are continuous; and caching a target policy table in the target storage area into a random access memory corresponding to the target storage area, wherein the target policy table is a policy table matched with a target message. The scheme of the invention can realize higher rate matching and greatly improve the table look-up rate.
Description
Technical Field
The present invention relates to the field of computer information processing technologies, and in particular, to an information processing method, apparatus, and device.
Background
With the popularization and application of high-speed networks, the requirements on policy matching of IP messages and the search rate of routes are higher. In the traditional design, an external TCAM (ternary content addressable memory) special chip is adopted for IP message strategy matching and route searching, and the method has high cost and high power consumption.
Disclosure of Invention
The technical problem to be solved by the invention is how to provide an information processing method, device and equipment. The matching rate is improved, and the power consumption is reduced.
In order to solve the technical problems, the technical scheme of the invention is as follows:
an information processing method, the method comprising:
acquiring at least one policy table;
storing the at least one policy table in a target storage area of a double-rate synchronous dynamic random access memory (DDR SDRAM), wherein the DDR SDRAM comprises at least two storage areas, and the addresses of two adjacent storage areas are continuous;
caching the target strategy table in the target storage area into a random access memory corresponding to the target storage area, wherein the target strategy table is a strategy table matched with a target message.
Optionally, storing the at least one policy table in a target storage area of the ddr sdram, including:
performing hash operation according to the content of a first policy table in the at least one policy table to obtain a first result;
performing hash operation according to the content of a second policy table in the at least one policy table to obtain a second result;
and storing the at least one policy table in a target storage area of the double rate synchronous dynamic random access memory according to the first result and the second result.
Optionally, storing the at least one policy table in a target storage area of the ddr sdram according to the first result and the second result, including:
if the first result is different from the second result, storing the first policy table in a first target storage area according to the first result and storing the second policy table in the first target storage area according to the second result;
and if the first result is the same as the second result, storing the first policy table in a first target storage area, performing hash operation on the second result to obtain a third result, and storing the second policy table according to the third result.
Optionally, storing the first policy table in the first target storage area according to the first result includes:
and taking the low N1 bit of the first result as a storage address of the first policy table, and storing the first policy table in the first target storage area, wherein N1 is a positive integer.
Optionally, storing the second policy table in the first target storage area according to the second result includes:
and taking the low N1 bit of the second result as a storage address of the second policy table, and storing the second policy table in the first target storage area, wherein N1 is a positive integer.
Optionally, storing the second policy table according to the third result includes:
if the third result is different from the first result and the second result, the low N1 bit of the third result is used as a storage address of the second policy table, the second policy table is stored in a second target storage area, and the second target storage area and the first target storage area are adjacent storage areas;
and if the third result is the same as the first result or the second result, performing hash operation on the second result and the third result to obtain a fourth result, and if the fourth result is different from the first result, the second result and the third result, taking the low N1 bit of the fourth result as the address of the second policy table, and storing the second policy table in a third target storage area, wherein N1 is a positive integer.
Optionally, caching the target policy table in the target storage area into a random access memory corresponding to the target storage area, including:
searching a target policy table from the first target storage area according to the first result, and if the content in the first target storage area is not 0, analyzing the target policy table;
and transferring the low N2 bits of the preset field in the target policy table to a random access memory corresponding to the target storage area, wherein N2 is a positive integer.
Optionally, the information processing method further includes:
receiving a query request for a target policy table;
and reading the target policy table from the random access memory according to the query request.
An embodiment of the present invention further provides a key processing apparatus, including:
the obtaining module is used for obtaining at least one policy table;
the processing module is used for storing the at least one policy table in a target storage area of a double-rate synchronous dynamic random access memory, the double-rate synchronous dynamic random access memory comprises at least two storage areas, and the addresses of the two adjacent storage areas are continuous; and caching a target policy table in the target storage area into a random access memory corresponding to the target storage area, wherein the target policy table is a policy table matched with a target message.
Embodiments of the present invention also provide a computing device, comprising: a processor, a memory storing a computer program which, when executed by the processor, performs the method as described above.
The scheme of the invention at least comprises the following beneficial effects:
the scheme of the invention adopts two-level cache mechanisms of an external double-rate synchronous dynamic random access memory DDR and an internal random access memory RAM, the external DDR is used as the first-level cache of the matching content table, and the DDR has larger storage space and can be used for storing tens of millions of matching strategies. The internal RAM is used as a content storage address which is actually matched due to the characteristic of high read-write speed. The strategy table is firstly stored in the external DDR, when the matching is hit, the address is recorded, and the memory content of the DDR is simultaneously stored in the internal RAM. After many times of training and learning, a large number of active strategies are stored in the internal RAM, and the hit probability of matching is increased. Because the read-write speed of the internal RAM is extremely high, the multi-port parallel operation can be realized, and the matching speed is greatly improved.
Drawings
FIG. 1 is a schematic flow chart diagram of an information processing method according to an embodiment of the present invention;
FIG. 2 is a flow chart of a fast lookup method according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a policy table according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating a specific format of a policy table according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of 2 computing hashes of a policy table according to an embodiment of the invention;
FIG. 6 is a schematic diagram of 3 hash computations for a policy table according to an embodiment of the present invention;
FIG. 7 is a schematic diagram of an address table maintained by the address scheduler of an embodiment of the invention;
FIG. 8 is a diagram illustrating the main format of a policy table according to an embodiment of the present invention;
fig. 9 is a schematic diagram of a format of a received message according to an embodiment of the present invention;
FIG. 10 is a diagram illustrating a mapping relationship between a first-level cache and a second-level cache according to an embodiment of the present invention;
FIG. 11 is a diagram illustrating a first level and a second level cache mapping according to an embodiment of the invention;
fig. 12 is a block diagram of an information processing apparatus according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited by the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
As shown in fig. 1, an embodiment of the present invention provides an information processing method, including:
step 12, storing the at least one policy table in a target memory area of a double-rate synchronous dynamic random access memory, where the double-rate synchronous dynamic random access memory includes at least two memory areas, and addresses of two adjacent memory areas are consecutive;
and step 13, caching a target policy table in the target storage area into a random access memory corresponding to the target storage area, wherein the target policy table is a policy table matched with a target message.
In the embodiment of the invention, the policy table is firstly stored in an external DDR (double data rate synchronous dynamic random access memory), when the address of the policy table is matched and hit with the storage address in the DDR, the address is recorded, and the storage content of the DDR is simultaneously transferred to an internal RAM (random access memory). A large number of active strategies are stored in the internal RAM, and the hit probability of matching is increased. Because the internal RAM has extremely high read-write speed, the multi-port parallel operation can be realized, and the matching speed is greatly improved.
In an optional embodiment of the present invention, as shown in fig. 3, the format of the policy table issued by the central processing unit CPU is a table header and a content, the policy table includes quintuple and key information, and a hash result calculated according to the content of the policy table;
in this embodiment, the hash value calculation uses a cryptographic algorithm SM3 (cryptographic hash algorithm), which is mainly used for digital signature and verification, message authentication code generation, and verification random number generation.
As shown in fig. 4 to 6, the policy table includes the quintuple and the key information, and the HASH result format is: format after three HASH calculations.
In an alternative embodiment of the present invention, step 12 may include:
and step 122, performing hash operation according to the content of a second policy table in the at least one policy table to obtain a second result.
Step 123, storing the at least one policy table in a target storage area of the ddr sdram according to the first result and the second result.
In an alternative embodiment of the present invention, step 123 may include:
step 1231, if the first result and the second result are different, storing the first policy table in a first target storage area according to the first result and storing the second policy table in the first target storage area according to the second result; in this embodiment, 4096 policy tables are taken as an example, software records the results of each policy table HASH1, and if the 1 st policy table and the 4096 th policy table HASH1 do not conflict, the first policy table may be directly stored in the first target storage area and the second policy table may be directly stored in the first target storage area;
step 1232, if the first result is the same as the second result, storing the first policy table in a first target storage area, performing hash operation on the second result to obtain a third result, and storing the second policy table according to the third result. In this embodiment, taking 4096 policy tables as an example, the software records the HASH1 result of each policy table, and if the 1 st policy table and the 4096 th policy table HASH1 conflict, it will be identified in the COLLISON field. For example: in contrast, in the case where the results of HASH1 in strategy table 1 are 32' h3a4b5e7f8c7d0102 and the results of HASH1 in strategy table 4096 are 32' h3a4b5e7f8c7d0102, the two values are equal, a conflict arises, it is necessary to calculate the result of HASH2 of 4096 strategy table for the second time (32 bits low) and put the result in the tail of strategy table, and the result is issued if the result of HSAH2 for the second time is 32' h4h3f2a34672a3d and the results of HASH in all the preceding strategy tables are compared and no conflict is found.
In an optional embodiment of the present invention, in step 1231, storing the first policy table in a first target storage area according to the first result includes:
step 12311, using the low N1 bits of the first result as the storage address of the first policy table, and storing the first policy table in the first target storage area, where N1 is a positive integer, for example, using the low 32 bits of the first result as the storage address of the first policy table, and storing the first policy table in the first target storage area.
In step 1231, storing the second policy table in the first target storage area according to the second result may include:
step 12312, using the low N1 bits of the second result as the storage address of the second policy table, storing the second policy table in the first target storage area, where N1 is a positive integer, e.g., using the low 32 bits of the second result as the storage address of the second policy table, and storing the second policy table in the first target storage area.
In an optional embodiment of the present invention, in step 1232, storing the second policy table according to the third result includes:
step 12321, if the third result is different from the first result and the second result, taking the low N1 bit of the third result as a storage address of the second policy table, and storing the second policy table in a second target storage area, where the second target storage area and the first target storage area are adjacent storage areas;
step 12322, if the third result is the same as the first result or the second result, performing a hash operation on the second result and the third result to obtain a fourth result, and if the fourth result is different from the first result, the second result, and the third result, using the low N1 bit of the fourth result as an address of the second policy table to store the second policy table in a third target storage area.
If the first hash result has no conflict, directly storing the first hash result into a first target storage area DDR _ SEG1 of the double-rate synchronous dynamic random access memory; if the first hash result conflicts, performing second hash on the first hash result and storing the first hash result in a DDR _ SEG2 space of a second target storage area of the double-rate synchronous dynamic random access memory; and if the second time of continuous collision is carried out, carrying out third hash on the second time result, and storing the second time result into a DDR _ SEG3 space of a third target storage area of the double-rate synchronous dynamic random access memory.
In the specific implementation, as shown in fig. 4 to 6:
1) Taking 4096 tables as an example, the software records each table phase HASH1 result.
2) If the 1 st table phase and the 4096 th table phase have a first HASH value HASH1 collision, they are identified in the name collision COLLISON field.
For example: in this case, it is necessary to calculate the result (lower 32 bits) of the second HASH value HASH2 of the 4096 front phases and put the result to the front phase tail, and to send the result if the result of the second HASH value HSAH2 is 32'h3a4b5e7f8c7d0102 is 32' h5e3f4d2a34673d and the HASH results of all the front phases are compared and no collision is found.
3) And the receiving end takes the value 32' h5e3f4d2a34672a3d of the lower 32b bits of the second HASH value HASH2 value as the storage address of the double-speed synchronous dynamic random access memory DDR, and directly stores the storage address into the double-speed synchronous dynamic random access memory DDR.
4) And if the first hash result conflicts, performing second hash on the first result and storing the second hash to the DDR _ SEG2 space, and if the second hash result conflicts continuously, performing third hash on the second result and storing the third hash to the DDR _ SEG3 space. If the first HASH value HASH1 is consistent in collision calculation and if the second HASH value HASH2 also has a collision, the results of the previous 2 times are subjected to HASH calculation together to obtain a third HASH value HASH3, and the third HASH value HASH3 is placed at the tail of the policy table. In this embodiment, the hash calculation uses a cryptographic algorithm SM3, and the result is taken as 32 bits lower.
In an alternative embodiment of the present invention, step 13 may include:
step 131, searching a target policy table from the first target storage area according to the first result, and if the content in the first target storage area is not 0, analyzing the target policy table;
and 132, transferring the low N2 bits of the preset field SEQ _ NUM in the target policy table to a random access memory RAM corresponding to the target storage area.
In this embodiment, as shown in fig. 7, the address scheduler maintains an address list, which includes the following specific contents: the identity ID, the first HASH value HASH1, the second HASH value HASH2 and the third HASH value HASH3.
In an alternative embodiment of the present invention, random access memory RAM 1-RAM 128 is used to store the contents of the policy after a hit as a second level cache.
Specifically, the table matching first matches the second level cache contents, and if the table matching is hit, the table matching is stored in the random access memory RAM; and if the double-speed synchronous dynamic random access memory is not hit, the content of the first-level cache double-speed synchronous dynamic random access memory DDR is matched.
In an optional embodiment of the present invention, the information processing method further includes:
step 14, receiving a query request for a target policy table;
and step 15, reading the target policy table from the random access memory according to the query request.
In this embodiment, as shown in fig. 2, the address Processor IP Processor module initiates reading of the double data rate synchronous dynamic random access memory DDR and reading and comparing of the contents of the random access memory RAM.
The address Processor IP Processor module maintains the content consistency between the secondary cache RAM and the primary cache DDR. In the DDR, all the table phases issued by software are stored, and because the DDR has large space, all the table phases issued by a central processing unit can be stored. These table-phase contents are all user-configurable, requiring all memory reservations.
In the random access memory RAM, the table phases matched in the actual scene, that is, the active table phases, are stored.
In a specific implementation, the message 1 is an IGMP message matched with the five-tuple information of the table facies 1, and the table facies 1 is transferred from the first-level cache to the second-level cache.
Message 2 matches the five-tuple information of phase 4096 for the ICMP message, and then phase 4096 is transferred from the first level cache to the second level cache.
By analogy, if message 128 matches the ROP message with the five-tuple information of phase 128, then phase 128 will be transferred from the first level cache to the second level cache.
Finally, 128 once-hit table facies are stored in the second-level cache, and the following messages are firstly looked up in the second-level cache, so that the hit probability is increased.
In an optional embodiment of the present invention, the storage content of the second level cache is consistent with the storage content of the first level cache, and the storage address calculation methods are different.
As shown in fig. 8, for the software to issue the table phase main content, the content in the DDR sdram DDR takes the hash value as the address, and the second level cache takes the ID value as the address (i.e. the SEQ _ NUM field in the table phase).
In an optional embodiment of the present invention, the specific process of the first-level cache to the second-level cache is as follows:
step (a), as shown in fig. 9, the computation service port receives a message five tuple information hash value:
and calculating a hash value by adopting an SM3 hash algorithm according to a network data exchange rule PROTOCOL, session initiation PROTOCOLs SIP and DIP, a destination PORT D _ PORT and a source PORT S _ PORT.
Step (b), storing the first-level cache data into a second-level cache:
as shown in fig. 10, the table phase is searched in the DDR according to the HASH result calculated in step (a), if the content in the DDR is not 0, the table phase is parsed, whether HASH results in the table phase conflict or not is further parsed, and if so, the two table phases are continuously read according to the second HASH value HASH 2. And (4) as the table phase not only retains the hash result but also retains the SEQ _ NUM result, the lower 7 bits of the SEQ _ NUM number in the read table phase are transferred to the internal random access memory RAM.
The external double-rate synchronous dynamic random access memory DDR and the internal random access memory RAM are not in linear correspondence.
Step (c), updating the second-level cache:
if the newly received message hits in the RAM, the service is processed directly according to the hit result. The internal 128 blocks of random access memory RAM can operate in parallel and the processing speed is very fast.
And (c) if the received message can not hit in the internal random access memory RAM, repeating the operation of the step (a)/the operation of the step (b), continuously reading from the DDR (double data rate synchronous dynamic random access memory), and repeating the above actions.
Step (d), deleting a primary table phase:
when a first-level table phase is deleted and updated, searching a HASH address needing to be updated according to a deletion mark in the table phase under software to delete the content in the DDR.
Step (e), deleting the secondary table phase:
as shown in fig. 11, according to the hash address to be deleted, the first-level cache mapping table is searched, and whether the table exists in the second-level cache is searched, if so, the table is deleted, and if not, the table is not required to be deleted.
In the embodiment of the invention, the external DDR adopts a MICRON DDR4 chip, and the interface controller of the DDR adopts MIG DDR4 of xilins; the internal secondary cache adopts internal ram or UltraRam of xilinx; when the IP messages need to be matched, the strategy table in the secondary cache RAM is matched firstly, and if the strategy table is successfully matched, the next matching is continued. If the matching is not successful, the mapping position in the DDR is searched in the address distributor according to the HASH value, the DDR is removed for extraction, and if the matching is successful, the corresponding representation is updated to the secondary cache RAM. And when the next time the appearance matching is needed, directly reading from the second-level cache.
The embodiment of the invention autonomously updates the active strategy table, and when no expression is hit in the secondary cache RAM, the expression is read from the primary cache DDR, thereby greatly improving the table look-up rate. And when the first-level cache is read, the storage strategy table in the DDR is directly read according to the HASH address. By using the external DDR and the internal RAM, 10G high-speed appearance matching search can be realized, the problems of high cost and high power consumption of a TCAM chip are solved through the design of an algorithm architecture, meanwhile, the interface speed of the TCAM is not limited, and higher-speed matching can be realized by expanding the number of the secondary cache RAMs.
As shown in fig. 12, an embodiment of the present invention also provides an information processing apparatus 120, including:
an obtaining module 121, configured to obtain at least one policy table;
a processing module 122, configured to store the at least one policy table in a target memory area of a double rate synchronous dynamic random access memory, where the double rate synchronous dynamic random access memory includes at least two memory areas, and addresses of two adjacent memory areas are consecutive; and caching a target policy table in the target storage area into a random access memory corresponding to the target storage area, wherein the target policy table is a policy table matched with a target message.
Optionally, storing the at least one policy table in a target storage area of the ddr sdram includes:
performing hash operation according to the content of a first policy table in the at least one policy table to obtain a first result;
performing hash operation according to the content of a second policy table in the at least one policy table to obtain a second result;
and storing the at least one policy table in a target memory area of the double rate synchronous dynamic random access memory according to the first result and the second result.
Optionally, storing the at least one policy table in a target storage area of the ddr sdram according to the first result and the second result, including:
if the first result is different from the second result, storing the first policy table in a first target storage area according to the first result and storing the second policy table in the first target storage area according to the second result;
and if the first result is the same as the second result, storing the first strategy table in a first target storage area, carrying out Hash operation on the second result to obtain a third result, and storing the second strategy table according to the third result.
Optionally, storing the first policy table in the first target storage area according to the first result includes:
and taking the low N1 bit of the first result as a storage address of the first policy table, and storing the first policy table in the first target storage area, wherein N1 is a positive integer.
Optionally, storing the second policy table in the first target storage area according to the second result includes:
and taking the low N1 bit of the second result as a storage address of the second policy table, and storing the second policy table in the first target storage area, wherein N1 is a positive integer.
Optionally, storing the second policy table according to the third result includes:
if the third result is different from the first result and the second result, taking the low N1 bit of the third result as a storage address of the second policy table, and storing the second policy table in a second target storage area, wherein the second target storage area and the first target storage area are adjacent storage areas;
and if the third result is the same as the first result or the second result, performing hash operation on the second result and the third result to obtain a fourth result, and if the fourth result is different from the first result, the second result and the third result, taking the low N1 bit of the fourth result as the address of the second policy table and storing the second policy table in a third target storage area, wherein N1 is a positive integer.
Optionally, caching the target policy table in the target storage area into a random access memory corresponding to the target storage area, including:
searching a target policy table from the first target storage area according to the first result, and if the content in the first target storage area is not 0, analyzing the target policy table;
and transferring the low N2 bits of the preset field in the target policy table to a random access memory corresponding to the target storage area, wherein N2 is a positive integer.
Optionally, the information processing method further includes:
receiving a query request for a target policy table;
and reading the target policy table from the random access memory according to the query request.
Embodiments of the present invention also provide a computing device, comprising: a processor, a memory and a program or instructions stored on the memory and executable on the processor, which when executed by the processor, implement the steps of the method as described above.
Embodiments of the present invention also provide a computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform the method as described above. All the implementation manners in the above method embodiments are applicable to the embodiment, and the same technical effect can be achieved.
According to the embodiment of the invention, the external double-rate synchronous dynamic random access memory DDR and the internal random access memory RAM are used, the table matching search of 10G high rate can be realized, the problems of high cost and high power consumption of a TCAM chip are solved through the design of an algorithm architecture, the interface rate of the TCAM chip is not limited, and the higher rate matching can be realized by expanding the number of the secondary cache random access memory RAM.
The information processing method can autonomously update the active strategy table phase, and when the table phase in the RAM of the secondary cache random access memory is not hit, the information processing method goes to the DDR of the primary cache double-rate synchronous dynamic random access memory for reading; when the first-level cache is removed for reading, the stored phase in the DDR can be directly read according to the HASH address, and the table lookup rate is greatly improved.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one type of logical functional division, and other divisions may be realized in practice, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a U disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.
Furthermore, it is to be noted that in the device and method of the invention, it is obvious that the individual components or steps can be decomposed and/or recombined. These decompositions and/or recombinations are to be regarded as equivalents of the present invention. Also, the steps of performing the series of processes described above may naturally be performed chronologically in the order described, but need not necessarily be performed chronologically, and some steps may be performed in parallel or independently of each other. It will be understood by those skilled in the art that all or any of the steps or elements of the method and apparatus of the present invention may be implemented in any computing device (including processors, storage media, etc.) or network of computing devices, in hardware, firmware, software, or any combination thereof, which can be implemented by those skilled in the art using their basic programming skills after reading the description of the present invention.
The object of the invention is thus also achieved by a program or a set of programs running on any computing device. The computing device may be a well-known general purpose device. The object of the invention is thus also achieved solely by providing a program product comprising program code for implementing the method or device. That is, such a program product also constitutes the present invention, and a storage medium storing such a program product also constitutes the present invention. It is to be understood that the storage medium may be any known storage medium or any storage medium developed in the future. It is also noted that in the apparatus and method of the present invention, it is apparent that each component or step can be decomposed and/or recombined. These decompositions and/or recombinations are to be regarded as equivalents of the present invention. Also, the steps of executing the series of processes described above may naturally be executed chronologically in the order described, but need not necessarily be executed chronologically. Some steps may be performed in parallel or independently of each other.
While the foregoing is directed to the preferred embodiment of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the appended claims.
Claims (10)
1. An information processing method, characterized in that the method comprises:
acquiring at least one policy table;
storing the at least one policy table in a target storage area of a double-rate synchronous dynamic random access memory (DDR SDRAM), wherein the DDR SDRAM comprises at least two storage areas, and the addresses of two adjacent storage areas are continuous;
and caching a target policy table in the target storage area into a random access memory corresponding to the target storage area, wherein the target policy table is a policy table matched with a target message.
2. The information processing method of claim 1, wherein storing the at least one policy table in a target memory area of the ddr sdram comprises:
performing hash operation according to the content of a first policy table in the at least one policy table to obtain a first result;
performing hash operation according to the content of a second policy table in the at least one policy table to obtain a second result;
and storing the at least one policy table in a target storage area of the double rate synchronous dynamic random access memory according to the first result and the second result.
3. The information processing method of claim 2, wherein storing the at least one policy table in a target memory area of the ddr sdram according to the first result and the second result comprises:
if the first result is different from the second result, storing the first policy table in a first target storage area according to the first result and storing the second policy table in the first target storage area according to the second result;
and if the first result is the same as the second result, storing the first strategy table in a first target storage area, carrying out Hash operation on the second result to obtain a third result, and storing the second strategy table according to the third result.
4. The information processing method of claim 3, wherein storing the first policy table in a first target storage area according to the first result comprises:
and taking the low N1 bit of the first result as a storage address of the first policy table, and storing the first policy table in the first target storage area, wherein N1 is a positive integer.
5. The information processing method of claim 3, wherein storing the second policy table in the first target storage area according to the second result comprises:
and taking the low N1 bit of the second result as a storage address of the second policy table, and storing the second policy table in the first target storage area, wherein N1 is a positive integer.
6. The information processing method according to claim 3, wherein storing the second policy table according to the third result includes:
if the third result is different from the first result and the second result, taking the low N1 bit of the third result as a storage address of the second policy table, and storing the second policy table in a second target storage area, wherein the second target storage area and the first target storage area are adjacent storage areas;
if the third result is the same as the first result or the second result, performing hash operation on the second result and the third result to obtain a fourth result, and if the fourth result is different from the first result, the second result and the third result, taking the low N1 bit of the fourth result as the address of the second policy table to store the second policy table in a third target storage area; n1 is a positive integer.
7. The information processing method according to claim 3, wherein caching the target policy table in the target storage area into a random access memory corresponding to the target storage area comprises:
searching a target policy table from the first target storage area according to the first result, and if the content in the first target storage area is not 0, analyzing the target policy table;
and transferring and storing the low N2 bits of the preset field in the target policy table into a random access memory corresponding to the target storage area, wherein N2 is a positive integer.
8. The information processing method according to claim 1, further comprising:
receiving a query request for a target policy table;
and reading the target policy table from the random access memory according to the query request.
9. An information processing apparatus characterized by comprising:
the obtaining module is used for obtaining at least one policy table;
the processing module is used for storing the at least one policy table in a target storage area of a double-rate synchronous dynamic random access memory, the double-rate synchronous dynamic random access memory comprises at least two storage areas, and the addresses of the two adjacent storage areas are continuous; and caching a target policy table in the target storage area into a random access memory corresponding to the target storage area, wherein the target policy table is a policy table matched with a target message.
10. A computing device, comprising: processor, memory storing a computer program which, when executed by the processor, performs the method of any of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211382175.4A CN115426315B (en) | 2022-11-07 | 2022-11-07 | Information processing method, device and equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211382175.4A CN115426315B (en) | 2022-11-07 | 2022-11-07 | Information processing method, device and equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115426315A true CN115426315A (en) | 2022-12-02 |
| CN115426315B CN115426315B (en) | 2023-01-31 |
Family
ID=84208071
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211382175.4A Active CN115426315B (en) | 2022-11-07 | 2022-11-07 | Information processing method, device and equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115426315B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030193927A1 (en) * | 2002-04-10 | 2003-10-16 | Stanley Hronik | Random access memory architecture and serial interface with continuous packet handling capability |
| CN102035727A (en) * | 2010-11-17 | 2011-04-27 | 杭州华三通信技术有限公司 | Method and equipment for processing routing |
| US20120210416A1 (en) * | 2011-02-16 | 2012-08-16 | Fortinet, Inc. A Delaware Corporation | Load balancing in a network with session information |
| CN108363621A (en) * | 2018-01-18 | 2018-08-03 | 东软集团股份有限公司 | Message forwarding method, device, storage medium under numa frameworks and electronic equipment |
| CN111782578A (en) * | 2020-05-29 | 2020-10-16 | 西安电子科技大学 | Cache control method, system, storage medium, computer equipment and application |
| CN114501135A (en) * | 2022-01-05 | 2022-05-13 | 伟乐视讯科技股份有限公司 | Method and device for realizing debouncing of code stream by two-stage smoothing |
-
2022
- 2022-11-07 CN CN202211382175.4A patent/CN115426315B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030193927A1 (en) * | 2002-04-10 | 2003-10-16 | Stanley Hronik | Random access memory architecture and serial interface with continuous packet handling capability |
| CN102035727A (en) * | 2010-11-17 | 2011-04-27 | 杭州华三通信技术有限公司 | Method and equipment for processing routing |
| US20120210416A1 (en) * | 2011-02-16 | 2012-08-16 | Fortinet, Inc. A Delaware Corporation | Load balancing in a network with session information |
| CN108363621A (en) * | 2018-01-18 | 2018-08-03 | 东软集团股份有限公司 | Message forwarding method, device, storage medium under numa frameworks and electronic equipment |
| CN111782578A (en) * | 2020-05-29 | 2020-10-16 | 西安电子科技大学 | Cache control method, system, storage medium, computer equipment and application |
| CN114501135A (en) * | 2022-01-05 | 2022-05-13 | 伟乐视讯科技股份有限公司 | Method and device for realizing debouncing of code stream by two-stage smoothing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115426315B (en) | 2023-01-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11102120B2 (en) | Storing keys with variable sizes in a multi-bank database | |
| US9871728B2 (en) | Exact match hash lookup databases in network switch devices | |
| Wang et al. | Scalable name lookup in NDN using effective name component encoding | |
| CN111966284B (en) | OpenFlow large-scale flow table elastic energy-saving and efficient searching system and method | |
| CN101577662B (en) | Method and device for matching longest prefix based on tree form data structure | |
| US20070171911A1 (en) | Routing system and method for managing rule entry thereof | |
| US7680806B2 (en) | Reducing overflow of hash table entries | |
| CN102420771B (en) | Method for increasing concurrent transmission control protocol (TCP) connection speed in high-speed network environment | |
| CN109194646A (en) | A kind of safety certification data access method based on block chain | |
| CN106776823A (en) | A kind of time series data management method, equipment and device | |
| WO2013138441A1 (en) | Systems, methods, and software for computing reachability in large graphs | |
| US10515015B2 (en) | Hash table-based mask length computation for longest prefix match caching | |
| CN100486211C (en) | Group classifying method based on regular collection division for use in internet | |
| CN115426315B (en) | Information processing method, device and equipment | |
| CN106878185B (en) | Message IP address matching circuit and method | |
| CN112818185A (en) | Method for searching longest prefix matching hardware system based on SRAM | |
| JP2006246488A (en) | Network router, address processing method, and computer program | |
| CN112187743B (en) | Network policy matching method and system based on IP address longest prefix | |
| CN111352938A (en) | Data processing method, computer device and storage medium | |
| CN111865804B (en) | Method and system for improving route issuing efficiency through hardware packet issuing mechanism | |
| CN113343034A (en) | IP searching method, system and storage medium | |
| Lee et al. | Binary search on trie levels with a bloom filter for longest prefix match | |
| JP3660311B2 (en) | Table search apparatus and method, program, and recording medium | |
| US11924102B2 (en) | Minimizing deviation from average latency of table lookups | |
| CN112115312B (en) | Data name searching method, system and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP02 | Change in the address of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: 100000 901, Floor 9, Building 7, Yard 8, Auto Museum East Road, Fengtai District, Beijing Patentee after: BEIJING SHUDUN INFORMATION TECHNOLOGY CO.,LTD. Address before: 100093 Room 101-502, Floor 5, Building 10, Yard 3, Fengxiu Middle Road, Haidian District, Beijing Patentee before: BEIJING SHUDUN INFORMATION TECHNOLOGY CO.,LTD. |