CN107864091B

CN107864091B - Link failure processing method and device

Info

Publication number: CN107864091B
Application number: CN201711045359.0A
Authority: CN
Inventors: 郭威; 王伟
Original assignee: Hangzhou H3C Technologies Co Ltd
Current assignee: Hangzhou H3C Technologies Co Ltd
Priority date: 2017-10-31
Filing date: 2017-10-31
Publication date: 2020-04-03
Anticipated expiration: 2037-10-31
Also published as: CN107864091A

Abstract

The disclosure relates to a method and a device for processing link failure, wherein the method comprises the following steps: forming a routing awareness table of a next hop device for the static SR head node, wherein the routing awareness table comprises an identifier of the next hop device and an identifier of a destination node corresponding to the next hop device; and when the identification of the next hop equipment in the routing sensing table is sensed to be changed, determining that the path from the next hop equipment to the destination node has a fault. Therefore, the failure of the path from the next-hop device to the destination node can be timely determined according to the change of the identifier of the next-hop device.

Description

Link failure processing method and device

Technical Field

The present disclosure relates to the field of communications technologies, and in particular, to a method and an apparatus for processing a link failure.

Background

MPLS (Multiprotocol Label Switching) is a backbone network technology which is widely applied at present. MPLS introduces a connection-oriented label switching concept on a connectionless IP network, combines a third layer routing technology with a second layer switching technology, and fully exerts the flexibility of IP routing and the simplicity of second layer switching.

Fig. 1 is a schematic diagram of an MPLS network architecture. As shown in fig. 1, the MPLS network includes routing devices a to I, each of which is a Label Switching Router (LSR) that is a basic constituent element of the MPLS network, and each of which is a device having a label distribution capability and a label switching capability.

The routing device a is an Ingress node, the routing devices B, C, E and F are Transit nodes, and the routing device D is an Egress node. Routing device a is the ingress LSR of the packet and is responsible for tagging the packet entering the MPLS network. Routing devices B-C and E-F are LSRs within the MPLS network and transmit packets to routing device D according to labels along an LSP (Label Switched path) formed by a series of LSRs. The routing device D is the egress LSR of the packet and is responsible for stripping the label in the packet and forwarding the stripped packet to the destination network.

Disclosure of Invention

In view of this, the present disclosure provides a method and an apparatus for processing a link failure.

According to an aspect of the present disclosure, a method for processing a link failure is provided, where the method is applied to a static segment routing SR header node in a multi-protocol label switching MPLS network, and the method includes:

forming a routing awareness table of a next hop device for the static SR head node, wherein the routing awareness table comprises an identifier of the next hop device and an identifier of a destination node corresponding to the next hop device;

and when the identification of the next hop equipment in the routing sensing table is sensed to be changed, determining that the path from the next hop equipment to the destination node has a fault.

According to another aspect of the present disclosure, there is provided a link failure processing apparatus applied to a static segment routing, SR, head node in a multi-protocol label switching, MPLS, network, the apparatus including:

a forming module, configured to form a routing awareness table for a next hop device of the static SR header node, where the routing awareness table includes an identifier of the next hop device and an identifier of a destination node corresponding to the next hop device;

a determining module, configured to determine that a path from the next hop device to the destination node fails when it is sensed that the identifier of the next hop device in the route sensing table changes.

The technical scheme provided by the disclosure can comprise the following beneficial effects: and determining whether the path from the next hop device to the destination node fails according to whether the identification of the next hop device in the routing sensing table is changed, thereby timely determining that the path from the next hop device to the destination node fails according to the change of the identification of the next hop device.

Under the condition that a path from the next-hop device to the destination node passes through the switch device, even if the static SR head node cannot sense that the output interface of the next-hop device is closed, the failure of the path from the next-hop device to the destination node can be timely determined according to the change of the identifier of the next-hop device.

If the identifier of a next hop device in the route sensing table corresponds to the identifiers of a plurality of destination nodes, it is determined that a path from the next hop device to the destination node from which the next hop device is changed first fails as long as the identifier of the next hop device is changed for the first time among the identifiers of the plurality of destination nodes.

If the backup paths to the multiple destination nodes exist, the paths to the multiple destination nodes are switched to the backup paths, and if the backup paths to the multiple destination nodes do not exist, the traffic to the multiple destination nodes is stopped from being forwarded to the next-hop equipment, so that the traffic loss is avoided.

Other features and aspects of the present disclosure will become apparent from the following detailed description of exemplary embodiments, which proceeds with reference to the accompanying drawings.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate exemplary embodiments, features, and aspects of the disclosure and, together with the description, serve to explain the principles of the disclosure.

Fig. 1 is a schematic diagram of an MPLS network architecture.

Fig. 2 is a schematic diagram of an MPLS network structure in an embodiment of the present disclosure.

Fig. 3 is a schematic diagram of an MPLS network structure in an embodiment of the present disclosure.

Fig. 4 shows a flow chart of a method of handling a link failure according to an embodiment of the present disclosure.

Fig. 5 is a schematic diagram of an MPLS network structure in an embodiment of the present disclosure

Fig. 6 shows a block diagram of a processing apparatus for a link failure according to an embodiment of the present disclosure.

Fig. 7 is a block diagram illustrating a hardware structure of a link failure processing apparatus according to an exemplary embodiment.

Detailed Description

Various exemplary embodiments, features and aspects of the present disclosure will be described in detail below with reference to the accompanying drawings. In the drawings, like reference numbers can indicate functionally identical or similar elements. While the various aspects of the embodiments are presented in drawings, the drawings are not necessarily drawn to scale unless specifically indicated.

The word "exemplary" is used exclusively herein to mean "serving as an example, embodiment, or illustration. Any embodiment described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments.

Furthermore, in the following detailed description, numerous specific details are set forth in order to provide a better understanding of the present disclosure. It will be understood by those skilled in the art that the present disclosure may be practiced without some of these specific details. In some instances, methods, means, elements and circuits that are well known to those skilled in the art have not been described in detail so as not to obscure the present disclosure.

For convenience of explanation, a part of the concept related to the present disclosure will be explained first.

SR (Segment Routing) adopts a source path selection mechanism, encapsulates in advance the SID (Segment Identifier) of the Segment that the path needs to pass through at the source node, and when the packet passes through the SR node, the node forwards the packet according to the SID of the packet. Other nodes than the SR head node need not maintain path state. The MPLS-based SR is an LSP that forwards a packet by using a Label as an SID when using the SR in an MPLS network, and a path through which the packet passes is referred to as an SRLSP (Segment Routing Label Switched path). Usually, an MPLS TE (MPLS Traffic Engineering) Tunnel (Tunnel) is composed of one or a group of CRLSPs (constrained-Routed Label Switched Paths), and an SRLSP is a special CRLSP and is established based on SR.

The MPLS TE Tunnel created on the SR head node is identified by the Tunnel interface of MPLS TE mode. When the outgoing interface of the traffic is a Tunnel interface, the traffic will be forwarded through the SRLSPs that constitute the MPLS TE Tunnel.

In the MPLS forwarding architecture, switching is performed using incoming label matching and pushing new labels, however, for broadcast ethernet links, deleting labels in the outgoing direction requires specifying the next hop information.

For example, the idea of static SR is that one device binds one label, so that binding the adjacent intermediate node by the static SR head node means that the static SR head node needs to match one entry label to identify the adjacent intermediate node, and the entry of the entry label is associated with the adjacent intermediate node. In some embodiments, the static SR header node associates a primary neighbor intermediate node and a backup neighbor intermediate node. Fig. 2 is a schematic diagram of an MPLS network structure in an embodiment of the present disclosure. As shown in fig. 2, the MPLS network includes routing devices R1 to R4, where R1 is a static SR head node and R4 is a destination node, and assuming that R2 is a main (main) neighbor intermediate node of R1 and R3 is a backup (backup) neighbor intermediate node of R1, a path to the destination node R4 via the next-hop device R2 is a main LSP and a path to the destination node R4 via the next-hop device R3 is a backup LSP. R1 is assigned a tag of 100, R2 is assigned a tag of 300, and R3 is assigned a tag of 200.

An interface with an interface Address of 10.1.1.2 of R2 is connected with an interface Address of 10.1.1.1 of R1, an interface with an interface Address of 20.1.1.2 of R3 is connected with an interface Address of 20.1.1.1 of R1, 3.3.3.3 is a destination Address of R4, and G0/1 is an ARP (Address Resolution Protocol) table or a routing table corresponding to an outgoing interface of R2.

For the primary LSP, R1 needs to bind the interface addresses 10.1.1.2 of the in-label 100, out-label 300, and next-hop device R2, while for the backup LSP, R1 needs to bind the interface addresses 20.1.1.2 of the in-label 100, out-label 200, and next-hop device R3. Therefore, key elements of the label forwarding entry of R2, i.e., the in-label 100 to be matched, the out-label 300 to be rolled out, and the out-interface G0/1, have been formed.

Since R2 is mainly responsible for matching incoming labels of packets and deleting labels, regardless of IP routing prefixes, R1 only needs to determine the reachability of the interface address 10.1.1.2 of the next-hop device R2, and the determination method is to search for a 32-bit masked route of the interface address 10.1.1.2 of the next-hop device R2 or search for an ARP entry corresponding to the interface address 10.1.1.2 of the next-hop device R2. If the route of the 32-bit mask of the interface address 10.1.1.2 of the next hop device R2 is found or the ARP entry corresponding to the interface address 10.1.1.2 of the next hop device R2 is found, R1 may determine that the interface address 10.1.1.2 of the next hop device R2 is reachable, that is, R1 may determine that R2 is available (does not fail).

If the outgoing interface G0/1 link fails or R2 fails and restarts to cause the outgoing interface G0/1 to be closed, R1 deletes the ARP entry corresponding to the interface address 10.1.1.2 of the next-hop device R2 from the local ARP table, and R1 determines that the interface address 10.1.1.2 of the next-hop device R2 is unreachable, that is, R1 may determine that R2 is unavailable, so the label forwarding entry of R2 is invalid, and R1 switches the main LSP to the backup LSP.

However, in some cases, for example, when a path from the next-hop device to the destination node passes through the switch device, the above-mentioned determination method cannot timely determine that the path has a failure.

Illustratively, fig. 3 is a schematic diagram of an MPLS network structure in an embodiment of the present disclosure. As shown in fig. 3, the MPLS network includes a controller, routing devices R1 to R4, and a switch device, where R1 is a static SR header node (also an Ingress node), R2 and R3 are both intermediate nodes of R1, R4 is an egress node, and the controller specifies a label stack on R1. R1 is assigned a tag of 100, R2 is assigned a tag of 300, and R3 is assigned a tag of 200.

The interface with the interface address of 10.1.1.2 of R2 and the interface with the interface address of 10.1.1.1 of R1 are both connected to switch through network cables, the interface with the interface address of 20.1.1.2 of R3 is connected with the interface address of 20.1.1.1 of R1, 3.3.3.3 is the destination address of R4, R1 carries out service forwarding according to the destination address, and G0/1 is an ARP table or a routing table corresponding to the outgoing interface of R2.

On R1, there are two paths for the route to reach the destination node R4: one is a path R1-switch-R2-R4, and the next hop device of R1 is R2; the other is a path R1-R3-R4, and the next hop device of R1 is R3.

Assuming that R2 is the main neighbor intermediate node of R1 and R3 is the backup neighbor intermediate node of R1, the path corresponding to R1-switch-R2-R4 is the main LSP and the path corresponding to R1-R3-R4 is the backup LSP. Assuming that R2 fails and restarts to close the output interface G0/1, the primary LSP fails and the primary LSP is unavailable, R1 quickly enables the backup LSP, i.e., switches the path from R1-switch-R2-R4 to R1-R3-R4.

For the primary LSP, R1 needs to bind the interface addresses 10.1.1.2 of the in-label 100, out-label 300, and next-hop device R2, while for the backup LSP, R1 needs to bind the interface addresses 20.1.1.2 of the in-label 100, out-label 200, and next-hop device R3.

However, when R2 fails and restarts, that is, the main LSP fails, the outgoing interface G0/1 of R2 is turned off, but R1 cannot perceive that the outgoing interface G0/1 of R2 is turned off. And the local ARP table of R1 needs to be aged after a long time (for convenience of explanation, this time will be referred to as "elapsed time") has elapsed since the path failure, for example, several minutes or ten and several minutes, so in this local ARP table, the interface address 10.1.1.2 of R2 is not deleted within this elapsed time, which enables R1 to always find the ARP entry corresponding to the interface address 10.1.1.2 of R2 in the local ARP table within this elapsed time, so that R1 always judges erroneously that R2 is available within this elapsed time, and thus erroneously judges that the main LSP is not failed.

Based on this, the embodiment of the present disclosure provides a method and an apparatus for processing a link failure.

In order to more clearly describe the present disclosure, the following detailed description will be made of embodiments of the present disclosure by taking fig. 3 to 5 as examples.

Fig. 4 shows a flow chart of a method of handling a link failure according to an embodiment of the present disclosure. The processing method is applied to a static SR header node in the MPLS network, for example, the processing method may be applied to R1 in fig. 3. As shown in fig. 4, the processing method includes the following steps.

In step S910, a route awareness table for a next hop device of the static SR header node is formed, where the route awareness table includes an identifier of the next hop device and an identifier of a destination node corresponding to the next hop device.

In this embodiment, the static SR head node, the next hop device, and the destination node may all be routing devices, and the routing devices may be routers or routing switches, which is not limited in the present invention. And the static SR head node, the next hop device, and the destination node all have identifiers capable of uniquely identifying themselves, including but not limited to addresses, and the representation form of the identifiers is not particularly limited by the present disclosure.

The destination node is a node via a next hop device. Since one or more nodes can be reached via one next hop device, the number of destination nodes may be one or more. Thus, in the route awareness table, one next hop device may correspond to one destination node or a plurality of destination nodes.

For example, for the MPLS network shown in fig. 3, since the next-hop device of R1 is R2, while as shown in fig. 3, the node passing through R2 has only R4, the destination node is R4.

Illustratively, fig. 5 is a schematic diagram of an MPLS network structure in an embodiment of the present disclosure. As shown in fig. 5, the MPLS network includes a controller, routing devices R1 to R7, and a switch device, where R1 is a static SR header node (also an Ingress node), R2, R3, and R6 are all intermediate nodes of R1, and R4, R5, and R7 are egress nodes.

An interface with an interface address of 10.1.1.2 of R2 and an interface with an interface address of 10.1.1.1 of R1 are connected to a switch through network cables, an interface with an interface address of 20.1.1.2 of R3 is connected with an interface address of 20.1.1.1 of R1, an interface with an interface address of 30.1.1.2 of R6 is connected with an interface address of 30.1.1.1 of R1, a destination address of R4 is 3.3.3.3, a destination address of R7 is 4.4.4.4, a destination address of R5 is 5.5.5.5, and an output interface of R2 corresponds to an ARP table or a routing table is G0/1.

For the MPLS network shown in fig. 5, since the next-hop device of R1 is R2, while the nodes passing through R2 have R4, R5 and R7 as shown in fig. 5, the destination nodes are R4, R5 and R7.

The static SR head node may look up an FIB table according to the destination IP address of the received message, and obtain an identifier of a next hop device of the message according to the FIB table.

It should be noted that the next-hop device may be a main neighbor intermediate node, a backup neighbor intermediate node, or a destination node. Wherein in case the next hop device is the destination node, the static SR header node directly forwards the packet to the destination node without passing through any intermediate node.

For convenience of description, the processing method of this embodiment is described by taking the following one-hop device as the main neighbor intermediate node as an example, and the processing method of the following one-hop device as the backup neighbor intermediate node or the destination node may refer to the following processing method of the following one-hop device as the main neighbor intermediate node, which is not described herein again.

In the MPLS network shown in fig. 3, the route-aware table formed by the static SR header nodes may be as shown in table 1.

TABLE 1

Identification of next hop device	Identification of destination node
		10.1.1.2	3.3.3.3

In the MPLS network shown in fig. 5, the route aware table formed by the static SR header nodes may be as shown in table 2.

TABLE 2

Identification of next hop device	Identification of destination node
		10.1.1.2	3.3.3.3
10.1.1.2	4.4.4.4
		10.1.1.2	5.5.5.5

In this embodiment, the information included in the route awareness table includes, but is not limited to, an identifier of a next hop device and an identifier of a destination node, and may further include other information such as an identifier of a static SR header node, routing information, a path to the destination node via the next hop device, and the like, for example. The routing information may include information such as an IP address and an egress interface of the destination node. For example, in the MPLS network shown in fig. 3, the route sensing table formed by the static SR header node may also be as shown in table 3.

TABLE 3

In this embodiment, the route sensing table of the next-hop device for the static SR head node may be formed in any one or more of the following manners.

The first method is as follows: traversing the current routing forwarding table of the static SR head node according to the identifier of the next hop equipment to acquire the identifier of the destination node passing through the next hop equipment; and forming the identifier of the next hop equipment and the acquired identifier of the destination node into a routing perception table.

In this embodiment, the static SR header node searches a stored local routing table (i.e., a current routing forwarding table), where the local routing table is composed of routing table entries, and the routing table entries may include a destination IP address and an address of a next hop device.

And the static SR head node searches a routing table item of which the address of the next hop equipment is the identifier of the next hop equipment of the static SR head node in a local routing table, and determines the destination IP address in the searched routing table item as the identifier of the destination node.

And the static SR head node forms the identification of the next hop equipment and the determined identification of the destination node into a route perception table.

The first embodiment will be described in detail below with reference to a specific application scenario. In the MPLS network shown in fig. 3, first, R1 finds the stored local routing table as shown in table 4.

TABLE 4

Destination IP address	Address of next hop device
		3.3.3.3	10.1.1.2

Then, R1 looks up the routing table entry containing the address of the next hop device of 10.1.1.2 in table 4 as row 2 in table 4, and determines the destination IP address 3.3.3.3 in this row as the identification of the destination node.

Finally, R1 forms the identification of the next hop device 10.1.1.2 and the determined identification of the destination node 3.3.3.3 into a route awareness table as shown in table 5.

TABLE 5

The first mode is described in detail below with reference to another specific application scenario. In the MPLS network shown in fig. 5, first, R1 finds the stored local routing table as shown in table 6.

TABLE 6

Destination IP address	Address of next hop device
		3.3.3.3	10.1.1.2
4.4.4.4	10.1.1.2
		5.5.5.5	10.1.1.2

Then, R1 looks up the routing table entry containing the address of the next hop device of 10.1.1.2 in table 6 as rows 2 to 4 in table 6, and determines the destination IP addresses 3.3.3.3, 4.4.4.4 and 5.5.5.5 in these rows as the identification of the destination node.

Finally, R1 forms the identification of the next hop device 10.1.1.2 and the identifications of the determined destination nodes 3.3.3.3, 4.4.4.4 and 5.5.5.5 into a route awareness table as shown in table 7.

TABLE 7

The second method comprises the following steps: determining the identifier of a destination node according to the MPLS TE tunnel established on the static SR head node, wherein the destination address of the MPLS TE tunnel is used as the identifier of the destination node; and forming the identifier of the next hop equipment, the path from the static SR head node to the next hop equipment and the identifier of the destination node into a routing perception table.

In this embodiment, the static SR head node determines the MPLS TE tunnel established on the static SR head node. The static SR head node determines a tunnel destination address of the established tunnel (i.e., a destination address of a tail node of the tunnel) as an identification of the destination node. And the static SR head node forms the identification of the next hop equipment, the path from the static SR head node to the next hop equipment and the identification of the destination node into a routing perception table.

The second embodiment will be described in detail below with reference to a specific application scenario. As in the MPLS network shown in fig. 3, first, R1 may determine that Tunnel 1 is established: the destination address is 3.3.3.3. R1 then determines the destination address 3.3.3.3 as the identity of the destination node. Finally, R1 forms the identity of the next hop device 10.1.1.2, the path R1-R2, and the identity of the destination node 3.3.3.3 into a route awareness table as shown in table 8.

TABLE 8

The second mode will be described in detail below with reference to another specific application scenario. As in the MPLS network shown in fig. 5, R1 may determine that the established Tunnel 1: the destination address is 3.3.3.3; tunnel 2: the destination address is 4.4.4.4; tunnel 3: the destination address is 5.5.5.5. R1 determines destination addresses 3.3.3.3, 4.4.4.4 and 5.5.5.5 as the identity of the destination node. R1 forms the route awareness table shown in table 9.

TABLE 9

In step S930, when the identity of the next hop device in the route awareness table is changed, it is determined that a path to the destination node via the next hop device fails.

In this embodiment, the static SR head node may detect whether the next hop device fails, and change the next hop device when the next hop device fails, and when the next hop device fails, the path to the destination node via the next hop device also fails, so that whether the path to the destination node via the next hop device fails may be quickly sensed according to whether the identifier of the next hop device in the route sensing table changes.

In this embodiment, when the static SR head node detects that the next hop device fails, the static SR head node changes the identifier of the next hop device in the route sensing table to the identifiers of other available next hop devices. Therefore, when the static SR head node detects that the next-hop device fails, the static SR head node can quickly perceive that the identity of the next-hop device in the route awareness table has changed. Therefore, the static SR head node can sense whether the identifier of the next hop device in the route sensing table changes by whether it senses that the next hop device fails.

In some embodiments, the static SR header node may periodically sense whether the next hop device has failed. When detecting that the next hop device fails, the static SR head node does not change the identifier of the next hop device in the route sensing table, that is, when detecting that a path to the destination node via the next hop device is normal, the static SR head node performs service forwarding through the path, which is not described in detail in this disclosure.

Correspondingly, when detecting that the next-hop device fails, the static SR head node changes the identifier of the next-hop device in the route sensing table to the identifiers of other available next-hop devices, that is, when detecting that the path reaching the destination node via the next-hop device fails, the static SR head node performs service forwarding via the path reaching the destination node via the other available next-hop devices.

In some embodiments, the static SR head node may detect whether the next-hop device fails according to a preset period, where the preset period may be a period arbitrarily selected according to actual needs. And, the way for the static SR head node to detect whether the next-hop device fails includes, but is not limited to: whether the next-hop device fails is detected through a BFD technique or a similar technique, which is not described in detail in this disclosure.

In one possible implementation manner, when the identity of the next-hop device in the route awareness table is not aware of a change, it is determined that a path to the destination node via the next-hop device has not failed.

For example, for the route awareness list shown in table 6 or table 8 above, if R1 perceives that the identity of the next-hop device in table 6 or table 8 changes, for example to 20.1.1.2, then R1 determines that the path via R2 to R4 fails.

Accordingly, if R1 perceives that the identity of the next hop device in table 6 or table 8 is still 10.1.1.2, then R1 determines that the path through R2 to R4 has not failed.

In this embodiment, a path from the next-hop device to the destination node may be a primary LSP or a backup LSP, and the path is not specifically limited in the present invention.

Therefore, in this embodiment, a route sensing table is formed, which includes an identifier of a next hop device of the static SR header node and an identifier of a destination node corresponding to the next hop device, and whether a path from the next hop device to the destination node fails is determined according to whether a change in the identifier of the next hop device in the route sensing table is sensed, so that it is possible to timely determine that a path from the next hop device to the destination node fails according to the change in the identifier of the next hop device.

In a possible implementation manner, the processing method may further include: and when determining that the path from the next-hop equipment to the destination node has a fault, switching the path to other paths, wherein the other paths are the paths from the changed next-hop equipment to the destination node.

In this embodiment, when it is determined that a path from the next-hop device to the destination node fails, in order to avoid traffic being discarded via the failed path, the static SR head node switches the path to the path from the changed next-hop device to the destination node.

For example, in the following, detailed description will be given of switching a path to another path when it is determined that a path to a destination node via a next-hop device fails, in conjunction with a specific application scenario. As in the MPLS network shown in fig. 3, if R1 senses that the identity of the next-hop device in table 6 or table 8 changes, for example to 20.1.1.2, R1 determines that the path via R2 to R4 fails, and R1 switches the path from R1-R2-R4 to R1-R3-R4.

As in the MPLS network shown in fig. 5, if R1 perceives that the identity of the next-hop device in the second row in table 7 or table 9 changes, for example to 20.1.1.2, then R1 determines that the path via R2 to R4 fails, R1 switches the path to R4 to R1-R3-R4 and the path to R5 to R1-R6-R5, and stops forwarding traffic to R7 to R2.

Therefore, in this embodiment, when it is determined that a path to the destination node via the next-hop device fails in time according to a change in the identifier of the next-hop device, the path is switched to another path to the destination node via the changed next-hop device, so that the static SR head node can switch the path to the destination node in time following the switching of the next-hop device.

Therefore, the synchronization of the MPLS link and the route forwarding can be guaranteed as much as possible, and the phenomenon that the flow from the static SR head node to the next-hop equipment is discarded due to the fact that the outlet interface cannot be found on the next-hop equipment can be avoided, so that the loss of the flow can be avoided, and the reliability of the MPLS network is improved.

Fig. 6 is a block diagram illustrating a structure of a link failure processing apparatus according to an exemplary embodiment, where the link failure processing apparatus may be applied to a static segment routing SR header node in a multi-protocol label switching MPLS network. As shown in fig. 6, the processing device 1000 may include a forming module 1010 and a determining module 1030.

The forming module 1010 is configured to form a routing awareness table for a next-hop device of the static SR header node, where the routing awareness table includes an identifier of the next-hop device and an identifier of a destination node corresponding to the next-hop device.

The determining module 1030 is connected to the forming module 1010, and is configured to determine that a path to a destination node via a next-hop device fails when an identifier of the next-hop device in the route awareness table is changed.

In one possible implementation, the forming module 1010 is specifically configured to: traversing the current routing forwarding table of the static SR head node according to the identifier of the next hop equipment to acquire the identifier of the destination node passing through the next hop equipment; and forming the identifier of the next hop equipment and the acquired identifier of the destination node into a routing perception table.

In one possible implementation, the forming module 1010 is specifically configured to: determining the identifier of a destination node according to the MPLS TE tunnel established on the static SR head node, wherein the destination address of the MPLS TE tunnel is used as the identifier of the destination node; and forming the identifier of the next hop equipment, the path from the static SR head node to the next hop equipment and the identifier of the destination node into a routing perception table.

In one possible implementation manner, the processing apparatus 1000 may further include: and a sensing module (not shown) configured to sense that the identifier of the next hop device in the route sensing table changes when sensing that the next hop device fails.

In one possible implementation manner, the processing apparatus 1000 may further include: and a switching module (not shown) configured to switch the path to the destination node via the next-hop device to another path when it is determined that the path to the destination node via the next-hop device fails, where the other path is a path to the destination node via the changed next-hop device.

With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.

Fig. 7 is a block diagram illustrating a hardware structure of a link failure processing apparatus according to an exemplary embodiment. Referring to fig. 7, the apparatus 1100 may include a processor 1101, a machine-readable storage medium 1102 having stored thereon machine-executable instructions. The processor 1101 and the machine-readable storage medium 1102 may communicate via a system bus 1103. Also, the processor 1101 performs the above-described link failure processing method by reading machine-executable instructions corresponding to the link failure processing logic in the machine-readable storage medium 1102.

The machine-readable storage medium 1102 referred to herein may be any electronic, magnetic, optical, or other physical storage device that can contain or store information such as executable instructions, data, and the like. For example, the machine-readable storage medium may be: a RAM (random Access Memory), a volatile Memory, a non-volatile Memory, a flash Memory, a storage drive (e.g., a hard drive), a solid state drive, any type of storage disk (e.g., an optical disk, a dvd, etc.), or similar storage medium, or a combination thereof.

Having described embodiments of the present disclosure, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the disclosed embodiments. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terms used herein were chosen in order to best explain the principles of the embodiments, the practical application, or technical improvements to the techniques in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.

Claims

1. A processing method of link failure is applied to a static Segment Routing (SR) head node in a multi-protocol label switching (MPLS) network, and is characterized by comprising the following steps:

2. The method of claim 1, wherein forming a route awareness table for a next hop device of the static SR head node comprises:

traversing the current routing forwarding table of the static SR head node according to the identifier of the next hop equipment to acquire the identifier of a destination node passing through the next hop equipment;

and forming the identifier of the next hop equipment and the acquired identifier of the destination node into the routing awareness table.

3. The method of claim 1, wherein forming a route awareness table for a next hop device of the static SR head node comprises:

determining the identifier of the destination node according to the MPLS TE tunnel established on the static SR head node, wherein the destination address of the MPLS TE tunnel is used as the identifier of the destination node;

and forming the identifier of the next hop equipment, the path from the static SR head node to the next hop equipment and the identifier of the destination node into the route sensing table.

4. The method according to any of claims 1 to 3, when sensing that the identity of the next hop device in the route sensing table changes, comprising:

and when the next hop equipment is sensed to have a fault, sensing that the identification of the next hop equipment in the routing sensing table is changed.

5. The method of any of claims 1 to 3, further comprising:

and when determining that the path from the next-hop equipment to the destination node has a fault, switching the path to another path, wherein the other path is the path from the changed next-hop equipment to the destination node.

6. A device for processing link failure, applied to a static segment routing, SR, head node in a multi-protocol label switching, MPLS, network, the device comprising:

7. The apparatus of claim 6, wherein the forming module is specifically configured to:

8. The apparatus of claim 6, wherein the forming module is specifically configured to:

9. The apparatus of any one of claims 6 to 8, further comprising:

and the sensing module is used for sensing that the identification of the next hop equipment in the routing sensing table is changed when sensing that the next hop equipment has a fault.

10. The apparatus of any one of claims 6 to 8, further comprising:

a switching module, configured to switch a path to the destination node via the next-hop device to another path when it is determined that the path fails, where the another path is a path to the destination node via the changed next-hop device.