WO2020134933A1

WO2020134933A1 - Information processing method and device, and storage medium

Info

Publication number: WO2020134933A1
Application number: PCT/CN2019/123127
Authority: WO
Inventors: 丁春云; 向奇敏; 龚汉杰; 任伟; 唐思诚
Original assignee: 中兴通讯股份有限公司
Priority date: 2018-12-29
Filing date: 2019-12-04
Publication date: 2020-07-02
Also published as: CN111385195A; CN111385195B

Abstract

Disclosed are an information processing method and device, and a storage medium. The method comprises: determining occurrence of a fault in a link used to transmit packets between one node and a destination node (101); searching a node table for a first index identifier corresponding to an Internet protocol (IP) address of the destination node, wherein the node table stores correspondence relationships between IP addresses of nodes and index identifiers (102); searching a topologically equivalent class (TEC) table for first TEC information corresponding to the first index identifier (103), wherein the TEC table stores correspondence relationships between index identifiers and TEC information, and the TEC information at least represents an outbound direction in which a packet travels from the first node; and updating the first TEC information (104).

Description

Information processing method, device and storage medium

cross reference

This application refers to the Chinese patent application No. 201811642377.1 filed on December 29, 2018 and titled "An Information Processing Method, Device, and Storage Medium," which is incorporated by reference in its entirety.

Technical field

This application relates to the field of communication technology, and in particular, to an information processing method, device, and storage medium.

Background technique

Currently, routers can be used for networking to transmit packets through the formed network, etc. Each router can be used as a node. If the link between a certain node and the next hop node fails, you need to perform routing table Update. The routing table in the related art establishes a piece of routing information for a path, and the routing information includes a gateway (that is, a next-hop node) and a routing network segment. When the link between a certain node and the next hop node fails, the routing network segment, gateway and other information in each routing information needs to be updated.

The above method needs to update the routing network segment, gateway and other information in each routing information, which will cause too much content to be modified in the routing table, so the route re-convergence time will become longer, which may affect the report The normal transmission of the text.

Summary of the invention

To solve the existing technical problems, embodiments of the present application provide an information processing method, device, and storage medium.

The technical solutions of the embodiments of the present application are implemented in this way. The embodiments of the present application provide an information processing method including: determining that a link for transmitting a message between itself and a destination node fails; and searching for the destination node from a node table The first index identifier corresponding to the Internet Protocol (IP, Internet) address of the Internet; the node table is set with the correspondence between the IP address of the node and the index identifier; from the topological equivalence class (TEC, Topology Equivalence Class) table The first TEC information corresponding to the first index identifier; the TEC table is provided with a relationship between the index identifier and the TEC information; the TEC information at least represents the outgoing direction of the message at the first node; for the first TEC information is updated.

An embodiment of the present application provides an information processing apparatus, which is applied to a first node. The apparatus includes: a determining unit configured to determine that a link for transmitting a message between itself and a destination node fails; a searching unit configured as a slave node Look up the first index identifier corresponding to the IP address of the destination address in the table; the node table is provided with the correspondence between the IP address of the node and the index identifier; and is also configured to look up the TEC table corresponding to the first index identifier The first TEC information; the TEC table is provided with a relationship between the index identifier and the TEC information; the TEC information at least characterizes the direction of the message at the first node; the update unit is configured to configure the first TEC information To update.

An embodiment of the present application provides an information processing apparatus, including: a processor and a memory for storing a computer program that can be run on the processor, wherein when the processor is used to run the computer program, the The steps of an information processing method.

An embodiment of the present application provides a storage medium on which a computer program is stored, and when the computer program is executed by a processor, any step of the above information processing method is implemented.

BRIEF DESCRIPTION

1 is a schematic diagram of an implementation process of an information processing method according to an embodiment of this application;

2a and 2b are a schematic diagram 1 of a topology structure of a first node and a second node according to an embodiment of the present application;

3 is a schematic diagram 2 of a topology structure of a first node and a second node according to an embodiment of the present application;

4 is a schematic diagram 3 of a topology of a first node and a second node according to an embodiment of this application;

5 is a schematic structural diagram 1 of an information processing device according to an embodiment of the present application;

6 is a second structural diagram of the information processing apparatus according to an embodiment of the present application.

detailed description

The application will be described in further detail below with reference to the drawings and embodiments.

In the related technology, routing technology is a must-have function of the current fifth-generation communication technology (5G, fifth Generation), which can be networked through routers to transmit packets through the formed network, etc. Each router can serve as a node, The data stream corresponding to the message can be voice, video, etc. The routing table in the related art establishes a piece of routing information for a path, and the routing information includes a gateway (that is, a next-hop node) and a routing network segment. If the link between a certain node and the next-hop node fails, you need to update each piece of routing information (including routing network segments and gateways) corresponding to the destination node in the routing table. In this way, too much content needs to be modified in the routing table, so the route re-convergence time will become longer, which may affect the normal transmission of packets.

Among them, route re-convergence may refer to the process of re-establishing the routing table, sending to learning, and stabilizing after the topology structure of the network changes, and notifying all relevant routers in the network to learn of the change. That is, the behavior of discovering alternative routes by recalculating routes caused by network topology changes.

Based on this, in various embodiments of the present application, the first index identifier corresponds to the IP address of the destination node, that is, multiple routes from the first node to the destination node can be used It is identified by the first index identifier, and the routing network segments of multiple routes are different. When the link between the first node and the destination node fails, it corresponds to one route set in the routing table in the related art. Compared with the solution of the routing network segment, the solution of the embodiment of the present application does not need to update the routing network segment of each route in multiple routes, but only needs to update the first TEC information in the TEC table, because The route network segment of each route corresponding to the destination node is updated, so that the fast restoration of the route can be ensured, and then the normal transmission of the message can be ensured.

An embodiment of the present application provides an information processing method, which is applied to a first node. As shown in FIG. 1, the method includes the following steps.

Step 101: Determine that the link for transmitting packets between itself and the destination node is faulty.

Here, the first node and the destination may specifically be a router or a switch.

Wherein, the first node may determine that the link between itself and the destination node that is transmitting a message has failed. Specifically, the first node may detect the destination address of the destination node, and when it is detected that the destination address of the destination node is abnormal, the first node may determine the link between itself and the destination node malfunction.

Step 102: Find the first index identifier corresponding to the IP address of the destination node from the node table; the node table is set with the correspondence between the IP address of the node and the index identifier.

In practical applications, when a node in the network determines that it can transmit a message from the first node to another node via itself, the node in the network may start flooding to transfer the message from the first node via itself. The routing information from the node to another node is broadcast to the first node. In this way, the first node may collect at least one piece of routing information in the network. Among them, flooding can refer to a routing algorithm that broadcasts routing information to nodes connected to itself.

For example, assuming that the first node is represented by node A, when node M in the network determines that it can transmit a message from the first node to another node D via itself, the node M can send routing information Broadcast to node A, the routing information may include the path, AMD, and the corresponding path length. Suppose that when node N in the network determines that it can transmit a message from the first node to another node D via itself, node N can broadcast routing information to node A, and the routing information can include a path, AND , And the corresponding path length. In this way, node A can collect multiple pieces of routing information to reach node D.

Here, there may be multiple links from the first node to the destination node. In this way, when a single link between the first node and the destination node fails, in order to achieve route reconvergence, you need to Among the multiple paths to the destination node, a path without failure is selected for the first node to perform normal transmission of the message.

Based on this, in an embodiment, the method further includes: obtaining at least one piece of routing information; using the obtained routing information, dividing multiple routes with the same destination address into a group to obtain multiple routing groups; for each route Group, determine the index identifier, and establish the correspondence between the node's IP address and the index identifier to obtain the node table.

In practical applications, there may be multiple links from the first node to the destination node. When multiple routes with the same destination address are divided into a group, in order to distinguish each route group, a packet can be used to reach the destination node. The IP address of at least one node of the destination node of the routing group generates an index mark to mark each routing group.

Based on this, in an embodiment, the determination of the index identifier includes: for each routing group, determining at least one node in the network that the packet can reach the destination node of the routing group; using the determined at least one The IP address of the node determines the index identification of the corresponding routing group.

Here, the establishment process of the node table may be as follows.

For example, assume that the first node is represented by node A, and there may be multiple destination nodes that node A can reach, for example, node C, node E, and node F. Among them, assume that the IP address of node C is 10.1.1.4/32; suppose that the IP address of node C is 10.1.1.4/32; there can be multiple links from node A to node C, for example, node A-node D-node C, or, node A-node B-node C, etc.; there can be multiple links from node A to node E, for example, node A-node D-node E, or node A-node B-node C -Node E, etc.; there may be multiple links from Node A to Node F, for example, Node A-Node D-Node F, or Node A-Node B-Node C-Node F, and so on. In this way, the multiple routes of the destination node for node C can be divided into a group and assigned an index mark, assuming X; the multiple routes of the destination node as node E can be divided into a group and assigned an index mark, assuming Y indicates that the destination node is a plurality of routes of node F are divided into a group, and the index mark is assigned, assuming that Z is used. The correspondence between the IP address of the node and the index identifier is established to obtain the node table, as shown in Table 1.

Table 1

Since there may be multiple links between the first node and the destination node, and each link corresponds to a routing network segment, the corresponding relationship between the index identifier and the routing network segment can be obtained. Suppose there are 3 routes to node C, and the corresponding routing network segment is divided into: 192.1.1.0/16, 192.1.2.0/16, 192.1.3.0/16; suppose there are 3 routes to node E, the corresponding routing network The segment is divided into: 192.1.4.0/16, 192.1.5.0/16, 192.1.6.0/16; assuming there are 3 routes to node F, the corresponding routing network segment is divided into: 192.1.7.0/16, 192.1.8.0/ 16. 192.1.9.0/16, as shown in Table 2.

Table 2

Step 103: Find the first TEC information corresponding to the first index identifier from the TEC table; the TEC table is provided with a relationship between the index identifier and the TEC information; the TEC information at least characterizes that the message is in the first The outgoing node.

In practical application, considering the related technology, for a link, the corresponding relationship between the routing network segment and the next hop sending information is established, and when the link to any next hop node fails, each link needs to be The routing network segment corresponding to the link and the next hop send information to update, so that in the process of achieving route reconvergence, more information needs to be updated, which may cause the message to not be transmitted to another undamaged in time On the link.

Here, the route from the first node to the destination node may include multiple routes. The route segments of the multiple routes are different. When the link between the first node and the destination node fails, route reconvergence needs to be achieved. To ensure the stability of the link. In order to reduce the update of routing information during the process of route re-convergence, that is, to avoid not updating the routing network segment of each route in multiple routes, a TEC message can be established for the index identification corresponding to each destination node In this piece of TEC information, at least the relevant information of the next hop node from the first node to the destination node may be included.

Based on this, in an embodiment, the method further includes: for each routing group, determining the path length between the first node and the destination node to obtain at least one path length; using the at least one path length, Determine the corresponding TEC information; and establish the correspondence between the index mark and the TEC information to obtain the TEC table.

Wherein, the TEC information may include at least the IP address of the next-hop node, the egress port of the next-hop node (which may be represented by the next-hop IP), the egress port of the first node (which may be represented by the egress interface), etc. .

Here, the node in the network where the message can reach the destination node of the routing group may refer to a node that broadcasts routing information to the first node through flooding.

Here, the establishment process of the TEC table may be as follows.

For example, assume that the first node is represented by node A, and there may be multiple destination nodes that node A can reach, for example, node C, node E, and node F. Suppose that the nodes in the network that can reach the destination node C include node C and node B; the nodes in the network that can reach the destination node E include node E, node B, and node C; the nodes in the network that can reach the destination node F Nodes include node F, node B, node C, and node D.

Take the destination node C that node A can reach as an example to explain the calculation process of TEC information, as follows.

Node A can calculate the path length between node A and node C, expressed by metric1, assuming metric1=1, the path length between node A, node B, and node C, expressed by metric2, assuming metric1=2; node A can By comparing metric1 and metric2, a path with the smallest path length can be determined, that is, the path corresponding to node A-node C.

After the determined AC path, node A can determine the TEC information using the determined AC path. Specifically, the node C's IP address is used as the IP address of the next hop node in the TEC information, assuming 10.1.1.4/32 , The node C points to the output port of node A as the next hop IP in the TEC information, assuming 4.4.4.1/24, and the node A points to the output port of node C as the output interface in the TEC information, assuming 4.4.4.2/ 24. Obtain the first TEC information in Table 3.

It should be noted that, for the situation of the destination node E and the destination node F reached by the node A, reference may be made to the above description, which will not be repeated here.

table 3

In actual application, when calculating the TEC information, the path length between the first node and the destination node needs to be used. Therefore, keyword information and path length information can be added to the TEC information; where the keyword information represents the IP of the node The address and path length information characterize the path length between the first node and the corresponding destination node. Taking the TEC corresponding to the destination node C as an example, the obtained TEC information is shown in Table 4.

Table 4

In practical application, considering that there may be multiple outgoing forwarding paths of packets in the network via the first node, in this way, for each routing group, the first node may compare itself with the destination node of the routing group The multiple outgoing forwarding paths are marked. When the specific outgoing forwarding path is determined using the TEC information, the corresponding forwarding path can be quickly found from the multiple forwarding paths.

Based on this, in an embodiment, the method further includes: for each routing group, determining a corresponding label set; the label set includes at least one label; one label corresponds to the destination node from the first node to the routing group A path between; the label is used to mark the path of the transmission message; the determined index set is set in the corresponding TEC information.

For example, assume that the first node is represented by node A and the destination node is represented by node C, and the path from node A to destination node C may be A-B-C, A-C. Assuming that the labels of path A-B-C are represented by 01 and the labels of path A-C are represented by 02, the label set {01,02} from node A to destination node C can be obtained, as shown in Table 5.

table 5

In practical application, each index identifies the corresponding TEC information, which can characterize one outgoing forwarding path of the message at the first node, and can also characterize multiple outgoing forwarding paths of the message at the first node.

For example, when applied to a fast rerouting scenario, the TEC information corresponding to each index identifier may represent the two outgoing forwarding paths of the packet at the first node, where one outgoing forwarding path serves as the main forwarding path and the other The outgoing forwarding path is used as the standby forwarding path. In this way, when there is a problem with the message transmission through the main forwarding path, the message transmission can be performed through the standby forwarding path again to ensure the normal transmission of the message without being affected by the link failure.

When applied to an equal-cost multi-routing scenario, the TEC information corresponding to each index identifier can characterize the two outgoing forwarding paths of the packet at the first node, where both outgoing forwarding paths are used as the main forwarding path. When there is a problem with one of the main forwarding paths for message transmission, the other main forwarding path can be used for message transmission to ensure the normal transmission of the message, thereby ensuring that the message transmission is not affected by the link failure.

Step 104: Update the first TEC information.

In practical applications, if the destination node reached by the first node has not failed, and the first node can reach the destination node via other nodes, the process of updating the first TEC information may be: For each routing group, determine the path length between the first node and the second node to obtain at least one path length; the second node is a node in the network where packets can reach the scheduling destination node; use the at least one The path length determines the corresponding TEC information; the first TEC information is updated with the determined TEC information.

Based on this, in an embodiment, the updating of the first TEC information includes: determining the TEC information using at least one path length; the path length is the path length of the first node and the second node; The second node is a node in the network where the message can reach the destination node; the first TEC information is updated using the determined TEC information.

It should be noted that when the link between the first node and the destination node fails, only the first TEC information in the TEC table is updated, because there is no need to correspond to the destination node. The routing network segment of each route is updated. Therefore, the route can be quickly converged to ensure the timely transmission of packets.

In actual application, if the destination node reached by the first node fails, a new destination node needs to be reselected. The TEC information of the new destination node is different from the first TEC information, so that the first The first TEC information in a TEC table is updated.

Based on this, in an embodiment, the method further includes: determining the second link after determining that the destination node fails; using at least one path length to determine TEC information; the path length is the first node and the The path length of the destination node of the second link; using the determined TEC information, the TEC table is updated.

Here, updating the TEC table may refer to deleting the first TEC information in the TEC table, or replacing the first TEC information with the determined TEC information.

Using the technical solution of the embodiment of the present application, the first index identifier corresponds to the IP address of the destination node, that is, multiple routes from the first node to the destination node may use the first Indexed to identify, and the route segments of multiple routes are different. When the link between the first node and the destination node fails, it corresponds to a route segment in the routing table in the related art. Compared with the solution, the solution of the embodiment of the present application does not need to update the routing network segment of each route in multiple routes, but only needs to update the first TEC information in the TEC table, because the purpose is not required. The routing network segment of each route corresponding to the node is updated, so that the rapid restoration of the route can be ensured, and then the normal transmission of the message can be ensured.

The application will be described in further detail below in conjunction with application examples.

In the following application embodiments, node A corresponds to the above-mentioned first node, and node D corresponds to the above-mentioned destination node.

The specific process of node A collecting topology and routing information includes: As shown in FIGS. 2a and 2b, taking node A to reach node D as an example, node A can reach node D via node C, assuming that node A reaches node D via node C The routing information is represented by route 1. The routing network segment of route 1 can be preset by the user, assuming 192.1.1.1/16; then node C can start IGP flooding to pass the routing information of route 1 to node A. Node A can also directly reach node D, assuming that the routing information of node A directly reaching node D is represented by route 2, the routing network segment of route 2 can be preset by the user, assuming 192.1.0.1/16; then node D can start IGP Flooding to pass routing information of route 2 to node A. Taking node A to reach node C as an example, node A can reach node C via node D. It is assumed that the routing information from node A to node C via node D is represented by route 3. The route segment of route 3 can be preset by the user. 192.0.0.0/16; then node D can start IGP flooding to pass routing information of route 3 to node A. Node A can also reach node C via node B. It is assumed that the routing information from node A to node D via node C is represented by route 4. The route segment of route 4 can be preset by the user, assuming 192.0.0.1/16; then Node B can initiate IGP flooding to pass routing information of route 4 to node A.

Application Example 1

In this application embodiment, as shown in FIGS. 3 and 4, the application scenario of this application embodiment is a single link failure scenario.

In addition, in this application example, the established node table is shown in Table 6. The established TEC table is shown in Table 7.

Table 6

Table 7

Step 1: The node A determines that the link between itself and the node D has failed, and then searches the node table for the first index identifier corresponding to the IP address of the node D.

From Table 6, it can be determined that the first index identifier corresponding to node D is X.

Step 2: Node A looks up the first TEC information corresponding to the first index identifier from the TEC table.

From Table 7, for the index ID X corresponding to node D, the TEC information found includes: the IP address of the next hop node is 10.1.1.4/32, the IP of the next hop is 4.4.4.1/24, and the outbound interface is 4.4 .4.2/24.

Step 3: Update the first TEC information.

The processing procedure for the failure of the destination node D is as follows.

As shown in FIG. 3, when the single link between node A and node D fails, destination node D does not fail, node C can also reach destination node D, and the path from node A to destination node D is A-B-C-D. In this way, node A can use the determined path of ABCD to determine the TEC information, specifically, the IP address of node B, that is, 10.1.1.2/32, as the IP address of the next hop node in the TEC information, and the entry port of node B That is, 1.1.1.2/24 is taken as the next hop IP in the TEC information, and the outgoing port of node A, namely 1.1.1.1/24, is used as the outgoing interface in the TEC information to obtain the determined TEC information. Use the determined TEC information to update the first TEC information found in the TEC table.

It should be noted that before a single link failure occurs between node A and node D, the index identifier X can be determined by the IP addresses of node C and node D; when the single link failure between node A and node D occurs At this time, since the destination node D has not failed, the index mark X can still be determined by the IP addresses of the nodes C and D, that is, the index mark X does not need to be updated.

As shown in FIG. 4, when a single link between node A and node D fails, if destination node D fails, node A will determine the TEC information twice. Specifically, node A first detects the link failure. , Node A can determine the path to node D as: ABCD, and use the determined path of ABCD to determine a TEC information; after the failure of destination node D, node A can use destination node C as a new destination node, based on the destination node The TEC information corresponding to C updates the TEC table.

It should be noted that before a single link failure occurs between node A and node D, the index mark X can be determined by the IP addresses of node C and node D; after the destination node D fails, the index mark X is determined by node C The IP address is determined, that is, the index mark X needs to be updated.

Here, when the destination node D fails, the route can be converged to the new path, so as to ensure that the packet transmission is not affected and the convergence time is not affected. Here, multiple routes from node A to node D can be represented by index mark X, and the route segments of multiple routes are different. When the single link between node A and node D fails, since node D is not required The routing network segment corresponding to each route is updated, so that the rapid restoration of the route can be ensured, and then the normal transmission of the message can be ensured.

Application Example 2

In this application embodiment, as shown in FIG. 3, the application scenario of this application embodiment is a fast rerouting (FRR, Fast) route.

In addition, in this application example, the established TEC table is shown in Table 8.

Table 8

From Table 8, for the index ID X corresponding to node D, the TEC information found includes: the IP address of the primary next hop node is 10.1.1.4/32, the IP of the primary next hop is 4.4.4.1/24, the primary out The interface is 4.4.4.2/24. The IP address of the next hop node is 10.1.1.2/32, the next hop IP is 1.1.1.2/24, and the outgoing interface is 1.1.1.1/24.

Step 3: Update the first TEC information.

As can be seen from Table 8, the TEC information can represent the two forwarding paths of the message at node A, one as the main forwarding path and the other as the backup forwarding path, so that when the single link between node A and node D fails, it can be Use the TEC information corresponding to the backup forwarding path to determine the outgoing forwarding path for transmitting the message to ensure the normal transmission of the message.

Here, multiple routes from node A to node D can be represented by index mark X, and the route segments of multiple routes are different. When the single link between node A and node D fails, since node D is not required The routing network segment corresponding to each route is updated, so that the rapid restoration of the route can be ensured, and then the normal transmission of the message can be ensured.

Application Example 3

In this application embodiment, the application scenario of this application embodiment is an equivalent multi-routing scenario.

In addition, in this application example, the established TEC table is shown in Table 9. In an equivalent multi-routing scenario, multiple paths between node A and node D can be set as the main forwarding path, each main forwarding path corresponds to a piece of TEC information, including the IP address of the main next hop node, the main next hop IP, main output interface.

Table 9

From Table 6, the index identifier X may be determined firstly corresponding to the node D.

From Table 9, for the index ID X corresponding to node D, the TEC information found includes: the IP address of the primary next hop node is 10.1.1.4/32, the IP of the primary next hop is 4.4.4.1/24, the primary out The interface is 4.4.4.2/24. The IP address of the primary next hop node is 10.1.1.2/32, the primary next hop IP is 1.1.1.2/24, and the primary outgoing interface is 1.1.1.1/24.

Step 3: Update the first TEC information.

It can be seen from Table 9 that the TEC information can represent the two forwarding paths of the message at node A, both of which serve as the main forwarding path. In this way, when the link between node A and node D fails, that is, when one main forwarding path fails, you can Use the TEC information corresponding to another main forwarding path to determine the outgoing forwarding path for the transmission of the message to ensure the normal transmission of the message.

It should be noted that, in an equivalent multi-routing scenario, before the link between node A and node D transmits a message, the message can be transmitted on multiple primary forwarding paths. When the link for transmitting messages between node A and node D fails, that is, one of the multiple main forwarding paths fails, it reports from the remaining main forwarding paths of the multiple main forwarding paths Text transmission.

Application Example 4

In this application embodiment, as shown in FIG. 3, the application scenario of this application embodiment is an SR scenario. The established TEC table is shown in Table 10.

Table 10

Here, the path from node A to destination node E may include: ADE, ABCE, which are represented by 01 and 02, respectively, to obtain the label set {01,02}; the path from node A to destination node F may include: ADF, ABCF, respectively 03 and 04 indicate that the label set {03,04} is obtained.

From Table 10, for the index ID X corresponding to node D, the TEC information found includes: the IP address of the next hop node is 10.1.1.4/32, the IP of the next hop is 4.4.4.1/24, and the outbound interface is 4.4 .4.2/24. For the index identifier Z, the found TEC information includes: the IP address of the next hop node is 10.1.1.4/32, the IP of the next hop is 4.4.4.1/24, and the outgoing interface is 4.4.4.2/24.

Step 3: Update the first TEC information.

As shown in Figure 3, when the single link between node A and node D fails, node C can also reach destination node D, and the path from node A to destination node D is A-B-C-D. In this way, node A can use the determined path of ABCD to determine the TEC information, specifically, the IP address of node B, that is, 10.1.1.2/32, as the IP address of the next hop node in the TEC information, and the entry port of node B That is, 1.1.1.2/24 is taken as the next hop IP in the TEC information, and the outgoing port of node A, namely 1.1.1.1/24, is used as the outgoing interface in the TEC information to obtain the determined TEC information. Use the determined TEC information to update the first TEC information found in the TEC table.

As shown in FIG. 4, when the single link between node A and node D fails, node D fails, you need to determine the destination node as the second link of node C, based on the corresponding TEC information of node C The TEC table is updated.

Here, after the first node determines the path of A-B-C-E, it can determine the corresponding label from the label set, so that when the message is transmitted, the path can be quickly found from multiple outgoing forwarding paths to realize the timely transmission of the message.

In order to implement the method of the embodiment of the present application, the embodiment of the present application further provides an information processing apparatus, which is provided on the first node, as shown in FIG. 5, and includes the following units.

The determining unit 51 is configured to determine that the link for transmitting packets between itself and the destination node fails; the second node is the next hop node of the first node; and is also configured to be based on the purpose corresponding to the link The IP address of the node determines the corresponding first routing network segment.

The searching unit 52 is configured to search for the first index identifier corresponding to the IP address of the destination address from a node table; the node table is provided with a correspondence relationship between the IP address of the node and the index identifier; and is also configured to search from the TEC table The first TEC information corresponding to the first index identifier; the TEC table is provided with a relationship between the index identifier and the TEC information; the TEC information at least represents the outbound direction of the message at the first node.

The updating unit 53 is configured to update the first TEC information.

In practical applications, the first node may detect the destination address of the destination node, and when detecting that the destination address of the destination node is abnormal, the first node may determine the link between itself and the destination node Road failure.

There may be multiple links from the first node to the destination node. In this way, when a single link between the first node and the destination node fails, in order to achieve route reconvergence, it is necessary to The multiple paths of the destination node select a path that has not failed, for the first node to perform normal transmission of the message.

Based on this, in an embodiment, the device further includes: a table creation unit configured to obtain at least one piece of routing information; using the obtained routing information, a plurality of routes with the same destination address are divided into a group to obtain a plurality of routes Group; for each routing group, determine the index identification, and establish the correspondence between the node's IP address and the index identification to obtain the node table.

In practical applications, there may be multiple links from the first node to the destination node via the next hop node, that is, the second node. When multiple routes with the same destination address are divided into a group, in order to distinguish each Each routing group can use the IP address of at least one node whose packets can reach the destination node of the routing group to generate an index mark to mark each routing group.

Based on this, in an embodiment, the table establishment unit is specifically configured to: for each routing group, determine at least one node of the network that can reach the destination node of the routing group in the packet; use the determined at least one The IP address of the node determines the index identification of the corresponding routing group.

Based on this, in an embodiment, the table creation unit is further configured to determine the path length between the first node and the destination node for each routing group to obtain at least one path length; the other nodes are A node in the network where the message can reach the destination node of the routing group; determine the corresponding TEC information using the at least one path length; and establish a correspondence between the index identifier and the TEC information to obtain the TEC table.

The TEC information may include at least the IP address of the next hop node, the egress port of the next hop node, the egress port of the first node, and so on.

Based on this, in an embodiment, the table building unit is further configured to determine a corresponding label set for each routing group; the label set includes at least one label; one label corresponds from the first node to the routing group A path between the destination nodes of the server; the label is used to mark the path of the transmission message; the determined index set is set in the corresponding TEC information.

Based on this, in an embodiment, the update unit 53 is specifically configured to: determine the TEC information using at least one path length; the path length is the path length of the first node and the second node; the second node It is the node other than the second node among the nodes in the network where the message can reach the destination node corresponding to the link; the first TEC information is updated with the determined TEC information.

It should be noted that when the link between the first node and the destination node fails, only the first TEC information in the TEC table is updated, because there is no need to correspond to the destination node. The information represented by the route segment of each route is updated. Therefore, the route can be quickly converged to ensure the timely transmission of packets.

In actual application, if the first node fails to reach the destination node, a new destination node needs to be reselected. The TEC information associated with the new destination node is different from the first TEC information. The first TEC information in the first TEC table is updated.

Based on this, in an embodiment, the update unit 53 is further configured to determine the second link after determining that the destination node fails; use at least one path length to determine the TEC information; the path length is the first node The path length of the destination node with the second link; using the determined TEC information, update the TEC table.

In practical applications, the determination unit 51, the search unit 52, the update unit 53, and the table creation unit may be implemented by a processor in the information processing device.

Based on the hardware implementation of the above program modules, and in order to implement the method on the node side of the embodiment of the present application, an embodiment of the present application further provides an information processing apparatus. As shown in FIG. 6, the information processing apparatus 60 includes: a communication interface 61, A processor 62 and a memory 63; wherein, the communication interface 61 can exchange information with other devices; the processor 62 is connected to the communication interface 61 and is used to execute one or more technical solutions on the node side when running a computer program The method provided. The computer program is stored on the memory 63.

Of course, in actual application, the various components in the information processing device 60 are coupled together via the bus system 84. Understandably, the bus system 64 is used to implement connection and communication between these components. In addition to the data bus, the bus system 84 also includes a power bus, a control bus, and a status signal bus. However, for the sake of clarity, various buses are marked as the bus system 64 in FIG. 6.

The memory 63 in the embodiment of the present application is used to store various types of data to support the operation of the information processing device 60. Examples of these data include: any computer program for operating on the information processing device 80.

The method disclosed in the above embodiments of the present application may be applied to the processor 62, or implemented by the processor 62. The processor 62 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method may be completed by an integrated logic circuit of hardware in the processor 62 or instructions in the form of software. The above-mentioned processor 62 may be a general-purpose processor, a digital signal processor (DSP, Digital Processor), or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, and the like. The processor 62 may implement or execute the methods, steps, and logical block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the method disclosed in the embodiments of the present application may be directly implemented and completed by a hardware decoding processor, or may be implemented and completed by a combination of hardware and software modules in the decoding processor. The software module may be located in a storage medium, and the storage medium is located in the memory 63. The processor 62 reads the information in the memory 63 and completes the steps of the foregoing method in combination with its hardware.

In an exemplary embodiment, the information processing apparatus 60 may be one or more application specific integrated circuits (ASICs, Application Specific Integrated Circuits), DSPs, programmable logic devices (PLDs, Programmable Logic Devices), complex programmable logic devices ( CPLD, Complex Programmable Logic Device, Field Programmable Gate Array (FPGA, Field-Programmable Gate Array), general-purpose processor, controller, microcontroller (MCU, Micro Controller), microprocessor (Microprocessor), or other Electronic components are implemented to perform the aforementioned method.

It can be understood that the memory 63 in the embodiment of the present application may be a volatile memory or a non-volatile memory, and may also include both volatile and non-volatile memory. Among them, the non-volatile memory can be read-only memory (ROM, Read Only Memory), programmable read-only memory (PROM, Programmable Read-Only Memory), erasable programmable read-only memory (EPROM, Erasable Programmable Read- Only Memory), Electrically Erasable Programmable Read Only Memory (EEPROM, Electrically Erasable Programmable Read-Only Memory), Magnetic Random Access Memory (FRAM, Ferromagnetic Random Access Memory), Flash Memory (Flash) Memory, Magnetic Surface Memory , Compact disc, or read-only compact disc (CD-ROM, Compact, Read-Only Memory); the magnetic surface memory can be a disk storage or a tape storage. The volatile memory may be a random access memory (RAM, Random Access Memory), which is used as an external cache. By way of example but not limitation, many forms of RAM are available, such as static random access memory (SRAM, Static Random Access Memory), synchronous static random access memory (SSRAM, Synchronous Static Random Access Memory), dynamic random access Memory (DRAM, Dynamic Random Access Memory), Synchronous Dynamic Random Access Memory (SDRAM, Synchronous Dynamic Random Access Memory), Double Data Rate Synchronous Dynamic Random Access Memory (DDRSDRAM, Double Data Rate, Synchronous Dynamic Random Access Random Access Memory), enhanced Type synchronous dynamic random access memory (ESDRAM, Enhanced Synchronous Dynamic Random Access Memory), synchronous connection dynamic random access memory (SLDRAM, SyncLink Dynamic Random Access Memory), direct memory bus random access memory (DRRAM, Direct Rambus Random Access Random Access Memory ). The memories described in the embodiments of the present application are intended to include but are not limited to these and any other suitable types of memories.

It should be noted that: "first", "second", etc. are used to distinguish similar objects, and need not be used to describe a specific order or sequence.

In addition, the technical solutions described in the embodiments of the present application can be arbitrarily combined without conflict.

The above are only examples of the present application, and are not intended to limit the protection scope of the present application.

Claims

An information processing method applied to a first node. The method includes:

Determine that the link for transmitting packets between itself and the destination node is faulty;

Look up the first index identifier corresponding to the Internet protocol IP address of the destination node from the node table; the node table is provided with the correspondence between the node's IP address and the index identifier;

Find the first TEC information corresponding to the first index identifier from the topologically equivalent TEC table; the TEC table is provided with a relationship between the index identifier and the TEC information; the TEC information at least characterizes the message in the first Outbound of a node;

Updating the first TEC information.
The method of claim 1, wherein the method further comprises:

Obtain at least one piece of routing information;

Use the obtained routing information to divide multiple routes with the same destination address into one group to obtain multiple routing groups;

For each routing group, determine the index identifier, and establish the correspondence between the node's IP address and the index identifier to obtain the node table.
The method according to claim 2, wherein the determining index identifier comprises:

For each routing group, determine at least one node in the network that can reach the destination node of the routing group;

Using the determined IP address of the at least one node, the index identifier of the corresponding routing group is determined.
The method of claim 2, wherein the method further comprises:

For each routing group, determine at least one path length between the first node and the destination node;

Use the at least one path length to determine the corresponding TEC information; and establish the correspondence between the index mark and the TEC information to obtain the TEC table.
The method of claim 4, wherein the method further comprises:

For each routing group, determine the corresponding label set; the label set includes at least one label; one label corresponds to a path from the first node to the destination node of the routing group; the label is used to transmit packets Mark the path;

Set the determined index set in the corresponding TEC information.
The method according to claim 1, wherein the updating of the first TEC information includes:

Determine the TEC information using at least one path length; the path length is the path length of the first node and the second node; the second node is a node in the network where the packet can reach the destination node;

The first TEC information is updated using the determined TEC information.
The method of claim 1, wherein the method further comprises:

After determining that the destination node is faulty, determine the second link;

Use at least one path length to determine TEC information; the path length is the path length of the destination node of the first node and the second link;

The determined TEC information is used to update the TEC table.
An information processing device applied to a first node. The device includes:

The determining unit is configured to determine that the link for transmitting packets between itself and the destination node fails;

The searching unit is configured to search for the first index identifier corresponding to the IP address of the destination address from the node table; the node table is provided with a correspondence relationship between the IP address of the node and the index identifier; The first TEC information corresponding to the first index identifier; the TEC table is provided with a relationship between the index identifier and the TEC information; the TEC information at least represents the outgoing direction of the message at the first node;

The update unit is configured to update the first TEC information.
The device according to claim 8, wherein the device further comprises:

Table establishment unit, configured to obtain at least one piece of routing information; use the obtained routing information to divide multiple routes with the same destination address into a group to obtain multiple routing groups; for each routing group, determine the index identification and establish a node The correspondence between the IP address and the index identifier to obtain the node table.
The apparatus according to claim 9, wherein the table creation unit is configured to: for each routing group, determine at least one node in the network that can reach the destination node of the routing group in the packet; use the determined The IP address of a node determines the index of the corresponding routing group.
The device according to claim 9, wherein

The table establishing unit is further configured to determine the path length between the first node and the destination node for each routing group to obtain at least one path length; use the at least one path length to determine corresponding TEC information; And establish the correspondence between the index mark and the TEC information to obtain the TEC table.
The apparatus according to claim 8, wherein the update unit is configured to:

Use at least one path length to determine the TEC information; the path length is the path length of the first node and the second node; the second node is a node in the network where the message can reach the destination node; use the determined The TEC information updates the first TEC information.
An information processing device includes: a processor and a memory for storing a computer program that can run on the processor,

Wherein, when the processor is used to run the computer program, the steps of the method according to any one of claims 1 to 7 are executed.
A storage medium on which a computer program is stored, which when executed by a processor implements the steps of the method according to any one of claims 1 to 7.