CN111385195A

CN111385195A - Information processing method, device and storage medium

Info

Publication number: CN111385195A
Application number: CN201811642377.1A
Authority: CN
Inventors: 丁春云; 向奇敏; 龚汉杰; 任伟; 唐思诚
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2018-12-29
Filing date: 2018-12-29
Publication date: 2020-07-07
Anticipated expiration: 2038-12-29
Also published as: WO2020134933A1; CN111385195B

Abstract

The application discloses an information processing method, an information processing device and a storage medium, wherein the method comprises the following steps: determining that a link for transmitting a message between the link and a destination node has a fault; searching a first index identification corresponding to an Internet Protocol (IP) address of the destination node from a node table; the node table is provided with a corresponding relation between the IP address of the node and the index identifier; searching first thermoelectric cooler (TEC) information corresponding to the first index identification from a Topological Equivalence Class (TEC) table; the TEC table is provided with a relation between index identification and TEC information; the TEC information at least represents the outgoing direction of the message at the first node; and updating the first TEC information.

Description

Information processing method, device and storage medium

Technical Field

The present application relates to the field of communications technologies, and in particular, to an information processing method, an information processing apparatus, and a storage medium.

Background

Currently, networking can be performed through routers, so as to transmit messages and the like through a constructed network, each router can be used as a node, and if a link between a certain node and a next-hop node fails, a routing table needs to be updated. In a routing table in the related art, a piece of routing information is established for a path, and the routing information includes a gateway (i.e., a next hop node) and a routing network segment. When a link between a certain node and a next hop node fails, information such as a routing network segment, a gateway and the like in each piece of routing information needs to be updated.

In the above manner, information such as a routing network segment, a gateway, and the like in each piece of routing information needs to be updated, which may result in excessive contents to be modified in a routing table, and thus, the time for re-convergence of a route may be prolonged, which may further affect normal transmission of a packet.

Disclosure of Invention

In order to solve the existing technical problems, embodiments of the present application provide an information processing method, an information processing apparatus, and a storage medium.

The technical scheme of the embodiment of the invention is realized as follows:

an embodiment of the present application provides an information processing method, including:

determining that a link for transmitting a message between the link and a destination node has a fault;

searching a first index identification corresponding to an Internet Protocol (IP) address of the destination node from a node table; the node table is provided with a corresponding relation between the IP address of the node and the index identifier;

searching a Topology Equivalence Class (TEC) table for first TEC information corresponding to the first index identifier; the TEC table is provided with a relation between index identification and TEC information; the TEC information at least represents the outgoing direction of the message at the first node;

and updating the first TEC information.

An embodiment of the present application provides an information processing apparatus, which is applied to a first node, and the apparatus includes:

the determining unit is used for determining that a link for transmitting the message between the determining unit and the destination node has a fault;

the searching unit is used for searching a first index identifier corresponding to the IP address of the destination address from a node table; the node table is provided with a corresponding relation between the IP address of the node and the index identifier; the first index identification is used for identifying the first index in the TEC table; the TEC table is provided with a relation between index identification and TEC information; the TEC information at least represents the outgoing direction of the message at the first node;

and the updating unit is used for updating the first TEC information.

An embodiment of the present application provides an information processing apparatus, including: a processor and a memory for storing a computer program capable of running on the processor,

wherein the processor is configured to execute the steps of any of the above information processing methods when running the computer program.

An embodiment of the present application provides a storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps of any one of the information processing methods described above.

The information processing method, the information processing device and the storage medium provided by the embodiment of the application determine that a link for transmitting a message between the information processing device and a destination node is in fault; searching a first index identification corresponding to the IP address of the destination node from a node table; the node table is provided with a corresponding relation between the IP address of the node and the index identifier; searching first TEC information corresponding to the first index identification from a TEC table; the TEC table is provided with a relation between index identification and TEC information; the TEC information at least represents the outgoing direction of the message at the first node; and updating the first TEC information. By adopting the scheme of the embodiment of the 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 identified by the first index identifier, and the routing network segments of the multiple routes are different, when the link between the first node and the destination node fails, compared with the scheme that one route set in the routing table corresponds to one routing network segment in the related art, the scheme of the embodiment of the application does not need to update the routing network segment of each route in the multiple routes, and only needs to update the first TEC information in the TEC table, and because the routing network segment of each route corresponding to the destination node does not need to be updated, the rapid recovery of the route can be ensured, and the normal transmission of the message can be further ensured.

Drawings

FIG. 1 is a schematic diagram of a flow chart of an implementation of an information processing method according to an embodiment of the present application;

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

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

fig. 4 is a third schematic view of a topology structure of a first node and a second node according to an embodiment of the present application;

FIG. 5 is a first schematic structural diagram of an information processing apparatus according to an embodiment of the present application;

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

Detailed Description

The present application will be described in further detail with reference to the following drawings and examples.

In the related art, the routing technology is a function that the current fifth Generation communication technology (5G) must have, and networking may be performed through routers to transmit a packet through a constructed network, and each router may serve as a node, and a data stream corresponding to the packet may be voice, video, and the like. In a routing table in the related art, a piece of routing information is established for a path, and the routing information includes a gateway (i.e., a next hop node) and a routing network segment. If a link between a certain node and a next hop node fails, each piece of routing information (including a routing network segment and a gateway) corresponding to the node in the routing table needs to be updated one by one. This results in too many contents to be modified in the routing table, and thus the time for re-convergence of the route becomes longer, which may affect the normal transmission of the packet.

The route re-convergence may refer to a process that after a topology structure of a network changes, a routing table is re-established, sent, and learned until stable, and all relevant routers in the network are notified of the change. I.e., the behavior of discovering alternate routes by recalculating routes due to changes in network topology.

Based on this, in various embodiments of the present application, the first index identifier corresponds to an IP address of the destination node, that is, multiple routes from the first node to the destination node may be identified by the first index identifier, and routing segments of the multiple routes are different, when a link between the first node and the destination node fails, compared with a scheme in which one route set in a routing table corresponds to one routing segment in the related art, the scheme of the embodiment of the present application does not need to update a routing segment of each route in the multiple routes, and only needs to update the first TEC information in the TEC table, and since it does not need to update a routing segment of each route corresponding to the destination node, it is possible to ensure fast recovery of the route, and further ensure normal transmission of a packet.

An embodiment of the present application provides an information processing method, which is applied to a first node, and as shown in fig. 1, the method includes:

step 101: and determining that a link for transmitting the message between the self node and the destination node has a fault.

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

The first node may determine that a link, which is transmitting a packet between the first node and a destination node, is failed. Specifically, the first node may detect a destination address of the destination node, and when the destination address of the destination node is detected to be abnormal, the first node may determine that a link between itself and the destination node fails.

Step 102: searching a first index identification corresponding to the IP address of the destination node from a node table; the node table is provided with a corresponding relation between the IP address of the node and the index identifier.

In practical applications, when a node in a network determines that a packet can be transmitted from the first node to another node via the node, the node in the network may initiate flooding to broadcast routing information from the first node to the another node via the node. As such, the first node may collect at least one piece of routing information in the network. Flooding may refer to a routing algorithm, i.e., broadcasting routing information to nodes connected to the flooding node.

For example, assuming that the first node is represented by node a, when node M in the network determines that a packet can be transmitted from the first node to another node D via itself, node M may broadcast routing information to node a, where the routing information may include paths, i.e., a-M-D, and corresponding path lengths. It is assumed that a node N in the network, upon determining that a packet can be transmitted from the first node to another node D via itself, may broadcast routing information, which may include paths, i.e., a-N-D, and corresponding path lengths, to node a. In this manner, node a may collect multiple pieces of routing information to reach node D.

Here, there may be multiple links from the first node to the destination node, so that when a single link between the first node and the destination node fails, in order to implement route reconvergence, it is necessary to select an un-failed path from multiple paths to the destination node, so that the first node performs normal transmission of a packet.

Based on this, in an embodiment, the method further comprises: acquiring at least one piece of routing information; dividing a plurality of routes with the same destination address into a group by using the acquired route information to obtain a plurality of route groups; and determining an index identifier for each routing group, and establishing a corresponding relation between the IP address of the node and the index identifier to obtain the node table.

In practical application, there may be multiple links from the first node to the destination node, and after multiple routes with the same destination address are divided into one group, in order to distinguish each route group, an index identifier may be generated by using an IP address of at least one node where a packet can reach the destination node of the route group, so as to mark each route group.

Based on this, in an embodiment, the determining the index identifier includes: for each routing group, determining at least one node of the message in the network, which can reach the destination node of the routing group; and determining the index identification of the corresponding routing group by using the determined IP address of the at least one node.

Here, the establishment procedure of the node table may be as follows:

for example, assuming that the first node is represented by node a, there may be a plurality of destination nodes that node a can reach, such as node C, node E, and node F. Wherein, the IP address of the node C is 10.1.1.4/32; assume node C has an IP address of 10.1.1.4/32; there may be multiple links from node a to node C, e.g., node a-node D-node C, or node a-node B-node C, etc.; the link from node a to node E may be multiple, 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, e.g., node a-node D-node F, or node a-node B-node C-node F, etc. Thus, a plurality of routes with the destination node being node C can be divided into a group, and index identifiers are allocated, assuming that X is used for representation; dividing a plurality of routes with a destination node as a node E into a group, and allocating index identifiers, wherein the index identifiers are assumed to be represented by Y; and dividing a plurality of routes with the destination node as the node F into a group, and allocating index identifiers, wherein the index identifiers are assumed to be represented by Z. And establishing a corresponding relation between the IP address of the node and the index identifier to obtain the node table, as shown in table 1.

TABLE 1

Because there may be multiple links from the first node to the destination node, each link corresponds to a routing network segment, so that the corresponding relation between the index identifier and the routing network segment can be obtained. Assuming that there are 3 routes to reach node C, the corresponding route segments are: 192.1.1.0/16, 192.1.2.0/16, 192.1.3.0/16; assuming that there are 3 routes to reach node E, the corresponding route segments are: 192.1.4.0/16, 192.1.5.0/16, 192.1.6.0/16; assuming that there are 3 routes to reach node F, the corresponding route segments are: 192.1.7.0/16, 192.1.8.0/16, 192.1.9.0/16, as shown in Table 2.

TABLE 2

Step 103: searching first TEC information corresponding to the first index identification from a TEC table; the TEC table is provided with a relation between index identification and TEC information; the TEC information at least represents the outgoing direction of the message at the first node.

In practical application, in consideration of the related art, a corresponding relationship between a routing network segment and next hop transmission information is established for one link, and when a link reaching any one next hop node fails, the routing network segment and the next hop transmission information corresponding to each link need to be updated, so that more information needs to be updated in the process of realizing routing reconvergence, and thus, a message may not be transmitted to another link which does not fail in time.

Here, the route from the first node to the destination node may include multiple routes, where the route segments of the multiple routes are different, and when a link between the first node and the destination node fails, it is necessary to implement route re-convergence to ensure stability of the link. In order to reduce the update of the routing information in the process of route re-convergence, that is, in order to avoid not updating the routing segment of each of the plurality of routes, a piece of TEC information may be established for the index identifier corresponding to each destination node, where the piece of TEC information at least may include information related to a next hop node from the first node to the destination node.

Based on this, in an embodiment, the method further comprises: determining the path length between the first node and a destination node aiming at each routing group to obtain at least one path length; determining corresponding TEC information by using the at least one path length; and establishing a corresponding relation between the index identification and the TEC information to obtain the TEC table.

The TEC information may include at least an IP address of the next hop node, an egress port (which may be represented by the next hop IP) of the next hop node, an egress port (which may be represented by an egress interface) of the first node, and the like.

Here, the node in the network where the packet can reach the destination node of the routing group may refer to a node of the routing information broadcasted to the first node by flooding.

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

for example, assuming that the first node is represented by node a, there may be a plurality of destination nodes that node a can reach, such as node C, node E, and node F. The nodes of which the message can reach the destination node C in the network are assumed to comprise the node C and the node B; the nodes of which the message can reach the destination node E in the network comprise a node E, a node B and a node C; the nodes of the network, at which the message can reach the destination node F, include node F, node B, node C and node D.

Taking a destination node C which can be reached by the node a as an example, a calculation process of the TEC information is described, specifically as follows:

node a may calculate the path length between node a and node C, denoted by metric1, assuming metric1 is 1, and the path length between node a, node B, and node C, denoted by metric2, assuming metric1 is 2; node a may compare metric1 with metric2 and determine a path with the smallest path length, i.e., the path corresponding to node a-node C.

After the determined path of a-C, the node a may determine the TEC information by using the determined path of a-C, specifically, taking the IP address of the node C as the IP address of the next hop node in the TEC information, assuming to be 10.1.1.4/32, taking the egress port of the node C pointing to the node a as the next hop IP in the TEC information, assuming to be 4.4.4.1/24, taking the egress port of the node a pointing to the node C as the egress interface in the TEC information, assuming to be 4.4.4.2/24, and obtaining the first piece of TEC information in table 3.

It should be noted that, for the case of the destination node E and the destination node F reached by the node a, reference may be made to the above description, and details are not described here again.

TABLE 3

In practical application, when the TEC information is calculated, the path length between the first node and the destination node needs to be used, so that key information and path length information may be added to the TEC information; the key information represents the IP address of the node, and the path length information represents 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, it is considered that there are multiple outgoing forwarding paths of a packet in the network via the first node, so that, for each routing group, the first node may mark the multiple outgoing forwarding paths between itself and a destination node of the routing group, and after a specific outgoing forwarding path is determined by using the TEC information, a corresponding forwarding path may be quickly found from the multiple outgoing forwarding paths.

Based on this, in an embodiment, the method further comprises: for each routing group, determining a corresponding label set; the set of tags includes at least one tag; a label corresponding to a path from the first node to a destination node of the routing group; the label is used for marking a path for transmitting the message; and setting the determined index set in the TEC information corresponding to the index set.

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

TABLE 5

In actual application, each index identifies the corresponding TEC information, and may represent one outgoing forwarding path of a packet at the first node, or represent multiple outgoing forwarding paths of a packet at the first node.

For example, when the method is applied to a fast reroute scenario, the TEC information corresponding to each index identifier may represent two outgoing forwarding paths of the packet at the first node, where one outgoing forwarding path is used as a main forwarding path, and the other outgoing forwarding path is used as a standby forwarding path.

When the method is applied to an equivalent multi-routing scene, the TEC information corresponding to each index identifier can represent two outgoing forwarding paths of the message at the first node, wherein the two outgoing forwarding paths are both used as main forwarding paths, so that when one of the main forwarding paths is used for message transmission, the message can be transmitted through the other main forwarding path to ensure normal transmission of the message, and thus the message transmission is not affected by link faults.

Step 104: and updating the first TEC information.

In actual application, if the destination node reached by the first node fails and the first node may reach the destination node via another node, the process of updating the first TEC information may be: determining the path length between the first node and the second node aiming at each routing group to obtain at least one path length; the second node is a node which can enable the message in the network to reach a scheduling destination node; determining corresponding TEC information by using the at least one path length; and updating the first TEC information by using the determined TEC information.

Based on this, in an embodiment, the updating the first TEC information includes: determining 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 which can enable the message in the network to reach the destination node; and updating the first TEC information by using the determined TEC information.

It should be noted that, when a link between the first node and the destination node fails, only the first TEC information in the TEC table is updated, and it is not necessary to update the routing network segment of each route corresponding to the destination node. Therefore, the rapid convergence of the route can be realized, and the timely transmission of the message is ensured.

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

Based on this, in an embodiment, the method further comprises: determining a second link after determining that the destination node fails; determining TEC information using at least one path length; the path length is the path length of the first node and the destination node of the second link; and updating the TEC table by utilizing the determined TEC information.

Here, the updating of 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.

By adopting the technical scheme of the embodiment of the 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 identified by the first index identifier, and the routing network segments of the multiple routes are different, when a link between the first node and the destination node fails, compared with a scheme that one route set in a routing table corresponds to one routing network segment in the related art, the scheme of the embodiment of the application does not need to update the routing network segment of each route in the multiple routes, and only needs to update the first TEC information in the TEC table, and because the routing network segment of each route corresponding to the destination node does not need to be updated, the rapid recovery of the route can be ensured, and the normal transmission of the message can be further ensured.

The present application will be described in further detail with reference to the following application examples.

In the following embodiments, node a corresponds to the first node, and node D corresponds to the destination node.

The specific process of the node A for collecting topology and routing information comprises the following steps: as shown in fig. 2a and fig. 2b, taking the example that node a reaches node D, node a may reach node D via node C, and assuming that the routing information that node a reaches node D via node C is represented by route 1, the routing segment of route 1 may be preset by the user, which is assumed to be 192.1.1.1/16; node C may initiate IGP flooding to pass the route information for route 1 to node a. The node A can also directly reach the node D, and the route information of the node A directly reaching the node D is represented by a route 2, and the route segment of the route 2 can be preset by a user, and is assumed to be 192.1.0.1/16; node D may initiate IGP flooding to pass the route information for route 2 to node a. Taking the example that the node a reaches the node C, the node a may reach the node C via the node D, and it is assumed that the routing information that the node a reaches the node C via the node D is represented by the route 3, and a routing network segment of the route 3 may be preset by the user, and is assumed to be 192.0.0.0/16; node D may initiate IGP flooding to pass the route information for route 3 to node a. Node a may also reach node C via node B, assuming that the routing information that node a reaches node D via node C is represented by route 4, and the routing segment of route 4 may be preset by the user, assumed to be 192.0.0.1/16; node B may initiate IGP flooding to pass the route information for route 4 to node a.

Application embodiment 1

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

In addition, in the embodiment of the present application, the node table is established as shown in table 6. The established TEC table is shown in Table 7.

TABLE 6

TABLE 7

The first step is as follows: and the node A determines that the link between the node A and the node D has a fault, and then searches a first index identifier corresponding to the IP address of the node D from the node table.

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

The second step is that: and the node A searches the first TEC information corresponding to the first index identification from the TEC table.

From table 7, for the index identifier X corresponding to the node D, the searched TEC information includes: the IP address of the next hop node is 10.1.1.4/32, the next hop IP is 4.4.4.1/24, and the output interface is 4.4.4.2/24.

The third step: and updating the first TEC information.

The processing procedure for the target node D without failure is specifically as follows:

as shown in fig. 3, when a single link between node a and node D fails, destination node D does not fail, node C may also reach destination node D, and the path from node a to destination node D is a-B-C-D. Thus, the node a may determine the TEC information by using the determined path of a-B-C-D, specifically, take the IP address of the node B, i.e., 10.1.1.2/32, as the IP address of the next hop node in the TEC information, take the ingress port of the node B, i.e., 1.1.1.2/24, as the next hop IP in the TEC information, and take the egress port of the node a, i.e., 1.1.1.1/24, as the egress port in the TEC information, to obtain the determined TEC information. And updating the first TEC information searched from the TEC table by using the determined TEC information.

It should be noted that before a single link failure does not occur between the node a and the node D, the index identifier X may be determined by the IP addresses of the node C and the node D; when a single link between node a and node D fails, the index identifier X may still be determined by the IP addresses of node C and node D, i.e., the index identifier X does not need to be updated, since the destination node D does not fail.

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

as shown in fig. 4, when a single link between node a and node D fails, if destination node D fails, node a may determine two times of TEC information, specifically, node a first senses a link failure, and thus, node a may determine that a path to node D is: a, determining primary TEC information by utilizing the determined path of A-B-C-D; after the destination node D fails, the node a may use the destination node C as a new destination node, and update the TEC table based on the TEC information corresponding to the destination node C.

It should be noted that before a single link failure does not occur between the node a and the node D, the index identifier X may be determined by the IP addresses of the node C and the node D; after the destination node D fails, the index identifier X is determined by the IP address of the node C, that is, the index identifier X needs to be updated.

Here, when the destination node D fails, the route may be converged to a new path, which may ensure that the packet transmission is not affected and the convergence time is not affected. Here, a plurality of routes from node a to node D may be represented by index identifier X, and the routing segments of the plurality of routes are different, and when a single link between node a and node D fails, since the routing segment of each route corresponding to node D does not need to be updated, a fast recovery of the route may be ensured, and then a normal transmission of a packet may be ensured.

Application example two

In this application embodiment, as shown in fig. 3, an application scenario of this application embodiment is a fast reroute (FRR) scenario.

In addition, in the embodiment of the present application, the established TEC table is as shown in table 8.

TABLE 8

From table 8, for the index identifier X corresponding to the node D, the searched TEC information includes: the IP address of the main next-hop node is 10.1.1.4/32, the IP of the main next-hop is 4.4.4.1/24, and the main output interface is 4.4.4.2/24. The IP address of the standby next hop node is 10.1.1.2/32, the standby next hop IP is 1.1.1.2/24, and the standby interface is 1.1.1.1/24.

The third step: and updating the first TEC information.

As can be seen from table 8, the TEC information may represent two forwarding paths of the packet at the node a, where one forwarding path is used as a main forwarding path, and the other forwarding path is used as a standby forwarding path, so that when a single link between the node a and the node D fails, the TEC information corresponding to the standby forwarding path may be used to determine an outgoing forwarding path for transmitting the packet, so as to ensure normal transmission of the packet.

Here, a plurality of routes from node a to node D may be represented by index identifier X, and the routing segments of the plurality of routes are different, and when a single link between node a and node D fails, since the routing segment of each route corresponding to node D does not need to be updated, a fast recovery of the route may be ensured, and then a normal transmission of a packet may be ensured.

Application example three

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

In addition, in the embodiment of the present application, the established TEC table is as shown in table 9. In an equivalent multi-routing scenario, multiple paths between the node a and the node D may be set as main forwarding paths, where each main forwarding path corresponds to one TEC information, and includes an IP address of a main next-hop node, a main next-hop IP, and a main outgoing interface.

TABLE 9

From table 6, the first determined index corresponding to node D is identified as X.

From table 9, for the index identifier X corresponding to the node D, the searched TEC information includes: the IP address of the main next-hop node is 10.1.1.4/32, the IP of the main next-hop is 4.4.4.1/24, and the main output interface is 4.4.4.2/24. The IP address of the main next hop node is 10.1.1.2/32, the IP address of the main next hop is 1.1.1.2/24, and the main output interface is 1.1.1.1/24.

The third step: and updating the first TEC information.

As can be seen from table 9, the TEC information may represent two forwarding paths of the packet at the node a, both serving as main forwarding paths, so that when a link between the node a and the node D fails, that is, when one main forwarding path fails, the TEC information corresponding to the other main forwarding path may be used to determine an outbound forwarding path for transmitting the packet, so as to ensure normal transmission of the packet.

It should be noted that, in the equivalent multi-routing scenario, before a link for transmitting a packet between the node a and the node D fails, the packet may be transmitted on any of the plurality of main forwarding paths. After a link for transmitting messages between the node A and the node D fails, namely one of the main forwarding paths fails, the messages are transmitted from the rest of the main forwarding paths,

application example four

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

Watch 10

Here, the path for the node a to reach the destination node E may include: A-D-E and A-B-C-E are respectively represented by 01 and 02 to obtain a tag set {01 and 02 }; the path from node a to destination node F may include: A-D-F and A-B-C-F are respectively represented by 03 and 04, and tag sets {03,04} are obtained.

From the table 10, for the index identifier X corresponding to the node D, the searched TEC information includes: the IP address of the next hop node is 10.1.1.4/32, the next hop IP is 4.4.4.1/24, and the output interface is 4.4.4.2/24. Aiming at the index identifier Z, the searched TEC information comprises: the IP address of the next hop node is 10.1.1.4/32, the next hop IP is 4.4.4.1/24, and the output interface is 4.4.4.2/24.

The third step: and updating the first TEC information.

as shown in fig. 3, when a single link between node a and node D fails, node C may also reach destination node D, where the path for node a to reach destination node D is a-B-C-D. Thus, the node a may determine the TEC information by using the determined path of a-B-C-D, specifically, take the IP address of the node B, i.e., 10.1.1.2/32, as the IP address of the next hop node in the TEC information, take the ingress port of the node B, i.e., 1.1.1.2/24, as the next hop IP in the TEC information, and take the egress port of the node a, i.e., 1.1.1.1/24, as the egress port in the TEC information, to obtain the determined TEC information. And updating the first TEC information searched from the TEC table by using the determined TEC information.

as shown in fig. 4, when a single link between a node a and a node D fails, and the node D fails, it is necessary to determine that a destination node is a second link of the node C, and update the TEC table based on the TEC information corresponding to the node C.

Here, after the first node determines the path of the a-B-C-E, the first node may determine the corresponding label from the label set, so that the path may be quickly found from multiple outgoing to forwarding paths when the packet is transmitted, thereby realizing the timely transmission of the packet.

In order to implement the method according to the embodiment of the present application, an embodiment of the present application further provides an information processing apparatus, which is disposed on a first node, and as shown in fig. 5, includes:

a determining unit 51, configured to determine that a link transmitting a packet between itself and a destination node has a failure; the second node is a next hop node of the first node; the network node is also used for determining a corresponding first routing network segment based on the IP address of the destination node corresponding to the link;

a searching unit 52, configured to search, from a node table, a first index identifier corresponding to the IP address of the destination address; the node table is provided with a corresponding relation between the IP address of the node and the index identifier; the first index identification is used for identifying the first index in the TEC table; the TEC table is provided with a relation between index identification and TEC information; the TEC information at least represents the outgoing direction of the message at the first node;

and an updating unit 53, configured to update the first TEC information.

In practical application, the first node may detect a destination address of the destination node, and when the destination address of the destination node is detected to be abnormal, the first node may determine that a link between itself and the destination node fails.

Therefore, when a single link between the first node and the destination node fails, in order to implement route reconvergence, a path that does not fail needs to be selected from multiple paths reaching the destination node, so that the first node can perform normal transmission of a packet.

Based on this, in an embodiment, the apparatus further comprises: a table establishing unit for acquiring at least one piece of routing information; dividing a plurality of routes with the same destination address into a group by using the acquired route information to obtain a plurality of route groups; and determining an index identifier for each routing group, and establishing a corresponding relation between the IP address of the node and the index identifier to obtain the node table.

In practical application, the first node may have multiple links to the destination node via the next-hop node, that is, the second node, and after multiple routes having the same destination address are divided into one group, in order to distinguish each route group, an index identifier may be generated by using an IP address of at least one node where a packet can reach the destination node of the route group, so as to mark each route group.

Based on this, in an embodiment, the table establishing unit is specifically configured to: aiming at each routing group, determining at least one node of a message in the network, wherein the message can reach a destination node of the routing group; and determining the index identification of the corresponding routing group by using the determined IP address of the at least one node.

Based on this, in an embodiment, the table establishing unit is further configured to determine, for each routing group, a path length between the first node and the destination node, so as to obtain at least one path length; the other nodes are nodes of which the message can reach the destination node of the routing group in the network; determining corresponding TEC information by using the at least one path length; and establishing a corresponding relation between the index identification and the TEC information to obtain the TEC table.

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

Based on this, in an embodiment, the table establishing unit is further configured to determine, for each routing group, a corresponding label set; the set of tags includes at least one tag; a label corresponding to a path from the first node to a destination node of the routing group; the label is used for marking a path for transmitting the message; and setting the determined index set in the TEC information corresponding to the index set.

Based on this, in an embodiment, the updating unit 53 is specifically configured to: determining 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 other nodes except the second node in the nodes of which the message can reach the destination node corresponding to the link in the network; and updating the first TEC information by using the determined TEC information.

It should be noted that, when a link between the first node and the destination node fails, only the first TEC information in the TEC table is updated, and information represented by the routing network segment of each route corresponding to the destination node does not need to be updated. Therefore, the rapid convergence of the route can be realized, and the timely transmission of the message is ensured.

In actual application, if the first node reaches the destination node and fails, a new destination node needs to be reselected, and the TEC information associated with the new destination node is different from the first TEC information, so that the first TEC information in the first TEC table can be updated.

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

In actual application, the determining unit 51, the searching unit 52, the updating unit 53, and the table establishing unit may be implemented by a processor in the information processing apparatus.

Based on the hardware implementation of the program module, and in order to implement the method on the node side in the embodiment of the present application, an embodiment of the present application further provides an information processing apparatus, as shown in fig. 6, where the information processing apparatus 60 includes: a communication interface 61, a processor 62, a memory 63; wherein the content of the first and second substances,

a communication interface 61 capable of information interaction with other devices;

and the processor 62 is connected with the communication interface 61 and is used for executing the method provided by one or more technical schemes of the node side when running the computer program. And the computer program is stored on the memory 63.

Of course, in practice, the various components of information handling device 60 are coupled together by bus system 84. It will be appreciated that the bus system 64 is used to enable communications among the components. The bus system 84 includes a power bus, a control bus, and a status signal bus in addition to a data bus. For clarity of illustration, however, the various buses are labeled as 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 apparatus 60. Examples of such data include: any computer program for operating on the information processing apparatus 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 having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware or instructions in the form of software in the processor 62. The processor 62 may be a general purpose processor, a Digital Signal Processor (DSP), or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, or the like. The processor 62 may implement or perform the methods, steps, and logic blocks disclosed in the embodiments of the present application. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed in the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software modules may be located in a storage medium located in the memory 63, and the processor 62 reads the information in the memory 63 and performs the steps of the aforementioned method in conjunction with its hardware.

In an exemplary embodiment, the information processing apparatus 60 may be implemented by one or more Application Specific Integrated Circuits (ASICs), DSPs, Programmable Logic Devices (PLDs), Complex Programmable Logic Devices (CPLDs), Field Programmable Gate Arrays (FPGAs), general purpose processors, controllers, Micro Controllers (MCUs), microprocessors (microprocessors), or other electronic components for performing the foregoing methods.

It will be appreciated that the memory 63 of embodiments of the present application may be either volatile memory or nonvolatile memory, and may include both volatile and nonvolatile memory. Among them, the nonvolatile Memory may be a Read Only Memory (ROM), a Programmable Read Only Memory (PROM), an Erasable Programmable Read-Only Memory (EPROM), an Electrically Erasable Programmable Read-Only Memory (EEPROM), a magnetic random access Memory (FRAM), a flash Memory (flash Memory), a magnetic surface Memory, an optical disk, or a Compact Disc Read-Only Memory (CD-ROM); the magnetic surface storage may be disk storage or tape storage. Volatile Memory can be Random Access Memory (RAM), which acts as external cache Memory. By way of illustration and not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Synchronous Static Random Access Memory (SSRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic Random Access Memory (SDRAM), Double Data Rate Synchronous Dynamic Random Access Memory (DDRSDRAM, Double Data Synchronous Random Access Memory), Enhanced Synchronous Dynamic Random Access Memory (ESDRAM, Enhanced Synchronous Dynamic Random Access Memory), Synchronous link Dynamic Random Access Memory (SLDRAM, Synchronous Dynamic Random Access Memory), Direct Memory bus (DRmb Access Memory, Random Access Memory). The memories described in the embodiments of the present application are intended to comprise, without being limited to, these and any other suitable types of memory.

It should be noted that: "first," "second," and the like are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.

The technical means described in the embodiments of the present application may be arbitrarily combined without conflict.

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

Claims

1. An information processing method applied to a first node, the method comprising:

searching a first index identification corresponding to the internet protocol IP address of the destination node from a node table; the node table is provided with a corresponding relation between the IP address of the node and the index identifier;

searching first TEC information corresponding to the first index identification from a topological equivalence class TEC table; the TEC table is provided with a relation between index identification and TEC information; the TEC information at least represents the outgoing direction of the message at the first node;

and updating the first TEC information.

2. The method of claim 1, further comprising:

acquiring at least one piece of routing information;

dividing a plurality of routes with the same destination address into a group by using the acquired route information to obtain a plurality of route groups;

and determining an index identifier for each routing group, and establishing a corresponding relation between the IP address of the node and the index identifier to obtain the node table.

3. The method of claim 2, wherein the determining the index identifier comprises:

aiming at each routing group, determining at least one node of a message in the network, wherein the message can reach a destination node of the routing group;

and determining the index identification of the corresponding routing group by using the determined IP address of the at least one node.

4. The method of claim 2, further comprising:

determining, for each routing group, at least one path length between the first node and a destination node;

determining corresponding TEC information by using the at least one path length; and establishing a corresponding relation between the index identification and the TEC information to obtain the TEC table.

5. The method of claim 4, further comprising:

for each routing group, determining a corresponding label set; the set of tags includes at least one tag; a label corresponding to a path from the first node to a destination node of the routing group; the label is used for marking a path for transmitting the message;

and setting the determined index set in the TEC information corresponding to the index set.

6. The method of claim 1, wherein the updating the first TEC information comprises:

determining 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 which can enable the message to reach the destination node in the network;

and updating the first TEC information by using the determined TEC information.

7. The method of claim 1, further comprising:

determining a second link after determining that the destination node fails;

determining TEC information using at least one path length; the path length is the path length of the first node and the destination node of the second link;

and updating the TEC table by utilizing the determined TEC information.

8. An information processing apparatus, applied to a first node, the apparatus comprising:

and the updating unit is used for updating the first TEC information.

9. The apparatus of claim 8, further comprising:

a table establishing unit for acquiring at least one piece of routing information; dividing a plurality of routes with the same destination address into a group by using the acquired route information to obtain a plurality of route groups; and determining an index identifier for each routing group, and establishing a corresponding relation between the IP address of the node and the index identifier to obtain the node table.

10. The apparatus according to claim 9, wherein the table establishing unit is specifically configured to: aiming at each routing group, determining at least one node of a message in the network, wherein the message can reach a destination node of the routing group; and determining the index identification of the corresponding routing group by using the determined IP address of the at least one node.

11. The apparatus of claim 9,

the table establishing unit is further configured to determine, for each route group, a path length between the first node and a destination node to obtain at least one path length; determining corresponding TEC information by using the at least one path length; and establishing a corresponding relation between the index identification and the TEC information to obtain the TEC table.

12. The apparatus according to claim 8, wherein the update is specifically configured to:

determining 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 which can enable the message to reach the destination node in the network; and updating the first TEC information by using the determined TEC information.

13. An information processing apparatus characterized by comprising: a processor and a memory for storing a computer program capable of running on the processor,

wherein the processor is adapted to perform the steps of the method of any one of claims 1 to 7 when running the computer program.

14. A storage medium having a computer program stored thereon, the computer program, when being executed by a processor, performing the steps of the method of any one of claims 1 to 7.