WO2020001309A1 - 一种传输路径故障的处理方法、装置及系统 - Google Patents

一种传输路径故障的处理方法、装置及系统 Download PDF

Info

Publication number
WO2020001309A1
WO2020001309A1 PCT/CN2019/091512 CN2019091512W WO2020001309A1 WO 2020001309 A1 WO2020001309 A1 WO 2020001309A1 CN 2019091512 W CN2019091512 W CN 2019091512W WO 2020001309 A1 WO2020001309 A1 WO 2020001309A1
Authority
WO
WIPO (PCT)
Prior art keywords
label
network device
node
adhesion
message
Prior art date
Application number
PCT/CN2019/091512
Other languages
English (en)
French (fr)
Inventor
胡志波
姚俊达
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to JP2020572767A priority Critical patent/JP7130784B2/ja
Priority to KR1020237002163A priority patent/KR102589957B1/ko
Priority to KR1020207037821A priority patent/KR102491583B1/ko
Priority to EP19824831.2A priority patent/EP3731469A4/en
Publication of WO2020001309A1 publication Critical patent/WO2020001309A1/zh
Priority to US16/997,293 priority patent/US11888732B2/en
Priority to JP2022133290A priority patent/JP7387836B2/ja
Priority to US18/536,967 priority patent/US20240113965A1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/22—Alternate routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H04L45/507—Label distribution
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H04L45/745—Address table lookup; Address filtering
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H04L45/745—Address table lookup; Address filtering
    • H04L45/748—Address table lookup; Address filtering using longest matching prefix

Definitions

  • the present application relates to the field of communication technologies, and in particular, to a method, a device, and a system for processing a transmission path fault.
  • Segment routing-traffic engineering is a new type of multi-protocol that uses interior gateway protocol (IGP) or border gateway protocol (BGP) protocol as control signaling.
  • Multiprotocol label switching (MPLS) TE tunneling technology The controller is responsible for calculating the forwarding path of the tunnel and delivering the label stack strictly corresponding to the path to the forwarder.
  • the repeater At the head node of the SR-TE tunnel, the repeater can control the transmission path of the message in the network according to the label stack.
  • the backup path is currently used to forward packets based on fast reroute (FRR) technology.
  • FRR fast reroute
  • the previous hop node of the sticky node determines that the sticky node has failed, the previous hop node needs to determine a backup path to bypass the sticky node. , But the previous hop node cannot handle the sticky label, which will cause the forwarding of the packet to fail.
  • the present application provides a method, a device, and a system for processing transmission path faults, which are used to solve the problem that the previous hop node of a faulty node in the prior art cannot handle sticky labels and fails to forward packets.
  • an embodiment of the present application provides a method for processing a transmission path failure, including: a first network device receiving an adhesion label sent by an adhesion network device, and a list of adhesion label stacks corresponding to the adhesion label; the first In the process of sending a message through the main path, the network device determines that the stuck network device is faulty; wherein the message includes a label stack list for guiding the message to be forwarded on the main path, so that The sticky network device is a next-hop network device of the first network device on the main path; the first network device exchanges the sticky label in the tag stack list to the sticky label stack list, and Switching the message to a backup path for sending based on the updated label stack list.
  • the adhesion network device publishes the adhesion label and the adhesion label stack to the entire network, so that after learning the previous hop network device of the adhesion network device, the adhesion label in the label stack list is exchanged for all
  • the list of sticky label stacks is described, and the message is switched to the backup path for transmission based on the updated label stack list to avoid data packets caused by the previous hop network device being unable to switch to the backup path due to the inability to process the sticky label. Forwarding failed.
  • the method further includes: the first network device adds the adhesion label and the corresponding The list of stuck label stacks is stored in a label information table generated by the first network device for the stuck network device; the first network device exchanges the stuck labels in the label stack list with the stuck label stack list And switching the updated message to a backup path for sending, including: the first network device obtaining a first label from a top of the label stack list, where the first label is used to instruct forwarding the The next-hop network device of the message is the connected network device; the first network device determines a first forwarding behavior corresponding to the first label based on a backup forwarding table; the backup forwarding table is used to indicate the backup path The first forwarding behavior is used to instruct to find the label information table; the first network device determines that it is located in the sticky label stack based on the label information table A second label at the top
  • the adhesive label and the corresponding adhesive label stack list are stored in a label information table generated by the first network device for the adhesive network device, which facilitates searching and saves time.
  • the first network device receiving the adhesion label sent by the adhesion network device and the adhesion label stack list corresponding to the adhesion label include: the first network device receives the content of the tag length sent by the adhesion network device TLV, where the TLV includes the adhesion tag and a list of adhesion tag stacks corresponding to the adhesion tag.
  • the TLV is a label binding SID / LabelBinding TLV.
  • the method further includes: after receiving the node segment identifier of the third network device that the connected network device floods in the network, the first network device sends the information to another network device.
  • the network device floods the node segment identifier of the third network device.
  • the destination network device (adhesive network device) of the loose path segment fails, the fault information of the network device is flooded to the entire network, and all network devices on the entire network will Delete the corresponding master-backup forwarding table to the connected network device.
  • the primary path and the backup path from the first network device to the last network device, need to pass through the loose path segment and need to bypass the stuck network device from the previous hop network device of the stuck network device to reach the tail network device.
  • the source network device in this path segment cannot delete the primary and backup forwarding tables of the attached network device, it cannot forward the data packet to the previous hop network device of the attached network device, which will cause the forwarding of the packet to fail. Therefore, through the above design, after the previous hop network device of the destination network device of the loose path segment receives the node segment identification of the destination network device of the loose path segment, the node segment identification of the destination network device is flooded throughout the entire network. Therefore, the source network device of the loose path segment can determine the forwarding path and forward the data packet according to the node segment identifier of the destination network device.
  • the method further includes: when the first network device sends a message through a backup path, the first network device receives instruction information sent by the stuck network device after a fault recovery, the instruction The information is used to indicate that the connected network device cannot forward a message correctly, and the first network device continues to send a message through the backup path.
  • the network device switches to the backup path to forward packets.
  • the failover node will re-flood its own node (prefix) label and adjacent label information to other nodes in the network.
  • the network device After receiving the flooding information from the fault recovery node, the network device switches the data packet back to the main path, that is, the packet is transmitted again through the fault recovery node.
  • the local database may be incomplete. For example, no other nodes have been learned, such as the node label and adjacency label of the next hop node of the stuck node on the main path.
  • the adhesive network device preferentially sends instruction information to indicate its previous hop network device after recovery.
  • the recovered adhesive network device is still unable to positively forward the packet, so the previous hop network device still passes the backup path. To forward data packets.
  • an embodiment of the present application provides a method for processing a transmission path fault, which includes: an adhesion network device receives an adhesion label sent by a controller, and a list of adhesion label stacks corresponding to the adhesion label; Other network devices in the network flood the sticky label and a list of sticky label stacks corresponding to the sticky label.
  • the adhesion network device publishes the adhesion label and the adhesion label stack to the entire network, so that after learning the previous hop network device of the adhesion network device, the adhesion label in the label stack list is exchanged for all
  • the list of sticky label stacks is described, and the message is switched to the backup path for transmission based on the updated label stack list to avoid data packets caused by the previous hop network device being unable to switch to the backup path due to the inability to process the sticky label. Forwarding failed.
  • an embodiment of the present application provides a device for processing a transmission path failure, and the device is applied to the first network device described in the first aspect, that is,
  • the device may be a first network device or a chip that can be applied to the first network device.
  • the device has the functions of implementing the embodiments of the first aspect described above. This function can be realized by hardware, and can also be implemented by hardware executing corresponding software.
  • the hardware or software includes one or more modules corresponding to the above functions.
  • an embodiment of the present application provides a device for processing a transmission path failure, where the device is applied to the network device described in the second aspect, that is, the device
  • the device may be a network device or a chip that can be applied to a network device.
  • the device has the functions of implementing the embodiments of the second aspect described above. This function can be realized by hardware, and can also be implemented by hardware executing corresponding software.
  • the hardware or software includes one or more modules corresponding to the above functions.
  • an embodiment of the present application provides a processing apparatus for processing a transmission path failure, including: a processor and a memory; the memory is used to store instructions; when the apparatus is running, the processor executes the instructions stored in the memory to The apparatus is caused to execute the method for processing a transmission path failure in the first aspect or any implementation method of the first aspect.
  • the memory may be integrated in the processor, or may be independent of the processor.
  • the device may also include a bus.
  • the processor is coupled to the memory through a bus.
  • the memory may include a readable memory and a random access memory.
  • the device When the device needs to be run, it is started by the bootloader booting system in the basic input-output system or embedded system that is solidified in the read-only memory, and the booting device enters the normal operating state. After the device enters a normal operating state, an application program and an operating system are run in the random access memory, so that the processor executes the first aspect or any possible implementation design method in the first aspect.
  • an embodiment of the present application provides a processing apparatus for processing a transmission path failure, including: a processor and a memory; the memory is configured to store instructions, and when the apparatus is running, the processor executes the instructions stored in the memory to The apparatus is caused to execute the method for processing a transmission path failure in the second aspect or any implementation method of the second aspect.
  • the memory may be integrated in the processor, or may be independent of the processor.
  • the device may also include a bus.
  • the processor is coupled to the memory through a bus.
  • the memory may include a readable memory and a random access memory.
  • the device When the device needs to be run, it is started by the bootloader booting system in the basic input-output system or embedded system that is solidified in the read-only memory, and the booting device enters the normal operating state. After the device enters a normal operating state, an application program and an operating system are run in the random access memory, so that the processor executes the second aspect or any possible implementation design method in the second aspect.
  • an embodiment of the present application further provides a system, including the device described in the third or fifth aspect, and the device described in the fourth or sixth aspect.
  • the system may further include other network devices that interact with the two types of network devices in the solution provided in the embodiments of the present application, such as other network devices on a transmission path.
  • an embodiment of the present application further provides a readable storage medium, where the readable storage medium stores a program or an instruction, and when the program or the instruction is run on a computer, processing of any transmission path failure in the foregoing aspects is handled. The method is executed.
  • an embodiment of the present application further provides a computer program product containing instructions that, when run on a computer, causes the computer to execute a method for processing any transmission path failure in each of the above aspects.
  • FIG. 1A is a schematic diagram of a network architecture according to an embodiment of the present application.
  • FIG. 1B is a schematic diagram of another network architecture according to an embodiment of the present application.
  • FIG. 2 is a flowchart of a method for processing a transmission path fault according to an embodiment of the present application
  • FIG. 3 is a schematic flowchart of a method for processing a transmission path fault according to an embodiment of the present application
  • FIG. 4 is a schematic diagram of a Binding TLV format provided by an embodiment of the present application.
  • FIG. 5 is a schematic flowchart of another method for processing a transmission path fault according to an embodiment of the present application.
  • mapping TLV format provided by an embodiment of the present application.
  • FIG. 7 is a schematic diagram of a Flags format provided by an embodiment of the present application.
  • FIG. 8 is a schematic structural diagram of a device 800 according to an embodiment of the present application.
  • FIG. 9 is a schematic structural diagram of a network device 900 according to an embodiment of the present application.
  • a node may also be referred to as a network device.
  • a network device is a device that provides a routing and forwarding function in a network.
  • the node may be a router, a switch, a repeater, or a label switching router (LSR). No restrictions. In the subsequent description process, a node is used as an example for description.
  • control plane uses the link-state-based IGP protocol or border gateway protocol (BGP) to distribute MPLS labels for nodes.
  • BGP border gateway protocol
  • the data plane performs MPLS packets based on the labels distributed by the control plane Forward.
  • SR-TE Segment Routing-Traffic Engineering
  • IGP interior gateway protocol
  • BGP border gateway protocol
  • the controller is responsible for calculating the forwarding path of the tunnel and delivering the label stack list strictly corresponding to the path to the forwarder.
  • the repeater can control the transmission path of the packet in the network according to the label stack list.
  • SRGB Segment global block
  • Segment which is identified by a segment label (Segment ID, SID).
  • SID Segment ID
  • the segment label in the embodiment of the present application may be referred to as a segment identification.
  • SIDs can be mapped to MPLS labels at the forwarding level.
  • prefix segments There are three types of segments, namely, prefix segments, adjacency segments, and node segments.
  • a prefix segment is used to identify a destination address prefix in the SR network.
  • Prefix segments can be diffused to other network elements through the IGP protocol. They are globally visible and globally effective.
  • Prefix Segments are marked by a prefix segment ID (Prefix Segment ID, Prefix SID).
  • the prefix segment label is simply referred to as a prefix label.
  • Prefix SID is the offset value in the SRGB range issued by the destination node. The receiving end will calculate the actual label based on its SRGB.
  • the adjacency segment is used to identify the routing link of two adjacent nodes in the network.
  • Adjacency Segments spread to other network elements through the IGP protocol. They are globally visible and locally valid.
  • Adjacency Segment uses Adjacency Segment ID (Adjacency, SID).
  • Adjacency, SID Adjacency, SID
  • the adjacent segment label is simply referred to as an adjacent label.
  • the adjacency label has certain directionality and is used to guide packet forwarding.
  • the adjacency label 9003 corresponds to the link PE1-> P3.
  • Adjacency SID is a local SID outside the SRGB range.
  • Node segment is a special Prefix segment, which is used to identify a specific node. Configure the IP address as the prefix on the local loopback interface of the node.
  • the PrefixSID of this node is actually the NodeSID.
  • a node segment label may be simply referred to as a node label.
  • Prefix Segment represents the destination address
  • Adjacency Segment represents the outgoing link of the data packet, which can be similar to the destination IP address and outbound interface in traditional IP forwarding, respectively.
  • nodes use the extended IGP protocol to flood their Node SID and Adjacency SID, so that any node can obtain information about other nodes.
  • any path in the network can be constructed.
  • a path in a network can consist of multiple routing segments.
  • the constructed path is represented by a list of tag stacks.
  • the label stack list includes the segment label (Segment ID) corresponding to each routing segment on the forwarding path.
  • the destination node uses its own node (prefix) SID of the IGP protocol, the forwarding node parses the node SID, and calculates the label value according to its own SRGB. After that, each node uses the topology information collected by the IGP protocol to calculate the label forwarding path according to the shortest path algorithm, and sends the calculated next hop and OuterLabel information to the forwarding table to guide the data packet forwarding.
  • prefix SID of the IGP protocol
  • the forwarding node parses the node SID, and calculates the label value according to its own SRGB.
  • each node uses the topology information collected by the IGP protocol to calculate the label forwarding path according to the shortest path algorithm, and sends the calculated next hop and OuterLabel information to the forwarding table to guide the data packet forwarding.
  • a label stack list cannot carry segment labels for the entire path.
  • the controller needs to allocate multiple label stack lists to the repeater and issue labels at appropriate nodes.
  • a special label is allocated at the same time as the stack list, and then these label stack lists are associated to realize segment-by-segment forwarding.
  • This special label is called a sticky label, and this suitable node is called a sticky node.
  • the controller assigns the sticky label to the sticky node and pushes it to the bottom of the label stack list.
  • the sticky label is replaced with a new label stack according to the association between the sticky label and the label stack list List, continue to guide the next paragraph forward.
  • the label stack list in the embodiments of the present application is referred to as a label stack for short, and a label stack corresponding to an adhesive label is referred to as an adhesive label stack.
  • a plurality in the embodiments of the present application refers to two or more than two.
  • "And / or” describes the association relationship between related objects and indicates that there can be three types of relationships. For example, A and / or B can indicate that there are three cases in which A exists alone, A and B exist, and B exists alone.
  • the terms “first” and “second” are used only for the purpose of distinguishing descriptions, and cannot be understood as indicating or implying relative importance, nor as indicating Or imply order.
  • Node 1 or node 2 is also only used to distinguish the described nodes, and cannot be understood as indicating or implying the relative importance, nor can it be understood as indicating or implying the order.
  • the forwarding tables involved in the embodiments of the present application may generally include only the main forwarding table, or may include the main forwarding table and the backup forwarding table.
  • the active-standby forwarding table involved in the embodiments of the present application includes a main forwarding table and a standby forwarding table.
  • FIG. 1A the creation of a segment path of a prefix segment and the forwarding of data packets are described.
  • the path of the prefix segment to be established is RT1, RT2, RT3, RT4, and RT5.
  • RT1 is the first node of the prefix segment
  • RT5 is the destination node of the prefix segment.
  • Configure SRGB [5000-5999] on RT5, set Prefix (node) SID to 5 on the Loopback interface of RT5, and RT5 generates and delivers forwarding entries based on SRGB and Prefix (node) SID.
  • RT5 then encapsulates SRGB and Prefix SID into control messages, and diffuses the control messages to the entire network through IGP.
  • other network devices in the network parse the Prefix SID issued by RT5, calculate the label value based on their SRGB, and calculate the label value (OuterLabel) based on the SRGB issued by the next hop node, and use IGP topology to calculate the label.
  • the forwarding path then generates a forwarding entry corresponding to the incoming label value.
  • the RT1 node receives the data packet, adds the tag value 2005, and forwards it.
  • the RT2 node receives the data packet carrying the label, performs label exchange, pops the label 2005, and replaces it with the label 3005.
  • the RT3 node receives the label message, performs label exchange, ejects the label 3005, and replaces it with the label 4004.
  • the RT4 node ejects the label 4005 and replaces it with the label 5005.
  • the RT5 node pops up the label 5005 and continues to check the routing and forwarding.
  • FIG. 1B uses FIG. 1B as an example to describe the creation of a strict segment path (cross-node is not allowed) and the forwarding of data packets.
  • the forwarder allocates adjacency labels based on the IGP protocol and reports the assigned adjacency labels to the controller, so that the controller generates a label stack list based on the adjacency labels.
  • Adjacent labels are flooded to the entire network through the IGP protocol.
  • Figure 1B taking the RT1 node as an example, the specific process of the IGP protocol to assign adjacent labels is as follows:
  • RT1 applies local dynamic labels for all its links through the IGP protocol (for example: RT1 assigns adjacency labels 1031 for links RT1-> RT2).
  • RT1 advertises adjacency labels through the IGP protocol and floods the entire network.
  • Other devices on the network learn the adjacency labels issued by RT1 through the IGP protocol. Specifically, other nodes allocate and publish adjacency labels in the manner of RT1, and flood them to other devices in the network.
  • the controller performs path calculation based on the SR-TE's tunnel constraint attributes.
  • the calculated path integrates adjacent labels of the entire path together based on the topology and adjacent labels to generate a label stack list.
  • the controller calculates the SR-TE tunnel path as RT1-> RT2-> RT3-> RT4-> RT5, and the corresponding tag stack list is ⁇ 1031,1032,1034,1035 ⁇ , and the controller passes The calculated label stack list is delivered to the repeater ingress node RT1.
  • the repeater obtains the SR-TE tunnel according to the label stack list issued by the controller.
  • a node stack may also be used to form a label stack list, that is, the label stack list is ⁇ 1002, 2003, 3004, 4005 ⁇ .
  • the forwarder performs label operations on the packets according to the label stack list corresponding to the SR-TE tunnel, and searches for the forwarding outbound interface hop by hop according to the label on the top of the stack to guide the data packets to the tunnel destination address.
  • the ingress node When a message enters the SR-TE tunnel, the ingress node inserts a list of label stacks in the message; when the message is forwarded in the SR-TE tunnel, it looks for the forwarding outbound interface according to the label at the top of the stack, and then the label at the top of the stack Peel off. For example, as shown in FIG. 1B, the ingress node PE1 adds a label stack list ⁇ 1031, 1032, 1034, 1035 ⁇ to the data packet, and then matches the link according to the label 1031 on the top of the stack, and finds the corresponding forwarding outbound interface as RT1-> RT2 link, then eject the label 1031.
  • the packet carries the label stack ⁇ 1032, 1034, 1035 ⁇ and is forwarded to the next hop node RT2 through the RT1-> RT2 link.
  • the intermediate node RT2 matches the link according to the label 1032 on the top of the stack, finds the corresponding forwarding outbound interface as RT2-> RT3 link, and then pops up the label 1032, and so on.
  • the node RT3 receives the message, , Continue to forward in the same way as the intermediate node RT3.
  • node RT4 pops up the last label 1035
  • the data packet is forwarded to node RT5.
  • the packet received by the egress node RT5 has no label and is forwarded by searching the routing table.
  • a node label across the nodes can be specified, and the controller sends the label stack to the head node of the repeater.
  • the repeater A hop pop-up label is found on the outbound interface to direct data packets to be forwarded to the tunnel destination address.
  • the paths of RT1-RT5 specify the nodes that need to pass through: RT3 and RT4.
  • a loose path is formed between RT1-RT3, which can be forwarded through RT2 or RT6.
  • the list of label stacks used to forward messages on RT1 is ⁇ 2003,3004,4005 ⁇ .
  • node R2 is a faulty node.
  • the forwarding path identified by the label stack of SR-TE is: RT1-> RT2-> RT3-> RT4-> RT5.
  • the neighbor node RT1 of the node RT2 performs a pop-up (POP) action instead of the node RT2, and uses the next layer label as the destination address, and the path bypassing the failed node RT2 is used as a backup path for data packets. Forward.
  • the backup path is: RT1-> RT6-> RT3-> RT4-> RT5.
  • the list of label stacks for data packets sent by RT1 is ⁇ 1002,2003,3004,4005 ⁇ .
  • RT1 can check the label stack's top label 1002 to determine that the RT2 node is a faulty node, and then check the label stack's top label.
  • 1002 and the second label 2003 determine that the node that needs to be reached by the path behind the failed node is RT3.
  • RT1 calculates the path that bypasses the failed node RT2 to reach the node identified by the second label 2003 (ie, RT3) as the node protection path for the SR-TE FRR of the next hop node RT2.
  • each node calculates the backup forwarding table and label information table (Context table) in advance through IGP.
  • Each node generates a context table and a master-slave forwarding table for its neighbors.
  • the context table includes the number of neighbors * (node (prefix) labels of all nodes in the entire network and all adjacency labels issued by neighbor nodes), and each neighbor node corresponds to a context entry.
  • the node RT1 generates a context entry corresponding to RT2 for its neighbor node RT2, and the context entry contains the node (prefix) label information of all nodes in the entire network and the adjacency label issued by RT2.
  • the node (prefix) label information corresponding to each node in all nodes in the entire network is the sum of the node label of the node and the initial value of SRGB of the RT2 node.
  • the previous hop node of the faulty node determines the backup path through the Context table and the master-backup forwarding table, and forwards data packets through the backup path.
  • the previous hop node of the node in the main path detects the failure, and the previous hop node will The node's fault information is flooded to other nodes in the network.
  • the previous hop node of the sticky node determines that the sticky node has failed, the previous hop node needs to determine a backup path to bypass the sticky label.
  • the sticky label stack corresponding to the sticky label is only known by the sticky node and the previous hop node is not known, the previous hop node cannot handle the sticky label.
  • an embodiment of the present application provides a method for processing a transmission path fault. As shown in FIG. 2, the method includes:
  • the adhesion node receives the adhesion label sent by the controller and a list of adhesion label stacks corresponding to the adhesion label.
  • the adhesion node floods the adhesion label to other nodes in the network, and a list of adhesion label stacks corresponding to the adhesion label.
  • the first node receives the adhesion label sent by the adhesion node and a list of adhesion label stacks corresponding to the adhesion label.
  • the first node determines that the stuck node has failed
  • the message includes a label stack list for guiding the message to be forwarded on the main path, and the adhesion node is a next hop node of the first node on the main path;
  • the first node exchanges the adhesion label in the label stack list to the adhesion label stack list, and switches the message to a backup path for sending based on the updated label stack list.
  • the first node After the first node receives the adhesion label sent by the adhesion node and the adhesion label stack list corresponding to the adhesion label, the first node adds the adhesion label and the corresponding adhesion label stack list. And stored in a label information table generated by the first node for the adhesion node.
  • the first node exchanges the sticky label in the tag stack list to the sticky label stack list, and switches the updated message to a backup path for sending, which can be implemented in the following manner:
  • the first node obtains a first label from the top of the label stack list, where the first label is used to indicate that a next hop node that forwards the message is the sticky node; the first node is based on a backup
  • the forwarding table determines a first forwarding behavior corresponding to the first label; the backup forwarding table is used to indicate the backup path; the first forwarding behavior is used to instruct to find the label information table; the first node is based on
  • the label information table determines a second label located at the top of the adhesion label stack list stack, where the second label is used to indicate that the next hop node of the adhesion node is the third node on the main path;
  • the first node uses the second label as an incoming label, and determines an outgoing label of a backup path from the first node to the third node from the backup forwarding table; the first node is based on the outgoing label.
  • the tag sends the message to a next hop node of the first node on the backup path.
  • the first node receiving the adhesion label sent by the adhesion node and the adhesion label stack list corresponding to the adhesion label include: the first node receives the tag length content TLV sent by the adhesion node, and The TLV includes the adhesion tag and a list of adhesion tag stacks corresponding to the adhesion tag.
  • the TLV may be a label binding SID / LabelBinding TLV.
  • the method further includes: when the first node determines that the stuck node has failed after receiving the node segment identifier of the third node flooded by the stuck node in the network, , Flooding the node segment identifier of the third node to other nodes in the network.
  • the method further includes: when the first node sends a message through a backup path, the first node receives instruction information sent by the stuck node after a fault recovery, and the instruction information is used for Indicating that the stuck node cannot forward a message correctly, and the first node continues to send a message through the backup path.
  • RT2 may be a first node in the embodiment shown in FIG. 2
  • RT3 may be a sticky node in the embodiment shown in FIG. 2.
  • the controller calculates the transmission path based on the SR-TE's tunnel constraint attributes, which can be either a strict path or a loose path.
  • the controller integrates the adjacent labels (and / or node labels) of the transmission path together according to the topology and the adjacent labels (and / or node labels) to generate a label stack to send to the first node of the transmission path.
  • the controller needs to divide the entire path into multiple label stacks to carry.
  • the contiguous label stack may be an adjacent label, or of course, a node label.
  • the contiguous label stack uses adjacent labels as an example.
  • the paths of RT1-RT5 specify the nodes that need to pass through: RT3 and RT4.
  • a loose path is formed between RT1-RT3, which can be forwarded through RT2 or RT6.
  • the controller calculates the SR-TE tunnel path as RT1 ---> RT3-> RT4-> RT5, corresponding to two tag stacks, ⁇ 1003,100 ⁇ and ⁇ 1034,1035 ⁇ , where 100 is the sticky tag and 1034 1035 is an adjacency label, 1003 is a node label of RT3 and an SRGB initial value of RT1 is calculated.
  • the controller sends the label stack to the corresponding repeater.
  • the controller will allocate the adhesion tag, and send the adhesion tag and the adhesion tag stack ⁇ 100: 1034,1035 ⁇ corresponding to the adhesion tag to the adhesion node RT3.
  • the controller uses the sticky tag 100 as the bottom of the tag stack on RT1.
  • the controller delivers the label stack ⁇ 1003,100 ⁇ to the first node RT1.
  • the determined main path is RT1-> RT2-> RT3-> RT4-> RT5.
  • RT1 determines that the main path passes through RT2, so that the outer label (top label) 1003 of the label stack included in the data message is exchanged for 2003 (node label of RT3 + SRGB initial value of RT2), and the updated data The message is sent to RT2.
  • RT2 receives the data packet sent by RT1, exchanges the top label of the stack to 3003, and sends it to RT3.
  • RT3 pops the top label after receiving it, and then exchanges the top label 100 in the updated label stack list with ⁇ 1034,1045 ⁇ .
  • the next-hop node is determined as RT4 according to the top-of-stack label 1034.
  • RT4 determines the next-hop node as RT5 according to the top-of-stack label 1035. After the label 1035 pops up, it sends the updated data message to RT5.
  • the sticky node RT3 fails, the previous hop node RT2 cannot process the sticky label in the label stack, which causes data packet forwarding failure.
  • the embodiment of the present application provides a transmission path failure processing scheme.
  • the adhesion node When the adhesion node receives the adhesion label and the adhesion label stack corresponding to the adhesion label sent by the controller, the adhesion node will stack the adhesion label and the adhesion label stack corresponding to the adhesion label. Publish to the entire network.
  • the adhesion tag and the binding TLV that the adhesion tag stack may include are published to the entire network.
  • Adhesive node RT3 uses Binding TLV, publishes the adhesive label (Binding ID) and the corresponding adhesive label stack ⁇ 100: 1034,1045 ⁇ . You can add several SID / Lable sub-TLVs based on the existing definition of Binding TLV. Fill in the specific adhesive label and the adhesive label stack corresponding to the adhesive label). For the specific Binding TLV format, see Figure 4.
  • RT2 may store the adhesion tag and its corresponding adhesion tag stack in the Context table. See Table 1 for the contents of the Context entries corresponding to RT3 in the Context table.
  • the input tag is used as the key value field of the Context table lookup table.
  • the local sid includes an adjacency tag (Adj) and an adhesion tag issued by RT3.
  • Adj, Sid indicates the adjacency label issued by the neighbor node.
  • the adjacency label issued by RT3 is the adjacency label 1034 of the link between RT3 and RT4, the adjacency label of the link between RT3 and RT7, and the link between RT3 and RT6 Adjacency label 1036.
  • Action which represents the forwarding action corresponding to the Local ID or the SID of the Adj node.
  • the paths RT1-RT5 specify the nodes that need to pass through: RT3, RT4.
  • a loose path is formed between RT1-RT3, which can be forwarded through RT2 or RT6.
  • the determined main path is RT1-> RT2-> RT3-> RT4-> RT5.
  • the tag stack received by RT1 from the controller is ⁇ 1003,100 ⁇ .
  • the backup path is RT1-> RT2-> RT7-> RT4-> RT5.
  • RT2 will generate a master-slave forwarding table for the Sid of the entire network. See Table 2 for the contents of the master and backup forwarding tables. Figure 2 shows only part of the contents of the two entries with 2003 and 2004 entry tags.
  • RT1 will determine that RT1's next hop node is RT2, so that RT1 exchanges the top label 1003 of the label stack for 2003 and adds it to the data packet and sends it to RT2.
  • RT2 determines that the next-hop node RT3 indicated by the top label of the data stack is faulty according to the top label 2003 of the label stack of the data packet.
  • RT2 is to find the next node that bypasses RT3 to RT3. Forwarding path of one hop node RT4.
  • the backup forwarding table (Table 2) is searched, and the forwarding entry corresponding to the incoming label 2003 is found.
  • the forwarding behavior indicated in the forwarding entry is pop-up label 2003, and RT2 is generated for the neighbor node RT3.
  • Context table After RT2 popped the top-of-stack label 2003, it was determined that the top-of-stack label of the label stack list was a sticky label. According to the LocalSid of the Context table using the sticky label 100, the forwarding entry corresponding to the incoming label 2003 was found.
  • the forwarding behavior indicated in is the exchange for ⁇ 3004,4005 ⁇ .
  • RT2 exchanges the sticky label 100 to ⁇ 1034, 1035 ⁇ .
  • RT2 obtains the adjacency label of RT3 to RT4 as 1034, and continues to search the local sid record of the Context table according to the top label 1034.
  • the found forwarding behavior is to forward to RT4, and determines that the adj node label corresponding to RT4 is 2004, that is, it obtains RT2. This is the ingress label on RT2 for the route segment from the ingress node to the egress node on RT4.
  • the RT2 node exchanges 1034 to 2004, and uses 2004 as the incoming label to find the main forwarding table.
  • the next hop node found is RT3.
  • the forwarding behavior found by the label is forwarding to RT7, and the outgoing label is 7004, so that the RT2 node exchanges the top-of-stack label with the found outgoing label, that is, pops the top-of-stack label 2004, and exchanges it to 7004.
  • the label stack here is ⁇ 7004,1035 ⁇ , and forward the updated data message to RT7.
  • RT7 After RT7 receives the data packet, it determines that the next hop node is RT4 according to the top label 7004, so that the top label 7004 is exchanged to 4004, and the updated data packet is forwarded to RT4. Similarly, RT4 receives the data packet. After the text, the destination node indicated by the top-of-stack label is determined to be itself, the top-of-stack label is popped out, the next-hop node indicated by the top-of-stack label 1035 of the updated label stack is RT5, and the updated data message is sent to RT5.
  • the adhesion node publishes the adhesion label and the adhesion label stack to the entire network, so that after learning of the previous hop node of the adhesion node, the adhesion label in the label stack list is exchanged for the adhesion label.
  • Stack list and switching the message to the backup path based on the updated label stack list to avoid data packet forwarding failure caused by the previous hop node being unable to switch to the backup path due to the inability to handle the sticky label.
  • the SR-TE FRR scheme is that the node generates a Context table for each neighbor of the node. Therefore, the specification of the Context table is the number of nodes in the entire network + the number of neighbors of the neighbor node. Each node needs to generate a context table of the size of the number of neighbors * (the number of nodes in the entire network + the number of neighbors of the neighbor nodes).
  • the network When the network includes a large number of nodes, and the specifications of the Context table supported by some nodes are not sufficient to support the specifications of the number of neighbors * (the number of nodes in the entire network + the number of neighbors of neighbor nodes), it will result in the Context table generated by these nodes.
  • the content is incomplete, and a faulty node in the network may cause it to fail to switch to the correct backup path to forward packets.
  • an embodiment of the present application proposes a way to configure the Context table.
  • the node obtains the adjacency label issued by the neighbor node and the node label of the adjacent node through the IGP, and learns the SRGB of the neighbor node, it generates a Context table.
  • the Context table includes the adjacency labels issued by the neighbor nodes, the node label information of the neighbor nodes and its adjacent nodes, and the difference between the initial SRGB value of the node and the initial SRGB value of the neighbor node.
  • the node label information is the neighbor node's. The sum of the initial SRGB value and the node labels of the neighboring nodes and their adjacent nodes.
  • RT3 adjacent nodes include RT2, RT7, RT6, and RT4.
  • the initial SRGB value of RT2 is 2000
  • the initial SRGB value of RT2's neighbor RT3 is 3000. Therefore, the difference between the initial SRGB value of RT2 and the initial SRGB value of RT3 is -1000.
  • a node label is used as an example in the sticky label stack for description.
  • RT3 is the adhesion node, the adhesion label and the adhesion label stack corresponding to the adhesion label are ⁇ 100: 3004,4005 ⁇ .
  • RT2 may store the adhesion tag and its corresponding adhesion tag stack in an entry corresponding to the RT3 node in the Context table.
  • Table 3 shows the content of the entry corresponding to RT3 in the Context table, that is, the content of the entry whose label is 2003.
  • the SRGB difference is the initial SRGB value of this node-the initial SRGB value of the neighbor node.
  • FIG. 4 takes FIG. 4 as an example to describe the forwarding process of data packets in detail.
  • the path of the first node RT1- the tail node RT5 specifies the nodes that need to pass through: RT3 and RT4. At this time, a loose path is formed between RT1-RT3, which can be forwarded through RT2 or RT6.
  • the determined main path is RT1-> RT2-> RT3-> RT4-> RT5.
  • the list of label stacks used to forward packets on RT1 is ⁇ 1003,100 ⁇ . For example, if RT3 fails, the backup path is RT1-> RT2-> RT7-> RT4-> RT5.
  • RT2 will generate a master-slave forwarding table for the Sid of the entire network. Partial contents of the master-slave forwarding table can be shown in Table 4. FIG. 4 only shows a part of the contents of the two entries with the entry labels 2003 and 2004.
  • RT1 determines that RT1's next hop node is RT2, it exchanges the top label 1003 of the label stack with a label 2003 indicating RT2, and then carries the label stack in a data message.
  • RT2 receives the data packet sent by RT1.
  • the label stack in the data packet is ⁇ 2003,100 ⁇ , and the main forwarding table is looked up according to the top-of-stack label in the label stack. For example, lookup table 4 and the top-of-stack label are 2003.
  • RT3 was used as inlabel, and the found forwarding behavior was forwarded to RT3, so RT2 exchanged the top-of-stack label to 3003, that is, the top-of-stack label was exchanged to the initial SRGB value of the next hop node (the initial SRGB value of RT3) and the node of the destination node.
  • the tag (node tag of RT3) determines the tag value, and then forwards the updated data message to RT3.
  • the label stack in the data packet is ⁇ 3003,100 ⁇ . It is determined that the receiving node indicated by the top label of the stack is itself. Therefore, after popping the top label 3003, the top label is popped.
  • RT4 receives the data sent by RT3.
  • the label stack of the data message is ⁇ 3004,4005 ⁇ . It is determined that the top-of-stack label indicates that the receiving node is itself, so the top-of-stack label is popped up, and the next-hop node is determined to be RT5 according to the top-of-stack label 4005.
  • the top label exchange is 5005, and the updated data packet is forwarded to RT5.
  • the label stack of the data packet is ⁇ 5005 ⁇ . It is determined that the top label of the stack indicates that the receiving node is itself. Therefore, the top label of the stack is popped up, and the forwarding table is searched to continue forwarding.
  • RT2 determines the next hop node RT3 indicated by the label on the top of the stack according to the stack top label 2003 of the data packet.
  • RT2 fails, RT2 needs to find Bypass the forwarding path from RT3 to RT3's next hop node RT4.
  • the backup forwarding table (Table 3) is searched.
  • the forwarding behavior corresponding to the label 2003 in the backup forwarding table is to pop the top label 2003 and look up the context table generated by RT2 for the neighbor node RT3.
  • the top-of-stack label of the label stack list was an adhesion label
  • the adhesion label 100 was exchanged to ⁇ 3004, 4005 ⁇ .
  • the Context table in Table 3 the SRGB difference is -1000, and RT2 obtains the label from RT3 to the next hop node RT4, that is, the top label 3004, and uses the top of the stack to add the SRGB difference, that is, the label (3004) +
  • the SRGB difference (-1000) 2004, that is, to obtain the ingress label on RT2 for the route segment from RT2 as the ingress node to RT4 as the egress node.
  • the next hop node found is RT3. Due to the interface failure to RT3, switch to the backup path, search the backup forwarding table, and use 2004 as the incoming label to find the forwarding behavior. Forward to RT7, the outgoing label is 7004, so the RT2 node exchanges the top label of the stack with the found outgoing label, that is, pops the top label 3004, and exchanges it to 7004.
  • the label stack here is ⁇ 7004,4005 ⁇ and will be updated. The subsequent data packets are forwarded to RT7.
  • RT7 After RT7 receives the data packet, it determines that the next hop node is RT4 according to the top label 7004, so that the top label 7004 is exchanged to 4004, and the updated data packet is forwarded to RT4. Similarly, RT4 receives the data packet. After that, it is determined that the destination node indicated by the top label is itself, and the top label is popped up. The next hop node indicated by the top label 4005 of the updated label stack is RT5, and the top label 4005 is exchanged to 5005. And send the updated data message to RT5.
  • the previous hop node of the failed node generates the context table for the failed node and the primary-backup forwarding table is switched from the primary path to the backup path.
  • the top label of the stack searches the standby forwarding table, and determines that the forwarding behavior of the standby forwarding table is to look up the Context table, and then determine the next hop node on the backup path that needs to forward the packet according to the Context table. According to the publication, it is determined that the backup path is implemented by the Context table.
  • the SRGB difference value is sent to the forwarding plane node, only the Context table is required to determine the next hop node of the faulty node.
  • the standby forwarding table is queried again using the node label of the next hop node of the failed node, so the Context table does not need to include the node labels corresponding to all nodes , It only needs to include the label information corresponding to the neighboring node and its adjacent node, so as to avoid the forwarding message caused by insufficient entry capacity Fails and saves storage resources.
  • the destination node of the loose path is a sticky node.
  • the fault information of this node is flooded to the entire network. Will delete the corresponding active-standby forwarding table of the failed node.
  • the main path and the backup path, from the first node to the tail node need to pass through the loose path segment and need to bypass the failed node from the previous hop node of the failed node to reach the tail node.
  • the source node deletes the active and standby forwarding tables of the faulty node, it cannot forward data packets to the previous hop node of the faulty node, which will cause the forwarding of the packet to fail.
  • RT3 The nodes that the SR-TE path designated by RT1 passes through are RT3, RT4, and RT5.
  • RT2 detects the failure of RT3, and floods the fault of RT3 through IGP.
  • Information and trigger the SR-TE FRR switch, switch to the backup paths RT7, RT4, RT5, bypass the failure point RT3, when the RT3 failure information floods the nodes of the entire network, RT1 starts to converge, and will be deleted to the RT3 master Forwarding table, so RT1 cannot forward data packets to RT2.
  • an embodiment of the present application provides a method for processing a transmission path fault.
  • the previous hop node of the sticky node uses the IGP protocol to flood all the nodes of the entire network with the prefix (node) label of the sticky node.
  • the prefix label of the sticky node may be carried in Mapping TLV (Tag (Type) -Length-Value).
  • TLV In the definition of TLV, there are three fields, namely: label field (Type), length field (Length), and content field (Value). Value contains prefix labels for glued nodes.
  • Mapping TLV can also be called label binding TLV (SID / Label Binding TLV).
  • SID label binding TLV
  • FIG. 6 Exemplarily, the Mapping TLV format shown in FIG. 6 is taken as an example. Among them, Type indicates the type of the TLV, Length indicates the length of the control message, Flags indicates the flag bit, and RESERVED indicates the reserved bit, which is not currently used.
  • the Range field provides the ability of a specified address segment to be associated with the Prefix and SID segments. Prefix length indicates the length of the prefix, prefix indicates the forwarding equivalence class at the tail node of the advertisement path, and SubTLV indicates the sub- in MappingTLV used to carry the Prefix-SID. TLV.
  • the previous hop node may add an R field in Flags to indicate a re-issue flag, that is, the prefix label for the failed node is re-published by the previous hop node to the rest of the network. node.
  • Flags can be seen in Figure 7.
  • F represents the address family flag. If not set, it represents IPv4 prefix; if set, it represents IPv6 prefix.
  • M represents a mirroring environment flag. This flag is set if the announced SID is associated with a mirroring environment.
  • S indicates whether the SID / Label Binding TLV can be flooded in the entire routing domain. If set, it indicates that the TLV can be flooded in the entire routing domain. If it is not set, the SID / Label Binding TLV must not penetrate between levels.
  • D indicates that this flag must be set when the SID / Label Binding TLV penetrates from level-2 to level-1. Otherwise the flag must be cleared.
  • A represents an auxiliary mark.
  • Level is the concept of network layering in the Intermediate System-to-Intermediate System (IS-IS) routing protocol. The common area is called Level-1, and the backbone area is called Level-2.
  • RT2 determines that the stuck node RT3 is faulty, it floods the node labels of RT3 to the entire network.
  • RT2 switches to the backup path and continues forwarding after receiving the data message.
  • the way in which RT2 switches the backup path to forward packets can be in the form of an existing context table.
  • the manner of configuring the context table described above can also be used, which is not limited here. For a specific sending process, refer to the forwarding manner in the embodiment corresponding to FIG. 4, and details are not described herein again.
  • the previous hop node switches to the backup path to forward the message.
  • the stuck node will re-flood its own node (prefix) label, adjacency label and other information to other nodes in the network.
  • the previous hop node received the flooding information from the sticky node, it switched the data message back to the main path, that is, it retransmitted the message through the sticky node.
  • the local database may be incomplete. For example, the relevant information of other nodes has not been learned, such as the node label and adjacency label of the next hop node of the stuck node on the main path. In this case, After RT3 receives the message, it cannot forward the message to the next hop node, resulting in the loss of the data message.
  • the SR-TE paths designated by RT1 are RT3, RT4, and RT5.
  • RT3 fails, RT2 triggers the SR-TE FRR switch after detecting the failure of RT3 and switches to the backup paths RT7, RT4, and RT5. Therefore, bypass the failed node RT3.
  • RT3 recovers and the restart is complete, RT3 republishes the Node Sid to the entire network, and RT2 switches the data packet back to RT3.
  • its local database may not be complete. For example, the node Sids of RT4 and RT5 have not been learned, so that data packets cannot be forwarded to the next-hop node RT4 at RT3, and the packets are discarded.
  • an embodiment of the present application provides a method for processing a transmission path fault.
  • the stuck node is recovered and the restart is completed, in order to prevent the previous hop node of the restored stuck node from sensing that the stuck node is recovered, the restored stuck node does not learn the prefix SID of other nodes, resulting in data packet loss.
  • the first information is issued on the entire network.
  • the instruction information is used to indicate that the restored stuck node cannot forward the message correctly; therefore, when the previous hop node received the data message to be sent to the restored stuck node, it still Forwards data packets from the backup path.
  • the indication information may be carried in the Overload bit.
  • Overload is specified in the IS-IS routing protocol. If a node cannot complete all the link state data (LSDB), that is, the local storage is used to store the topology information of all nodes in the entire network, it will use a bit in the header of the link state data packet issued by itself to identify its incompleteness. The LSDB cannot forward packets correctly. This one-bit identification bit is called the Overload (OL) bit.
  • OL Overload
  • the node RT2 receives the Overload bit in the link state data packet issued by RT3, and senses that its next hop node RT3 is in the Overload state.
  • the Over state indicates that the restored sticky node cannot forward the message correctly. Therefore, the node RT2 continues to follow the SR-TE / FRR forwarding path before the fault recovery.
  • the way in which RT2 uses the backup path to forward data packets can be in the form of the existing context table. Of course, the above method of configuring the context table can also be used. This is not limited.
  • RT2 can use the Context table to forward data packets along the SR-TE FRR path (backup path).
  • an overload duration may be configured, and the RT2 uses a backup path to forward data packets within the duration.
  • RT3 completes the LSDB, it can publish a link state packet again on the entire network, and the header no longer includes the overload bit. After receiving the link state packet that does not include the overload bit, RT2 then switches back to the RT3 to forward the data packet.
  • an embodiment of the present application further provides an apparatus.
  • the apparatus 800 is applied to a network device.
  • the device 800 may include a receiving module 801, a processing module 802, and a sending module 803.
  • the apparatus 800 may specifically be a processor in a network device, or a chip or a chip system, or a functional module.
  • the processing module 802 is used to control and manage the actions of the device 800, the receiving module 801 is used to receive information or messages, the sending module 803 is used to send information or messages, and the processing module 802 is used to control the information received by the receiving module 801 Or the message is processed.
  • the processing module 802 may also be used to indicate a processing process involving a network device (such as a first node or RT2 or a sticky node or RT3) and / or other processes of the technical solution described in this application in any of the foregoing embodiments.
  • the apparatus may further include a storage module (not shown in FIG. 8), and the storage module is configured to store a Context table and a master-slave forwarding table.
  • the device 800 may be applied to a previous hop node of an adhesion node, such as the first node in the embodiment corresponding to FIG. 2 or RT2 in the embodiments corresponding to FIG. 3 and FIG. 5.
  • the receiving module 801 is configured to receive an adhesive label sent by an adhesive network device and a list of adhesive label stacks corresponding to the adhesive label;
  • a processing module 802 configured to determine that the stuck node has failed during the process of sending a message through the main path;
  • the message includes a label stack list for guiding the message to be forwarded on the main path, and the adhesion node is a next hop node of the first node on the main path.
  • the processing module 802 is further configured to exchange the adhesion label in the label stack list with the adhesion label stack list;
  • a sending module 803 is configured to switch the message to a backup path for sending based on the updated tag stack list of the processing module 802.
  • the processing module 802 is further configured to: after the receiving module 801 receives the adhesion label sent by the adhesion node and the adhesion label stack list corresponding to the adhesion label, the adhesion label and the corresponding The list of adhesion label stacks is stored in a label information table generated by the first node for the adhesion node;
  • the processing module 802 is specifically configured to obtain a first label from the top of the stack of the label stack list when exchanging the adhesive labels in the label stack list to the adhesive label stack list. It is indicated that the next hop node that forwards the message is the sticky node; a first forwarding behavior corresponding to the first label is determined based on a backup forwarding table; the backup forwarding table is used to indicate the backup path; the A first forwarding behavior for instructing to search the label information table; and determining a second label located at the top of the sticky label stack list stack based on the label information table, where the second label is used for indicating on the main path, The next hop node of the sticky node is a third node; using the second label as an incoming label, determining an outgoing label of a backup path from the first node to the third node from the backup forwarding table. ;
  • the sending module 803 is specifically configured to send the message to a next hop node of the first node on a backup path based on the out-label.
  • the sending module 803 is further configured to, after the receiving module 801 receives the node segment identifier of the third node flooded by the connected node in the network, send the Other nodes in the network flood the node segment identifier of the third node.
  • the receiving module 801 is further configured to receive, when the sending module 803 sends a message through a backup path, instruction information sent by the adhesion node after the fault is recovered, where the instruction information is used
  • the sending module 803 is further configured to continue sending a message through the backup path to indicate that the connected node cannot forward the message correctly.
  • the device 800 may be applied to an adhesion node, such as an adhesion node in the embodiment corresponding to FIG. 2 or RT3 in the embodiments corresponding to FIG. 3 and FIG. 5.
  • an adhesion node such as an adhesion node in the embodiment corresponding to FIG. 2 or RT3 in the embodiments corresponding to FIG. 3 and FIG. 5.
  • the receiving module 801 is configured to receive the adhesion label sent by the controller and the list of adhesion label stacks corresponding to the adhesion label; and the transmission module 803 is configured to flood the network to other network devices in the network.
  • the adhesive label and the adhesive label stack list corresponding to the adhesive label are described.
  • the processing module 802 is configured to store the adhesion label and the adhesion label stack list corresponding to the adhesion label in a storage module (not shown in FIG. 8).
  • the embodiment of the present application further provides a structure of a network device.
  • the network device 900 may include a communication interface 910 and a processor 920.
  • the network device 90 may further include a memory 930.
  • the memory 930 may be provided inside the network device, and may also be provided outside the network device.
  • the processing module 802 shown in FIG. 8 above may be implemented by the processor 920.
  • the receiving module 801 and the sending module 803 may be implemented by the communication interface 910.
  • the processor 920 sends and receives packets or messages through the communication interface 910, and is used to implement any method performed by the node (first node or RT2) described in FIG. 2 to FIG. 8.
  • each step of the processing flow may complete the method performed by the first node or RT2 described in FIG. 2 to FIG. 5 through an integrated logic circuit of hardware in the processor 920 or an instruction in the form of software.
  • the program code executed by the processor 920 to implement the foregoing method may be stored in the memory 930.
  • the memory 930 and the processor 920 are coupled.
  • the processor 920 may send and receive packets or messages through the communication interface 910, and is configured to implement any method performed by the node (adhesive node or RT3) described in FIG. 2 to FIG. 5.
  • each step of the processing flow can be performed by the integrated logic circuit of hardware in the processor 920 or by instructions in the form of software in the method performed by the glue node or RT3 described in FIG. 2 to FIG. 5.
  • the program code executed by the processor 920 to implement the foregoing method may be stored in the memory 930.
  • the memory 930 and the processor 920 are coupled.
  • Any communication interface involved in the embodiments of the present application may be a circuit, a bus, a transceiver, or any other device that can be used for information interaction.
  • the communication interface 910 in the network device 900 may be a device connected to the network device 900.
  • the other device may be a previous hop node or a next hop node of the network device 900. .
  • the processors involved in the embodiments of the present application may be general-purpose processors, digital signal processors, application specific integrated circuits, field programmable gate arrays or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and may implement or The disclosed methods, steps and logic block diagrams in the embodiments of the present application are executed.
  • a general-purpose processor may be a microprocessor or any conventional processor.
  • the steps of the method disclosed in combination with the embodiments of the present application may be directly implemented by a hardware processor, or may be performed by a combination of hardware and software modules in the processor.
  • the coupling in the embodiments of the present application is an indirect coupling or communication connection between devices, modules, or modules, and may be electrical, mechanical, or other forms for information exchange between devices, modules, or modules.
  • the processor 920 may operate in cooperation with the memory 930.
  • the memory 930 may be a non-volatile memory, such as a hard disk (HDD) or a solid-state drive (SSD), etc., or a volatile memory, such as a random access memory (random -access memory, RAM).
  • the memory 930 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.
  • the specific connection medium between the communication interface 910, the processor 920, and the memory 930 is not limited in the embodiment of the present application.
  • the memory 930, the processor 920, and the communication interface 910 are connected by a bus in FIG. 9.
  • the bus is indicated by a thick line in FIG. It is not limited.
  • the bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only a thick line is used in FIG. 9, but it does not mean that there is only one bus or one type of bus.
  • an embodiment of the present application further provides a computer storage medium.
  • a software program is stored in the storage medium, and when read and executed by one or more processors, the software program can implement any one or more of the foregoing.
  • the computer storage medium may include various media that can store program codes, such as a U disk, a mobile hard disk, a read-only memory, a random access memory, a magnetic disk, or an optical disk.
  • an embodiment of the present application further provides a chip, and the chip includes a processor, configured to implement functions involved in any one or more of the foregoing embodiments, for example, to implement the first in FIG. 2 to FIG. 5.
  • the chip further includes a memory, and the memory is configured to execute necessary program instructions and data executed by the processor.
  • the chip may be composed of a chip, and may also include a chip and other discrete devices.
  • this application may be provided as a method, a system, or a computer program product. Therefore, this application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Moreover, this application may take the form of a computer program product implemented on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
  • computer-usable storage media including, but not limited to, disk storage, CD-ROM, optical storage, etc.
  • These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to work in a specific manner such that the instructions stored in the computer-readable memory produce a manufactured article including an instruction device, the instructions
  • the device implements the functions specified in one or more flowcharts and / or one or more blocks of the block diagram.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device, so that a series of steps can be performed on the computer or other programmable device to produce a computer-implemented process, which can be executed on the computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more flowcharts and / or one or more blocks of the block diagrams.

Landscapes

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

Abstract

本申请公开了一种传输路径故障的处理方法、装置及系统，用以解决现有技术中存在故障节点的上一跳节点无法处理粘连标签而导致的转发报文失败的问题。方法包括：第一网络设备接收粘连网络设备发送的粘连标签，以及所述粘连标签对应的粘连标签栈列表；所述第一网络设备在通过主路径发送报文的过程中，确定所述粘连网络设备发生故障；其中，所述报文中包括用于指导所述报文在所述主路径上转发的标签栈列表，所述粘连网络设备为在所述主路径上所述第一网络设备的下一跳网络设备；所述第一网络设备将所述标签栈列表中的粘连标签交换为所述粘连标签栈列表，并基于更新后的标签栈列表将所述报文切换到备份路径上发送。

Description

一种传输路径故障的处理方法、装置及系统
本申请要求了2018年6月30日提交的，申请号为CN 201810703774.9，发明名称为“一种传输路径故障的处理方法、装置及系统”的中国申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，尤其涉及一种传输路径故障的处理方法、装置及系统。
背景技术
段路由流量工程(segment routing-traffic engineering，SR-TE)是使用内部网关协议(interior gateway protocol，IGP)或者边界网关协议(border gateway protocol，BGP)协议作为控制信令的一种新型的多协议标签交换(multiprotocol label switching，MPLS)TE隧道技术。控制器负责计算隧道的转发路径，并将与路径严格对应的标签栈下发给转发器。在SR-TE隧道的首端节点上，转发器根据标签栈，即可控制报文在网络中的传输路径。
当主路径某一个节点发生故障时，目前基于快速重路由(fast reroute，FRR)技术使用备份路径来转发报文。
如果故障节点是粘连节点，且标签栈中携带有粘连节点的粘连标签的情况下，在粘连节点的上一跳节点确定粘连节点发生故障时，上一跳节点需要确定绕过粘连节点的备份路径，但是上一跳节点无法处理粘连标签，从而会导致转发报文失败。
发明内容
本申请提供一种传输路径故障的处理方法、装置及系统，用以解决现有技术中存在故障节点的上一跳节点无法处理粘连标签而导致的转发报文失败的问题。
第一方面，本申请实施例提供了一种传输路径故障的处理方法，包括：第一网络设备接收粘连网络设备发送的粘连标签，以及所述粘连标签对应的粘连标签栈列表；所述第一网络设备在通过主路径发送报文的过程中，确定所述粘连网络设备发生故障；其中，所述报文中包括用于指导所述报文在所述主路径上转发的标签栈列表，所述粘连网络设备为在所述主路径上所述第一网络设备的下一跳网络设备；所述第一网络设备将所述标签栈列表中的粘连标签交换为所述粘连标签栈列表，并基于更新后的标签栈列表将所述报文切换到备份路径上发送。
本申请实施例提供的方案中，粘连网络设备将粘连标签以及粘连标签栈发布到全网，使得粘连网络设备的上一跳网络设备获知后，将所述标签栈列表中的粘连标签交换为所述粘连标签栈列表，并基于更新后的标签栈列表将所述报文切换到备份路径上发送，避免上一跳网络设备由于无法处理粘连标签导致无法切换到备份路径，而造成的数据报文转发失败。
在一种可能的设计中，所述第一网络设备接收粘连网络设备发送的粘连标签，以及粘连标签对应的粘连标签栈列表后，还包括：所述第一网络设备将所述粘连标签以及对应的粘连标签栈列表保存在所述第一网络设备为所述粘连网络设备生成的标签信息表中；所述第 一网络设备将所述标签栈列表中的粘连标签交换为所述粘连标签栈列表，并将更新后的所述报文切换到备份路径上发送，包括：所述第一网络设备从所述标签栈列表的栈顶获取第一标签，所述第一标签用于指示转发所述报文的下一跳网络设备为所述粘连网络设备；所述第一网络设备基于备份转发表确定所述第一标签对应的第一转发行为；所述备份转发表用于指示所述备份路径；所述第一转发行为用于指示查找所述标签信息表；所述第一网络设备基于所述标签信息表确定位于所述粘连标签栈列表栈顶的第二标签，所述第二标签用于指示在所述主路径上，所述粘连网络设备的下一跳网络设备为第三网络设备；所述第一网络设备将所述第二标签作为入标签，从所述备份转发表中确定由所述第一网络设备到所述第三网络设备的备份路径的出标签；所述第一网络设备基于所述出标签向备份路径上所述第一网络设备的下一跳网络设备发送所述报文。
通过上述设计，将所述粘连标签以及对应的粘连标签栈列表保存在所述第一网络设备为所述粘连网络设备生成的标签信息表，为查找提供便利，节省时间。
在一种可能的设计中，第一网络设备接收粘连网络设备发送的粘连标签，以及粘连标签对应的粘连标签栈列表，包括：所述第一网络设备接收所述粘连网络设备发送的标签长度内容TLV，所述TLV中包括所述粘连标签以及粘连标签对应的粘连标签栈列表。
在一种可能的设计中，所述TLV为标签绑定SID/Label Binding TLV。
在一种可能的设计中，还包括：所述第一网络设备在接收到所述粘连网络设备在网络内泛洪的所述第三网络设备的节点段标识之后，向所述网络内的其它网络设备泛洪所述第三网络设备的节点段标识。
由于，在转发路径中存在松散路径的情况下，当松散路径段的目的网络设备(粘连网络设备)发生故障时，该网络设备的故障信息泛洪到整个网络后，全网所有的网络设备都会删除到该粘连网络设备的对应的主备转发表。在松散路径的情况下，主路径和备份路径中，从首网络设备到尾网络设备，都需要通过松散路径段且需要从粘连网络设备的上一跳网络设备绕过粘连网络设备到达尾网络设备，由于该路径段的源网络设备在删除到粘连网络设备的主备转发表后，无法将数据报文转发到粘连网络设备的上一跳网络设备，会导致转发报文失败。因此，通过上述设计，在松散路径段的目的网络设备的上一跳网络设备收到松散路径段的目的网络设备的节点段标识后，将该目的网络设备的节点段标识在全网泛洪，从而松散路径段的源网络设备能够根据目的网络设备的节点段标识来确定转发路径，转发数据报文。
在一种可能的设计中，还包括：所述第一网络设备在通过备份路径发送报文时，所述第一网络设备接收所述粘连网络设备在故障恢复后发送的指示信息，所述指示信息用于指示所述粘连网络设备无法正确转发报文，所述第一网络设备继续通过所述备份路径发送报文。
在主路径上的粘连节点发生故障时，网络设备切换到备份路径上转发报文。当粘连网络设备恢复后重启完成时，故障恢复节点会重现将自身的节点(前缀)标签、邻接标签等信息重新泛洪给网络中的其它节点。网络设备接收到故障恢复节点泛洪的信息后，将数据报文重新切回到主路径，即重新通过故障恢复节点传输报文。但是由于故障恢复的粘连节点刚刚重启，本地数据库可能不完整，比如还没有学习到其它节点，比如主路径该粘连节点的下一跳节点的节点标签、邻接标签等信息，在该情况下，RT3接收到报文后，无法转发报文到下一跳节点，导致数据报文丢失。基于此，通过上述设计，粘连网络设备恢复后优先 发送指示信息来指示其上一跳网络设备，该恢复后的粘连网络设备还无法正确定转发报文，从而上一跳网络设备依然通过备份路径来转发数据报文。
第二方面，本申请实施例提供了一种传输路径故障的处理方法，包括：粘连网络设备接收控制器发送的粘连标签，以及所述粘连标签对应的粘连标签栈列表；所述粘连网络设备向网络内的其它网络设备泛洪所述粘连标签，以及所述粘连标签对应的粘连标签栈列表。
本申请实施例提供的方案中，粘连网络设备将粘连标签以及粘连标签栈发布到全网，使得粘连网络设备的上一跳网络设备获知后，将所述标签栈列表中的粘连标签交换为所述粘连标签栈列表，并基于更新后的标签栈列表将所述报文切换到备份路径上发送，避免上一跳网络设备由于无法处理粘连标签导致无法切换到备份路径，而造成的数据报文转发失败。
第三方面，基于与第一方面的方法实施例同样的发明构思，本申请实施例提供了一种传输路径故障的处理装置，所述装置应用于第一方面所述的第一网络设备，即该装置可以是第一网络设备，也可以是能够应用于第一网络设备的芯片。该装置具有实现上述第一方面的各实施例的功能。该功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。该硬件或软件包括一个或多个与上述功能相对应的模块。
第四方面，基于与第二方面提供的方法实施例同样的发明构思，本申请实施例提供了一种传输路径故障的处理装置，所述装置应用于第二方面所述的网络设备，即该装置可以是网络设备，也可以是能够应用于网络设备的芯片。该装置具有实现上述第二方面的各实施例的功能。该功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。该硬件或软件包括一个或多个与上述功能相对应的模块。
第五方面，本申请实施例提供一种传输路径故障的处理装置，包括：处理器和存储器；该存储器用于存储指令，当该装置运行时，该处理器执行该存储器存储的该指令，以使该装置执行上述第一方面或第一方面的任一实现方法中的传输路径故障的处理方法。需要说明的是，该存储器可以集成于处理器中，也可以是独立于处理器之外。装置还可以包括总线。其中，处理器通过总线耦接存储器。其中，存储器可以包括可读存储器以及随机存取存储器。当需要运行该装置时，通过固化在只读存储器中的基本输入输出系统或者嵌入式系统中的bootloader引导系统进行启动，引导装置进入正常运行状态。在装置进入正常运行状态后，在随机存取存储器中运行应用程序和操作系统，使得该处理器执行第一方面或第一方面的任意可能的实现设计中的方法。
第六方面，本申请实施例提供一种传输路径故障的处理装置，包括：处理器和存储器；该存储器用于存储指令，当该装置运行时，该处理器执行该存储器存储的该指令，以使该装置执行上述第二方面或第二方面的任一实现方法中的传输路径故障的处理方法。需要说明的是，该存储器可以集成于处理器中，也可以是独立于处理器之外。装置还可以包括总线。其中，处理器通过总线耦接存储器。其中，存储器可以包括可读存储器以及随机存取存储器。当需要运行该装置时，通过固化在只读存储器中的基本输入输出系统或者嵌入式系统中的bootloader引导系统进行启动，引导装置进入正常运行状态。在装置进入正常运行状态后，在随机存取存储器中运行应用程序和操作系统，使得该处理器执行第二方面或第二方面的任意可能的实现设计中的方法。
第七方面，本申请实施例还提供了一种系统，包括第三方面或第五方面所述的装置，以及第四方面或第六方面所述的装置。在一个可能的设计中，该系统还可以包括本申请实施 例提供的方案中与该两种网络设备进行交互的其他网络设备，例如传输路径上的其它网络设备。
第八方面，本申请实施例还提供一种可读存储介质，所述可读存储介质中存储有程序或指令，当其在计算机上运行时，使得上述各方面的任意的传输路径故障的处理方法被执行。
第九方面，本申请实施例还提供一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述各方面中的任意的传输路径故障的处理方法。
另外，第三方面至第九方面中任一种设计方式所带来的技术效果可参见第一方面至第二方面中不同实现方式所带来的技术效果，此处不再赘述。
附图说明
图1A为本申请实施例提供的一种网络架构示意图；
图1B为本申请实施例提供的另一种网络架构示意图；
图2为本申请实施例提供的传输路径故障的处理方法流程图；
图3为本申请实施例提供的一种传输路径故障的处理方法流程示意图；
图4为本申请实施例提供的Binding TLV格式示意图；
图5为本申请实施例提供的另一种传输路径故障的处理方法流程示意图；
图6为本申请实施例提供的mapping TLV格式示意图；
图7为本申请实施例提供的Flags格式示意图；
图8为本申请实施例提供的装置800的结构示意图；
图9为本申请实施例提供的网络设备900的结构示意图。
具体实施方式
本申请应用于支持SR-TE的节点。在本申请实施例中，节点也可以称为网络设备，网络设备是在网络中提供路由转发功能的设备，例如，可以是路由器、交换机、转发器或者标签交换路由器(label switching router，LSR)等，不作限定。在后续描述过程中，以节点为例进行说明。
在SR-TE技术中，控制平面采用基于链路状态的IGP协议，或者边界网关协议(border gateway protocol，BGP)，来分发节点的MPLS标签，数据平面基于该控制平面分发的标签进行MPLS报文转发。
SR-TE(Segment Routing-Traffic Engineering)是使用内部网关协议(interior gateway protocol，IGP)或者边界网关协议(border gateway protocol，BGP)协议作为控制信令的一种新型的TE隧道技术。控制器负责计算隧道的转发路径，并将与路径严格对应的标签栈列表下发给转发器。在SR-TE隧道的入节点上，转发器根据标签栈列表，即可控制报文在网络中的传输路径。
下面先对申请实施例中涉及到的术语进行解释说明。
1)、段路由全局块(Segment Routing Global Block，SRGB)：用户指定的为段(segment)预留的标签集合。
2)、段(segment)，通过段标签(Segment ID，SID)来标识。本申请实施例中的段标 签可以称为段标识。SID，在转发层面，可以映射为MPLS标签。
段包括三类，分别为前缀段(Prefix Segment)、邻接段(Adjacency Segment)和节点段(Node Segment)。
前缀段，用于标识SR网络中的某个目的地址前缀(Prefix)。Prefix Segment可以通过IGP协议扩散到其他网元，全局可见，全局有效。Prefix Segment通过前缀段标识(Prefix Segment ID，Prefix SID)来标记。本申请实施例中将前缀段标签简称为前缀标签。Prefix SID是目的节点发布的SRGB范围内的偏移值，接收端会根据自己的SRGB计算实际标签。
邻接段(Adjacency Segment)用于标识网络中的某两个邻接节点的路由链路。Adjacency Segment通过IGP协议扩散到其他网元，全局可见，本地有效。Adjacency Segment通过邻接段标签(Adjacency Segment ID，Adjacency SID)。本申请实施例中将邻接段标签简称为邻接标签。
邻接标签具有一定的方向性，用于指导报文转发，比如，邻接标签9003对应链路PE1->P3。Adjacency SID为SRGB范围外的本地SID。
节点段(Node Segment)是特殊的Prefix Segment，用于标识特定的节点(Node)。在节点的本地环回(Loopback)接口下配置IP地址作为前缀，这个节点的Prefix SID实际就是节点段标签(Node SID)。本申请实施例中将节点段标签可以简称为节点标签。
简单来说，Prefix Segment代表目的地址，Adjacency Segment代表数据包的外发链路，可以分别类似于传统IP转发中的目的IP地址和出接口。在IGP区域内，节点使用扩展IGP协议将自身的Node SID以及Adjacency SID进行泛洪，这样任意一个节点都可以获得其他节点的信息。
通过前缀(节点)SID和邻接SID的排序组合，可以构建出网络内的任何路径。网络中的一条路径可以通过多个路由段构成。构建出来的路径通过标签栈列表来表示。标签栈列表包括了转发路径上每个路由段对应的段标签(Segment ID)。
目的节点通过IGP协议自己的节点(前缀)SID，转发节点解析节点SID，并根据自己的SRGB计算标签值。此后各节点使用IGP协议收集的拓扑信息，根据最短路径算法计算标签转发路径，并将计算的下一跳及出标签(OuterLabel)信息下发转发表，指导数据报文转发。
3)粘连节点和粘连标签
当标签栈列表深度超过转发器所支持的标签栈列表深度时，一个标签栈列表无法携带整条路径的段标签，控制器需要为转发器分配多个标签栈列表，在合适的节点下发标签栈列表的同时分配一种特殊的标签，然后将这些标签栈列表关联起来，实现逐段转发。这种特殊的标签称为粘连标签，这个合适的节点称为粘连节点。控制器为粘连节点分配粘连标签，并将其压在标签栈列表的栈底，当报文转发至粘连节点时，根据粘连标签与标签栈列表的关联关系，将粘连标签更换为新的标签栈列表，继续指导下一段转发。需要说明的是，为了描述方便，本申请实施例中标签栈列表简称为标签栈，粘连标签对应的标签栈称为粘连标签栈。
另外，需要说明的是，本申请实施例中的多个指两个或两个以上。“和/或”，描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。另外，需要理解的是，在本申请的描述中，“第一”、 “第二”等词汇，仅用于区分描述的目的，而不能理解为指示或暗示相对重要性，也不能理解为指示或暗示顺序。节点1或者节点2等也仅用于区分描述的节点，而不能理解为指示或者暗示相对重要性，也不能理解为指示或者暗示顺序。
另外，本申请实施例中涉及到的转发表，一般可以是只包括主转发表，或者可以包括主转发表和备份转发表。本申请实施例中涉及到的主备转发表包括主转发表和备转发表。
以图1A为例对前缀段的段路径的创建以及数据报文的转发进行说明。
比如待建立的前缀段路径为RT1、RT2、RT3、RT4、RT5。RT1为该前缀段的首节点，RT5为该前缀段的目的节点。
在RT5上配置SRGB＝[5000-5999]，在RT5的Loopback接口配置Prefix(node)SID为5，RT5基于SRGB和Prefix(node)SID生成转发表项并下发。之后RT5将SRGB和Prefix SID封装到控制报文，并将该控制报文通过IGP向全网扩散。网络中其他网络设备接收到控制报文后，解析RT5发布的Prefix SID，根据自己的SRGB计算入标签值，同时根据下一跳节点发布的SRGB计算出标签值(OuterLabel)，使用IGP拓扑计算标签转发路径，然后生成该入标签值对应的转发表项。
RT4解析RT5发布的Prefix SID，根据自己的SRGB＝[4000-4999]计算标签值，计算公式是：入标签inLabel＝SRGB起始值+Prefix SID值，所以inLabel＝4000+5＝4005。使用IS-IS拓扑计算出标签(OuterLabel)，计算公式是：OuterLabel＝下一跳设备发布的SRGB的起始值+Prefix SID值(即该前缀段或者节点段上目的节点的节点标签)，如图1A所示，RT4的下一跳设备为RT5，RT5发布的SRGB范围是[5000-5999]，所以OuterLabel＝5000+5＝5005。
RT3计算过程与RT4类似，inLabel＝3000+5＝3005，OuterLabel＝4000+5＝4005。RT2计算过程与RT4类似，inLabel＝2000+5＝2005，OuterLabel＝3000+5＝3005。RT1计算过程与RT4类似，inLabel＝1000+5＝1005，OuterLabel＝2000+5＝2005。
在建立RT1-RT5的段路径后，RT1节点在收到数据报文，添加标签值2005并转发。RT 2节点收到携带该标签的数据报文，进行标签交换，将标签2005弹出，换成出标签3005，。RT3节点收到该标签报文，进行标签交换，将标签3005弹出，换成标签4004。RT4节点在收到该数据报文后，将标签4005弹出，换成标签5005。RT5节点在收到该数据报文后，将标签5005弹出，继续查路由转发。
下面以图1B为例对严格的段路径(不允许跨节点)的创建以及数据报文的转发进行说明。
转发器基于IGP协议分配邻接标签，并将分配的邻接标签上报给控制器，从而控制器基于邻接标签生成标签栈列表。
邻接标签通过IGP协议泛洪到整个网络中。如图1B所示，以RT1节点为例，IGP协议分配邻接标签的具体过程如下：
RT1通过IGP协议为其所有链路申请本地动态标签(例如：RT1为链路RT1->RT2分配邻接标签1031)。RT1通过IGP协议发布邻接标签，泛洪到整个网络。网络中的其它设备通过IGP协议学习到RT1发布的邻接标签。具体的，其它节点按照RT1的方式分配和发布邻接标签，并泛洪给网络中的其它设备。
控制器基于SR-TE的隧道约束属性进行路径计算，计算出来的路径根据拓扑和邻接标签，将整条路径的邻接标签整合在一起，生成一个标签栈列表。比如参见图1B所示，控制 器计算出SR-TE隧道路径为RT1->RT2->RT3->RT4->RT5，对应的标签栈列表为{1031,1032,1034,1035}，控制器通过计算出的标签栈列表下发给转发器入节点RT1。从而转发器根据控制器下发的标签栈列表获得SR-TE隧道。本申请此处也可以使用节点标签来构成标签栈列表，即标签栈列表为{1002,2003,3004,4005}。
转发器上根据SR-TE隧道对应的标签栈列表，对报文进行标签操作，并根据栈顶标签逐跳查找转发出接口，指导数据报文转发到隧道目的地址。
当报文进入SR-TE隧道时，入节点在报文中插入一个标签栈列表；当报文在SR-TE隧道中转发时，根据栈顶的标签查找转发出接口之后，将栈顶的标签剥掉。比如，参见图1B所示，入节点PE1为数据报文添加标签栈列表{1031,1032,1034,1035}，然后根据栈顶的标签1031匹配链路，找到对应的转发出接口为RT1->RT2链路，之后将标签1031弹出。报文携带标签栈{1032,1034,1035}，通过RT1->RT2链路向下一跳节点RT2转发。中间节点RT2收到报文后，根据栈顶的标签1032匹配链路，找到对应的转发出接口为RT2->RT3链路，之后将标签1032弹出，以此类推，节点RT3收到报文后，以与中间节点RT3相同的方式继续转发。直到节点RT4弹出最后一个标签1035，数据报文转发至节点RT5。出节点RT5收到的报文不带标签，通过查找路由表继续转发。
严格的段路径方式，在存在等价路径的情况下，也无法进行负载分担。再该情况下可以根据节点标签，或者节点标签和邻接标签构成的混合标签栈，可指定跨节点的节点标签，控制器将标签栈发给转发器的首节点，转发器基于该标签栈，逐跳查找出接口弹出标签，指导数据报文进行转发到隧道目的地址。比如，如图1A所示，RT1-RT5的路径，指定需要经过的节点为：RT3、RT4，此时RT1-RT3之间构成了松散路径，可以通过RT2转发，也可以通过RT6转发。在此情况下，RT1上用于转发报文的标签栈列表为{2003,3004,4005}。
在SR-TE转发报文的过程中，可能发生链路故障或者节点故障。目前，可以通过FRR机制来对路径进行恢复。比如节点R2节点为故障节点。
节点R2未发生故障时，SR-TE的标签栈标识的转发路径为：RT1->RT2->RT3->RT4->RT5。当节点RT2故障时，节点RT2的邻居节点RT1替代节点RT2做标签弹出(POP)动作，并使用到下一层标签作为目的地址，且绕过故障节点RT2的路径作为备份路径进行数据报文的转发。备份路径为：RT1->RT6->RT3->RT4->RT5。
比如RT1进行数据报文发送的标签栈列表为{1002,2003,3004,4005}，RT1可以通过检查标签栈的栈顶标签1002，确定RT2节点是故障节点，然后通过检查标签栈的栈顶标签1002和第二个标签2003，确定故障节点后面路径所需要到达的节点为RT3。RT1计算出绕过故障节点RT2到达第二个标签2003所标识的节点(即RT3)的路径，作为对下一跳节点RT2的SR-TE FRR的节点保护路径。
在RT2节点故障前，每一个节点通过IGP提前计算好备份转发表和标签信息表(Context表)。每一个节点都为其邻居节点生成Context表以及主备转发表。Context表包括了邻居数*(全网络所有节点的节点(前缀)标签和邻居节点发布的所有的邻接标签)，每个邻居节点对应一个Context表项。比如，节点RT1为其邻居节点RT2生成RT2对应的Context表项，该Context表项中包含了全网所有节点对应节点(前缀)标签信息以及RT2发布的邻接标签。全网所有节点中每个节点对应的节点(前缀)标签信息是该节点的节点标签与RT2节点的SRGB的初始值的和。在路径中存在故障节点时，故障节点的上一跳节点通过 Context表以及主备转发表确定备份路径，并通过备份路径转发数据报文。
需要说明的是，主路径中某个节点，或者某个节点到下一跳的路径发生故障时，在主路径中该节点的上一跳节点感知到故障后，上一跳节点的会将该节点的故障信息泛洪到网络中其它节点。
如果故障节点是粘连节点，且标签栈中携带有粘连节点的粘连标签的情况下，在粘连节点的上一跳节点确定粘连节点发生故障时，上一跳节点需要确定绕过粘连标签的备份路径，但是因为粘连标签对应的粘连标签栈只有粘连节点知道，上一跳节点不知道，因此针对粘连标签，上一跳节点无法处理。
基于此，本申请实施例提供了一种传输路径故障的处理方法，参见图2所示，该方法包括：
S201，粘连节点接收控制器发送的粘连标签，以及所述粘连标签对应的粘连标签栈列表。
S202，所述粘连节点向网络内的其它节点泛洪所述粘连标签，以及所述粘连标签对应的粘连标签栈列表。
S203，第一节点接收粘连节点发送的粘连标签，以及所述粘连标签对应的粘连标签栈列表。
S204，所述第一节点在通过主路径发送报文的过程中，确定所述粘连节点发生故障；
其中，所述报文中包括用于指导所述报文在所述主路径上转发的标签栈列表，所述粘连节点为在所述主路径上所述第一节点的下一跳节点；
S205，所述第一节点将所述标签栈列表中的粘连标签交换为所述粘连标签栈列表，并基于更新后的标签栈列表将所述报文切换到备份路径上发送。
在一种可能的实施方式中，所述第一节点接收粘连节点发送的粘连标签，以及粘连标签对应的粘连标签栈列表后，所述第一节点将所述粘连标签以及对应的粘连标签栈列表保存在所述第一节点为所述粘连节点生成的标签信息表中。
所述第一节点将所述标签栈列表中的粘连标签交换为所述粘连标签栈列表，并将更新后的所述报文切换到备份路径上发送，可以通过如下方式实现：
所述第一节点从所述标签栈列表的栈顶获取第一标签，所述第一标签用于指示转发所述报文的下一跳节点为所述粘连节点；所述第一节点基于备份转发表确定所述第一标签对应的第一转发行为；所述备份转发表用于指示所述备份路径；所述第一转发行为用于指示查找所述标签信息表；所述第一节点基于所述标签信息表确定位于所述粘连标签栈列表栈顶的第二标签，所述第二标签用于指示在所述主路径上，所述粘连节点的下一跳节点为第三节点；所述第一节点将所述第二标签作为入标签，从所述备份转发表中确定由所述第一节点到所述第三节点的备份路径的出标签；所述第一节点基于所述出标签向备份路径上所述第一节点的下一跳节点发送所述报文。
在一种可能的实施方式中，第一节点接收粘连节点发送的粘连标签，以及粘连标签对应的粘连标签栈列表，包括：所述第一节点接收所述粘连节点发送的标签长度内容TLV，所述TLV中包括所述粘连标签以及粘连标签对应的粘连标签栈列表。示例性地，所述TLV可以为标签绑定SID/Label Binding TLV。
在一种可能的实施方式中，还包括：所述第一节点在接收到所述粘连节点在网络内泛洪的所述第三节点的节点段标识之后，确定所述粘连节点发生故障时，，向所述网络内的其它 节点泛洪所述第三节点的节点段标识。
在一种可能的设计中，还包括：所述第一节点在通过备份路径发送报文时，所述第一节点接收所述粘连节点在故障恢复后发送的指示信息，所述指示信息用于指示所述粘连节点无法正确转发报文，所述第一节点继续通过所述备份路径发送报文。
以图3所示的网络架构为例，首先包括粘连节点的路径的建立过程以及数据报文转发过程进行详细描述。图3所示的网络架构，RT2可以是图2所示的实施例中的第一节点，RT3可以是图2所示的实施例中的粘连节点。
控制器基于SR-TE的隧道约束属性计算传输路径，可以是严格路径也可以是松散路径。控制器根据拓扑和邻接标签(和/或节点标签)，将传输路径的邻接标签(和/或节点标签)整合在一起，生成一个标签栈发送给传输路径的首节点。当标签栈深度超过转发器所支持的标签栈深度时，一个标签栈无法携带所有的邻接标签(和/或节点标签)，则控制器需要将整条路径分为多个标签栈携带。本申请实施例中粘连标签栈采用的可以是邻接标签，当然也可以是节点标签。
如图3所示，以粘连标签栈采用邻接标签为例。图3中，RT1-RT5的路径，指定需要经过的节点为：RT3、RT4，此时RT1-RT3之间构成了松散路径，可以通过RT2转发，也可以通过RT6转发。比如，控制器计算出SR-TE隧道路径为RT1--->RT3->RT4->RT5，对应2个标签栈，{1003,100}和{1034,1035}，其中100为粘连标签，1034、1035为邻接标签，1003为RT3的节点标签与RT1的SRGB初始值计算得到的。
控制器将标签栈下发给相应的转发器。示例性地，控制器将分配粘连标签，并将粘连标签以及粘连标签对应的粘连标签栈{100：1034,1035}下发给粘连节点RT3。控制器将粘连标签100作为RT1上标签栈的栈底。控制器将标签栈{1003,100}下发给首节点RT1。
本申请实施例中RT1经过路径计算，确定的主路径为RT1->RT2->RT3->RT4->RT5。
RT1确定主路径为经过RT2，从而将数据报文中包括的标签栈的外层标签(栈顶标签)1003交换为2003(RT3的节点标签+RT2的SRGB初始值)，并将更新后的数据报文发送给RT2。在粘连节点未发生故障的情况下，RT2收到RT1发送的数据报文后，把栈顶标签交换为3003，并发给RT3。RT3收到后弹出栈顶标签，然后把更新后标签栈列表中的栈顶标签100交换为{1034,1045}。根据栈顶标签1034确定下一跳节点为RT4，将栈顶标签1034弹出后，将更新后的数据报文转发给RT4，RT4根据栈顶标签1035确定下一跳节点为RT5，从而将栈顶标签1035弹出后，将更新后的数据报文发送给RT5。
在粘连节点RT3发生故障时，其上一跳节点RT2无法针对标签栈中的粘连标签进行处理导致数据报文转发失败。
基于此，本申请实施例提供了一种传输路径故障的处理方案，粘连节点在接收到控制器发送的粘连标签以及粘连标签对应的粘连标签栈时，将粘连标签以及粘连标签对应的粘连标签栈发布到全网。
示例性的，粘连标签以及粘连标签栈可以包括的绑定(binding)TLV中发布到全网。粘连节点RT3采用Binding TLV，发布粘连标签(Binding Sid)以及对应的粘连标签栈{100:1034,1045}，可以在现有的Binding TLV的定义的基础上添加若干个SID/Lable sub TLV，来填入具体的粘连标签以及粘连标签对应的粘连标签栈)，具体Binding TLV格式可以参见图4所示。
作为一种示例，RT2在接收到RT3发布的粘连标签以及其对应的粘连标签栈后，可以将粘连标签以及其对应的粘连标签栈存储在Context表中。Context表中RT3对应的Context表项的部分内容可以参见表1所示。
Inlabel，表示入标签，为本节点的SRGB初始值+邻居节点的节点Sid，即RT2的SRGB初始值2000+RT3的节点标签3＝2003。入标签作为Context表查表的关键(KEY)值字段。
表1中，本地sid包括RT3发布的邻接标签(Adj Sid)以及粘连标签。
Adj Sid，表示邻居节点发布的邻接标签，RT3发布的邻接标签分别为RT3与RT4之间链路的邻接标签1034，RT3与RT7之间链路的邻接标签1037，以及RT3与RT6之间链路的邻接标签1036。
Adj节点Sid，表示邻居节点发布的邻接标签对应的目的节点，使用本节点的SRGB初始值+该目的节点发布的节点Sid。比如，RT3与RT4之间链路的邻接标签1034，目的节点是RT4，则1034对应的Adj节点Sid为RT2的SRGB初始值+RT4的节点标签＝2004。
Action，表示Local sid或者Adj节点SID对应的转发动作。
表1
Figure PCTCN2019091512-appb-000001
在图3所示的网络架构中，RT1-RT5的路径，指定需要经过的节点为：RT3、RT4，此时RT1-RT3之间构成了松散路径，可以通过RT2转发，也可以通过RT6转发，本申请实施例中RT1经过路径计算，确定的主路径为RT1->RT2->RT3->RT4->RT5。在此情况下，RT1接收到控制器发送的标签栈为{1003,100}。比如，在RT3故障的情况下备份路径为RT1->RT2->RT7->RT4->RT5。同时，RT2会生成全网的节点Sid的主备转发表。主备转发表的部分内容可以参见表2所示。图2仅示出了入标签为2003和2004的两条表项的部分内容。
表2
Figure PCTCN2019091512-appb-000002
Figure PCTCN2019091512-appb-000003
RT1将确定RT1的下一跳节点为RT2，从而RT1将标签栈的栈顶标签1003交换为2003后添加在数据报文中，发送给RT2。则RT2在接收到RT1的数据报文后，根据数据报文的标签栈的栈顶标签2003，确定栈顶标签指示的下一跳节点RT3故障时，RT2是要找到绕过RT3到RT3的下一跳节点RT4的转发路径。从而查找备份转发表(表2)，查找该入标签为2003对应的这条转发表项，该条转发表项中指示的转发行为是弹出栈顶标签2003，并查找RT2为邻居节点RT3生成的Context表。RT2弹出栈顶标签2003后，确定标签栈列表的栈顶标签为粘连标签，根据采用粘连标签100查找Context表的Local Sid，查找到入标签为2003对应的这条转发表项，该条表项中指示的转发行为是交换为{3004,4005}。从而RT2将粘连标签100交换为{1034，1035}。RT2获取RT3到RT4的邻接标签为1034，继续根据栈顶标签1034查找Context表的本地sid记录，查找到的转发行为是转发到RT4，并确定RT4对应的adj节点标签为2004，即获取以RT2为入节点到以RT4出节点的路由段，在RT2上的入标签。RT2节点将1034交换为2004，使用2004作为入标签查找主转发表，查找到的下一跳节点为RT3，由于到RT3的接口故障，于是切换到备份路径，查找备份转发表，将2004作为入标签查找到的转发行为是转发到RT7，出标签为7004，从而RT2节点将栈顶标签交换为查找到的出标签，即将栈顶标签2004弹出，并交换为7004，此处的标签栈为{7004,1035}，将更新后的数据报文转发给RT7。
RT7接收到数据报文后，根据栈顶标签7004确定下一跳节点为RT4，从而将栈顶标签7004交换为4004，并将更新后的数据报文转发给RT4，同理RT4接收到数据报文后，确定栈顶标签指示的目的节点为自身，将栈顶标签弹出，确定更新后的标签栈的栈顶标签1035指示的下一跳节点为RT5，并将更新后的数据报文发送给RT5。
本申请实施例提供的方案中，粘连节点将粘连标签以及粘连标签栈发布到全网，使得粘连节点的上一跳节点获知后，将所述标签栈列表中的粘连标签交换为所述粘连标签栈列表，并基于更新后的标签栈列表将所述报文切换到备份路径上发送，避免上一跳节点由于无法处理粘连标签导致无法切换到备份路径，而造成的数据报文转发失败。
另外，由于Context表是预先生成的，SR-TE FRR的方案是节点为该节点的每个邻居都生成Context表，因此Context表的规格为全网的节点数+邻居节点的邻居数，所以每个节点需要生成邻居数*(全网节点数+邻居节点的邻居数)这样规模的Context表。
当网络包括节点数较多，且有些节点所支持的Context表的规格不足以支持邻居数*(全网节点数+邻居节点的邻居数)这样的规格时，会导致这些节点生成的Context表中内容不全，在网络中出现故障节点，可能会导致无法切换到正确的备份路径来转发报文。
基于此，本申请实施例中提出了一种配置Context表的方式。当节点通过IGP获取到邻居节点发布的邻接标签以及邻居节点其邻接的节点的节点标签，并在学习到邻居节点的SRGB后，生成Context表。Context表中包括邻居节点发布的邻接标签，以及邻居节点其邻接的节点的节点标签信息，以及本节点的SRGB初始值与邻居节点的SRGB初始值的差值，此处节点标签信息是邻居节点的SRGB初始值与所述邻居节点其邻接的节点的节点标签的和。
以图5所示为例，RT2为邻居节点RT3生成的Context表如表3所示。RT3邻接的节点包括RT2、RT7、RT6以及RT4。其中，RT2的SRGB初始值为2000，RT2的邻居节点RT3的SRGB初始值为3000，因此，RT2的SRGB初始值与RT3的SRGB初始值的差值为-1000。本实施例中以粘连标签栈采用节点标签为例进行说明。RT3为粘连节点，粘连标签以及粘连标签对应的粘连标签栈为{100:3004,4005}。
作为一种示例，RT2在接收到RT3发布的粘连标签以及其对应的粘连标签栈后，可以将粘连标签以及其对应的粘连标签栈存储在Context表中RT3节点对应的表项中。Context表的部分内容可以参见表3所示，表3中示出了Context表中RT3对应的表项中的部分内容，即入标签为2003的表项中的部分内容。表3中，SRGB差：为本节点的SRGB初始值–邻居节点的SRGB初始值。
表3
Figure PCTCN2019091512-appb-000004
下面以图4为例，对数据报文的转发过程进行详细描述。
图4中，首节点RT1-尾节点RT5的路径，指定需要经过的节点为：RT3、RT4，此时RT1-RT3之间构成了松散路径，可以通过RT2转发，也可以通过RT6转发，本申请实施例中RT1经过路径计算，确定的主路径为RT1->RT2->RT3->RT4->RT5。RT1上用于转发报文的标签栈列表为{1003,100}。比如，在RT3故障的情况下备份路径为RT1->RT2->RT7->RT4->RT5。同时，RT2会生成全网的节点Sid的主备转发表。主备转发表的部分内容可以参见表4所示，图4仅示出了入标签为2003和2004的两条表项的部分内容。
表4
Figure PCTCN2019091512-appb-000005
在RT3未发生故障时，如图5所示，RT1确定RT1的下一跳节点为RT2时，将标签栈的栈顶标签1003交换为指示RT2的标签2003后，将标签栈携带在数据报文中发送给RT2。RT2接收到RT1发送的数据报文，数据报文中的标签栈为{2003,100}，根据标签栈中的栈顶标签查找主转发表，比如，查找表4，栈顶标签为2003，将2003作为inlabel，查找到的转发行为转发到RT3，从而RT2将栈顶标签交换为3003，即将栈顶标签交换为基于下一跳节点的SRGB初始值(RT3的SRGB初始值)以及目的节点的节点标签(RT3的节点标签)确定的标签值，然后转发更新后的数据报文到RT3。RT3接收到RT2发送的数据报文后，数据报文中的标签栈为{3003,100}，确定栈顶标签指示的接收节点为自身，因此，将栈顶标签3003弹出后，将栈顶标签100交换为粘连标签栈列表{3004,4005}，确定下一跳节点为RT4，将栈顶标签3004交换为4004，并将更新后数据报文转发到RT4，同理RT4接收到RT3发送的数据报文后，数据报文的标签栈为{3004,4005}，确定栈顶标签指示接收节点为自身，因此将栈顶标签弹出，根据栈顶标签4005确定下一跳节点为RT5，因此将栈顶标签交换为5005，并将更新后的数据报文转发到RT5。RT5接收到RT4发送的数据报文后，数据报文的标签栈为{5005}，确定栈顶标签指示接收节点为自身，因此将栈顶标签弹出，继续查找转发表继续转发。
在粘连节点RT3发生故障时，RT2在接收到RT1的数据报文后，根据数据报文的标签栈的栈顶标签2003，确定栈顶标签指示的下一跳节点RT3故障时，RT2是要找到绕过RT3到RT3的下一跳节点RT4的转发路径。从而查找备份转发表(表3)，备份转发表中入标签2003对应的转发行为是弹出栈顶标签2003，并查找RT2为邻居节点RT3生成的Context表。RT2弹出栈顶标签2003后，确定标签栈列表的栈顶标签为粘连标签，根据Context表，将粘连标签100交换为{3004，4005}。根据表3的Context表获取到SRGB差为-1000，RT2获取从RT3到下一跳节点RT4的标签，即栈顶标签3004，并使用栈顶标签与SRGB差作和，即标签(3004)+SRGB差(-1000)＝2004，即获取以RT2为入节点到以RT4出节点的路由段，在RT2上的入标签。使用2004作为入标签查找主转发表，查找到的下一跳节点为RT3，由于到RT3的接口故障，于是切换到到备份路径，查找备份转发表，将2004作为入标签查找到的转发行为是转发到RT7，出标签为7004，从而RT2节点将栈顶标签交换为查找到的出 标签，即将栈顶标签3004弹出，并交换为7004，此处的标签栈为{7004,4005}，将更新后的数据报文转发给RT7。
RT7接收到数据报文后，根据栈顶标签7004确定下一跳节点为RT4，从而将栈顶标签7004交换为4004，并将更新后的数据报文转发给RT4，同理RT4接收到数据报文后，确定栈顶标签指示的目的节点为自身，将栈顶标签弹出，确定更新后的标签栈的栈顶标签4005指示的下一跳节点为RT5，从将栈顶标签4005交换为5005，并将更新后的数据报文发送给RT5。
现有在主路径中某个节点出现故障的情况下，该故障节点的上一跳节点通过为该故障节点生成Context表以及主备转发表由主路径切换到备份路径上时，通过根据标签栈中的栈顶标签查找备转发表，确定备转发表的转发行为是查找Context表后，根据Context表来确定备份路径上需要转发报文的下一跳节点，也就是现有仅查询一次备转发表，确定备份路径是Context表来实现的，而本申请实施例提供的方案中，通过给转发面节点下发SRGB的差值的情况，仅需要使用Context表确定故障节点的下一跳节点的节点标签，而确定备份路径的转发报文的下一跳节点时，是通过故障节点的下一跳节点的节点标签再查询一次备转发表，因此Context表中不需要包括所有节点对应的节点标签，仅需要包括邻居节点其邻接的节点对应的标签信息即可，从而避免表项容量不足导致的转发报文失败，并且可以节省存储资源。
在转发路径中存在松散路径的情况下，松散路径的目的节点为粘连节点，当松散路径段的目的节点(粘连节点)发生故障时，该节点的故障信息泛洪到整个网络后，全网所有的节点都会删除到该故障节点的对应的主备转发表。在松散路径的情况下，主路径和备份路径中，从首节点到尾节点，都需要通过松散路径段且需要从故障节点的上一跳节点绕过故障节点到达尾节点，由于该路径段的源节点在删除到故障节点的主备转发表后，无法将数据报文转发到故障节点的上一跳节点，会导致转发报文失败。
以图5所示为例，RT1指定的SR-TE路径经过的节点为RT3,RT4,RT5，当RT3故障的时候，RT2感知到RT3故障时，通过IGP泛洪(Flooding)该RT3故障的故障信息，并触发SR-TE FRR切换，切换到备份路径RT7,RT4,RT5，绕过故障点RT3，当RT3故障信息泛洪到全网的节点后，RT1开始收敛，会删除到RT3的主备转发表，从而RT1无法转发数据报文到RT2。
基于此，本申请实施例提供了一种传输路径故障的处理方法。粘连节点的上一跳节点感知到该粘连节点发生故障时，采用IGP协议向全网的所有节点泛洪该粘连节点的前缀(节点)标签。上一跳节点在泛洪该粘连节点的前缀标签时，可以将粘连节点的前缀标签携带在Mapping TLV(Tag(Type)-Length-Value)。
需要说明的是，本申请实施例中有关Mapping TLV的细节，请参考国际互联网工程任务组(Internet Engineering Task Force，IETF)发布的文稿draft-ietf-isis-segment-routing-extensions，该文档与此相关部分的内容好像整体复制一般以引入的方式并入本文本中，此处为了简洁，不再赘述。
在TLV的定义中，包括三个域，分别为：标签域(Type)，长度域(Length)，内容域(Value)。Value中包含了粘连节点的前缀标签。Mapping TLV也可以称为标签绑定TLV(SID/Label  Binding TLV)。示例性地，以图6所示为Mapping TLV格式为例。其中，Type表示该TLV的类型，Length表示控制报文的长度，Flags表示标志位，RESERVED表示预留位，当前未用到。Range字段提供了指定的一个地址段与Prefix SID段关联的能力，Prefix length表示前缀的长度，prefix在通告路径的尾节点表示转发等价类，SubTLV表示MappingTLV中用于携带Prefix-SID的sub-TLV。
示例性地，本申请实施例中，上一跳节点可以在Flags中增加一个R字段，用于表示重发布标志位，即针对故障节点的前缀标签由该上一跳节点重新发布给全网其它节点。
Flags的格式可以参见图7所示。其中，F表示地址族标志。如果未置位，代表IPv4前缀；如果置位，代表IPv6前缀。M表示镜像环境标记，如果通告的SID关联一个镜像环境则设置该标记。S表示SID/Label Binding TLV是否可在整个路由域内泛洪，如果置位，表示在整个路由域内泛洪；如果未置位，SID/Label Binding TLV一定不能在level间渗透。D表示当SID/Label Binding TLV从level-2向level-1渗透时，必须设置该标记。否则该标记必须被清除。A表示附属标记。其中，Level是中间系统到中间系统(Intermediate System-to-Intermediate System，IS-IS)路由协议中对网络分层的概念。普通区域称为Level-1，骨干区称为Level-2。
以图5所示的网络架构为例，RT2在确定粘连节点RT3故障时，向全网泛洪RT3的节点标签。RT1在收到RT2泛洪的RT3的节点标签后，根据粘连节点RT3的节点标签确定向RT2节点发送数据报文的出标签，即RT2的SRGB初始值+RT3的节点标签＝2000+3＝2003。从而RT2在接收到数据报文后切换到备份路径上继续转发。RT2切换备份路径转发报文的方式可以采用现有context表的形式，当然还可以采用上述配置context表的方式，此处对此不作限定。具体的发送过程可以参见图4对应的实施例的转发方式，此处不再赘述。
另外，在粘连节点发生故障时，上一跳节点切换到备份路径上转发报文。当粘连节点恢复后重启完成时，粘连节点会重新将自身的节点(前缀)标签、邻接标签等信息重新泛洪给网络中的其它节点。上一跳节点接收到粘连节点泛洪的信息后，将数据报文重新切回到主路径，即重新通过粘连节点传输报文。但是由于粘连节点刚刚重启，本地数据库可能不完整，比如还没有学习到其它节点的相关信息，比如主路径上该粘连节点的下一跳节点的节点标签、邻接标签等信息，在该情况下，RT3接收到报文后，无法转发报文到下一跳节点，导致数据报文丢失。
以图5所示，RT1指定的SR-TE路径为RT3,RT4,RT5，当RT3故障的时候，RT2通过感知到RT3故障后，触发SR-TE FRR切换，切换到备份路径RT7,RT4,RT5，因此绕过故障节点RT3。但当RT3故障恢复，并且重启完成时，RT3将Node Sid重新发布到全网，RT2将数据报文重新切回到RT3。但是由于RT3刚刚重启完成，它本地数据库可能还不全，比如还没有学到RT4和RT5的node Sid，这样就导致数据报文在RT3无法转发到下一跳节点RT4，丢弃报文。
基于此，本申请实施例提供了一种传输路径故障的处理方法。在粘连节点恢复，且重启完成时，为防止恢复的粘连节点的上一跳节点在感知到粘连节点恢复时，恢复的粘连节点未学习到其它节点的前缀SID，导致数据报文丢失。在粘连节点恢复后首先在全网发布指示信息，指示信息用于指示恢复的粘连节点无法正确转发报文；因此上一跳节点在接收到待发送给恢复的粘连节点的数据报文时，依然从备份路径转发数据报文。
示例性地，指示信息可以携带在Overload bit。Overload bit是IS-IS路由协议中规定的。如果一个节点不能完成全部的连接状态数据(LSDB)，即本地存储用于存储全网所有节点的拓扑信息，它将在自己发布的链路状态数据包的头部用一个bit来标识其未完成LSDB，无法正确转发报文，这一个bit的标识位叫做Overload(OL)bit。通过该粘连节点发布的链路状态数据包中的Overload bit,其他节点得知该粘连节点可能无法做出正确的路由决定，即无法正确转发数据报文，因为它的LSDB没有完成。其他节点在计算最短路径时不会通过这个节点来转发数据报文。
以图5所示的网络架构为例，粘连节点RT3在故障恢复，且重启完成后，为防止RT2首先感知到RT3故障恢复，且此时RT3还未学习到RT4和RT5的前缀Sid，导致数据报文丢失。RT3在故障重启完成后在发布链路状态数据包的头部添加Overload bit标识位。
节点RT2收到RT3发布链路状态数据包中的Overload bit，感知到其下一跳节点RT3处于Overload状态，Over状态表示恢复的粘连节点无法正确转发报文。因此，节点RT2继续走故障恢复前的SR-TE FRR转发路径，RT2采用备份路径转发数据报文的方式可以采用现有context表的形式，当然还可以采用上述配置context表的方式，此处对此不作限定。
粘连节点完成LSDB的时间，即Overload时间，一般比较长，比如是60s。因此在该时长内RT2可以采用查Context表按着SR-TE FRR路径(备份路径)转发数据报文。示例性地，可以给配置Overload时长，RT2在该时长内采用备份路径转发数据报文。当然，RT3在完成LSDB时，可以再次在全网发布链路状态数据包，且头部不再包括overload bit标志位。RT2在收到该不包括overload bit标志位的链路状态数据包后，再切回到该RT3转发数据报文。
基于与方法实施例同样的发明构思，本申请实施例还提供了一种装置，参见图8所示，该装置800应用于网络设备。该装置800可以包括接收模块801、处理模块802、发送模块803。该装置800具体可以是网络设备中的处理器，或者芯片或者芯片系统，或者是一个功能模块等。处理模块802用于对装置800的动作进行控制管理，接收模块801用于接收信息或者报文，发送模块803用于发送信息或者发送报文，处理模块802用于对接收模块801接收到的信息或者报文进行处理。处理模块802还可以用于指示上述任意实施例中涉及网络设备(比如第一节点或者RT2或者粘连节点或者RT3)的处理过程和/或本申请所描述的技术方案的其他过程。该装置还可以包括存储模块(图8中未示出)，存储模块用于存储Context表与主备转发表。
在一种可能的实施方式中，该装置800可以应用于粘连节点的上一跳节点，比如图2对应的实施例中的第一节点或者图3、图5对应的实施例中的RT2。
以应用到第一节点为例，接收模块801，用于接收粘连网络设备发送的粘连标签，以及粘连标签对应的粘连标签栈列表；
处理模块802，用于在通过主路径发送报文的过程中，确定所述粘连节点发生故障；
其中，所述报文中包括用于指导所述报文在所述主路径上转发的标签栈列表，所述粘连节点为在所述主路径上所述第一节点的下一跳节点。
所述处理模块802，还用于将所述标签栈列表中的粘连标签交换为所述粘连标签栈列表；
发送模块803，用于基于所述处理模块802更新后的标签栈列表将所述报文切换到备份路径上发送。
在一种可能的示例中，所述处理模块802，还用于在所述接收模块801接收粘连节点发送的粘连标签，以及粘连标签对应的粘连标签栈列表后，将所述粘连标签以及对应的粘连标签栈列表保存在所述第一节点为所述粘连节点生成的标签信息表中；
所述处理模块802，在将所述标签栈列表中的粘连标签交换为所述粘连标签栈列表时，具体用于从所述标签栈列表的栈顶获取第一标签，所述第一标签用于指示转发所述报文的下一跳节点为所述粘连节点；基于备份转发表确定所述第一标签对应的第一转发行为；所述备份转发表用于指示所述备份路径；所述第一转发行为用于指示查找所述标签信息表；基于所述标签信息表确定位于所述粘连标签栈列表栈顶的第二标签，所述第二标签用于指示在所述主路径上，所述粘连节点的下一跳节点为第三节点；将所述第二标签作为入标签，从所述备份转发表中确定由所述第一节点到所述第三节点的备份路径的出标签；
所述发送模块803，具体用于基于所述出标签向备份路径上所述第一节点的下一跳节点发送所述报文。
在一种可能的示例中，，所述发送模块803，还用于在所述接收模块801接收到所述粘连节点在网络内泛洪的所述第三节点的节点段标识之后，向所述网络内的其它节点泛洪所述第三节点的节点段标识。
在一种可能的示例中，所述接收模块801，还用于在所述发送模块803通过备份路径发送报文时，接收所述粘连节点在故障恢复后发送的指示信息，所述指示信息用于指示所述粘连节点无法正确转发报文，所述发送模块803，还用于继续通过所述备份路径发送报文。
在一种可能的实施方式中，该装置800可以应用于粘连节点，比如图2对应的实施例中的粘连节点或者图3、图5对应的实施例中的RT3。
以应用到粘连节点为例，接收模块801，用于接收控制器发送的粘连标签，以及所述粘连标签对应的粘连标签栈列表；发送模块803，用于向网络内的其它网络设备泛洪所述粘连标签，以及所述粘连标签对应的粘连标签栈列表。可选地，处理模块802用于将粘连标签，以及所述粘连标签对应的粘连标签栈列表存储在存储模块中(图8中未示出)。
本申请实施例还提供一种网络设备的结构，如图9所示，网络设备900中可以包括通信接口910、处理器920。可选的，网络设备90中还可以包括存储器930。其中，存储器930可以设置于网络设备内部，还可以设置于网络设备外部。上述图8中所示的、处理模块802均可以由处理器920实现。接收模块801、发送模块803可以由通信接口910实现。
在一种可能的实施方式中，处理器920通过通信接口910收发报文或者消息，并用于实现图2～图8中所述的节点(第一节点或者RT2)所执行的任一方法。在实现过程中，处理流程的各步骤可以通过处理器920中的硬件的集成逻辑电路或者软件形式的指令完成图2～图5中所述的第一节点或者RT2所执行的方法。为了简洁，在此不再赘述。处理器920用于实现上述方法所执行的程序代码可以存储在存储器930中。存储器930和处理器920耦合。
在一种可能的实施方式中，处理器920可以通过通信接口910收发报文或者消息，并用于实现图2～图5中所述的节点(粘连节点或者RT3)所执行的任一方法。在实现过程中，处理流程的各步骤可以通过处理器920中的硬件的集成逻辑电路或者软件形式的指令完成图2～图5中所述的粘连节点或者RT3所执行的方法。为了简洁，在此不再赘述。处理器920 用于实现上述方法所执行的程序代码可以存储在存储器930中。存储器930和处理器920耦合。
本申请实施例中涉及到的任一通信接口可以是电路、总线、收发器或者其它任意可以用于进行信息交互的装置。比如网络设备900中的通信接口910，示例性地，该其它装置可以是与该网络设备900相连的设备，比如，该其它装置可以是该网络设备900的上一跳节点或者下一跳节点等。
本申请实施例中涉及的处理器可以是通用处理器、数字信号处理器、专用集成电路、现场可编程门阵列或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件，可以实现或者执行本申请实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者任何常规的处理器等。结合本申请实施例所公开的方法的步骤可以直接体现为硬件处理器执行完成，或者用处理器中的硬件及软件模块组合执行完成。
本申请实施例中的耦合是装置、模块或模块之间的间接耦合或通信连接，可以是电性，机械或其它的形式，用于装置、模块或模块之间的信息交互。
处理器920可能和存储器930协同操作。存储器930可以是非易失性存储器，比如硬盘(hard disk drive，HDD)或固态硬盘(solid-state drive，SSD)等，还可以是易失性存储器(volatile memory)，例如随机存取存储器(random-access memory，RAM)。存储器930是能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质，但不限于此。
本申请实施例中不限定上述通信接口910、处理器920以及存储器930之间的具体连接介质。本申请实施例在图9中以存储器930、处理器920以及通信接口910之间通过总线连接，总线在图9中以粗线表示，其它部件之间的连接方式，仅是进行示意性说明，并不引以为限。所述总线可以分为地址总线、数据总线、控制总线等。为便于表示，图9中仅用一条粗线表示，但并不表示仅有一根总线或一种类型的总线。
基于以上实施例，本申请实施例还提供了一种计算机存储介质，该存储介质中存储软件程序，该软件程序在被一个或多个处理器读取并执行时可实现上述任意一个或多个实施例提供的方法。所述计算机存储介质可以包括：U盘、移动硬盘、只读存储器、随机存取存储器、磁碟或者光盘等各种可以存储程序代码的介质。
基于以上实施例，本申请实施例还提供了一种芯片，该芯片包括处理器，用于实现上述任意一个或多个实施例所涉及的功能，例如用于实现图2-图5中第一节点或者RT2所执行的方法，或者用于实现图2-图5中粘连节点或者RT3所执行的方法。可选地，所述芯片还包括存储器，所述存储器，用于处理器所执行必要的程序指令和数据。该芯片，可以由芯片构成，也可以包含芯片和其他分立器件。
本领域内的技术人员应明白，本申请的实施例可提供为方法、系统、或计算机程序产品。因此，本申请可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本申请是参照根据本申请实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程 和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
显然，本领域的技术人员可以对本申请进行各种改动和变型而不脱离本申请的范围。这样，倘若本申请的这些修改和变型属于本申请权利要求及其等同技术的范围之内，则本申请也意图包含这些改动和变型在内。

Claims (18)

  1. 一种传输路径故障的处理方法，其特征在于，包括：
    第一网络设备接收粘连网络设备发送的粘连标签，以及所述粘连标签对应的粘连标签栈列表；
    所述第一网络设备在通过主路径发送报文的过程中，确定所述粘连网络设备发生故障；
    其中，所述报文中包括用于指导所述报文在所述主路径上转发的标签栈列表，所述粘连网络设备为在所述主路径上所述第一网络设备的下一跳网络设备；
    所述第一网络设备将所述标签栈列表中的粘连标签交换为所述粘连标签栈列表，并基于更新后的标签栈列表将所述报文切换到备份路径上发送。
  2. 如权利要求1所述的方法，其特征在于，所述第一网络设备接收粘连网络设备发送的粘连标签，以及粘连标签对应的粘连标签栈列表后，还包括：
    所述第一网络设备将所述粘连标签以及对应的粘连标签栈列表保存在所述第一网络设备为所述粘连网络设备生成的标签信息表中；
    所述第一网络设备将所述标签栈列表中的粘连标签交换为所述粘连标签栈列表，并将更新后的所述报文切换到备份路径上发送，包括：
    所述第一网络设备从所述标签栈列表的栈顶获取第一标签，所述第一标签用于指示转发所述报文的下一跳网络设备为所述粘连网络设备；
    所述第一网络设备基于备份转发表确定所述第一标签对应的第一转发行为；所述备份转发表用于指示所述备份路径；
    所述第一转发行为用于指示查找所述标签信息表；
    所述第一网络设备基于所述标签信息表确定位于所述粘连标签栈列表栈顶的第二标签，所述第二标签用于指示在所述主路径上，所述粘连网络设备的下一跳网络设备为第三网络设备；
    所述第一网络设备将所述第二标签作为入标签，从所述备份转发表中确定由所述第一网络设备到所述第三网络设备的备份路径的出标签；
    所述第一网络设备基于所述出标签向备份路径上所述第一网络设备的下一跳网络设备发送所述报文。
  3. 如权利要求1或2所述的方法，其特征在于，第一网络设备接收粘连网络设备发送的粘连标签，以及粘连标签对应的粘连标签栈列表，包括：
    所述第一网络设备接收所述粘连网络设备发送的标签长度内容TLV，所述TLV中包括所述粘连标签以及粘连标签对应的粘连标签栈列表。
  4. 如权利要求3所述的方法，其特征在于，所述TLV为标签绑定SID/Label Binding TLV。
  5. 如权利要求1-4任一项所述的方法，其特征在于，还包括：
    所述第一网络设备在接收到所述粘连网络设备在网络内泛洪的所述第三网络设备的节点段标识之后，向所述网络内的其它网络设备泛洪所述第三网络设备的节点段标识。
  6. 如权利要求1-5任一项所述的方法，其特征在于，还包括：
    所述第一网络设备在通过备份路径发送报文时，所述第一网络设备接收所述粘连网络设备在故障恢复后发送的指示信息，所述指示信息用于指示所述粘连网络设备无法正确转发报 文，所述第一网络设备继续通过所述备份路径发送报文。
  7. 一种传输路径故障的处理方法，其特征在于，包括：
    粘连网络设备接收控制器发送的粘连标签，以及所述粘连标签对应的粘连标签栈列表；
    所述粘连网络设备向网络内的其它网络设备泛洪所述粘连标签，以及所述粘连标签对应的粘连标签栈列表。
  8. 一种传输路径故障的处理装置，其特征在于，所述装置应用第一网络设备，包括：
    接收模块，用于接收粘连网络设备发送的粘连标签，以及粘连标签对应的粘连标签栈列表；
    处理模块，用于在通过主路径发送报文的过程中，确定所述粘连网络设备发生故障；
    其中，所述报文中包括用于指导所述报文在所述主路径上转发的标签栈列表，所述粘连网络设备为在所述主路径上所述第一网络设备的下一跳网络设备；
    所述处理模块，还用于将所述标签栈列表中的粘连标签交换为所述粘连标签栈列表；
    发送模块，用于基于所述处理模块更新后的标签栈列表将所述报文切换到备份路径上发送。
  9. 如权利要求8所述的装置，其特征在于，所述处理模块，还用于在所述接收模块接收粘连网络设备发送的粘连标签，以及粘连标签对应的粘连标签栈列表后，将所述粘连标签以及对应的粘连标签栈列表保存在所述第一网络设备为所述粘连网络设备生成的标签信息表中；
    所述处理模块，在将所述标签栈列表中的粘连标签交换为所述粘连标签栈列表时，具体用于从所述标签栈列表的栈顶获取第一标签，所述第一标签用于指示转发所述报文的下一跳网络设备为所述粘连网络设备；基于备份转发表确定所述第一标签对应的第一转发行为；所述备份转发表用于指示所述备份路径；所述第一转发行为用于指示查找所述标签信息表；基于所述标签信息表确定位于所述粘连标签栈列表栈顶的第二标签，所述第二标签用于指示在所述主路径上，所述粘连网络设备的下一跳网络设备为第三网络设备；将所述第二标签作为入标签，从所述备份转发表中确定由所述第一网络设备到所述第三网络设备的备份路径的出标签；
    所述发送模块，具体用于基于所述出标签向备份路径上所述第一网络设备的下一跳网络设备发送所述报文。
  10. 如权利要求8或9所述的装置，其特征在于，所述接收模块，具体用于接收所述粘连网络设备发送的标签长度内容TLV，所述TLV中包括所述粘连标签以及粘连标签对应的粘连标签栈列表。
  11. 如权利要求10所述的装置，其特征在于，所述TLV为标签绑定SID/Label Binding TLV。
  12. 如权利要求8-11任一项所述的装置，其特征在于，所述发送模块，还用于在所述接收模块接收到所述粘连网络设备在网络内泛洪的所述第三网络设备的节点段标识之后，向所述网络内的其它网络设备泛洪所述第三网络设备的节点段标识。
  13. 如权利要求8-12任一项所述的装置，其特征在于，所述接收模块，还用于在所述发送模块通过备份路径发送报文时，接收所述粘连网络设备在故障恢复后发送的指示信息，所述指示信息用于指示所述粘连网络设备无法正确转发报文，所述发送模块，还用于继续通过所述备份路径发送报文。
  14. 一种传输路径故障的处理装置，其特征在于，包括：
    接收模块，用于接收控制器发送的粘连标签，以及所述粘连标签对应的粘连标签栈列表；
    发送模块，用于向网络内的其它网络设备泛洪所述粘连标签，以及所述粘连标签对应的粘连标签栈列表。
  15. 一种网络设备，其特征在于，包括：
    通信接口、处理器和存储器；
    所述存储器用于存储软件程序，所述处理器用于读取所述存储器中存储的软件程序，通过所述通信接口收发消息，并实现权利要求1至6任一项所述的方法。
  16. 一种网络设备，其特征在于，包括：
    通信接口、处理器和存储器；
    所述存储器用于存储软件程序，所述处理器用于读取所述存储器中存储的软件程序，通过所述通信接口收发消息，并实现权利要求7所述的方法。
  17. 一种系统，其特征在于，包括如权利要求8至13任一所述的装置和如权利要求14所述的装置；或者，所述系统包括如权利要求15所述的网络设备和如权利要求16所述的网络设备。
  18. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质中存储软件程序，所述软件程序在被一个或多个处理器读取并执行时可实现权利要求1至7任一项所述的方法。
PCT/CN2019/091512 2018-06-30 2019-06-17 一种传输路径故障的处理方法、装置及系统 WO2020001309A1 (zh)

Priority Applications (7)

Application Number Priority Date Filing Date Title
JP2020572767A JP7130784B2 (ja) 2018-06-30 2019-06-17 送信経路障害処理方法および装置、ならびにシステム
KR1020237002163A KR102589957B1 (ko) 2018-06-30 2019-06-17 전송 경로 장애 처리 방법 및 장치, 그리고 시스템
KR1020207037821A KR102491583B1 (ko) 2018-06-30 2019-06-17 전송 경로 장애 처리 방법 및 장치, 그리고 시스템
EP19824831.2A EP3731469A4 (en) 2018-06-30 2019-06-17 TRANSMISSION PATH FAILURE TREATMENT PROCESS, ASSOCIATED EQUIPMENT AND SYSTEM
US16/997,293 US11888732B2 (en) 2018-06-30 2020-08-19 Transmission path fault processing method and apparatus, and system
JP2022133290A JP7387836B2 (ja) 2018-06-30 2022-08-24 送信経路障害処理方法および装置、ならびにシステム
US18/536,967 US20240113965A1 (en) 2018-06-30 2023-12-12 Transmission path fault processing method and apparatus, and system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810703774.9 2018-06-30
CN201810703774.9A CN110661700B (zh) 2018-06-30 2018-06-30 一种传输路径故障的处理方法、装置及系统

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/997,293 Continuation US11888732B2 (en) 2018-06-30 2020-08-19 Transmission path fault processing method and apparatus, and system

Publications (1)

Publication Number Publication Date
WO2020001309A1 true WO2020001309A1 (zh) 2020-01-02

Family

ID=68985924

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/091512 WO2020001309A1 (zh) 2018-06-30 2019-06-17 一种传输路径故障的处理方法、装置及系统

Country Status (6)

Country Link
US (2) US11888732B2 (zh)
EP (1) EP3731469A4 (zh)
JP (2) JP7130784B2 (zh)
KR (2) KR102589957B1 (zh)
CN (2) CN110661700B (zh)
WO (1) WO2020001309A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113162849A (zh) * 2020-01-22 2021-07-23 华为技术有限公司 一种报文处理方法、装置及系统
CN113691445A (zh) * 2020-05-18 2021-11-23 华为技术有限公司 报文转发备份路径确定方法及相关设备
JP2022085887A (ja) * 2020-11-27 2022-06-08 華為技術有限公司 通信方法および装置

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021046689A1 (en) * 2019-09-09 2021-03-18 Telefonaktiebolaget Lm Ericsson (Publ) Method and network node for label switched path traceroute
US11431618B2 (en) 2019-09-19 2022-08-30 Nokia Solutions And Networks Oy Flexible path encoding in packet switched networks
US11677658B2 (en) * 2019-09-19 2023-06-13 Nokia Solutions And Networks Oy Packet routing based on common node protection
CN115314563A (zh) * 2020-01-20 2022-11-08 华为技术有限公司 一种消息生成方法、处理方法及装置
US11438259B2 (en) * 2020-02-18 2022-09-06 Juniper Networks, Inc. Flexible algorithm aware border gateway protocol (BGP) prefix segment routing identifiers (SIDs)
CN113315697B (zh) * 2020-02-26 2022-11-11 华为技术有限公司 报文处理方法、装置、网络设备及存储介质
CN113691446B (zh) * 2020-05-19 2023-02-10 华为技术有限公司 一种报文发送的方法和装置
CN113746729B (zh) * 2020-05-28 2023-03-10 华为技术有限公司 绑定段标识的处理方法及设备
CN114301832A (zh) * 2020-09-21 2022-04-08 华为技术有限公司 一种业务处理方法及网络设备
CN112787939B (zh) * 2020-12-30 2022-11-08 迈普通信技术股份有限公司 路径转发表更新方法及装置
CN116915685B (zh) * 2023-09-06 2023-12-12 新华三技术有限公司 报文传输方法、装置及电子设备

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150256456A1 (en) * 2014-03-06 2015-09-10 Cisco Technology, Inc. Segment routing extension headers
CN105763448A (zh) * 2016-03-07 2016-07-13 杭州华三通信技术有限公司 一种报文传输方法和装置
CN107547371A (zh) * 2017-09-28 2018-01-05 新华三技术有限公司 一种报文转发方法及装置

Family Cites Families (29)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7206087B2 (en) * 2000-05-16 2007-04-17 Xerox Corporation Finishing module coordinator apparatus and method for assembler/finisher systems
US7864346B2 (en) * 2000-05-16 2011-01-04 Xerox Corporation Apparatus and method for describing, planning and automatically programming complex finishing tasks
US7463591B1 (en) * 2001-06-25 2008-12-09 Juniper Networks, Inc. Detecting data plane liveliness of a label-switched path
US8305882B2 (en) * 2001-12-18 2012-11-06 Horizon Technology Funding Company V Llc Methods, systems, and computer program products for detecting and/or correcting faults in a multiprotocol label switching network by using redundant paths between nodes
US20040028064A1 (en) * 2002-08-09 2004-02-12 Alcatel Stitching-extending MPLS tunnels to the customer interface
DE10337465B4 (de) 2003-08-14 2009-10-15 Nokia Siemens Networks Gmbh & Co.Kg Verfahren zum Routing von Datenpaketen in einem mehrere Netzknoten aufweisenden paketvermittelnden Kommunikationsnetz
JP2005260321A (ja) 2004-03-09 2005-09-22 Nec Corp ラベルパスネットワークの迂回制御方式
JP4434867B2 (ja) 2004-07-15 2010-03-17 富士通株式会社 Ｍｐｌｓネットワークシステム及びノード
JP2007074311A (ja) 2005-09-06 2007-03-22 Nippon Telegr & Teleph Corp <Ntt> 迂回ｌｓｐ設定方法、マルチキャストｍｐｌｓ転送装置、及びプログラム
US7940695B1 (en) * 2007-06-08 2011-05-10 Juniper Networks, Inc. Failure detection for tunneled label-switched paths
JP4729119B2 (ja) 2007-10-25 2011-07-20 富士通株式会社 ラベルスイッチングネットワークにおける通信装置
CN101588520A (zh) * 2009-07-07 2009-11-25 北京邮电大学 一种用于mpls-tp网络的段保护方法
US8879384B2 (en) 2009-09-14 2014-11-04 Alcatel Lucent Fast upstream source failure detection
US8422364B2 (en) * 2010-05-17 2013-04-16 Cisco Technology, Inc. Multicast label distribution protocol node protection
GB201314642D0 (en) * 2013-08-15 2013-10-02 Summerfield Gideon Image Identification System and Method
US9350605B2 (en) * 2013-10-11 2016-05-24 Ciena Corporation Method and apparatus for multi-instance control plane for dynamic MPLS-TP tunnel management via in-band communication channel (G-ACH)
US10097372B2 (en) * 2014-01-09 2018-10-09 Ciena Corporation Method for resource optimized network virtualization overlay transport in virtualized data center environments
US10063463B2 (en) * 2014-12-16 2018-08-28 Cisco Technology, Inc. Node protection for segment routing adjacency segments
CN105871721B (zh) * 2015-01-19 2020-05-05 中兴通讯股份有限公司 一种段路由处理方法、处理装置及发送装置
CN105871722B (zh) * 2015-01-19 2020-02-14 中兴通讯股份有限公司 标签构造以及标签报文转发方法及装置
US10637775B2 (en) * 2015-10-17 2020-04-28 Cisco Technology, Inc. Make-before-break mechanism for label switched paths
US10164907B2 (en) * 2015-11-25 2018-12-25 Telefonaktiebolaget Lm Ericsson (Publ) Method and system for completing loosely specified MDTs
WO2017118880A1 (en) * 2016-01-08 2017-07-13 Telefonaktiebolaget Lm Ericsson (Publ) Faster convergence on primary provider edge (pe) failure in a single-active redundancy topology
US9992105B2 (en) * 2016-03-30 2018-06-05 Juniper Networks, Inc. Label switched path reporting
US10237173B2 (en) 2016-07-21 2019-03-19 Cisco Technology, Inc. Target FEC (forwarding equivalence class) stack based FEC query in segment routing environments
CN107666438B (zh) 2016-07-27 2021-10-22 中兴通讯股份有限公司 报文转发方法及装置
CN108023815B (zh) * 2016-11-03 2020-10-30 中兴通讯股份有限公司 信息传输方法、装置及系统
US10812369B2 (en) * 2017-04-27 2020-10-20 Futurewei Technologies, Inc. Label switched path (LSP) stitching without session crossing domains
CN107547389B (zh) * 2017-08-30 2020-10-09 新华三技术有限公司 网络接入方法、装置及机器可读存储介质

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150256456A1 (en) * 2014-03-06 2015-09-10 Cisco Technology, Inc. Segment routing extension headers
CN105763448A (zh) * 2016-03-07 2016-07-13 杭州华三通信技术有限公司 一种报文传输方法和装置
CN107547371A (zh) * 2017-09-28 2018-01-05 新华三技术有限公司 一种报文转发方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
S. PREVIDI ET AL.: "Draft-ietf-isis-segment-routing-extensions-18", IS - IS EXTENSIONS FOR SEGMENT ROUTING, 20 June 2018 (2018-06-20), XP055673815 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113162849A (zh) * 2020-01-22 2021-07-23 华为技术有限公司 一种报文处理方法、装置及系统
CN113691445A (zh) * 2020-05-18 2021-11-23 华为技术有限公司 报文转发备份路径确定方法及相关设备
CN113691445B (zh) * 2020-05-18 2022-12-02 华为技术有限公司 报文转发备份路径确定方法及相关设备
JP2022085887A (ja) * 2020-11-27 2022-06-08 華為技術有限公司 通信方法および装置
JP7273130B2 (ja) 2020-11-27 2023-05-12 華為技術有限公司 通信方法および装置

Also Published As

Publication number Publication date
JP7387836B2 (ja) 2023-11-28
KR20230015522A (ko) 2023-01-31
EP3731469A4 (en) 2020-12-09
KR102589957B1 (ko) 2023-10-13
CN114070782B (zh) 2023-05-16
KR20210008428A (ko) 2021-01-21
EP3731469A1 (en) 2020-10-28
KR102491583B1 (ko) 2023-01-20
CN114070782A (zh) 2022-02-18
CN110661700B (zh) 2021-10-15
CN110661700A (zh) 2020-01-07
US20200382416A1 (en) 2020-12-03
US11888732B2 (en) 2024-01-30
JP7130784B2 (ja) 2022-09-05
US20240113965A1 (en) 2024-04-04
JP2022176998A (ja) 2022-11-30
JP2021530891A (ja) 2021-11-11

Similar Documents

Publication Publication Date Title
WO2020001309A1 (zh) 一种传输路径故障的处理方法、装置及系统
WO2020001307A1 (zh) 一种传输路径故障的处理方法、装置及系统
US10992574B2 (en) Packet forwarding method and device
WO2021258754A1 (zh) 报文指示方法、装置、设备和存储介质
US9998368B2 (en) Zone routing system
WO2015149598A1 (zh) 报文处理的方法及标签交换路由器
CN108632146A (zh) 报文处理的方法及路由器
CN112868214B (zh) 分组内的协调负载转移oam记录
CN114531395B (zh) 一种通告网络设备处理能力的方法、设备和系统
EP3582454B1 (en) Graceful restart procedures for label switched paths with label stacks
CN111224870B (zh) 一种SR-MPLS Anycast场景下的故障修复方法、设备和存储介质
JP2023549512A (ja) 情報処理方法、ノード及びコンピュータ読み取り可能な記憶媒体

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19824831

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2019824831

Country of ref document: EP

Effective date: 20200722

ENP Entry into the national phase

Ref document number: 2020572767

Country of ref document: JP

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 20207037821

Country of ref document: KR

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE