WO2016095450A1

WO2016095450A1 - Item updating method, device and storage medium on the basis of route searching

Info

Publication number: WO2016095450A1
Application number: PCT/CN2015/080748
Authority: WO
Inventors: 程晨; 李彧; 张炜; 徐宝魁
Original assignee: 深圳市中兴微电子技术有限公司
Priority date: 2014-12-17
Filing date: 2015-06-04
Publication date: 2016-06-23
Also published as: CN105791132A; CN105791132B

Abstract

An item updating method on the basis of route searching is disclosed in the present invention. Tree node item data or result item data of a current searching level is updated when it is determined that a control packet enters into the current searching level and all searching instructions before the control packet have been processed; meanwhile, read addresses of the searching instructions after the control packet are acquired in sequence, the read addresses are matched with the updating address of the current searching level, and the data acquired according to the read address is replaced by the data corresponding to the updating address when it is determined that the matching is successful; a labeled packet is inserted into the entry of the searching instructions of the current searching level when it is determined that the updating of the tree node item data or the result item data has been completed; the labeled packet is discarded when it is determined that the searching instructions before the labeled packet being inserted into the current searching level have been all processed. An item updating device and a storage medium on the basis of route searching are also disclosed in the present invention.

Description

Method, device and storage medium for updating table items based on route lookup

Technical field

The present invention relates to the field of network switching technologies, and in particular, to a method, an apparatus, and a storage medium for updating an entry based on a route lookup.

Background technique

In the application scenario of the large-capacity route finder, not only the capacity and the search performance are required, but the update performance is also an important indicator, but often in a complex algorithm, the update performance is a small bottleneck; for example, in word search In the algorithm of the tree (Trie) class, because of the need to save the search delay, it is often necessary to operate by node copying and priority override, and this operation will significantly increase the cost of node update, because updating or adding one Nodes often need to be modified by several or even hundreds of nodes; in the routing lookup update of Ternary Content Addressable Memory (TCAM), the rearrangement of hardware node data is involved. This rearrangement is not only required to be done inside the TCAM, but also needs to rearrange the result table data mapped one by one with the TCAM entries, and in order to ensure that the search is not erroneous, the rearrangement must also be performed in sequence, involving the TCAM and The result table interaction and synchronization greatly affect the update performance of the table entries.

In the traditional multi-path search tree (B-tree) data structure update, there is no data replication, and there is no interaction between the result table and the node table. The performance is better than the route lookup update of Trie and TCAM. The optimized B-tree route lookup method (see 201310396381.5) requires a special update process to improve the efficiency of data update and reduce the delay caused by data update.

Summary of the invention

In view of this, an embodiment of the present invention is to provide a method for updating an entry based on a route lookup. The device and the storage medium can improve the efficiency of data update and reduce the delay caused by data update.

To achieve the above objective, the technical solution of the embodiment of the present invention is implemented as follows:

An embodiment of the present invention provides a method for updating an entry based on a route search, where the method includes:

Determining that the control packet enters the current search level, and the search instruction before the control packet has been processed, updating the tree node entry data or the result entry data of the current search level, and simultaneously acquiring the control packet Searching for a read address in the instruction, matching the read address with the update address of the current search level, and determining that the data obtained according to the read address is replaced with the data corresponding to the update address when the match is successful;

Determining that the tree node entry data or the result table item data update is completed, inserting a markup packet at a search instruction entry of the current search level;

The tagged packet is discarded when it is determined that the lookup instruction before the tagged packet is inserted into the current lookup stage has been processed.

In the above solution, before the determining that the control packet enters the current search level, and before the search instruction before the control packet has been processed, the method further includes:

Reading the updated table entry data and the update address corresponding to the entry data, and obtaining and saving the entry data that needs to be updated by the current search level and the entry data that needs to be updated by the current search level. Update the address.

In the above solution, the updated entry data that needs to be updated by all the search levels and the update address corresponding to the entry data includes: a tree node table part and a result table part;

The tree node table part includes: node data that needs to be updated by all the search levels and an update address corresponding to the node data; the result table part includes: result data that needs to be updated by all the search levels, and the result The update address corresponding to the data.

When it is determined that the current lookup level is the highest lookup level, the control packet is inserted at the lookup instruction entry of the current lookup level.

In the above solution, the method further includes:

When detecting that the data of a certain item of the current search level is incorrect, storing the item data and the update address corresponding to the item data, and sequentially acquiring the read address in the search instruction of the current search level, The read address is matched with the update address of the current search level. When the match is successful, the data obtained according to the read address is replaced with the data corresponding to the update address until the error is repaired.

An embodiment of the present invention further provides a method for updating an entry based on a route lookup, where the method includes:

When the control packet is detected in the current search level, the search instruction after entering the control packet of the current search level is locked;

Determining, when the processing instruction before the control packet enters the current search level, that the search instruction has been processed, updating the tree node entry data or the result entry data of the current search level;

When it is determined that the tree node entry data or the result entry data update of the current search level is completed, the search instruction after the control packet entering the current search level is unlocked.

In the foregoing solution, before the control packet is detected in the current search level, the method further includes:

When it is determined that the current search level is the highest search level, the control packet is inserted at the search instruction entry of the current search level.

In the foregoing solution, when it is determined that the search instruction before the control packet enters the current search level has been processed, the method further includes:

The control packet is sent directly to the next lookup level.

In the above solution, the updating the tree node entry data or the result entry data of the current search level includes: reading the stored entry data of all the search levels that need to be updated, and the current search in the update address corresponding to the entry data. The table item data that needs to be updated and the current search level need to be updated. The update address corresponding to the entry data, and the entry data that needs to be updated by the current search level is written into the corresponding update address.

The embodiment of the present invention further provides an apparatus for updating an entry based on a route search, where the apparatus includes: a first update module, a cache module, an insert module, and a determining module;

The first update module is configured to: when the control packet enters the current search level, and the search instruction before the control packet has been processed, update the tree node entry data or the result entry data of the current search level, and simultaneously , triggering the Cache module;

The Cache module is configured to sequentially acquire a read address in a lookup instruction after the control packet, and match the read address with an update address of a current lookup level, and determine that the match is successful according to the read address. Data is replaced with data corresponding to the update address;

The inserting module is configured to: when the tree node entry data or the result table data update is completed, insert a markup packet at a search instruction entry of the current search level;

The determining module is configured to discard the tagged packet when it is determined that the lookup instruction before the tagged packet is inserted into the current lookup stage has been processed.

In the above solution, the first update module is further configured to: read the updated entry data of all the search levels that need to be updated, and the update address corresponding to the entry data, and obtain and save the entry data that needs to be updated by the current search level. And an update address corresponding to the entry data that needs to be updated by the current search level;

Correspondingly, the device further includes a first cache module configured to store the entry data that needs to be updated by all the search levels and the update address corresponding to the entry data;

The Cache module is further configured to store the entry data that needs to be updated by the current search level and the update address corresponding to the entry data that needs to be updated by the current search level.

In the above solution, the first update module is further configured to: when determining that the current search level is the highest search level, insert a control packet at a search instruction entry of the current search level.

In the above solution, the first update module is further configured to: when detecting that an item of the current search level of the search is incorrect, storing the update data corresponding to the entry data and the entry data to the Cache a module, and sequentially acquiring a read address in the search instruction of the current search level, matching the read address with an update address of the current search level, and determining that the data obtained according to the read address is replaced with the update when the match is successful. The data corresponding to the address until the error is fixed.

The embodiment of the present invention further provides a device for updating an entry based on a route search, where the device includes: a lock module, a second update module, and an unlocking module;

The locking module is configured to lock a lookup instruction after entering the control packet of the current search level when the control packet is detected in the current search level;

The second update module is configured to: when the search instruction before the control packet enters the current search level has been processed, update the tree node entry data or the result entry data of the current search level;

The unlocking module is configured to: when determining that the tree node entry data or the result table item data of the current search level is updated, unlocking the lookup instruction after entering the control packet of the current search level.

In the above solution, the second update module is further configured to: when the current search level is the highest search level, insert the control packet at the search instruction entry of the current search level.

In the above solution, the second update module is configured to read the entry data that needs to be updated in all the search levels that are stored, and the entry data that needs to be updated in the current search level in the update address corresponding to the entry data, and the current The update address corresponding to the table item data that needs to be updated by the search level, and the table item data that needs to be updated by the current search level is written into the corresponding update address;

Correspondingly, the device further includes a second cache module configured to store the entry data that needs to be updated by all the search levels and the update address corresponding to the entry data.

In the above solution, the second update module is further configured to send the control packet directly to the next search level.

The embodiment of the present invention further provides a computer storage medium, where the computer storage medium stores a computer program for performing the above-mentioned route lookup based update method of the embodiment of the present invention.

The method and device for updating an entry based on route lookup provided by the embodiment of the present invention, and determining that the control packet enters the current search level, and the search command before the control packet has been processed, updating the tree of the current search level Node entry data or result table entry data, at the same time, sequentially acquiring the read address in the lookup instruction after the control packet, matching the read address with the update address of the current lookup level, and determining that the match is successful, The data obtained by the read address is replaced by data corresponding to the update address; when it is determined that the tree node entry data or the result entry data update is completed, a markup packet is inserted at a search instruction entry of the current search level; The tagged packet is discarded when the tagged packet is inserted into the lookup instruction before the current lookup level has been processed. In this way, while updating the tree node entry data or the result table entry data of the current search level, replacing the data acquired according to the read address with the data corresponding to the update address, the data update efficiency and the data can be improved. The delay caused by the update.

DRAWINGS

FIG. 1 is a schematic flowchart of a route search method of a B-tree;

2 is a schematic flowchart of a method for updating an entry based on route lookup according to an embodiment of the present invention;

3 is a schematic flowchart b of a method for updating an entry based on route lookup according to an embodiment of the present invention;

4 is a schematic diagram of a storage format of an entry data that needs to be updated by all the search levels and an update address corresponding to the entry data according to an embodiment of the present invention;

5 is a schematic flowchart of a method for updating an entry based on route lookup according to Embodiment 2 of the present invention;

6 is a schematic flowchart b of a method for updating an entry based on route lookup according to Embodiment 2 of the present invention;

FIG. 7 is a schematic flowchart of a method for updating an entry based on route lookup according to Embodiment 3 of the present invention;

FIG. 8 is a schematic flowchart of a method for updating an entry based on route lookup according to Embodiment 4 of the present invention; FIG.

FIG. 9 is a schematic structural diagram of a device for updating an entry based on route lookup according to an embodiment of the present invention; FIG.

FIG. 10 is a schematic structural diagram of a device for updating an entry based on route lookup according to Embodiment 2 of the present invention.

detailed description

The method for updating the entry based on the route search in the embodiment of the present invention is based on a B-tree route search method. For a clear understanding of the embodiment of the present invention, the B-tree route search method is briefly described.

B-tree is a bottom-up tree. Each layer of the tree is a search level. The bottom layer is the result table search level. The other layers are tree node search levels, that is, the actual search level. Add a result table to the layer of the tree to find the layer.

Each update (add, delete, update) data in the B-tree will cause one of the following operations: 1. Update only one result data; 2. Update a tree node and a result data; 3. Update a tree. Node and multiple result data; 4. Update multiple tree nodes and multiple result data.

The route lookup of the B-tree is a top-down lookup, and each level of the search is associated with each other. Therefore, the update of the entry in the embodiment of the present invention is also a top-down update, that is, the update process is to perform data from the top. The top search level of the update starts, and is updated downwards in turn. The result table search level is the last level update. In this way, after the current search level is updated, the new search request must access the updated tree node entry. Data or result table entry data.

Figure 1 shows the flow chart of the B-tree route lookup method. As shown in Figure 1, the logical relationship between the three levels of lookup stages is given. The Nth level search level is taken as an example. The Nth level search level is used. After receiving the search instruction sent by the N-1 level search level, the instruction is stored in the first in first out queue (FIFO), and when the FIFO1 is not empty, there is a seek instruction, which is located at the exit of the FIFO1. The lookup instruction will be processed, data such as key values and read addresses are stored in FIFO 2, and the lookup request and lookup address are sent to FIFO 3; here the read address in FIFO 2 is the same address as the lookup address in FIFO 3; The lookup request and the lookup address are used to obtain tree node entry data in the node table; when the FIFO3 is not empty, the lookup request and lookup at the FIFO3 exit The address will be sent to the node table for data lookup operation; after a certain delay, the search result will be returned to FIFO4 (204); when FIFO4 is not empty, the return result at the FIFO4 exit will be the key value at the exit of FIFO2 The information is simultaneously fetched; after comparing the tree node table item data in the returned result with the key value data, a lookup instruction of the next search level is generated and sent to the next search level.

During the above route lookup process, the data in each FIFO may be temporarily stored in the FIFO because the processing speed of a certain position on the data line does not match the instruction speed; when any FIFO is almost full, the previous FIFO is streamed. Control back pressure, so there will be no loss of instructions or data.

In the embodiment of the present invention, in the embodiment of the present invention, when the control packet is determined to enter the current search level, and the search command before the control packet has been processed, the tree node entry of the current search level is updated. Data or result table item data, at the same time, sequentially acquiring the read address in the lookup instruction after the control packet, matching the read address with the update address of the current lookup level, and determining that the match is successful, according to the read address The acquired data is replaced with data corresponding to the update address; when it is determined that the tree node entry data or the result entry data update is completed, a markup packet is inserted at a search instruction entry of the current search level; and the markup packet insertion is determined. The tagged packet is discarded when the lookup instructions before the current lookup level have been processed.

2 is a schematic flowchart of a method for updating an entry based on route lookup according to an embodiment of the present invention; FIG. 3 is a schematic flowchart of a method for updating an entry based on route lookup according to an embodiment of the present invention; FIG. 2 and FIG. The method for updating an entry based on route lookup in the embodiment of the present invention includes:

Step 201: Determine that the control packet enters the current search level, and when the search instruction before the control packet has been processed, update the tree node entry data or the result entry data of the current search level, and simultaneously obtain the control. a read address in the lookup instruction after the packet, the read address is matched with the update address of the current search level, and when the matching is successful, the data obtained according to the read address is replaced with the data corresponding to the update address;

Here, before the step, the method further includes: when determining that the current search level is the highest search level, inserting a control packet at a search instruction entry of the current search level; where the control packet is a control packet with a special mark, The transmission may be performed along with the lookup instruction stream. When the control packet is read out from the FIFO 1, the lookup address entering the FIFO 2 is an invalid address or an empty address, and correspondingly, an empty result is returned to the FIFO 4; The highest lookup level is the top search level in all lookup levels that requires data updates.

In an embodiment, before the step, the method further includes: reading all the item data stored by the first cache module and the update address corresponding to the item data, and acquiring and saving the current search level. The updated item address and the update address corresponding to the updated item data of the current search level to the Cache module;

Here, if the current search level is the highest search level, the read all the search levels stored in the first cache module need to be updated and the update address corresponding to the entry data, and the current search level needs to be updated. The operation of the entry data and the update address corresponding to the entry data that needs to be updated by the current search level is performed before the operation of inserting the control packet at the entry of the search instruction;

The method further includes: the first cache module stores all the entries that need to be updated by all the search levels written by the software, before the reading of the stored table entry data and the update address corresponding to the entry data. Data and an update address corresponding to the entry data;

The stored update table entry data and the update address corresponding to the entry data include: a tree node table portion and a result table portion; since the data bit width of the node is far greater than the data bit width of the result table Dividing into a tree node table and a result table can facilitate the division of hardware storage units;

The tree node table part includes: node data that needs to be updated by all the search levels and an update address corresponding to the node data; the result part includes: result data that needs to be updated by all the search levels, and the result data Corresponding update address;

The storage format of the tree node table portion is as shown in FIG. 4a, including: a valid tag, a search level, Updating the address and the tree node data; wherein the valid tag is a hardware identifier, marking whether the update entry is valid, the search level identifies which level of the search node the search node is in; the update address is a tree node The corresponding physical address; the tree node data is the data that needs to be written into the actual hardware memory; since the tree node is updated from top to bottom, when filling in the tree node table, it is also in accordance with the top-down Fill in the order, the node with the highest level to be updated is filled in the first line of the node cache, and then filled in sequentially. If a layer needs to update multiple nodes, the data of the layer nodes can be in no order;

The storage format of the result part is as shown in FIG. 4b, and includes: a valid tag, an update address, and a result entry data; wherein the valid tag indicates whether the update entry is valid, and the update address is corresponding to the result entry data. The physical address, the result table data is the data that needs to be written into the actual hardware memory.

In an embodiment, the sequentially acquiring the read address in the lookup instruction after the control packet, and matching the read address with the update address of the current lookup level includes:

The cache cache switch is enabled to sequentially acquire the read address in the lookup instruction after the control packet enters the current lookup level, and match the read address with the update address of the current lookup level stored in the Cache module.

In an embodiment, the determining instructions before the determining the control packet have been processed, that is, determining that the control packet before entering the current search level has been cleared from the FIFO queue, that is, in the queue exit of the FIFO2. When the control packet is detected;

The updating the tree node entry data or the result entry data of the current search level includes: obtaining the entry data that needs to be updated in the current search level stored in the Cache module, and the update address corresponding to the entry data, The table item data that needs to be updated by the current search level is written into the corresponding update address;

Substituting the entry data obtained according to the read address with the entry data corresponding to the update address, and ignoring the actually searched data, so, from the lookup phenomenon, correspondingly updating the address data The update operation has been completed. Although the actual entry data may not be written to the tree node table or the result table, the speed of the route update on the phenomenon is accelerated, and the update operation can be performed "slowly" for the actual entry data.

Step 202: When it is determined that the tree node entry data or the result entry data update is completed, insert a markup packet at a search instruction entry of the current search level;

Here, the determining that the tree node entry data or the result entry data update is completed includes: determining that the entry data that needs to be updated in the current search level stored in the Cache module has been written into the entry corresponding to the entry data. Update address;

The markup packet is a markup packet having a special mark different from the control packet, and can be normally transmitted along with the lookup instruction stream, and the insertion of the markup package ensures that the lookup instruction after the markup packet is inserted into the current lookup level is read. All are updated tree node table entry data or result table entry data.

Step 203: Determine that the tagged packet is discarded when the search instruction before the tagged packet is inserted into the current search level has been processed.

The method further includes: disabling the Cache switch to clear the current search level stored in the Cache module needs to be updated, where the determining that the search packet is inserted into the current search level has been processed. The entry data and the update address corresponding to the entry data; thus, facilitating the writing of the data to be updated and the corresponding update address when the current search level performs the next update;

The Cache switch is disabled, that is, the lookup instruction after the tagged packet is inserted into the current search level can obtain the corresponding entry data according to the read address of the ACL, and the corresponding entry data cached in the Cache module is not required to be replaced. .

In an embodiment, after the step, the method further includes: directly sending the control packet to the next search level; thus, ensuring consistency of the update operation of the B-tree, reducing update delay, and improving B-tree update efficiency.

In an embodiment, the method further includes: detecting a table of the current search level of the lookup When the item data is incorrect, the Cache module stores the entry data of the current search level and the corresponding update address written by the control plane, and enables the Cache switch to sequentially acquire the read address in the search instruction of the current search level. Matching the read address with the update address of the current search level, and determining that the match is successful, replacing the data acquired according to the read address with the data corresponding to the update address until the error is repaired, and the device is disabled. The Cache switch is used as the temporary backup table, so that the control plane can perform corresponding fault location and fault processing.

In an embodiment, the method further includes: adding a valid flag of each item data that needs to be updated in the current current search level, where the valid flag is used to identify whether the current item data is valid;

When it is detected that the data of a certain item of the current search level of the search is incorrect, and the current search level needs to perform data update, the following operations are required, that is, the data acquired according to the read address in the search instruction is replaced with the Cache module. The data corresponding to the update address stored in the memory, because the update address and its corresponding data are written to the Cache module, there may be some update data not completely written, but the read command from the FIFO 2 reads The address is an address corresponding to the data that is not completely written. At this time, when the data corresponding to the update address stored in the Cache module replaces the data acquired according to the read address in the search instruction, the operation will be wrong, and therefore, the operation is increased. After the valid tag of each entry data stored by the Cache module is obtained, and the data that needs to be updated by the current search level and the corresponding address are obtained, the update address corresponding to the entry data is first written in the Cache module, and a valid tag is set. Invalid, when the entry of the entry data is completed, the valid tag is set to be valid, and the valid tags of all the entry data are When valid, the update operation is performed on the tree node entry data or the result entry data of the current search level; thus, when the data of a certain entry of the current search level is found to be incorrect, the Cache module is used as a backup table. It also does not affect the update of the tree node entry data or the result table entry data.

FIG. 5 is a schematic flowchart of a method for updating an entry based on a route search according to Embodiment 2 of the present invention; FIG. 6 is a schematic flowchart of a method for updating an entry based on route search according to Embodiment 2 of the present invention; FIG. 5 and FIG. The method for updating an entry based on route lookup in the embodiment of the present invention includes:

Step 501: When the control packet is detected in the current search level, the search instruction after entering the control packet of the current search level is locked;

Before the step, the method further includes: when determining that the current search level is the highest search level, inserting a control packet at the search instruction entry of the current search level; as shown in step 1 in FIG. 6;

The determining that the current search level is the highest search level includes: determining that the current search level is the top search level of all search levels that need to be updated;

The control packet is a control packet with a special flag, which can be normally transmitted along with the lookup instruction stream. When the control packet is read from the FIFO1 and processed, the search address entering the FIFO 2 is an invalid address or an empty address, correspondingly Return to the empty result of FIFO4.

In an embodiment, the control packet is detected in the current lookup stage, ie the control packet is detected at the exit of the FIFO 1, ie the control packet has just been read out from the FIFO 1 for distribution; Step two is shown;

The search instruction after entering the control packet of the current search level is locked. At this time, the search instruction in the FIFO1 is pressed in the FIFO1, and cannot be output, and the search instruction sent by the previous stage is in a later period of time. They are also sequentially pressed into the FIFO1, and the lookup instruction before the control packet enters the current search level can smoothly obtain the return data from the FIFO4, generate the next-level search instruction and enter the next stage.

Step 502: When it is determined that the search instruction before the control packet enters the current search level has been processed, update the tree node entry data or the result entry data of the current search level;

Here, the determining that the control packet enters the current search level has been processed, that is, the search instruction before the control packet enters the current search level has been cleared from the FIFO queue, that is, the queue exit of the FIFO2. The control packet is detected, and the read data of the control packet is also returned to the exit of the FIFO 4; as shown in step 3 in FIG. 6;

The updating the tree node entry data or the result entry data of the current search level includes: acquiring data that needs to be updated by all the search levels stored in the second cache module, and an address corresponding to the data The data that needs to be updated by the current search level and the update address corresponding to the data that needs to be updated by the current search level, and the data that needs to be updated by the current search level is written into the corresponding update address;

Here, before the data that needs to be updated in all the search levels stored in the second cache module and the update address corresponding to the current search level and the update address corresponding to the current search level in the address corresponding to the data, The method further includes: the second cache module stores the entry data that needs to be updated by all the search levels written by the software, and the update address corresponding to the entry data;

The storage format of the tree node table part is as shown in FIG. 4a, and includes: a valid tag, a search level, an update address, and a tree node data; wherein the valid tag is a hardware identifier, and marking whether the update entry is valid. The search level identifies which level of the search level the node is in; the update address is the physical address corresponding to the tree node; the tree node data is the data that needs to be written into the actual hardware memory; Top-down updates, therefore, when filling in the tree node table, it is also filled in the top-down order. The top layer that needs to be updated is filled in the first row of the node cache, and then filled in sequentially. If a layer needs to update multiple nodes, the data of the layer nodes may be in no order;

The storage format of the result part is as shown in FIG. 4b, and includes: a valid tag, an update address, and a result entry data; wherein the valid tag indicates whether the update entry is valid, and the update address is corresponding to the result entry data. Physical address, the result table data needs to be written into the actual hardware. Saved data.

Step 503: When it is determined that the tree node entry data or the result entry data update of the current search level is completed, unlocking the lookup instruction after entering the control packet of the current search level;

Here, the unlocking the lookup instruction after entering the control packet of the current search level, so that the lookup instruction previously pressed in the FIFO1 can be normally distributed; as shown in step 4 in FIG. 6;

The control packet strictly divides the lookup instruction before the control packet located in the lookup instruction stream and the lookup instruction after the control packet into an original lookup instruction and a new lookup instruction, and the original lookup instruction acquires before updating The tree node entry data or the result table entry data, and the new lookup instruction obtains the updated tree node entry data or result entry data.

FIG. 7 is a schematic flowchart of a method for updating an entry based on a route search according to Embodiment 3 of the present invention; in the embodiment of the present invention, a current search level for performing data update is a top search level in a search level that needs to be updated, as shown in FIG. As shown in FIG. 7, the method for updating an entry based on route lookup according to Embodiment 3 of the present invention includes:

Step 701: The first cache module stores the updated entry data of all the search levels written by the software and the update address corresponding to the entry data.

Here, the stored update table entry data and the update address corresponding to the entry data include: a tree node table portion and a result table portion; since the data bit width of the node is far greater than the data of the result table The bit width, divided into a tree node table and a result table can facilitate the division of the hardware storage unit;

The tree node table part includes: node data that needs to be updated by all the search levels and an update address corresponding to the node data; the result part includes: all the search levels need to be updated. Result data and an update address corresponding to the result data;

In the embodiment of the present invention, the software only needs to perform one interaction with the first cache module, so that multiple routing entries of multiple search levels can be updated, which greatly improves the update efficiency.

Step 702: Insert a control packet at a search instruction entry of the current search level;

Here, the control packet is a control packet with a special flag, which can be transmitted along with the lookup instruction stream. When the control packet is read from the FIFO1 and processed, the lookup address entering the FIFO 2 is an invalid address or empty. The address, correspondingly, returns a null result to FIFO 4; the highest lookup level is the topmost lookup level in all lookup stages that requires data updates.

Step 703: Acquire and save the entry data that needs to be updated by the current search level and the update address corresponding to the entry data that needs to be updated by the current search level;

The step includes: reading the entry data that needs to be updated by all the search levels stored by the first cache module, and the update address corresponding to the entry data, and obtaining and saving the entry data that needs to be updated by the current search level and the current search level. Update address corresponding to the updated entry data to the Cache module Piece.

Step 704: When it is determined that the search instruction before the control packet enters the current search level has been processed, update the tree node entry data or the result entry data of the current search level, and simultaneously obtain the search instruction after the control packet. The read address is matched with the update address of the current search level, and when the match is successful, the data obtained according to the read address is replaced with the data corresponding to the update address;

Here, the sequentially acquiring the read address in the lookup instruction after the control packet, and matching the read address with the update address of the current lookup level includes:

In an embodiment, when the determining that the control packet has entered the current search level has been processed, that is, when the control packet before the current search level has been cleared from the FIFO queue, that is, in the FIFO2 When the control packet is detected at the queue exit;

The updating the tree node entry data or the result entry data of the current search level includes: obtaining the entry data that needs to be updated by the current search level stored by the Cache module, and the update address corresponding to the entry data, where the The entry data that needs to be updated by the current search level is written into the corresponding update address;

Replace the entry data obtained according to the read address with the entry data corresponding to the update address, and ignore the actually searched data. Thus, from the lookup phenomenon, the data of the corresponding update address has been updated, although the actual The entry data may not be written in the tree node table or the result table, which speeds up the update of the route on the phenomenon, and can update the data slowly and slowly.

Step 705: When it is determined that the tree node entry data or the result entry data update is completed, insert a markup packet at a search instruction entry of the current search level;

Step 706: Determine that the tagged packet is discarded when the search packet before the tagged packet is inserted into the current search level has been processed.

After the step, the method further includes: directly sending the control packet to the next search level; thus, ensuring consistency of the update operation of the B-tree, reducing the update delay, and improving the update efficiency of the B-tree. .

In an embodiment, when the determining that the tagged packet is inserted into the current search level has been processed, the method further includes:

The Cache switch is enabled, and the updated entry data that needs to be updated in the current search level and the update address corresponding to the entry data are cleared.

In an embodiment, the method further includes: when detecting that an item of the current search level of the search is incorrect, the Cache module stores the item data and the corresponding update address written by the control plane, and The Cache switch is enabled, and the read address in the search instruction of the current search level is sequentially acquired, and the read address is matched with the update address of the current search level, and when the matching is successful, the data acquired according to the read address is replaced. For the data corresponding to the update address, until the error is repaired, the Cache switch is disabled; thus, the Cache module is used as a temporary backup table, which facilitates the control plane to perform corresponding fault location and fault handling;

When it is detected that the data of an item of the current search level of the search is incorrect, and the current search level needs When performing data update, the following operations are required, that is, data acquired according to the read address in the lookup instruction is replaced with data corresponding to the update address stored in the Cache module, because the update address and its corresponding data are written. When the Cache module is entered, there may be some update data that is not completely written, but the read address in the lookup instruction from the FIFO 2 is the address corresponding to the incompletely written data. At this time, the Cache module The operation of replacing the data corresponding to the update address in the search instruction by the data stored in the search instruction will be erroneous. Therefore, the valid tag of each entry data stored in the Cache module is added, and the current search level needs to be updated. After the data and the corresponding address, the update address corresponding to the entry data is first written in the Cache module, and the valid flag is set to be invalid. When the entry of the entry is completed, the valid flag is set to be valid. When the valid tags of all the entry data are valid, the tree node entry data or the result entry data of the current search level is updated. For; thus, when detecting an article of the current search level to find the data entry error, the Cache module as a backup table at the same time will not affect the update tree node data entry or table item data.

FIG. 8 is a schematic flowchart of a method for updating an entry based on a route search according to Embodiment 4 of the present invention; in the embodiment of the present invention, a current search level for performing data update is a top search level in a search level that needs to be updated, as shown in FIG. As shown in FIG. 8, the method for updating an entry based on route lookup according to Embodiment 4 of the present invention includes:

Step 801: The second cache module stores the entry data that needs to be updated by all the search levels written by the software, and the update address corresponding to the entry data.

In the embodiment of the present invention, the software only needs to perform one interaction with the second cache module, so that multiple routing entries of multiple search levels can be updated, which greatly improves the update efficiency.

Step 802: Insert a control packet at a search instruction entry of the current search level;

Step 803: When the control packet is detected in the current search level, the search instruction after entering the control packet of the current search level is locked;

Here, the control packet is detected in the current lookup stage, that is, the control packet is detected at the exit of the FIFO 1, that is, the control packet is just read out from the FIFO 1 for distribution; as shown in step 2 in FIG. ;

Step 804: When it is determined that the search instruction before the control packet enters the current search level has been processed, update the tree node entry data or the result entry data of the current search level;

Here, when it is determined that the search instruction before the control packet enters the current search level has been processed, that is, when the search instruction before the control packet enters the current search level has been cleared from the FIFO queue, that is, in the FIFO2 The control packet is detected at the queue exit, and the read-empty data of the control packet is also returned to the exit of the FIFO 4; as shown in step 3 in FIG. 6;

The updating the tree node entry data or the result entry data of the current search level includes: acquiring data that needs to be updated by all the search levels stored in the second cache module, and data that needs to be updated in the current search level of the address corresponding to the data And the update address corresponding to the data that needs to be updated by the current search level, and the data that needs to be updated by the current search level is written into the corresponding update address.

Step 805: When it is determined that the tree node entry data or the result table item data of the current search level is updated, the search instruction after entering the control packet of the current search level is unlocked;

In an embodiment, after the step, the method further includes: sending the control package directly Go to the next search level; in this way, the consistency of the update operation of the B-tree can be guaranteed, the update delay can be reduced, and the update efficiency of the B-tree can be improved.

FIG. 9 is a schematic structural diagram of a device for updating an entry based on a route search according to an embodiment of the present invention; as shown in FIG. 9 , the device for updating an entry based on a route search according to an embodiment of the present invention includes: a first update module, a Cache module, and an insertion Module and determination module; among them,

The first update module 91 is configured to: when the control packet enters the current search level, and the search instruction before the control packet has been processed, update the tree node entry data or the result entry data of the current search level, At the same time, the Cache module is triggered;

The Cache module 92 is configured to sequentially acquire the read address in the lookup instruction after the control packet, and match the read address with the update address of the current search level, and determine that the match is successful, and the read address is obtained according to the read address. Data is replaced by data corresponding to the update address;

The inserting module 93 is configured to: when the tree node entry data or the result table data update is completed, insert a markup packet at a search instruction entry of the current search level;

The determining module 94 is configured to discard the tagged packet when the lookup instruction before the tagged packet is inserted into the current lookup stage has been processed.

In an embodiment, the first update module 91 is further configured to: read the updated entry data of all the search levels that need to be updated and the update address corresponding to the entry data, and obtain and save the current search level to be updated. The entry data and the update address corresponding to the entry data that needs to be updated by the current search level;

Correspondingly, the device further includes a first cache module 95 configured to store the entry data that needs to be updated by all the search levels and the update address corresponding to the entry data;

The Cache module 92 is further configured to store the entry data that needs to be updated by the current search level and the update address corresponding to the entry data that needs to be updated by the current search level;

Here, the stored entry data that needs to be updated by all the search levels and the update address corresponding to the entry data includes: a tree node table part and a result table part; Greater than the data bit width of the result table, dividing into the tree node table and the result table can facilitate the division of the hardware storage unit;

In an embodiment, the Cache module 92 sequentially acquires a read address in a lookup instruction after the control packet, and matches the read address with an update address of a current lookup level, including:

The Cache module 92 enables the Cache switch to sequentially acquire the read address in the lookup instruction after the control packet enters the current search level, and matches the read address with the update address of the current lookup level stored in the Cache module.

In an embodiment, the updating, by the first update module 91, the tree node entry data or the result entry data of the current search level includes:

The first update module 91 acquires that the current search level stored by the Cache module needs to be updated. The entry data and the update address corresponding to the entry data are used to write the entry data that needs to be updated by the current search level into the corresponding update address.

In an embodiment, the first update module 91 is further configured to: when the current search level is the highest search level, insert a control packet at a search instruction entry of the current search level; where the control packet is a special The marked control packet can be transmitted along with the lookup instruction stream. When the control packet is read out from the FIFO1, the lookup address entering the FIFO2 is an invalid address or an empty address, and correspondingly, the return to the FIFO4 is Empty result; the highest search level is the top search level in all lookup levels that needs to be updated.

In an embodiment, the first update module 91 is further configured to: when it is determined that the search instruction before the tagged packet is inserted into the current search level, the Cache switch is enabled, and the Cache module is cleared. The current search level stored in the file needs updated table item data and an update address corresponding to the table item data; thus, the data that needs to be updated and the corresponding update address are written by the current search level for the next update.

In an embodiment, the first update module 91 is further configured to send the control packet directly to the next search level; thus, the continuity of the update operation of the B-tree can be ensured, and the update delay is reduced, and the update delay is improved. The update efficiency of B-tree.

In an embodiment, the first update module 91 is further configured to: when detecting that an item of the current search level of the search is incorrect, storing the item data and the update address corresponding to the item data to The Cache module enables the Cache switch to sequentially acquire the read address in the lookup instruction of the current search level, and match the read address with the update address of the current search level to determine that the match is successful according to the The data obtained by the read address is replaced with the data corresponding to the update address until the error is repaired, and the Cache switch is disabled. Thus, the Cache module is used as a temporary backup table, which facilitates the control plane to perform corresponding fault location. And fault handling;

In an embodiment, the first update module 91 is further configured to add a valid tag of each entry data that needs to be updated by the current current search level, where the valid tag is used to identify the current entry. Whether the data is valid;

When it is detected that the data of a certain item of the current search level of the search is incorrect, and the current search level needs to perform data update, the following operations are required, that is, the data acquired according to the read address in the lookup instruction is replaced with the Cache module. The data corresponding to the update address stored in the memory, because the update address and its corresponding data are written to the Cache module, there may be some update data not completely written, but the read command from the FIFO 2 reads The address is the address corresponding to the data that is not completely written. At this time, the operation of replacing the data corresponding to the read address in the search instruction by the data corresponding to the update address stored in the Cache module will be an error, and therefore, the first The update module 91 adds the valid tag of each entry data stored by the Cache module, and obtains the update address corresponding to the entry data in the Cache module after acquiring the data and the corresponding address that need to be updated by the current search level. And set the valid flag to be invalid. When the data of the entry is completed, set the valid tag to be valid, and wait for all the entry data. When the valid tag is valid, the tree node entry data or the result table entry data of the current search level is updated; thus, when the data of a certain item of the current search level is found to be incorrect, the cache is detected. The module as a backup table does not affect the update of the tree node entry data or the result table entry data.

10 is a schematic structural diagram of a device for updating an entry based on a route search according to a second embodiment of the present invention; as shown in FIG. 10, the device for updating an entry based on a route search includes: a lock module 11 and a second update module. 12 and an unlocking module 13; wherein

The locking module 11 is configured to lock a lookup instruction after entering the control packet of the current search level when the control packet is detected in the current search level;

The second update module 12 is configured to: when the search instruction before the control packet enters the current search level has been processed, update the tree node entry data or the result entry data of the current search level;

The unlocking module 13 is configured to: when it is determined that the tree node entry data or the result table data of the current search level is updated, the search finger after the control packet entering the current search level is unlocked make.

In an embodiment, the second update module 12 is further configured to: when determining that the current search level is the highest search level, insert a control packet at a search instruction entry of the current search level;

Here, the determining, by the second update module 12, that the current search level is the highest search level includes: determining that the current search level is the top search level of all the search levels that need to be updated;

In an embodiment, the second update module 12 determines that the search instruction before the control packet enters the current search level has been processed, that is, the search instruction before the control packet enters the current search level has been obtained from the FIFO. When the queue is emptied, that is, the control packet is detected at the queue exit of the FIFO 2, and the read-empty data of the control packet is also returned to the exit of the FIFO 4; as shown in step 3 in FIG. 6;

In an embodiment, the updating, by the second update module 12, the tree node entry data or the result entry data of the current search level includes:

The second update module 12 reads the table item data that needs to be updated in all the search levels that are stored, and the table item data that needs to be updated in the current search level in the update address corresponding to the item data, and the table that needs to be updated in the current search level. An update address corresponding to the item data, and the table item data that needs to be updated by the current search level is written into the corresponding update address;

Correspondingly, the device further includes a second cache module 14 configured to store the entry data that needs to be updated by all the search levels and the update address corresponding to the entry data;

Obtaining the data that needs to be updated in all the search levels stored in the second cache module 14 and the update data corresponding to the data that the current search level needs to update in the address corresponding to the data, and the update address corresponding to the data that needs to be updated by the current search level, and the current search level The data that needs to be updated is written into the corresponding update address;

Here, the obtaining all the search levels stored in the second cache module 14 needs updated data. And the method further includes: the second cache module 14 stores all the search levels written by the software, before the data corresponding to the data needs to be updated by the current search level and the update address corresponding to the data that needs to be updated by the current search level. The updated item data and the updated address corresponding to the item data;

In an embodiment, the second update module 12 is further configured to directly send the control packet to the next search level; thus, the continuity of the update operation of the B-tree can be ensured, and the update is reduced. Delay, improve the update efficiency of B-tree.

The first update module, the Cache module, the insert module, the determination module, the lock module, the second update module, and the unlock module provided in the embodiment of the present invention may all be implemented by a processor, and may also pass through a specific logic circuit. In practical applications, the processor may be a central processing unit (CPU), a microprocessor (MPU), a digital signal processor (DSP), or a field programmable gate array (FPGA), etc.; the first cache module and The second cache module can be implemented by a memory.

In the embodiment of the present invention, if the foregoing route search-based entry update method is implemented in the form of a software function module and is sold or used as a stand-alone product, it may also be stored in a computer readable storage medium. Based on such understanding, the technical solution of the embodiments of the present invention may be embodied in the form of a software product in essence or in the form of a software product stored in a storage medium, including a plurality of instructions. A computer device (which may be a personal computer, server, or network device, etc.) is caused to perform all or part of the methods described in various embodiments of the present invention. The foregoing storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read only memory (ROM), a magnetic disk, or an optical disk. Thus, embodiments of the invention are not limited to any specific combination of hardware and software.

Correspondingly, the embodiment of the present invention further provides a computer storage medium, where the computer storage medium stores a computer program for performing the above-mentioned route lookup based update method of the embodiment of the present invention.

The above is only the preferred embodiment of the present invention and is not intended to limit the scope of the present invention.

Claims

A method for updating an entry based on a route lookup, the method comprising:

Determining that the control packet enters the current search level, and the search instruction before the control packet has been processed, updating the tree node entry data or the result entry data of the current search level, and simultaneously acquiring the control packet Searching for a read address in the instruction, matching the read address with the update address of the current search level, and determining that the data obtained according to the read address is replaced with the data corresponding to the update address when the match is successful;

Determining that the tree node entry data or the result table item data update is completed, inserting a markup packet at a search instruction entry of the current search level;

The tagged packet is discarded when it is determined that the lookup instruction before the tagged packet is inserted into the current lookup stage has been processed.
The method of claim 1, wherein the method further comprises: before the determining that the control packet enters the current lookup level, and the lookup instructions before the control packet have been processed, the method further comprising:

Reading the updated table entry data and the update address corresponding to the entry data, and obtaining and saving the entry data that needs to be updated by the current search level and the entry data that needs to be updated by the current search level. Update the address.
The method according to claim 2, wherein the stored list item data that needs to be updated and the update address corresponding to the item data include: a tree node table part and a result table part;

The tree node table part includes: node data that needs to be updated by all the search levels and an update address corresponding to the node data; the result table part includes: result data that needs to be updated by all the search levels, and the result The update address corresponding to the data.
The method according to claim 1 or 2, wherein the method further comprises: before the determining that the control packet enters the current lookup level, and before the lookup instructions before the control packet have been processed, the method further comprises:

When the current search level is determined to be the highest search level, the search command entry at the current search level is inserted. Enter the control package.
The method of claim 1 or 2, wherein the method further comprises:

When the error table entry data of the current search level is found, the error table entry data and the update address corresponding to the error table entry data are stored, and the read address in the search instruction of the current search level is sequentially obtained, and the The read address is matched with the update address of the current search level. When the match is successful, the data obtained according to the read address is replaced with the data corresponding to the update address until the error is repaired.
A method for updating an entry based on a route lookup, the method comprising:

When the control packet is detected in the current search level, the search instruction after entering the control packet of the current search level is locked;

Determining, when the processing instruction before the control packet enters the current search level, that the search instruction has been processed, updating the tree node entry data or the result entry data of the current search level;

When it is determined that the tree node entry data or the result entry data update of the current search level is completed, the search instruction after the control packet entering the current search level is unlocked.
The method of claim 6 wherein before the control packet is detected in the current lookup stage, the method further comprises:

When it is determined that the current search level is the highest search level, the control packet is inserted at the search instruction entry of the current search level.
The method according to claim 6 or 7, wherein, when it is determined that the search instruction before the control packet enters the current search level has been processed, the method further includes:

The control packet is sent directly to the next lookup level.
The method according to claim 6 or 7, wherein the updating the tree node entry data or the result entry data of the current search level comprises:

Reading the table item data that needs to be updated in all the search levels that are stored, and the table item data that needs to be updated in the current search level in the update address corresponding to the table item data, and the table that needs to be updated in the current search level. The update address corresponding to the item data, and the table item data that needs to be updated by the current search level is written into the corresponding update address.
An apparatus for updating an item based on a route search, the apparatus comprising: a first update module, a Cache module, an insert module, and a determining module; wherein

The first update module is configured to: when the control packet enters the current search level, and the search instruction before the control packet has been processed, update the tree node entry data or the result entry data of the current search level, and simultaneously , triggering the Cache module;

The Cache module is configured to sequentially acquire a read address in a lookup instruction after the control packet, and match the read address with an update address of a current lookup level, and determine that the match is successful according to the read address. Data is replaced with data corresponding to the update address;

The inserting module is configured to: when the tree node entry data or the result table data update is completed, insert a markup packet at a search instruction entry of the current search level;

The determining module is configured to discard the tagged packet when it is determined that the lookup instruction before the tagged packet is inserted into the current lookup stage has been processed.
The device according to claim 10, wherein the first update module is further configured to: read the updated entry data of all the search levels that need to be updated and the update address corresponding to the entry data, and obtain and save the current search level. The updated item address and the updated address corresponding to the item data to be updated by the current search level;

Correspondingly, the device further includes a first cache module configured to store the entry data that needs to be updated by all the search levels and the update address corresponding to the entry data;

The Cache module is further configured to store the entry data that needs to be updated by the current search level and the update address corresponding to the entry data that needs to be updated by the current search level.
The apparatus according to claim 10 or 11, wherein said first update module is further configured to: when the current lookup level is determined to be the highest lookup level, insert a control packet at a lookup instruction entry of the current lookup level.
The device according to claim 10 or 11, wherein the first update module is further configured to store the error table entry data and the error table entry data when detecting the error table entry data of the current search level of the search Corresponding update address to the Cache module, and sequentially acquiring the read address in the search instruction of the current search level, matching the read address with the update address of the current search level, and determining that the match is successful, according to the read address The acquired data is replaced with the data corresponding to the update address until the error is fixed.
An apparatus for updating an item based on a route search, the apparatus comprising: a lock module, a second update module, and an unlocking module;

The locking module is configured to lock a lookup instruction after entering the control packet of the current search level when the control packet is detected in the current search level;

The second update module is configured to: when the search instruction before the control packet enters the current search level has been processed, update the tree node entry data or the result entry data of the current search level;

The unlocking module is configured to: when determining that the tree node entry data or the result table item data of the current search level is updated, unlocking the lookup instruction after entering the control packet of the current search level.
The apparatus of claim 14, wherein the second update module is further configured to determine that the current lookup level is the highest lookup level, the control packet being inserted at a lookup instruction entry of the current lookup level.
The device according to claim 14 or 15, wherein the second update module is configured to read the updated entry data of all the search levels that are required to be stored, and the current search level in the update address corresponding to the entry data needs to be updated. The entry data and the update address corresponding to the updated entry data of the current search level, and write the entry data that needs to be updated by the current search level into the corresponding update address;

Correspondingly, the device further includes a second cache module configured to store the entry data that needs to be updated by all the search levels and the update address corresponding to the entry data.
The apparatus of claim 14 or 15, wherein said second update module is further configured to send said control packet directly to a next lookup stage.
A computer storage medium having stored therein computer executable instructions for performing a route lookup based entry update method according to any one of claims 1 to 5.
A computer storage medium having stored therein computer executable instructions for performing a route lookup based entry update method according to any one of claims 6 to 9.