CN115134283A - Ring network protection method and device - Google Patents

Ring network protection method and device Download PDF

Info

Publication number
CN115134283A
CN115134283A CN202110253004.0A CN202110253004A CN115134283A CN 115134283 A CN115134283 A CN 115134283A CN 202110253004 A CN202110253004 A CN 202110253004A CN 115134283 A CN115134283 A CN 115134283A
Authority
CN
China
Prior art keywords
node
transmission path
list
routing
ring network
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202110253004.0A
Other languages
Chinese (zh)
Inventor
江元龙
周天然
范大卫
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Huawei Digital Technologies Co Ltd
Original Assignee
Beijing Huawei Digital Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Huawei Digital Technologies Co Ltd filed Critical Beijing Huawei Digital Technologies Co Ltd
Priority to CN202110253004.0A priority Critical patent/CN115134283A/en
Publication of CN115134283A publication Critical patent/CN115134283A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/34Source routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/42Loop networks
    • H04L12/437Ring fault isolation or reconfiguration
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/22Alternate routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/50Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The embodiment of the application discloses a ring network protection method, which can be executed by a first node on a ring network, and in one example, the first node can further process a first message to be forwarded to obtain a second message including a second route segment list under the condition that a first link in a first transmission path on the ring network fails, wherein the second route segment list is used for indicating a second transmission path, a destination node of the second transmission path is the same as that of the first transmission path, and the second transmission path does not include the first link. After obtaining the second packet, the first node may forward the second packet. Therefore, even if the first link on the ring network fails, the first node can normally forward the service message through the second transmission path without the first link. By adopting the mode, the first node can realize ring network protection by processing the routing segment list of the indication message transmission path, and the method is simple and efficient.

Description

Ring network protection method and device
Technical Field
The present application relates to the field of communications, and in particular, to a method and an apparatus for protecting a ring network.
Background
Segment Routing (SR) is a Protocol designed based on the source routing concept to forward packets on a network, SR based on Multi-Protocol Label Switching (MPLS) forwarding plane is referred to as SR-MPLS, and SR based on Internet Protocol version six (IPv 6) forwarding plane is referred to as SRv 6. For SR-MPLS based ring networks and SRv6 based ring networks, traffic transmission needs to be protected in order to avoid traffic transmission interruption caused by current transmission path failure. One known technique is MPLS-Transport Profile (TP) -defined ring protection technology, which may employ MPLS labels to implement traffic looping and switching. Regarding the ring network protection technology defined by MPLS-TP, reference may be made to the relevant description part of the Internet Engineering Task Force (IETF) request for comments (RFC) 8227, which is not described in detail herein.
However, the ring network protection technology defined by MPLS-TP cannot directly protect SRv 6-based ring networks. Only when the SRv 6-based ring network supports the MPLS-TP technology, the SRv 6-based ring network can be protected by using the MPLS-TP-defined ring network protection technology. This approach is complicated and increases network costs.
Therefore, how to provide a simple and efficient ring network protection mechanism in an SR network becomes one of the problems to be solved at present. In this document, to avoid confusion in the meaning of Chinese, we refer to a segment (segment) in the SR network path as a routing segment.
Disclosure of Invention
The embodiment of the application provides a ring network protection method, which can simply and efficiently protect a ring network in an SR network.
In a first aspect, an embodiment of the present application provides a method for protecting a ring network, where the method may be performed by a first node on a ring network, and in an example, the first node may receive a first packet, where the first packet includes a first route segment list used for indicating a first transmission path. Under the condition that the ring network is normal, the first node may forward the first packet based on the first routing segment list. In one example, the first routing segment list includes a first routing segment indicating a first link between the first node and the second node. If the first link fails, after receiving the first message, the first node does not forward the first message based on the first routing segment list, but further processes the first message to obtain a second message including a second routing segment list, wherein the second routing segment list is used for indicating a second transmission path, the second transmission path is the same as a destination node of the first transmission path, and the second transmission path does not include the first link. After obtaining the second packet, the first node may forward the second packet. It is to be appreciated that the first node may forward the second packet to the corresponding tail node based on the second transmission path. Therefore, by using the scheme, even if the first link on the ring network fails, the first node can normally forward the service message through the second transmission path without the first link. By adopting the mode, the first node can realize ring network protection by processing the routing segment list of the indication message transmission path, and the method is simple and efficient.
In one example, the first message may be either an MPLS message or an SRv6 message. Therefore, by using the ring network protection method provided by the embodiment of the application, not only the ring network based on SR-MPLS can be protected, but also the ring network based on SRv6 can be protected. Compared with the protection of the ring network based on SRv6 by utilizing the ring network protection technology defined by MPLS-TP, the protection method of the SRv 6-based ring network is not required to require that the ring network based on SRv6 supports the MPLS-TP technology, so that the protection method of the SRv 6-based ring network is simpler and more efficient.
In one implementation, when a first node obtains a second packet according to a first packet, the first node: the first node may replace the first routing segment in the first packet indicating the first link with a third routing segment list, where the third routing segment list is used to indicate a transmission path on the ring network that is opposite to the transmission direction of the first link and has the same head node and tail node as the first link. In this way, the second routing segment list in the second message includes at least two parts, one of which is the third routing segment list, and is used for transmitting the service message to the second node through a transmission path opposite to the transmission path of the first link. The other part is a fourth routing segment list indicating a transmission path from the second node to the third node. Wherein the fourth routing segment list is part of the first routing segment list in the first message. Therefore, the first node can forward the second packet to the third node through the third routing segment list and the fourth routing segment list.
In one implementation, when a first node obtains a second packet according to a first packet, the first node: the first node may regard the first routing segment and the fourth routing segment in the first message as a whole, and replace the whole with a fifth routing segment list, where the fifth routing segment list is used to indicate a transmission path on the ring network, where the transmission direction of the first link is opposite to the transmission direction of the first link, a head node is the first node, and a tail node is the third node. In this manner, the second list of routing segments in the second message may include the fifth list of routing segments, but no longer include the fourth list of routing segments described previously.
In an implementation manner, before the first node processes the first packet to obtain the second packet, the first node may further send an RPS message to the second node, and after receiving a response message fed back by the second node for the RPS message, the first packet is processed to obtain the second packet.
In an implementation manner, when the ring network is an SR-MPLS-based ring network, the first message is an MPLS message. At this time, the first routing segment list included in the first packet may be a first MPLS label list, where the first MPLS label list is used to indicate the first transmission path. Correspondingly, the second routing segment list included in the second packet may be a second MPLS label list. For example, the first MPLS label list may be: { MPLS label [ B-C ], MPLS label [ C-D ] }, the second list of MPLS labels could be: { MPLS label [ B-A ], MPLS label [ A-F ], MPLS label [ F-E ], MPLS label [ E-D ], MPLS label [ D-C ], MPLS label [ C-D ] }.
In one implementation, when the ring network is an SRv 6-based ring network, the first message is a SRv6 message. At this time, the first routing segment list included in the first packet may be a first segment list, where the first segment list is used to indicate a first transmission path. Correspondingly, the second routing segment list included in the second packet may be a second segment list. For example, the first segment list may be: { segment [ A-B ], segment [ B-C ], segment [ C-D }, the first segment list may be: { segment [ A-B ], segment [ B-A ], segment [ A-F ], segment [ F-E ], segment [ E-D ], segment [ D-C ], segment [ C-D }.
In a second aspect, an embodiment of the present application provides a ring network protection method, which may be executed by a first node on a ring network. In one example, the first node may forward the traffic packet over the second transmission path after the failure of the first transmission path. The first transmission path and the second transmission path are two transmission paths with opposite transmission directions on the ring network, and the first transmission path and the second transmission path are provided with the same head node and tail node. Specifically, the method comprises the following steps: the first node may obtain a first packet including a first route segment list after the first transmission path fails, and forward the first packet, where the first route segment list is used to indicate a second transmission path. Therefore, by using the scheme, even if the first transmission path on the ring network fails, the first node can normally forward the service message through the second transmission path. By adopting the mode, the first node can realize ring network protection by processing the routing segment list of the indication message transmission path, and the method is simple and efficient.
In one example, the first packet may be an MPLS packet or an SRv6 packet. Therefore, by using the ring network protection method provided by the embodiment of the application, not only the ring network based on SR-MPLS can be protected, but also the ring network based on SRv6 can be protected. On the aspect of protecting the SRv 6-based ring network, compared with the scheme of protecting the SRv 6-based ring network by using the MPLS-TP-defined ring network protection technology, the scheme does not need to require the SRv 6-based ring network to simultaneously support the MPLS-TP technology, so that the scheme is simpler and more efficient.
In an implementation manner, a service corresponding to the first packet is accessed to the ring network through the first node. Therefore, even if the first transmission path on the ring network fails, the first node serving as the entry node can normally forward the service packet through the second transmission path. The first node can realize ring network protection by processing the routing segment list of the indication message transmission path, and the method is simple and efficient.
In one implementation, the first node may prestore a correspondence relationship between a first routing segment list and a second routing segment list, where the second routing segment list is used to indicate the first transmission path. Thus, when the first transmission path fails, the first node may determine the first routing segment list according to the correspondence between the first routing segment list and the second routing segment list, and further obtain the first packet including the first routing segment list.
In one implementation, the service packet may access the ring network through the BSID. For this case, the first node may pre-store a correspondence between the BSID and the first route segment list. Thus, when the first node receives the message of the first service sent by the node outside the ring network after the first transmission path fails, the first node may determine the first routing segment list according to the BSID in the message of the first service and the correspondence between the BSID and the first routing segment list, and further obtain the first message including the first routing segment list.
In an implementation manner, if the failure of the first transmission path indicates that the link directly connected to the first node fails, the first node may perform the steps of obtaining the first packet including the first route segment list and the subsequent steps after determining that the link directly connected to the first node fails.
In an implementation manner, if the failure of the first transmission path indicates that other links except for the link directly connected to the first node have failed, the first node may receive an RPS message sent by an intermediate node on the first transmission path, and determine that the other links have failed according to the RPS message. Further, the first node may perform the steps of obtaining a first packet including the first list of route segments and the following.
In an implementation manner, if the failure of the first transmission path indicates that a link between the second node and the third node fails, the first node may receive an RPS message sent by the second node to the third node, and after receiving the RPS message sent by the second node to the third node, execute the steps of obtaining the first packet including the first route segment list and the subsequent steps.
In an implementation manner, when the ring network is an SR-MPLS based ring network, the first message is an MPLS message. At this time, the first routing segment list included in the first packet may be a first MPLS label list, where the first MPLS label list is used to indicate the second transmission path. For example, the first MPLS label list may be: { MPLS label [ A-F ], MPLS label [ F-E ], MPLS label [ E-D ] }.
In one implementation, when the ring network is an SRv 6-based ring network, the first message is a SRv6 message. At this time, the first routing segment list included in the first packet may be a first segment list, where the first segment list is used to indicate the second transmission path. For example, the first segment list may be: { segment [ A-F ], segment [ F-E ], segment [ E-D }.
In a third aspect, the present application provides a communication apparatus, comprising: a transceiving unit and a processing unit. Wherein: the transceiving unit is configured to perform the transceiving operation according to any one of the first aspect and the first aspect, and the processing unit is configured to perform the other operation except the transceiving operation according to any one of the first aspect and the first aspect. Alternatively, the transceiver unit is configured to perform the transceiving operation according to any one of the second aspect and the second aspect, and the processing unit is configured to perform the other operation except the transceiving operation according to any one of the second aspect and the second aspect.
In a fourth aspect, the present application provides a communication device comprising a memory and a processor; the memory for storing program code; the processor is configured to execute the instructions in the program code to cause the communication apparatus to perform the method of any one of the first aspect and the first aspect, or to cause the communication apparatus to perform the method of any one of the second aspect and the second aspect.
In a fifth aspect, the present application provides a communication device comprising a communication interface and a processor. Wherein: the communication interface is configured to perform the transceiving operations of any of the above first aspects and the first aspects, and the processor is configured to perform operations other than the transceiving operations of any of the above first aspects and the first aspects. Alternatively, the communication interface is configured to perform the transceiving operation according to any one of the second aspect and the second aspect, and the processor is configured to perform the other operation except the transceiving operation according to any one of the second aspect and the second aspect.
In a sixth aspect, the present application provides a computer-readable storage medium, wherein instructions are stored in the computer-readable storage medium, and when the instructions are executed on a computer, the instructions cause the computer to perform the method of any one of the above first aspect and the first aspect, or cause the computer to perform the method of any one of the above second aspect and the second aspect.
In a seventh aspect, the present application provides a computer program product comprising a program which, when run on a processor, implements the method of any one of the above first aspect and first aspect, or implements the method of any one of the above second aspect and second aspect.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and other drawings can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a schematic diagram of an exemplary application scenario;
fig. 2 is a schematic flowchart of a ring network protection method according to an embodiment of the present application;
fig. 3a is a schematic structural diagram of an RPS message according to an embodiment of the present application;
fig. 3b is a schematic structural diagram of an RPS message according to an embodiment of the present application;
fig. 4 is a schematic flowchart of another ring network protection method according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a communication device according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a communication device according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of a communication device according to an embodiment of the present application.
Detailed Description
The embodiment of the application provides a ring network protection method, which can simply and efficiently protect a ring network in an SR network.
For convenience of understanding, a possible application scenario of the embodiment of the present application is first described.
Referring to fig. 1, an exemplary application scenario is illustrated.
Fig. 1 shows an SR ring network, and the SR ring network shown in fig. 1 includes A, B, C, D, E, F of the 6 nodes. In the SR ring network, traffic may be transmitted in either a clockwise direction or a counterclockwise direction. For example, traffic may be transmitted along transmission path A-B-C-D-E-F, or along transmission path F-E-D-C-B-A.
The node in the embodiment of the present application may be a network device such as a switch and a router.
The SR ring network may be a SR-MPLS based ring network, or an SRv6 based ring network, which is not limited herein. In the SR ring network, the adjacent link between each node and its adjacent next-hop node can be indicated using a routing segment. In one example, if the SR-ring network is an SR-MPLS based ring network, the contiguous links between each node and its adjacent next-hop node may be indicated using an MPLS label. For example, the adjacent links a-D between node a and node B may be indicated by MPLS label 1. MPLS label 1 may be, for example, label value 100. In one example, if the SR ring network is an SRv 6-based ring network, the contiguous link between each node and its neighboring next-hop node may be indicated using a segment (segment). For example, the adjacent links A-D between node A and node B may be indicated by segment 1. Wherein, segment 1 can be an IPv6 address value, and the address value can be 2601: AC01: BC02:1101: A001: B002: C003: D004, for example.
As shown in fig. 1: traffic can access the SR ring from node a and exit the SR ring from node D. When the SR ring network does not have a fault, after the service is accessed into the SR ring network from the node A, the service reaches the node D through the transmission path A-B-C-D, and then the service exits from the SR ring network from the node D. When the link between node B and node C fails, the traffic flow cannot reach node D via transmission path a-B-C-D. In order to ensure that the service is normally transmitted in the ring network, corresponding ring network protection measures need to be taken.
Next, a ring network protection method provided in the embodiment of the present application is described by taking a scenario shown in fig. 1 as an example.
It should be noted that, in the SR ring network, each node can access a service, and fig. 1 is only for convenience of understanding, and the service is accessed into the SR ring network from the node a and is taken out of the SR ring network from the node D as an example for description. In addition, one or more services may be carried on the same transmission path in the SR ring network, and the embodiment of the present application is not particularly limited. For example, transmission paths A-B-C-D may carry traffic 1. The transmission path a-B-C-D may carry traffic 2, or even traffic 3, in addition to traffic 1.
It should be noted that, in the embodiment of the present application, the SRv6 packet refers to an IPv6 packet with a Segment Routing Header (SRH).
Referring to fig. 2, fig. 2 is a schematic flowchart of a ring network protection method according to an embodiment of the present application. The ring network protection method 100 shown in fig. 2 may be executed by, for example, a first node, where the first node is an intermediate node on a transmission path for transmitting traffic on a ring network. The first node may for example correspond to the node B shown in fig. 1. The method 100 may include, for example, S101-S103 as follows.
S101: the method comprises the steps that a first node receives a first message, wherein the first message comprises a first routing section list used for indicating a first transmission path, the first routing section list comprises a first routing section used for indicating a first link, and the first link is a link between the first node and a second node.
In this embodiment of the present application, the first routing segment list includes a plurality of routing segments, and the first routing segment list is used to indicate a first transmission path, where the first transmission path is a transmission path of the first packet. The plurality of routing segments include a first routing segment indicating a first link, the first link being an adjacent link between the first node and the second node. Wherein the second node is a downstream node of the first node on the first transmission path. For example, corresponding to the scenario shown in fig. 1, the first node is node B, the second node is node C, and the first link is a link from node B to node C via the clockwise direction.
And when the ring network is based on SR-MPLS, the first message is an MPLS message. At this time, the first routing segment list may be a first MPLS label list indicating the first transmission path. In one example, the first MPLS label list may include at least one MPLS label, one MPLS label to indicate a segment of a link in the first transmission path. The first routing segment may be one of the at least one MPLS label. Now, the scenario shown in fig. 1 is illustrated: the first node is a node B, and the service is accessed into the SR ring network from the node A and is exported out of the SR ring network from the node D. Then: the first MPLS label list may include: an MPLS label 1 indicating the arrival at node C from node B and an MPLS label 2 indicating the arrival at node D from node C, the first routing segment being MPLS label 1.
When the ring network is an SRv 6-based ring network, the first message is SRv6 message. At this time, the first routing segment list may be a first segment list (segment list), and the first segment list may include a plurality of segments, one segment indicating a segment of a link in the first transmission path. The first routing segment may be one of the plurality of segments. The scenario illustrated in fig. 1 is now exemplified: the first node is a node B, and the service is accessed into the SR ring network from the node A and exits from the ring network from the node D. The first segment list may include: segment 1 for indicating the arrival of node B by node a, segment 2 for indicating the arrival of node C by node B, and segment 3 for indicating the arrival of node D by node C, the first routing segment is segment 2.
In this embodiment, the first node may receive the first packet sent by the ingress node. The entry node mentioned herein refers to a node of the service access ring network corresponding to the first packet. Corresponding to the scenario shown in fig. 1, the entry node may be node a.
In one example, the ingress node may receive a service packet from another device outside the ring network, for example, and encapsulate the service packet, so as to obtain a third packet, where the third packet includes a target routing segment list for indicating a transmission path of the service packet in the ring network. In one example, in order to ensure the security of the ring network, the network topology of the ring network is prevented from being leaked, so that the possibility that the ring network is attacked is reduced. The service packet may access the ring network through a Binding Segment Identifier (BSID). The BSID may be used to identify a forwarding path. Specifically, in one example, a BSID identifying one forwarding path within a ring network may be generated by a control management device. After the BSID is generated, the control management device may transmit the correspondence between the BSID and the forwarding path indicated by the BSID to the ingress node. In one example, the correspondence between the BSID and the forwarding path indicated by the BSID may be a correspondence between the BSID and a target routing segment list. The control management device mentioned in this embodiment of the present application may be, for example, a device running network management software, or may be a controller, and this embodiment of the present application is not particularly limited.
In an example, when a service packet accesses a ring network through a BSID, the service packet received by the ingress node includes the BSID, and at this time, the ingress node may obtain the target routing segment list according to a correspondence between the BSID and the target routing segment list, and obtain a third packet including the target routing segment list. In yet another example, the ingress node may obtain the target routing segment list according to a relevant service parameter of the service packet, for example, so as to obtain a third packet including the target routing segment list.
In this embodiment, if the ring network is an SR-MPLS-based ring network, the third packet is an MPLS packet. If the ring network is SRv 6-based, the third packet is SRv6 packet.
With respect to the destination routing segment list, it should be noted that:
if the first packet is an MPLS packet, the target routing segment list may be a target MPLS label list, and since an MPLS label in a label stack is popped up during a forwarding process of the MPLS packet, the first routing segment list is a part of the target routing segment list. The scenario illustrated in fig. 1 is now exemplified: the first node is a node B, and the service is accessed into the SR ring network from the node A and is exported out of the SR ring network from the node D. Then: the first MPLS label list may include: MPLS label 1 indicating arrival at node C from node B and MPLS label 2 indicating arrival at node D from node C. The target MPLS label list may include: MPLS label 3 indicating arrival by node a to node B, MPLS label 1 indicating arrival by node B to node C, and MPLS label 2 indicating arrival by node C to node D.
If the first packet is an SRv6 packet, the target routing segment list may be a target segment list, and since the segment list is not modified in the process of forwarding the SRv6 packet, the first routing segment list and the target routing segment list are the same. Regarding the included contents of the target segment list, the above description for the first segment list can be combined, and the description is not repeated here.
After obtaining the third packet, the ingress node may forward the third packet. Correspondingly, the first node can receive the first message. Regarding the first packet and the third packet, it should be noted that the service data in the third packet is the same as the service data in the first packet, and only the parameters for controlling packet forwarding are different. For example, if the first packet and the third packet are both MPLS packets, the contents in the MPLS label stacks of the first packet and the third packet may be different. For example, the first message includes a first MPLS label list, and the third message includes a target MPLS label list. If the first message and the third message are both SRv6 messages, the contents of partial fields in the SRH in the first message and the third message are different. For example, the remaining number of routing Segments (SF) in the first and third messages are different in value.
S102: after the first link fails, the first node obtains a second message according to the first message, the second message comprises a second route segment list used for indicating a second transmission path, tail nodes of the first transmission path and the second transmission path are the same, and the second transmission path does not comprise the first link.
S103: and forwarding the second message.
After the first node receives the first message, if the looped network has not failed, the first node forwards the first message based on the first routing segment list. Specifically, the first node may first forward the first packet to the second node via the first link. If the first link fails, the first node cannot forward the first message to the second node through the first link. At this time, the first node may modify the first routing segment list forwarded by the guidance message in the first message to obtain a second message, and forward the second message. The second packet includes a second route segment list for indicating a second transmission path, and the tail nodes of the first transmission path and the second transmission path are the same, so that the second packet can be forwarded to the predetermined tail node through the second transmission path. In addition, the second transmission path does not include the first link, so that even if the first link on the ring network fails, the first node can normally forward the service packet through the second transmission path that does not include the first link. For convenience of description, in the following description, the tail node of the first transmission path is referred to as a "third node". The third node is also a node on the ring network, which in some examples may be a node of a traffic egress ring network, and thus may also be referred to as an "egress node". Corresponding to the scenario shown in fig. 1, the third node may be node D.
As before, when the ring network is an SR-MPLS based ring network, the first routing segment list may be a first MPLS label list. At this time, the second routing segment list may be a second MPLS label list.
As mentioned above, when the ring network is an SRv 6-based ring network, the first routing segment list may be a first segment list, and at this time, the second routing segment list may be a second segment list.
It should be noted that, in S102, when the "first node obtains the second packet according to the first packet" is implemented specifically, there may be multiple implementation manners, and two possible implementation manners are described below.
The first implementation mode comprises the following steps:
the first node may replace the first routing segment in the first packet indicating the first link with a third routing segment list, where the third routing segment list is used to indicate a transmission path on the ring network that is opposite to the transmission direction of the first link and has the same head node and tail node as the first link. It is understood that the first node may also forward the service packet to the second node through the third routing segment list. In this way, the second routing segment list in the second message includes at least two parts, one of which is the third routing segment list, and is used for transmitting the service message to the second node through a transmission path opposite to the transmission path of the first link. The other part is a fourth routing segment list indicating a transmission path from the second node to the third node. Wherein the fourth routing segment list is part of the first routing segment list in the first message. Therefore, the first node can forward the second packet to the third node through the third routing segment list and the fourth routing segment list.
In one example, the first node may maintain a correspondence between the first route segment and the third route segment list, for example. In this way, after the first link indicated by the first routing segment fails, the first node determines the third routing segment list according to the correspondence between the first routing segment and the third routing segment list, and replaces the first routing segment in the first message with the third routing segment list.
The first routing segment list included in the first packet and the second routing segment list included in the second packet may be described with reference to table 1 and table 2 below. Table 1 shows a first MPLS label list and a second MPLS label list in SR-MPLS based ring network. Table 2 shows the first segment list and the second segment list in the SRv 6-based ring network.
TABLE 1
Figure BDA0002966010060000081
In Table 1, the link indicated by MPLS label [ B-C ] is: a node B to node C neighbor link; the link indicated by MPLS label [ B-A ] is: a node B to node a neighbor link; the link indicated by MPLS label [ A-F ] is: a neighbor link from node a to node F; and so on, are not illustrated in this list.
It is understood that, at this time, the correspondence between the aforementioned first routing segment and the third routing segment list may be a correspondence between MPLS labels [ B-C ] and { MPLS label [ B-a ], MPLS labels [ a-F ], MPLS labels [ F-E ], MPLS labels [ E-D ], MPLS labels [ D-C }. The fourth routing segment list may be an MPLS label C-D.
TABLE 2
Figure BDA0002966010060000091
In Table 2, the links indicated by segment [ A-B ] are: a node A to node B neighbor link; the link indicated by segment [ B-C ] is: a node B to node C neighbor link; the link indicated by segment [ B-A ] is: a node B to node A adjacency link; the links indicated by segment [ A-F ] are: a neighbor link from node a to node F; and so on, are not illustrated in this list.
It is understood that, at this time, the correspondence between the first routing segment and the third routing segment list may be the correspondence between segment [ B-C ] and { segment [ B-a ], segment [ a-F ], segment [ F-E ], segment [ E-D ], segment [ D-C }. The aforementioned fourth routing segment list may be segment [ C-D ].
It can be understood that, after receiving the first packet, the first node replaces the first routing segment in the first packet with the third routing segment list, and after the active segment is set as the first segment of the third routing segment list, the first node may forward the service packet to the third node through the path B-a-F-E-D-C-D.
In an example, the ring network protection mode corresponding to the first mode may also be referred to as a "loopback mode".
The second implementation mode comprises the following steps:
the first node may regard the first route segment and the fourth route segment in the first message as a whole, and replace the whole with a fifth route segment list, where the fifth route segment list is used to indicate that the transmission direction of the first link on the ring network is opposite, and a head node is the first node, and a tail node is a transmission path of the third node. It can be understood that, through the fifth routing segment list, the first node may forward the service packet to the third node. In this manner, the second list of routing segments in the second message may include the fifth list of routing segments but no longer include the fourth list of routing segments. With regard to the description of the fourth routing segment list, reference may be made to the description part in the above first implementation, and the description is not repeated here.
It should be noted that, in an example, the first node may store, for example, a corresponding relationship between the whole of the first routing segment and the fourth routing segment list and the fifth routing segment list. In this way, after the first link indicated by the first routing segment fails, the first node may determine the fifth routing segment list according to the correspondence between the whole formed by the first routing segment and the fourth routing segment list and the fifth routing segment list, and replace the whole formed by the first routing segment and the fourth routing segment list in the first message with the fifth routing segment list.
In a second implementation manner, the description may be made with reference to the following table 3 and table 4 with respect to the first routing segment list included in the foregoing first packet and the second routing segment list included in the foregoing second packet. Table 3 shows a first MPLS label list and a second MPLS label list in the SR-MPLS based ring network. Table 4 shows the first segment list and the second segment list in the case of SRv 6-based ring network.
TABLE 3
Figure BDA0002966010060000101
In Table 3, the link indicated by MPLS label [ B-C ] is: a node B to node C neighbor link; the link indicated by MPLS label [ B-A ] is: a node B to node a neighbor link; the link indicated by MPLS label [ A-F ] is: an adjacent link from node a to node F; and so on, are not illustrated in this list.
It is understood that, at this time, the correspondence between the whole of the first route segment and the fourth route segment list and the fifth route segment list may be a correspondence between { MPLS label [ B-C ], MPLS label [ C-D ] } and { MPLS label [ B-a ], MPLS label [ a-F ], MPLS label [ F-E ], MPLS label [ E-D ] }. The first routing segment is an MPLS label [ B-C ], and the fourth routing segment list may be an MPLS label [ C-D ].
TABLE 4
Figure BDA0002966010060000102
In Table 4, the link indicated by segment [ A-B ] is: a node A to node B neighbor link; the link indicated by segment [ B-C ] is: a node B to node C neighbor link; the link indicated by segment [ B-A ] is: a node B to node a neighbor link; the link indicated by segment [ A-F ] is: a neighbor link from node a to node F; and so on, are not illustrated in this list.
It is understood that, at this time, the correspondence between the whole of the first route segment and the fourth route segment list and the fifth route segment list may be the correspondence between { segment [ B-C ], segment [ C-D ] } and { segment [ B-a ], segment [ a-F ], segment [ F-E ], segment [ E-D ] }. The first routing segment is segment [ B-C ], and the fourth routing segment list can be segment [ C-D ].
It can be understood that, the first node regards the first routing segment and the fourth routing segment in the first message as a whole, and after receiving the first message, the whole in the first message is replaced by the fifth routing segment list, and after the active segment is set as the first segment of the fifth routing segment list, the service message may be forwarded to the third node through the path B-a-F-E-D.
In an example, the ring network protection mode corresponding to the second mode may also be referred to as a "short loopback mode".
In one example, the first node may detect connectivity of the first link to determine whether the first link fails, e.g., the first node may detect connectivity of the first link using Bidirectional Forwarding Detection (BFD) techniques. After the first node determines that the first link fails, the step of "obtaining a second packet according to the first packet" in S102 is executed. Of course, the first node may detect the connectivity of the first link in other manners, which is not described herein.
In an example, before performing the ring network protection measure as described in S102, the first node may further send a Ring Protection Switching (RPS) message to the second node, and after receiving a response message fed back by the second node for the RPS message, perform S102 again.
As for the RPS message, it can be understood with reference to fig. 3a and 3b, fig. 3a shows the structure of the RPS message when the ring network is an SR-MPLS based ring network, and fig. 3b shows the structure of the RPS message when the ring network is an SRv6 based ring network. In fig. 3a and 3 b:
a destination Node identifier (Dest Node ID) field is used for carrying an identifier of a destination Node, for example, an IP address of the destination Node;
a source Node identifier (Src Node ID) field is used to carry an identifier of a source Node, for example, an IP address of the source Node;
the request type (request) field is used to carry a type of requesting ring protection switching, where the type of ring protection switching may include: one of protection Lock (LP), Forced Switch (FS), Signal Fail (SF), Signal Degrade (SD), Manual Switch (MS), No Request (NR), or Reverse Request (RR). When the type of the ring protection is RR, it indicates that the RPS message is a response message to a certain RPS request.
The mode (mode, M) field is used to carry the mode of the ring protection switching; the ring protection switching mode can be one of a loopback mode, a short loopback mode, switching and the like; it can be understood that, when the switching protection switching mode carried in the RPS message is the loopback mode, the first node may perform the operation described in the first implementation manner in S102, and when the ring protection switching mode carried in the RPS message is the short loopback mode, the first node may perform the operation described in the second implementation manner in S102.
The version field is used to carry a version number, and is used to indicate a protocol version corresponding to the ring protection switching message.
The other fields shown in fig. 3a and 3b will not be described in detail here. It should be noted that fig. 3a and 3b are only shown as an example, and do not limit the embodiments of the present application. In some embodiments, the structure of the RPS message is not limited to the format shown in fig. 3a and 3 b.
As can be seen from the above description, with the method 100, in the SR-based ring network, for an intermediate node (i.e., a first node) on a service packet transmission path, in the case of a failure of a first link, it may forward the service packet normally through a second transmission path that does not include the first link. By adopting the mode, the first node can realize ring network protection by processing the routing section list of the transmission path of the indication message, and the method is simple and efficient.
The embodiment of the present application further provides a ring network protection method executed by an ingress node, and the method is described with reference to fig. 4.
Referring to fig. 4, fig. 4 is a schematic flowchart of another ring network protection method provided in the embodiment of the present application. The ring network protection method 200 shown in fig. 4 may be executed by a first node, for example, where a service accesses a ring network through the first node, and the first node may correspond to the node a shown in fig. 1, for example. The method 200 may include, for example, the following S201-S202.
S201: after the first transmission path fails, the first node acquires a first message including a first route segment list, the first route segment list is used for indicating a second transmission path, the first transmission path and the second transmission path are two transmission paths with opposite transmission directions on the ring network, and the first transmission path and the second transmission path have the same head node and tail node.
S202: and forwarding the first message.
In this embodiment of the present application, if the ring network does not have a fault, the traffic of the first service that is accessed to the ring network through the first node may be transmitted through the first transmission path. The first service refers to a service corresponding to the first message. It is understood that in addition to the first service, other services may also access the ring network via the first node.
In an example, the failure of the first transmission path may be a failure of a link directly connected to the first node, or a failure of another link. For example, corresponding to the scenario shown in fig. 1, the first transmission path is a-B-C-D, and the failure of the first transmission path may be a failure of a link a-B or a failure of a link B-C.
In this embodiment of the application, the first node may detect connectivity of a link directly connected to the first node to determine whether the link directly connected to the first node fails, for example, the first node may detect connectivity of the link directly connected to the first node by using a BFD technique. Therefore, in one example, if the failure of the first transmission path refers to a failure of a link directly connected to the first node, the first node may perform S201 after determining that the link directly connected to the first node fails.
In addition, other nodes on the ring network can detect the connectivity of the link directly connected with the other nodes, and send RPS messages to the opposite end node when determining that the link directly connected with the other nodes has a fault. In one example, if the failure of the first transmission path refers to failure of another link, the first node may receive an RPS message sent by an intermediate node on the first transmission path and determine that the other link fails according to the RPS message before performing S101. Further, the first node may perform the aforementioned S201. The other links mentioned herein refer to one of the links in the first transmission path except the link directly connected to the first node.
In an example, when the failure of the first transmission path refers to a failure of a transmission path between the second node and the third node, the second node may send an RPS message to the third node, and it is understood that a destination node identification field in the RPS message is used to carry an identification of the second node, and a source address identification field in the RPS message is used to carry an identification of the third node. In an example, the protection switching mode carried in the RPS message is a switching mode, and after receiving the RPS message, the first node may switch a transmission path of a service accessing a ring network through the first node based on the RPS message. In an implementation manner of the embodiment of the present application, to ensure that the third node can receive the RPS message when a unidirectional failure occurs in a link between the second node and the third node, the second node may send the RPS message to the third node in a clockwise direction and a counterclockwise direction, respectively. The scenario illustrated in fig. 1 is now exemplified:
the first node is an a node, the second node is a B node, the third node is a C node, and after determining that the link B-C has failed, the node B may send an RPS message to the node C, and when the RPS message is transmitted in a counterclockwise direction (i.e., along the path B-a-F-E-D-C), the node a may receive the RPS message, and further, perform S201 and S202.
In this embodiment of the application, if the ring network is an SR-MPLS-based ring network, the structure of the RPS message sent by the second node may be as shown in fig. 3a, and if the ring network is an SRv 6-based ring network, the structure of the RPS message sent by the second node may be as shown in fig. 3b, and related contents may refer to the above description part of fig. 3a and fig. 3b, and are not described repeatedly here.
In the embodiment of the present application, when the ring network is an SR-MPLS-based ring network, the first message is an MPLS message. At this time, the first routing segment list may be a first MPLS label list indicating the second transmission path, and in one example, the first MPLS label list may include at least one MPLS label indicating a segment of a link in the second transmission path. The scenario illustrated in fig. 1 is now exemplified: the first node is a node A, and the service is accessed into the SR ring network from the node A and is exported out of the SR ring network from the node D. Then: the first MPLS label list may include: MPLS label 1 for indicating arrival at node F from node a, MPLS label 2 for indicating arrival at node E from node F, and MPLS label 3 for indicating arrival at node D from node E, at which time the second transmission path is: A-F-E-D.
When the ring network is an SRv 6-based ring network, the first message is a SRv6 message. At this time, the first routing segment list may be a first segment list, and the first segment list may include a plurality of segments, one segment being used to indicate a segment of a link in the second transmission path. The scenario illustrated in fig. 1 is now exemplified: the first node is a node A, and the service is accessed into the SR ring network from the node A and is exported out of the SR ring network from the node D. The first segment list may include: segment 1 for indicating arrival at node F from node a, segment 2 for indicating arrival at node E from node F, and segment 3 for indicating arrival at node D from node E, at which time the second transmission path is: A-F-E-D.
In an implementation manner of the embodiment of the present application, the first node may prestore a correspondence relationship between a first routing segment list and a second routing segment list, where the second routing segment list is used to indicate the first transmission path. In the scenario shown in fig. 1, the first transmission path may be, for example, a-B-C-D. Thus, when the first transmission path fails, the first node may determine the first routing segment list according to the correspondence between the first routing segment list and the second routing segment list, and further obtain the first packet including the first routing segment list.
With respect to the correspondence between the aforementioned first routing segment list and the second routing segment list, the following description may be made in conjunction with table 5 and table 6 below. Table 5 shows a first MPLS label list (i.e., a first routing segment list) and a second MPLS label list (i.e., a second routing segment list) in an SR-MPLS based ring network. Table 6 shows a first segment list (i.e., a first route segment list) and a second segment list (i.e., a second route segment list) when the ring network is based on SRv 6.
TABLE 5
Figure BDA0002966010060000131
In table 5: the link indicated by MPLS label [ A-B ] is: a node A to node B neighbor link; the link indicated by MPLS label [ B-C ] is: a node B to node C adjacency link; the link indicated by MPLS label [ A-F ] is: a neighbor link from node a to node F; and so on, are not illustrated in this list.
TABLE 6
Figure BDA0002966010060000132
In Table 6, the links indicated by segment [ A-B ] are: a node A to node B neighbor link; the link indicated by segment [ B-C ] is: a node B to node C neighbor link; the link indicated by segment [ C-D ] is: a neighbor link from node C to node D; the link indicated by segment [ A-F ] is: an adjacent link from node a to node F; and so on, this is not intended to be a list.
As described above, in some embodiments, the service packet may access the ring network through the BSID. For this case, the first node may pre-store a correspondence between the BSID and the first route segment list. Thus, when the first node receives the message of the first service sent by the node outside the ring network after the first transmission path fails, the first node may determine the first routing segment list according to the BSID in the message of the first service and the correspondence between the BSID and the first routing segment list, and further obtain the first message including the first routing segment list.
Regarding the first routing segment list, reference may be made to relevant description parts in tables 5 and 6, and a repeated description will not be made.
As can be seen from the above description, with the method 200, even if the first transmission path on the ring network fails, the first node serving as the ingress node may forward the service packet normally through the second transmission path. By adopting the mode, the first node can realize ring network protection by processing the routing segment list of the indication message transmission path, and the method is simple and efficient.
As mentioned above, besides the first service, other services may also access the ring network through the first node. For other services, if a link between the second node and the third node fails, the first node may also switch the transmission path of other services after receiving the RPS message sent by the second node to the third node. Taking the first node as the node a shown in fig. 1 as an example, for the second service accessed through the first node, when the ring network has no fault, the traffic of the second service is transmitted along the transmission path a-B-C-D-E, and exits the ring network from the node E. After the failure of the link B-C, the first node receives the RPS message sent by the node B to the node C, and the first node may switch the transmission path of the second service to a-F-E.
In addition, for other nodes on the transmission path of the RPS message sent by the second node to the third node, it may also perform a similar procedure as the first node to switch the transmission path of the service accessing the ring network through itself. Taking the fourth node on the transmission path of the RPS message sent by the second node to the third node as an example, after receiving the RPS message sent by the second node to the third node, the fourth node may switch the transmission path of the service accessed to the ring network through the fourth node, so that the transmission path of the service accessed to the ring network through the fourth node does not pass through the link between the second node and the third node, thereby ensuring that the service is normally transmitted in the ring network. As to the specific implementation manner of switching the transmission path of the service accessing the ring network through the fourth node by the fourth node, the specific implementation manner is similar to the specific implementation manner of switching the transmission path of the service accessing the ring network through the first node by the first node, so that reference may be made to the description part of the method 200 above for related implementation, and the description is not repeated here. The scenario illustrated in fig. 1 is now exemplified:
the first node is a node A, the second node is a node B, the third node is a node C, after a failure of a link B-C, the node B sends an RPS message to the node C, when the RPS message is transmitted along a counterclockwise direction (namely along a path B-A-F-E-D-C), the node A, the node F, the node E and the node D can all receive the RPS message, and further, the node A, the node F, the node E and the node D can switch a transmission path of a service accessed to a ring network through the node A, the node F, the node E and the node D. The fourth node may be a node F, a node E, or a node D.
In addition, an embodiment of the present application further provides a communication apparatus 500, which is shown in fig. 5. Fig. 5 is a schematic structural diagram of a communication device according to an embodiment of the present application. The communication device 500 includes a transceiver unit 501 and a processing unit 502. The communication device 500 may be used to perform the method 100 or the method 200 in the above embodiments.
In one example, the communication device 500 may perform the method 100 in the above embodiments, when the communication device 500 is used to perform the method 100 in the above embodiments: the transceiving unit 501 is configured to perform transceiving operations performed by the first node in the method 100 (transceiving operations refer to receiving and/or transmitting related operations in this application). The processing unit 502 is configured to perform operations other than transceiving operations performed by the first node in the method 100. For example, the transceiver unit 501 is configured to receive a first packet, where the first packet includes a first route segment list used for indicating a first transmission path, the first route segment list includes a first route segment used for indicating a first link, and the first link is a link between a first node and a second node; the processing unit 502 is configured to obtain a second packet according to the first packet after the first link fails, where the second packet includes a second route segment list used for indicating a second transmission path, tail nodes of the first transmission path and the second transmission path are the same, and the second transmission path does not include the first link; the transceiver unit 501 is further configured to forward the second packet.
In one example, the communications apparatus 500 may perform the method 200 in the above embodiments, when the communications apparatus 500 is used to perform the method 200 in the above embodiments: the transceiving unit 501 is configured to perform transceiving operations performed by the first node in the method 200. The processing unit 502 is configured to perform operations other than transceiving operations performed by the first node in the method 200. For example, the processing unit 502 is configured to obtain a first packet including a first route segment list after a first transmission path fails, where the first route segment list is used to indicate a second transmission path, the first transmission path and the second transmission path are two transmission paths with opposite transmission directions on a ring network, and the first transmission path and the second transmission path have the same head node and tail node; the transceiving unit 501 is configured to forward the first packet.
In addition, an embodiment of the present application further provides a communication apparatus 600, see fig. 6, where fig. 6 is a schematic structural diagram of the communication apparatus provided in the embodiment of the present application. The communication device 600 includes a communication interface 601 and a processor 602 coupled to the communication interface 601. The communication device 600 may be used to perform the method 100 or the method 200 in the above embodiments.
In one example, the communication device 600 may perform the method 100 in the above embodiments, when the communication device 600 is used to perform the method 100 in the above embodiments: the communication interface 601 is used for performing transceiving operations performed by the first node in the method 100. The processor 602 is configured to perform operations other than transceiving operations performed by the first node in the method 100. For example, the communication interface 601 is configured to receive a first packet, where the first packet includes a first route segment list used for indicating a first transmission path, the first route segment list includes a first route segment used for indicating a first link, and the first link is a link between a first node and a second node; the processor 602 is configured to obtain a second packet according to the first packet after the first link fails, where the second packet includes a second route segment list used for indicating a second transmission path, tail nodes of the first transmission path and the second transmission path are the same, and the second transmission path does not include the first link; the communication interface 601 is further configured to forward the second packet.
In one example, the communications apparatus 600 may perform the method 200 in the above embodiments, when the communications apparatus 600 is used to perform the method 200 in the above embodiments: the communication interface 601 is used for performing transceiving operations performed by the first node in the method 200. Processor 602 is configured to perform operations other than transceiving operations performed by the first node in method 200. For example, the processor 602 is configured to obtain a first packet including a first route segment list after a first transmission path fails, where the first route segment list is used to indicate a second transmission path, the first transmission path and the second transmission path are two transmission paths with opposite transmission directions on a ring network, and the first transmission path and the second transmission path have the same head node and tail node; the communication interface 601 is configured to forward the first packet.
In addition, an embodiment of the present application further provides a communication apparatus 700, see fig. 7, where fig. 7 is a schematic structural diagram of the communication apparatus provided in the embodiment of the present application.
The communication apparatus 700 may be used to perform the method 100 or the method 200 in the above embodiments.
As shown in fig. 7, the communication device 700 may include a processor 710, a memory 720 coupled to the processor 710, and a transceiver 730. The transceiver 730 may be, for example, a communication interface, an optical module, etc. The processor 710 may be a Central Processing Unit (CPU), a Network Processor (NP), or a combination of a CPU and an NP. The processor may also be an application-specific integrated circuit (ASIC), a Programmable Logic Device (PLD), or a combination thereof. The PLD may be a Complex Programmable Logic Device (CPLD), a field-programmable gate array (FPGA), General Array Logic (GAL), or any combination thereof. Processor 710 may refer to a single processor or may include multiple processors. The memory 720 may include a volatile memory (RAM), such as a random-access memory (RAM); the memory may also include a non-volatile memory (ROM), such as a read-only memory (ROM), a flash memory (flash memory), a hard disk (HDD) or a solid-state drive (SSD); memory 720 may also include combinations of the above types of memory. The memory 720 may refer to one memory or may include a plurality of memories. In one embodiment, the memory 720 has stored therein computer-readable instructions comprising a plurality of software modules, such as a sending module 721, a processing module 722, and a receiving module 723. The processor 710 may perform corresponding operations according to the instructions of each software module after executing each software module. In the present embodiment, the operation performed by one software module actually refers to the operation performed by the processor 710 according to the instruction of the software module.
In one example, the communications apparatus 700 may perform the method 100 in the above embodiments, and when the communications apparatus 700 is used to perform the method 100 in the above embodiments: the transceiver 730 is configured to perform transceiving operations performed by the first node in the method 100. Processor 710 is configured to perform operations in method 100 other than transceiving operations performed by the first node. For example, the transceiver 730 is configured to receive a first packet, where the first packet includes a first routing segment list used for indicating a first transmission path, and the first routing segment list includes a first routing segment used for indicating a first link, where the first link is a link between a first node and a second node; the processor 710 is configured to obtain a second packet according to the first packet after the first link fails, where the second packet includes a second route segment list used for indicating a second transmission path, tail nodes of the first transmission path and the second transmission path are the same, and the second transmission path does not include the first link; the transceiver 730 is further configured to forward the second packet.
In one example, the communications apparatus 700 may perform the method 200 in the above embodiments, when the communications apparatus 700 is used to perform the method 200 in the above embodiments: the transceiver 730 is used for performing transceiving operations performed by the first node in the method 200. Processor 710 is configured to perform operations in method 200 other than transceiving operations performed by the first node. For example, the processor 710 is configured to obtain a first packet including a first route segment list after the first transmission path fails, where the first route segment list is used to indicate a second transmission path, the first transmission path and the second transmission path are two transmission paths with opposite transmission directions on the ring network, and the first transmission path and the second transmission path have the same head node and tail node; the transceiver 730 is configured to forward the first packet.
The present application also provides a computer-readable storage medium having stored therein instructions, which when executed on a computer, cause the computer to perform any one or more of the operations of the methods (e.g., method 100 and method 200) described in any of the preceding embodiments.
The present application also provides a computer program product comprising a computer program that, when run on a computer, causes the computer to perform any one or more of the operations of the methods (e.g., method 100 and method 200) described in any of the preceding embodiments.
It should be noted that the communication device mentioned in this embodiment of the present application may be a network device such as a switch and a router, or may be a part of components on the network device, such as a board and a line card on the network device, or may be a functional module on the network device, or may be a chip for implementing the method of the present application, and this embodiment of the present application is not limited specifically. The communication devices may be directly connected to each other, for example, but not limited to, by ethernet wires or optical cables.
In this embodiment, the communication device provided in this embodiment may be the first node itself, or may be a part of a component on the first node.
The terms "first," "second," "third," "fourth," and the like in the description and claims of this application and in the above-described drawings, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It will be appreciated that the data so used may be interchanged under appropriate circumstances such that the embodiments described herein may be practiced otherwise than as specifically illustrated or described herein. Moreover, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of a unit is only a logical service division, and other divisions may be realized in practice, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, each service unit in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a hardware form, and can also be realized in a software service unit form.
The integrated unit, if implemented in the form of a software business unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method of the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
Those skilled in the art will recognize that, in one or more of the examples described above, the services described in this disclosure may be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, the services may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.
The above embodiments are intended to explain the objects, aspects and advantages of the present invention in further detail, and it should be understood that the above embodiments are merely illustrative of the present invention.
The above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present application.

Claims (18)

1. A ring network protection method is applied to a first node on a ring network, and comprises the following steps:
receiving a first message, where the first message includes a first routing segment list used for indicating a first transmission path, the first routing segment list includes a first routing segment used for indicating a first link, and the first link is a link between the first node and a second node;
after the first link fails, obtaining a second message according to the first message, wherein the second message comprises a second route segment list used for indicating a second transmission path, tail nodes of the first transmission path and the second transmission path are the same, and the second transmission path does not comprise the first link;
and forwarding the second message.
2. The method of claim 1, wherein a tail node of the first transmission path is a third node on the ring network, and wherein the second list of route segments comprises:
a third list of routing segments and a fourth list of routing segments indicating routing of the second node to the third node, wherein: the third routing segment list is used to indicate a transmission path on the ring network that is opposite to the transmission direction of the first link and has the same head node and tail node as the first link, and the fourth routing segment list is a part of the first routing segment list.
3. The method of claim 1, wherein a tail node of the first transmission path is a third node on the ring network, wherein the second routing segment list includes a fifth routing segment list and does not include a fourth routing segment list indicating that the second node is a third node on the ring network, wherein the fifth routing segment list indicates that the first link is in a reverse transmission direction on the ring network, and wherein a head node is the first node, wherein a tail node is a transmission path of the third node, and wherein the fourth routing segment list is a part of the first routing segment list.
4. The method according to any of claims 1-3, wherein before obtaining a second message from the first message, the method further comprises:
sending a ring protection switching RPS message to the second node;
and receiving a response message fed back by the second node aiming at the RPS message.
5. The method according to any of claims 1-4, wherein the first packet and the second packet are both multiprotocol label switching (MPLS) packets, the first list of routing segments is a first MPLS label list, and the second list of routing segments is a second MPLS label list.
6. The method according to any of claims 1-4, wherein the first packet and the second packet are Internet protocol sixth version routing SRv6 packets, the first routing segment list is a first segment list, and the second routing segment list is a second segment list.
7. A ring network protection method is applied to a first node on a ring network, and comprises the following steps:
after a first transmission path fails, acquiring a first message including a first route segment list, wherein the first route segment list is used for indicating a second transmission path, the first transmission path and the second transmission path are two transmission paths with opposite transmission directions on the ring network, and the first transmission path and the second transmission path have the same head node and tail node;
and forwarding the first message.
8. The method according to claim 7, wherein the service corresponding to the first packet accesses the ring network through the first node.
9. The method according to claim 7 or 8, wherein prior to obtaining the first packet comprising the first list of route segments, the method further comprises:
and obtaining the first routing segment list according to a pre-stored corresponding relation between the first routing segment list and a second routing segment list, wherein the second routing segment list is used for indicating the first transmission path.
10. The method according to claim 7 or 8, wherein prior to obtaining the first packet comprising the first list of route segments, the method further comprises:
and obtaining the first routing segment list according to a pre-stored corresponding relationship between a first Binding Segment Identifier (BSID) and the first routing segment list, wherein the first BSID is used for indicating the first transmission path.
11. The method according to any of claims 7-10, wherein prior to obtaining the first packet comprising the first list of route segments, the method further comprises:
and receiving a ring protection switching RPS message.
12. The method of claim 11, wherein the receiving the ring protection switching RPS message when a link between the second node and the third node in the first transmission path fails comprises:
and receiving the RPS message sent by the second node to the third node.
13. The method according to any of claims 7-12, wherein the first packet is a multiprotocol label switching, MPLS, packet, and wherein the first list of routing segments is a first list of MPLS labels.
14. The method according to any of claims 7-12, wherein the first packet is an internet protocol sixth version routing SRv6 packet, and the first routing segment list is a first segment list.
15. A communications apparatus, configured to perform the method of any one of claims 1-14, the apparatus comprising:
a transceiver unit for implementing operations related to receiving and/or transmitting in the method of any one of claims 1 to 14;
a processing unit for performing operations other than said receiving and/or transmitting.
16. A communication device, comprising a memory and a processor;
the memory for storing program code;
the processor, configured to execute instructions in the program code to cause the communication device to perform the method of any of claims 1-15 above.
17. A computer-readable storage medium having stored therein instructions which, when run on a computer, cause the computer to perform the method of any one of claims 1-14 above.
18. A computer program product, characterized in that it comprises a program which, when run on a processor, implements the method of any one of claims 1-14.
CN202110253004.0A 2021-03-08 2021-03-08 Ring network protection method and device Pending CN115134283A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110253004.0A CN115134283A (en) 2021-03-08 2021-03-08 Ring network protection method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110253004.0A CN115134283A (en) 2021-03-08 2021-03-08 Ring network protection method and device

Publications (1)

Publication Number Publication Date
CN115134283A true CN115134283A (en) 2022-09-30

Family

ID=83374512

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110253004.0A Pending CN115134283A (en) 2021-03-08 2021-03-08 Ring network protection method and device

Country Status (1)

Country Link
CN (1) CN115134283A (en)

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102014011A (en) * 2009-09-04 2011-04-13 中兴通讯股份有限公司 Method and system for protecting looped network
CN104426700A (en) * 2013-09-06 2015-03-18 华为技术有限公司 Network element and ring network protection method
CN105282028A (en) * 2014-06-05 2016-01-27 中兴通讯股份有限公司 Message transmission method, nodes and path management servers
WO2016184127A1 (en) * 2015-05-15 2016-11-24 中兴通讯股份有限公司 Packet processing method and device
CN107666436A (en) * 2016-07-27 2018-02-06 中兴通讯股份有限公司 Message forwarding method and device
CN109218200A (en) * 2018-11-26 2019-01-15 新华三技术有限公司 A kind of message processing method and device
CN109561021A (en) * 2017-09-25 2019-04-02 华为技术有限公司 A kind of method and the network equipment of message forwarding
CN110086712A (en) * 2019-05-13 2019-08-02 何梓菁 A kind of link protection method and Point of Local Repair based on the tunnel SR-TE
CN110120914A (en) * 2019-05-13 2019-08-13 何梓菁 A kind of node protection method and Point of Local Repair based on the tunnel SR-TE
WO2020049577A1 (en) * 2018-09-07 2020-03-12 Telefonaktiebolaget Lm Ericsson (Publ) Network node, first node, second node and methods performed thereby for routing a packet through a path

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102014011A (en) * 2009-09-04 2011-04-13 中兴通讯股份有限公司 Method and system for protecting looped network
CN104426700A (en) * 2013-09-06 2015-03-18 华为技术有限公司 Network element and ring network protection method
CN105282028A (en) * 2014-06-05 2016-01-27 中兴通讯股份有限公司 Message transmission method, nodes and path management servers
WO2016184127A1 (en) * 2015-05-15 2016-11-24 中兴通讯股份有限公司 Packet processing method and device
CN107666436A (en) * 2016-07-27 2018-02-06 中兴通讯股份有限公司 Message forwarding method and device
CN109561021A (en) * 2017-09-25 2019-04-02 华为技术有限公司 A kind of method and the network equipment of message forwarding
WO2020049577A1 (en) * 2018-09-07 2020-03-12 Telefonaktiebolaget Lm Ericsson (Publ) Network node, first node, second node and methods performed thereby for routing a packet through a path
CN109218200A (en) * 2018-11-26 2019-01-15 新华三技术有限公司 A kind of message processing method and device
CN110086712A (en) * 2019-05-13 2019-08-02 何梓菁 A kind of link protection method and Point of Local Repair based on the tunnel SR-TE
CN110120914A (en) * 2019-05-13 2019-08-13 何梓菁 A kind of node protection method and Point of Local Repair based on the tunnel SR-TE

Similar Documents

Publication Publication Date Title
CN108337157B (en) Method and node for transmitting message in network
US10972391B2 (en) Full-path validation in segment routing
CN109873760B (en) Method and device for processing route, and method and device for data transmission
JP7479490B2 (en) Packet processing method and apparatus, network device, and storage medium
CN109861913B (en) Method and device for advertising prefix identification of cross-interior gateway protocol
US10439880B2 (en) Loop-free convergence in communication networks
EP2436152B1 (en) Failure localisation in a mpls-tp network
US7936667B2 (en) Building backup tunnels for fast reroute in communications networks
JP6443864B2 (en) Method, apparatus and system for implementing packet loss detection
CN115987754A (en) Network communication method and device
CN113132223A (en) Fault detection method and equipment
CN113872843B (en) Route generation method, route processing method and device
CN115134283A (en) Ring network protection method and device
CN115883452A (en) Communication method and communication device
US9794168B2 (en) Scalable continuity test for a group of communication paths
US20230379246A1 (en) Method and Apparatus for Performing Protection Switching in Segment Routing SR Network
WO2022222884A1 (en) Failure sensing method, apparatus and system for forwarding path
CN114915538A (en) Fault detection method, network device and system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination