WO2009121292A1 - 一种建立备份标签交换路径的方法及节点和系统 - Google Patents

一种建立备份标签交换路径的方法及节点和系统 Download PDF

Info

Publication number
WO2009121292A1
WO2009121292A1 PCT/CN2009/071104 CN2009071104W WO2009121292A1 WO 2009121292 A1 WO2009121292 A1 WO 2009121292A1 CN 2009071104 W CN2009071104 W CN 2009071104W WO 2009121292 A1 WO2009121292 A1 WO 2009121292A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
path
backup
fault
label
Prior art date
Application number
PCT/CN2009/071104
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 华为技术有限公司
Publication of WO2009121292A1 publication Critical patent/WO2009121292A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/40—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection

Definitions

  • the embodiments of the present invention relate to a label switching technology, and in particular, to a method for establishing a backup label switching path, a protection switching method for a fault, and a section, and system. Background technique
  • Multi Protocol Label Switch is a protocol proposed to improve the forwarding speed of routers. It is an IP switching technology that combines Layer 3 IP and Layer 2 switching. The core idea is that The packets are classified, the packets are tagged according to different categories, and a Label Switch Path (LSP) is established, and then the packets are transmitted on the pre-established label switching path according to the labels only in the MPLS network.
  • LSP Label Switch Path
  • GPLS general-purpose MPLS
  • T-MPLS Transport MPLS
  • Multicast is a routing technology that optimizes the use of bandwidth, allowing IP traffic to be sent from one root or multiple roots to multiple leaf locations.
  • the application sends only one copy of each packet to a group of computers that accept the information.
  • the key is how to map the Layer 3 (L3) IP multicast routing to the point-to-multipoint LSP (P2MP LSP) in the label switching network.
  • the method for improving the survivability of the point-to-multipoint LSP (P2MP LSP) is to establish a backup P2MP LSP for the working P2MP LSP.
  • P2MP LSP Point-to-multipoint LSP
  • P2MP LSP itself requires Taking up a lot of network resources, protecting it consumes more bandwidth. Therefore, how to implement effective point-to-multipoint LSP (P2MP LSP) protection with a minimum of resources becomes a very valuable research topic. Summary of the invention
  • Embodiments of the present invention provide a method for establishing a backup label switching path, a protection switching method for a fault, and a node and a system, to implement effective point-to-multipoint LSP (P2MP LSP) protection with a minimum of resources.
  • P2MP LSP point-to-multipoint LSP
  • An embodiment of the present invention provides a method for establishing a backup label switching path, including: receiving signaling for establishing a backup label switching path;
  • the embodiment of the present invention further provides a fault protection switching method, including: when a fault occurs, the local repair point sends a service packet to the fault-independent branch node, and the fault-independent branch node separately sends the service packet to the working path.
  • the embodiment of the invention further provides a node, including:
  • a receiving unit configured to receive signaling for establishing a backup label switching path
  • the determining unit is configured to determine whether the node is a fault-independent branch node, and the processing unit is configured to bind the upstream and downstream working paths and the backup path when the determining result of the determining unit is yes.
  • the embodiment of the present invention further provides a fault protection switching system, including: a first node, configured to send a service packet;
  • a second node configured to send the received service text sent by the first node to a downstream node of the working path and a downstream node of the backup path.
  • the method for establishing a backup label switching path, the method for protecting a fault of a fault, and the node and the system avoid the backup path and the working path by utilizing the working path unrelated to the fault.
  • Overlap and backup path The waste of resources caused by the loop formed by the working path saves network resources and label resources.
  • a service packet is sent to prevent repeated transmission of service packets, and bandwidth resources are saved to minimize Resources enable efficient point-to-multipoint LSP (P2MP LSP) protection.
  • P2MP LSP point-to-multipoint LSP
  • FIG. 1 is a flowchart of a method for establishing a backup label switching path according to an embodiment of the present invention
  • FIG. 2 is a schematic diagram of a method for establishing a backup label switching path according to an embodiment of the present invention
  • FIG. 3 is a schematic diagram of a method for establishing a backup label switching path according to an embodiment of the present invention
  • FIG. 4 is a schematic diagram of a method for establishing a backup label switching path according to an embodiment of the present invention
  • FIG. 5 is a schematic diagram of a method for establishing a backup label switching path according to an embodiment of the present invention
  • FIG. 6 is a schematic diagram of a method for establishing a backup label switching path according to an embodiment of the present invention.
  • FIG. 7 is a schematic diagram of a method for establishing a backup label switching path according to an embodiment of the present invention.
  • FIG. 8 is a flowchart of a fault protection switching method according to an embodiment of the present invention.
  • FIG. 9 is a schematic diagram of a fault protection switching method according to an embodiment of the present invention.
  • FIG. 10 is a schematic diagram of a fault protection switching method according to an embodiment of the present invention.
  • FIG. 11 is a schematic diagram of a node according to an embodiment of the present invention.
  • FIG. 12 is a schematic diagram of a fault protection switching system according to an embodiment of the present invention. detailed description
  • a method for establishing a backup label switching path includes:
  • Step 101 Receive signaling for establishing a backup label switching path.
  • Step 102 Determine whether the node is a fault-independent branch node, and if yes, execute step 103.
  • Step 103 Bind the upstream and downstream working paths and the backup path.
  • a method for establishing a backup label switching path further comprising: the leaf node information protected by the backup path in the signaling, and the leaf node information and the current node protected by the node according to the carried backup path
  • the leaf node information saved by the node determines whether the node is a fault-independent branch node.
  • Another embodiment of the present invention provides a method for establishing a backup label switching path, which further includes: the signaling carries the fault-independent branch node information, and the node determines whether the node is fault-independent according to the fault-independent branch node information carried therein Branch node.
  • a method for establishing a backup label switching path the binding of the upstream and downstream working paths and the backup path is specifically performed to establish a label mapping or a setup between the working inbound label and the backup out label of the local node.
  • the label mapping between the backup inbound label and the working out label of the node is specifically performed to establish a label mapping or a setup between the working inbound label and the backup out label of the local node.
  • the binding mode of the upstream and downstream working paths and the backup path are bound by the same identifier.
  • the specific binding mode does not limit the present invention.
  • a method for establishing a backup label switching path where the signaling carries the working out label and the outbound port information corresponding to each fault-independent branch node, and the fault-independent branch node performs the work according to the carried
  • the label and outbound port information establish a label mapping between the backup inbound label and the working out label.
  • the embodiment of the present invention may not carry the information in the signaling, but save the downstream node by each fault-independent branch node.
  • the assigned work out label and out port information may be carried.
  • a method for establishing a backup label switching path wherein the leaf node information protected according to the carried backup path and the leaf saved by the node are included in the leaf node information saved by the node If the node information other than the leaf node information of the backup path protection is backed up, it is determined that the node is a fault-independent branch node.
  • a method for establishing a backup label switching path according to another embodiment of the present invention wherein the fault-independent branch node information is performed by a local repair point according to routing information of the working path signaling and routing information calculated according to the topology. Contrast obtained.
  • a method for establishing a backup label switching path further includes: sending a notification message carrying the fault-independent branch node to a local repair point.
  • a method for establishing a backup label switching path which effectively utilizes a node that is not affected by a fault on a point-to-multipoint LSP (P2MP LSP), and establishes a backup path as a fault-independent branch node, thereby effectively avoiding
  • the overlap of the backup path and the working path and the loop formed by the backup path and the working path prevent the data from being sent multiple times on the same link when the fault occurs, which reduces the waste of resources caused by the backup path, and is effective with the least resources.
  • Point-to-multipoint LSP (P2MP LSP) protection As shown in FIG. 2, a method for establishing a backup label switching path according to another embodiment of the present invention is shown.
  • R1 is the root node of the point-to-multipoint LSP (P2MP LSP)
  • R5, R12, and R13 are the leaf nodes of the point-to-multipoint LSP (P2MP LSP).
  • the solid path in the figure is the point-to-multipoint LSP (P2MP LSP). Tree topology.
  • Each node records the multicast leaf that the service arrives through the node according to the ERO and SERO objects carried in the received PATH message. Node information.
  • the method for establishing a point-to-multipoint LSP (P2MP LSP) and a backup path provided by the embodiment of the present invention is not limited to a resource reservation protocol (RSVP), and may also adopt a label distribution protocol (LDP) or a constraint-based routing LDP (CR-). LDP) to achieve.
  • RSVP resource reservation protocol
  • LDP label distribution protocol
  • CR- constraint-based routing LDP
  • R2 when R2 receives the PATH message, it records that the leaf node that the service will reach through the node is R5, R12, and R13, which may be the IP address of the leaf node, or any identifier that indicates the node, and the present invention does not Make restrictions.
  • the embodiment of the present invention refers to the record as a leaf node table and has the following format:
  • the ERP sent by R2 to R3 is ERO: ⁇ R3, R4, R5 ⁇ , ⁇ S2L_SUB_LSP> object-R5
  • R3 sends a PATH message to R4 ERO: ⁇ R4, R5 ⁇ , ⁇ S2L_SUB_LSP> object-R5
  • R2 sends the PATH message to R6.
  • the establishment of the backup path is performed by taking R2 as R6 for the local repair backup path.
  • R2 calculates the backup path of the rerouting, as shown by the dotted line in Figure 2, and the backup path is
  • R2 uses the route as the ERO and SERO object of the PATH message, and sends a PATH message along the route to establish a backup path for rerouting.
  • the embodiment of the present invention extends the PATH message, and adds a new object ⁇ ( ⁇ (1 node> object) to record the leaf node information of the rerouting path protection.
  • R2 is R6 for local repair.
  • the backup path is finally to protect R12 and R13, so the ⁇ protected nodo ⁇ t icon in the sent PATH message should contain R12 and R13.
  • the node on the backup path receives the PATH message and compares it with the leaf node table in the node according to the ⁇ protected node> object. If there are other nodes in the leaf node table other than the node in the ⁇ protected node>? Then, the flag is marked in the path state of the node, indicating that the backup path can be established by the node as the fault-independent branch node, and the service replication is forwarded from the node to the downstream node of the working path and the downstream node of the backup path when the fault occurs. .
  • R3 and R4 are marked with the flag in the path status of the node.
  • the RESV message is sent back.
  • the node After receiving the Resv message, the node performs corresponding processing according to the flag identifier. When the node does not have the flag identifier, it forwards according to the protocol; when the node has a flag, it indicates that it can The node establishes a backup path for the fault-independent branch node, and the node performs label mapping.
  • the node path state has a flag identifier, so label mapping is performed at R4.
  • Lsl Lsl ⁇ Ll, where Lsl is the incoming label of R4 on the point-to-multipoint LSP (P2MP LSP) working path, and L1 is the outgoing label of R4 on the backup path.
  • R4 sends a Notify message to the local repair node R2 (PLR), informing R2 to branch the working path at R4, establish a backup path, and clear the flag identifier.
  • PLR local repair node
  • the Notify message adds a notification type to the ⁇ ERROR_SPEC> object, carrying the fault-independent branch node information, indicating that the node can be used as a fault-independent branch node to establish a backup path.
  • R2—R3—R4 uses the working path.
  • the backup path and the working path between R8 and R12 can be merged. This situation is the same as the unicast case and is not described here.
  • a method for establishing a backup label switching path which effectively utilizes a node that is not affected by a fault on a point-to-multipoint LSP (P2MP LSP), and establishes a backup path as a fault-independent branch node, thereby effectively avoiding
  • P2MP LSP point-to-multipoint LSP
  • the overlap between the backup path and the working path prevents data from being sent multiple times on the same link when the fault occurs, reducing the waste of resources caused by the backup path, and implementing effective point-to-multipoint LSP (P2MP LSP) with the least resources.
  • FIG. 3 illustrates a method for establishing a backup label switching path according to another embodiment of the present invention.
  • R1 is the root node of a point-to-multipoint LSP (P2MP LSP)
  • R5, R12, and R13 are leaf nodes of a point-to-multipoint LSP (P2MP LSP).
  • the solid path in the figure is a point-to-multipoint LSP ( Tree topology of P2MP LSP).
  • the leaf node table of the nodes R3 and R4 is
  • the leaf node table of R7 and R8 is
  • R2 is the R6 node for the local repair backup path establishment process
  • first R2 calculates the local repair rerouting, as shown by the dotted line in Figure 3, R2 - R3 - R4 - R8 - R 12
  • R2 sends a PATH message, where ⁇ ( ⁇ (1 110(16> is 1 12, R13; the node that receives the PATH message according to the leaf node table and ⁇ ( ⁇ (1)(1> compare if the leaf node If the table contains other nodes than the node in the ⁇ protected node ⁇ image, the node will be marked with the flag in the node path state, indicating that the backup path can be established with the node as the fault-independent branch node.
  • R3 and R4 can set the flag identifier, and R12 in the leaf node table of R7 is included in the ⁇ protected node>, so the backup path cannot be established as a branch node.
  • R13 and R12 send a RESV message to R2 after receiving the PATH message.
  • R4 receives the RESV message sent from R12 and R13 respectively.
  • the node path status has a flag identifier. It indicates that the backup path can be established as a fault-independent branch node.
  • Label mapping is performed at R4, Lsl Ll, Lsl ⁇ L2, where Lsl is the incoming label of R4 on the P2MP LSP working path, and L1 is the backup path branch.
  • the incoming label of R7, L2 is the incoming label of R8 on the backup path branch.
  • R4 sends a Notify message to the local repair node R2 (PLR), informing R2 to branch the working path in R4, establish a backup path, and clear the flag identifier.
  • PLR local repair node
  • R4— R8 — R12 R7 — R9 — R13 The R2—R3—R4 part utilizes the working path.
  • the backup path and the working path between R8 and R12, and R9 and R13 can be merged. This situation is the same as the unicast case and is not described here.
  • a method for establishing a backup label switching path which effectively utilizes a node that is not affected by a fault on a point-to-multipoint LSP (P2MP LSP), and establishes a backup path as a fault-independent branch node, thereby effectively avoiding
  • P2MP LSP point-to-multipoint LSP
  • the overlap between the backup path and the working path prevents data from being sent multiple times on the same link when the fault occurs, reducing the waste of resources caused by the backup path, and implementing effective point-to-multipoint LSP (P2MP LSP) with the least resources.
  • FIG. 4 illustrates a method for establishing a backup label switching path according to another embodiment of the present invention.
  • R1 is the root node of the point-to-multipoint LSP (P2MP LSP)
  • R5, R12, R13, and R14 are leaf nodes of the point-to-multipoint LSP (P2MP LSP).
  • the solid line path is a point-to-multipoint LSP (P2MP LSP).
  • P2MP LSP point-to-multipoint LSP
  • the tree topology According to the processing method similar to the embodiment of Fig. 2, it can be seen that the leaf node table of R2 is
  • the leaf node table of nodes R3 and R4 is
  • the leaf node table of R7 and R8 is
  • the leaf node table of R9 is
  • R6 when R6 is the R9 node for the local repair backup path establishment process, R6 first calculates the local repair reroute, as shown by the dotted line in Figure 4.
  • R6— R2 — R3 — R4 — R8 — Rll — RIO — R14 R15 — R13 The calculation of the backup path is known in the prior art and will not be described here.
  • R6 sends a PATH message, where ⁇ ( ⁇ (1 110(16> is 1, 13, R14; the node that receives the PATH message according to the leaf node table and ⁇ ( ⁇ (1)(16> compare, if the leaf node
  • the table contains other nodes except the node in the ⁇ protected node ⁇ image, and the node identifies the flag in the node path state, indicating that the backup path can be established with the node as the fault-independent branch node.
  • R2, R3, R4, R8 can set the flag identifier.
  • R13 and R14 After receiving the PATH message, R13 and R14 send a Resv message to R6.
  • R8 receives the Resv message sent from R14, and checks the path status of the node. If there is a flag in the path status of the node, it indicates that the backup path can be established as a fault-independent branch node. Label mapping is performed on R8, Ls2 L2, where Ls2 is the point to The inbound label of R8 on the working path of the multi-point LSP (P2MP LSP), and L2 is the inbound label of R11 on the backup path.
  • P2MP LSP multi-point LSP
  • R8 sends a Notify message to the local repair node R6 (PLR), informing R6 to branch the working path on R8, establish a backup path, and clear the flag identifier.
  • PLR local repair node
  • R2 processes the RESV message sent from R13, and establishes a label mapping, Lsl Ll, where Lsl is the incoming label of the working path R2 on the point-to-multipoint LSP (P2MP LSP), and L1 is the incoming label of the R15 carried by the RESV message, and R6 sends a Notify message, indicating that R2 also establishes a backup path for the fault-independent branch node and clears the path status identifier.
  • Lsl Ll the incoming label of the working path R2 on the point-to-multipoint LSP
  • L1 is the incoming label of the R15 carried by the RESV message
  • R6 sends a Notify message, indicating that R2 also establishes a backup path for the fault-independent branch node and clears the path status identifier.
  • the backup path established by R6 for local repair of R9 consists of two parts, R8-Rll-RIO-R14, R2-R15-R13.
  • the multicast service replication can be forwarded to the backup path R2—R15—R13 at R2, avoiding the multicast service passing through R2—R6, and then copying and forwarding to the backup path R6—R2 at R6—
  • the backup path and the working path of the R15o RIO-R14 can be merged. This situation is the same as the unicast case and is not described here.
  • a method for establishing a backup label switching path which effectively utilizes a node that is not affected by a fault on a point-to-multipoint LSP (P2MP LSP), and establishes a backup path as a fault-independent branch node, thereby effectively avoiding
  • the overlap of the backup path and the working path and the loop formed by the backup path and the working path prevent the data from being sent multiple times on the same link when the fault occurs, which reduces the waste of resources caused by the backup path, and is effective with the least resources.
  • Point-to-multipoint LSP (P2MP LSP) protection FIG. 5 shows a method for establishing a backup label switching path according to another embodiment of the present invention.
  • R6 is R9 for local repair.
  • the backup route calculated when the backup path is established is shown by the dotted line in Figure 5.
  • R6 sends a PATH message, where ⁇ ( ⁇ (1 110(16> is 1, 13, R14; the node that receives the PATH message according to the leaf node table and ⁇ ( ⁇ (1)(16> compare, if the leaf node
  • the table contains other nodes except the node in the ⁇ protected node ⁇ image, and the node identifies the flag in the node path state, indicating that the backup path can be established with the node as the fault-independent branch node.
  • R2, R3, R4, R8 can set the flag identifier.
  • R13 and R14 After receiving the PATH message, R13 and R14 send back the RESV message to R6.
  • R8 receives the RESV message sent from R14, and checks the path status of the node. If there is a flag in the path status of the node, it indicates that the backup path can be established as a fault-independent branch node. Label mapping is performed on R8, Ls2 L2, where Ls2 is the point to The inbound label of R8 on the working path of the multi-point LSP (P2MP LSP), and L2 is the inbound label of R11 on the backup path.
  • P2MP LSP multi-point LSP
  • R8 sends a Notify message to the local repair node R6 (PLR), informing R6 to branch the working path at R8, establish a backup path, and clear the flag identifier.
  • PLR local repair node
  • R6 the local repair node
  • R2 processes the RESV message sent from R13, establishes a label mapping, Lsl Ll, where Lsl is the entry of the working path R2 on the point-to-multipoint LSP (P2MP LSP)
  • the label, L1 is the inbound label of R15 carried in the RESV message, and sends a Notify message to R6, indicating that R2 also establishes a backup path for the branch node and clears the path status identifier.
  • the backup path established by R6 for local repair of R9 consists of two parts, R8 - R11 - RIO - R14, R2 - R15 - R13.
  • the backup path and working path between R10 and R14 can be merged. This situation is the same as the unicast case. It is a prior art and will not be described here.
  • a method for establishing a backup label switching path which effectively utilizes a node that is not affected by a fault on a point-to-multipoint LSP (P2MP LSP), and establishes a backup path as a fault-independent branch node, thereby effectively avoiding
  • P2MP LSP point-to-multipoint LSP
  • the overlap of the backup path and the working path and the loop formed by the backup path and the working path prevent the data from being sent multiple times on the same link when the fault occurs, which reduces the waste of resources caused by the backup path, and is effective with the least resources.
  • Point-to-multipoint LSP (P2MP LSP) protection is provided.
  • the embodiment of the present invention further provides a method for establishing a backup label switching path.
  • Each node on the backup route receives a signal for establishing a backup label switching path sent by a local repair point, where the signaling carries fault-independent branch node information.
  • the fault-independent branch node information is obtained by comparing the routing information of the working path signaling by the local repair point with the backup path routing information calculated according to the topology.
  • the fault-independent branch node determines that the node is a fault-independent branch node according to the fault-independent branch node information carried in the received signaling, the upstream backup path and the downstream working path are bound;
  • the binding between the backup ingress label of the node and the label mapping between the working out tags may be used, or any other binding manner may be adopted.
  • the fault-independent branch node assigns a label to the upstream backup path, that is, the backup inbound label of the node is Ls4, and the downstream node R5 on the downstream working path of the fault-independent branch node is the label assigned to the downstream working path of the fault-independent branch node. , that is, the working out label of the node is Ls5, then the label mapping Ls4 Ls5 is established.
  • the fault-independent branch node sends a message to the upstream node to complete the establishment of the backup label switching path. For example, a Resv message may be sent to a node, until the local repair point receives the Resv message, and the backup label switching path is established.
  • the embodiment of the present invention further provides a method for establishing a backup label switching path.
  • R1 is a root node of a working point to multipoint LSP (P2MP LSP), and R5, R12, and Rl 3 are working point to multiple points.
  • the leaf node of the LSP (P2MP LSP), the solid line path in Figure 6 is the tree topology of the working point to multipoint LSP (P2MP LSP).
  • R2 is used to protect R6 as an example, that is, R2 is a local repair point PLR, and a backup point-to-multipoint LSP is established to protect against link faults of R6 faults or R2 to R6.
  • the R2 node carries the working P2MP carried in the working path signaling according to R1.
  • the routing information of the LSP and the R2 node itself obtain the fault-independent branch node information according to the backup path routing information calculated by the topology. Specifically,
  • the explicit routing information carried in the signaling that R2 receives the working P2MP LSP is:
  • R2 can determine that the R5 branch path does not contain R6. Therefore, the branch path of R5 is the fault-independent branch path.
  • R2 can determine the R2 and R13 of the P2MP LSP according to the routing information of the backup P2MP LSP. If the branch path is not related to the fault on the working P2MP LSP, that is, the last route coincidence point of the R5 branch path is R4, then it is determined that R4 is a fault-independent branch node.
  • routing information of the working P2MP LSP can also be used when the signaling of the working P2MP LSP does not provide the explicit routing object ERO of the working P2MP LSP. Obtained by the record routing object RRO of the working P2MP LSP. Then, R2 initiates signaling to establish a backup P2MP LSP, where the fault-independent branch node information is carried. Specifically:
  • the Path message initiated by R2 to establish a backup P2MP LSP carries a joint object, which contains information about the fault-independent branch node, where is the address information of the node R4;
  • the fault-independent branch node information may further include downstream outgoing label and outgoing port information on the working P2MP LSP corresponding to each fault-independent branch node.
  • the downstream outgoing label and outgoing port information of the R4 node on the R5 branch of the working P2MP LSP As shown in Figure 6, the downstream outgoing label of R4 is 103, and the outgoing port is 3, then the R4 address information is The downstream outgoing label and outgoing port triplet information ⁇ R4, 103, 3> is carried in the fault-independent branch node information of the Path message initiated by R2 to establish a backup P2MP LSP.
  • the downstream outgoing label and outgoing port information of the working P2MP LSP corresponding to each fault-independent branch node can be obtained by the recording routing object RRO of the working P2MP LSP signaling. That is, when the working node root node initiates the establishment of the working P2MP LSP signaling, it carries the RRO object, which requires recording the node address information, the downstream outgoing label information, and the outgoing port information.
  • Path message of the backup P2MP LSP initiated by R2 also has an explicit routing object for backing up the P2MP LSP.
  • the session attribute session attribute object in the Path message of the backup P2MP LSP initiated by R2 is the same as the session attribute of the working path signaling except that the initiator address sender address is changed from R1 to R2.
  • the other node determines whether it is a fault-independent branch node according to the fault-independent branch node information carried therein. If yes, the upstream entry label of the backup P2MP LSP and the forwarding entry of the downstream outgoing label on the working P2MP LSP are established. Specifically
  • the R4 After receiving the Path message of the backup P2MP LSP from the R3, the R4 determines that the node is faulty because the ⁇ R4, 103, 3> in the fault-independent branch node information contained in the Path message contains the local node address. Irrelevant branch nodes. At this time, R4 not only needs to allocate the upstream label 402 to R3, but also establishes the following forwarding entry:
  • the node R4 can also query the forwarding table information. Get it by other means.
  • R4 also sends a Path message to R8 according to the explicit routing object. When R4 receives the Resv message sent from R8 and carries the label 403 from port 5, R4 will establish another switch.
  • the traffic of the backup P2MP LSP is received, the traffic is sent to the downstream node of the backup P2MP LSP and the downstream node of the working P2MP LSP.
  • the node when the node receives the signaling for establishing the backup P2MP LSP and judges that it is not a fault-independent branch node, it directly processes it according to the RSVP-TE protocol.
  • the protection switching relationship is configured, that is, the work label is switched to the backup label when the fault occurs. It is worth noting that if the PLR is configured on another working branch, the label on the working branch needs to be switched to the backup label to avoid protecting the repeated transmission on the coincident path.
  • PLR is No on another working branch can be known through the ERO object or RRO object of the working path.
  • Figure 7 shows the established backup P2MP LSP, where R2 is the PLR point.
  • the protection relationship configured on R2 is: ⁇ 100—>200, 100—>101 ⁇ Switch to ⁇ 100— >401 ⁇ .
  • the embodiment of the present invention further provides a fault protection switching method, including:
  • Step 801 When a fault occurs, the local repair point sends a service packet to the fault-independent branch node.
  • Step 802 The fault-independent branch node sends the service packet to the downstream node of the working path and the downstream node of the backup path.
  • a fault protection switching method includes: when a fault occurs, the local repair point sends the service packet to the fault-independent branch node through a working label, and the fault-independent branch node receives the local service After the switchover notification message sent by the repair point is sent, the service packet is sent to the downstream node of the working path and the downstream node of the backup path.
  • a fault protection switching method includes: when a fault occurs, the local repair point sends the service packet to the fault-independent branch node through a backup label, and the fault-independent branch node reports the service The text is sent to the downstream node of the working path and the downstream node of the backup path.
  • a fault protection switching method wherein the fault-independent branch node performs the service packet according to the label mapping of the current node and the downstream node of the working path and the downstream node of the backup path. They are sent to the downstream node of the working path and the downstream node of the backup path.
  • the label mapping between the working inbound label and the backup outgoing label of the local node and the label mapping of the backup inbound label and the working out label of the local node are obtained by using a method for establishing a backup label switching path provided by the embodiment of the present invention;
  • the label mapping between the working inbound label and the working out label of the node and the method for establishing the backup label switching path of the present node by using the embodiment of the present invention After the backup label switching path is established, the embodiment of the present invention further provides a fault protection switching method, which may be node protection or link protection.
  • the left part of Figure 9 is a schematic diagram of service packet transmission before the fault occurs.
  • the label 101 in the figure is a work label.
  • the protection switching action is performed: Local repair point A sends a service message to the fault-independent branch node B through the work tag 101; the local repair point A also sends a switch notification message to the fault-independent branch node B, that is, an indication message in the figure; when the fault-independent branch node B receives the message After the localization repair point A sends the switching advertisement message, according to the label mapping ⁇ 101 > 102, 101 > 401 ⁇ of the downstream node C of the current node and the working path and the downstream node E of the backup path, the service packet is respectively separated. It is sent to the downstream node of the working path and the downstream node of the backup path.
  • the switching point in this figure is B.
  • a fault protection switching method provided by the embodiment of the present invention utilizes a node that is not affected by a fault on a point-to-multipoint LSP (P2MP LSP), that is, a fault-independent branch node, thereby effectively avoiding overlapping of the backup path and the working path, and preventing When the fault occurs, the data is sent multiple times on the same link, which reduces the waste of resources caused by the backup path, and implements effective point-to-multipoint LSP (P2MP LSP) protection with a minimum of resources.
  • P2MP LSP point-to-multipoint LSP
  • the embodiment of the present invention further provides a fault protection switching method, which may be node protection or link protection.
  • the left part of Figure 10 is a schematic diagram of service packet transmission before the fault occurs.
  • the label 101 is a work label.
  • the protection switching action is performed:
  • the repair point A sends a service packet to the fault-independent branch node B through the backup label 400.
  • the switch point in the figure is A; the fault-independent branch node B is based on the saved node and the downstream node of the working path and the downstream node of the backup path.
  • the label mapping ⁇ 400-->102, 400-->401 ⁇ sends the service packet to the downstream node of the working path and the downstream node of the backup path.
  • a fault protection switching method provided by an embodiment of the present invention, using point-to-multipoint
  • the resulting resources are wasted to achieve effective point-to-multipoint LSP (P2MP LSP) protection with minimal resources.
  • an embodiment of the present invention further provides a node, including:
  • the receiving unit 1101 is configured to receive signaling for establishing a backup label switching path
  • the determining unit 1102 is configured to determine whether the local node is a fault-independent branch node
  • the processing unit 1103 is configured to: when the determining result of the determining unit is yes, The downstream working path is bound to the backup path.
  • the storage unit is configured to save the leaf node information, and is also used to save the label mapping between the working inbound label and the backup out label of the node or the label mapping between the backup inbound label and the working out label of the node.
  • an embodiment of the present invention further provides a fault protection switching system, including:
  • a first node 1201, configured to send a service text
  • the second node 1202 is configured to separately send the received service message sent by the first node 1201 to a downstream node of the working path and a downstream node of the backup path.
  • a fault protection switching system is provided by the embodiment of the present invention, where the second node specifically includes:
  • a storage unit configured to save a label mapping of the node and the downstream node of the working path and the downstream node of the backup path;
  • a sending unit configured to separately send the service packet to a downstream node of the working path and The downstream node of the backup path.
  • a fault protection switching system is provided by the embodiment of the present invention, where the first node specifically includes:
  • the service packet sending unit is configured to send a service packet to the second node.
  • a switching advertisement sending unit configured to send a switching announcement message to the second node.
  • the protection switching system may not include the switching advertisement message sending unit.
  • a fault protection switching system provided by an embodiment of the present invention, using point-to-multipoint
  • the second node on the LSP (P2MP LSP) that is not affected by the fault that is, the fault-independent branch node, effectively avoids the overlap of the backup path and the working path and the loop formed by the backup path and the working path, preventing the data from being in the same chain when the fault occurs.
  • Sending multiple times on the road reduces the waste of resources caused by the backup path to achieve effective point-to-multipoint LSP (P2MP LSP) protection with minimal resources.
  • Non-volatile storage medium which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.
  • a computer device may It is a personal computer, a server, or a network device, etc. that performs the methods described in various embodiments of the present invention.

Landscapes

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

Description

一种建立备份标签交换路径的方法及节点和系统 本申请要求于 2008 年 3 月 31 日提交中国专利局， 申请号为 200810066448.8, 发明名称为 "一种建立备份标签交换路径的方法及 节点和系统"的中国专利申请的优先权， 其全部内容通过引用结合在 本申请中。 技术领域
本发明实施例涉及标签交换技术， 特别涉及一种建立备份标签 交换路径的方法和故障的保护倒换方法及节,、和系统。 背景技术
多协议标签交换 MPLS (Multi Protocol Label Switch)最初是用来 提高路由器的转发速度而提出的协议， 它是一种将第三层 IP和第二 层交换结合的 IP交换技术， 其核心思想是对分组进行分类， 依据不 同的类别为分组打上标签， 建立标签交换路径 LSP ( Label Switch Path ), 随后在 MPLS 网络中只依据标签将分组在预先建立起来的标 签交换路径上传输。 MPLS技术通过进一步改造， 已逐渐演变成为通 用 MPLS ( GMPLS )技术。 现在又出现传送 MPLS ( T - MPLS )技 术。 这些分组包交换网可统称为标签交换网络。
多播是一种优化使用带宽的路由技术， 允许 IP数据流从一个根 或多个根发送到多个叶子地。 采用多播技术后， 应用仅发送每个数据 包的一份拷贝给一组要接受信息的计算机。
将标签交换网络与多播结合， 即标签交换网络的多播实现， 关键 是如何将第三层 (L3)的 IP多播路由映射到标签交换网络中的点到多 点 LSP ( P2MP LSP )。 而提高点到多点 LSP ( P2MP LSP ) 的生存性 的方法是为工作 P2MP LSP建立一个备份 P2MP LSP进行保护， 在故 障发生时， 业务流从工作 P2MP LSP快速切换到保护 P2MP LSP, 保 证业务不会发生长时间中断。 点到多点 LSP ( P2MP LSP )本身需要 占用大量的网络资源， 对其进行保护会消耗更多的带宽。 所以， 如何 用最少的资源实现有效的点到多点 LSP ( P2MP LSP )保护， 就成为 非常有价值的研究课题。 发明内容
本发明实施例提供一种建立备份标签交换路径的方法和故障的 保护倒换方法及节点和系统， 以用最少的资源实现有效的点到多点 LSP ( P2MP LSP )保护。
本发明实施例提供一种建立备份标签交换路径的方法， 包括： 接收建立备份标签交换路径的信令；
判断本节点是否是故障无关分支节点， 如果是， 则将上下游的工 作路径和备份路径进行绑定。
本发明实施例还提供一种故障的保护倒换方法， 包括： 发生故障时， 本地修复点向故障无关分支节点发送业务报文， 所 述故障无关分支节点将所述业务报文分别发送到工作路径的下游节 点和备份路径的下游节点。
本发明实施例还提供一种节点， 包括：
接收单元， 用于接收建立备份标签交换路径的信令；
判断单元， 用于判断本节点是否是故障无关分支节点； 处理单元， 用于当判断单元的判断结果为是时， 将上下游的工作 路径和备份路径进行绑定。
本发明实施例还提供一种故障的保护倒换系统， 包括： 第一节点， 用于发送业务报文；
第二节点，用于将接收到的所述第一节点发送的业务 文分别发 送到工作路径的下游节点和备份路径的下游节点。
由以上技术方案可以看出，本发明实施例提供的一种建立备份标 签交换路径的方法和故障的保护倒换方法及节点和系统，通过利用与 故障无关的工作路径，避免了备份路径和工作路径重叠以及备份路径 和工作路径形成的回路造成的资源浪费， 节省了网络资源和标签资 源； 在备份路径与工作路径重合部分， 发送一份业务报文， 防止业务 报文的重复发送， 节约带宽资源， 以用最少的资源实现有效的点到多 点 LSP ( P2MP LSP )保护。 附图说明
图 1 为本发明实施例提供的一种建立备份标签交换路径的方法 的流程图；
图 2 为本发明一实施例提供的一种建立备份标签交换路径的方 法的示意图；
图 3 为本发明一实施例提供的一种建立备份标签交换路径的方 法的示意图；
图 4 为本发明一实施例提供的一种建立备份标签交换路径的方 法的示意图；
图 5 为本发明一实施例提供的一种建立备份标签交换路径的方 法的示意图；
图 6 为本发明一实施例提供的一种建立备份标签交换路径的方 法的示意图；
图 7 为本发明一实施例提供的一种建立备份标签交换路径的方 法的示意图；
图 8 为本发明一实施例提供的一种故障的保护倒换方法的流程 图；
图 9 为本发明一实施例提供的一种故障的保护倒换方法的示意 图；
图 10为本发明一实施例提供的一种故障的保护倒换方法的示意 图；
图 11为本发明一实施例提供的一种节点；
图 12为本发明一实施例提供的一种故障的保护倒换系统。 具体实施方式
为了使本发明的技术方案和优点更加清楚，下面结合附图和具体 实施例对本发明进行详细描述。
如图 1所示，本发明实施例提供的一种建立备份标签交换路径的 方法， 包括：
步骤 101 , 接收建立备份标签交换路径的信令；
步骤 102, 判断本节点是否是故障无关分支节点， 如果是， 则执 行步骤 103。
步骤 103, 将上下游的工作路径和备份路径进行绑定。
本发明另一实施例提供的一种建立备份标签交换路径的方法，还 包括： 该信令中携带备份路径保护的叶子节点信息， 则该节点根据该 携带的备份路径保护的叶子节点信息和本节点保存的叶子节点信息， 判断本节点是否是故障无关分支节点。
本发明另一实施例提供一种建立备份标签交换路径的方法，还包 括： 该信令中携带故障无关分支节点信息， 则该节点根据其中携带的 故障无关分支节点信息判断本节点是否是故障无关分支节点。
本发明另一实施例提供的一种建立备份标签交换路径的方法，将 上下游的工作路径和备份路径进行绑定具体为建立本节点的工作入 标签和备份出标签间的标签映射或建立本节点的备份入标签和工作 出标签间的标签映射。
本发明实施例还可以采用其他绑定方式，比如将上下游的工作路 径和备份路径采用同一标识进行绑定，具体绑定方式不构成对本发明 的限制。
本发明另一实施例提供的一种建立备份标签交换路径的方法，该 信令中携带各个故障无关分支节点对应的工作出标签和出端口信息， 则该故障无关分支节点根据该携带的工作出标签和出端口信息建立 备份入标签和工作出标签间的标签映射。当然本发明实施例也可以不 在信令中携带这些信息，而是由各故障无关分支节点保存下游节点分 配的工作出标签和出端口信息。
本发明另一实施例提供的一种建立备份标签交换路径的方法，其 中，根据该携带的备份路径保护的叶子节点信息和本节点保存的叶子 如果本节点保存的叶子节点信息包含除该携带的备份路径保护 的叶子节点信息以外的其他节点信息，则判断本节点是故障无关分支 节点。
本发明另一实施例提供的一种建立备份标签交换路径的方法，其 中，该故障无关分支节点信息是通过本地修复点根据工作路径信令的 路由信息和根据拓朴计算的备份路径路由信息进行对比获得。
本发明另一实施例提供的一种建立备份标签交换路径的方法，还 包括： 向本地修复点发送携带所述故障无关分支节点的通知消息。
本发明实施例提供的一种建立备份标签交换路径的方法，有效利 用了点到多点 LSP ( P2MP LSP )上不受故障影响的节点， 以其为故 障无关分支节点， 建立备份路径， 有效避免了备份路径和工作路径的 重叠以及备份路径和工作路径形成的回路，防止了故障发生时数据在 同一链路上发送多次， 减少了备份路径带来的资源浪费， 以用最少的 资源实现有效的点到多点 LSP ( P2MP LSP )保护。 如图 2所示，示出了本发明另一实施例提供的一种建立备份标签 交换路径的方法。 R1为点到多点 LSP ( P2MP LSP )的根节点， R5、 R12、 R13为点到多点 LSP ( P2MP LSP ) 的叶子节点， 图中实线路 径为点到多点 LSP ( P2MP LSP ) 的树拓朴。
在点到多点 LSP ( P2MP LSP )的建立过程中， 本发明实施例进 行如下扩展： 每个节点根据接收到的 PATH 消息中携带的 ERO 及 SERO对象， 记录业务经过该节点到达的多播叶子节点信息。
本发明实施例提供的建立点到多点 LSP ( P2MP LSP )及备份路 径的方法并不限于资源预留协议（RSVP ), 也可采用标签分发协议 ( LDP )或基于约束路由的 LDP ( CR-LDP ) 来实现。 在图 2中， 在建立点到多点 LSP ( P2MP LSP )过程中， R1发 送 PATH消息， 其中，
ERO: {R2, R3, R4, R5} , <S2L_SUB_LSP> object-R5
SERO: {R2, R6, R7, R8, R12} , <S2L_SUB_LSP> object-R12 SERO: {R6, R9, R13} , <S2L_SUB_LSP>object-R13
则 R2在接收到 PATH消息时， 记录下业务经过本节点将到达的 叶子节点为 R5、 R12、 R13, 具体可以为叶子节点的 IP地址， 或者任 何可以表明该节点的标识， 本发明对此不进行限制。 本发明实施例将 该记录称为叶子节点表， 具有如下格式：
Figure imgf000008_0001
同样， R2向 R3发送的 PATH消息中 ERO: {R3 , R4, R5} , <S2L_SUB_LSP> object-R5
R3向 R4发送的 PATH消息中 ERO: {R4, R5 } , <S2L_SUB_LSP> object-R5
则 R3, R4的叶子节点表均为
P2MP ID/LSP ID R5
R2向 R6发送的 PATH消息中
ERO: {R6, R7, R8, R12} , <S2L_SUB_LSP> object-R12 SERO: {R6, R9, R13} , <S2L_SUB_LSP> object-R13 则 R6的叶子节点表为
P2MPID/LSP ID R12 R13 同样的方法可以得到 R7, R8, R9的叶子节点表， 分别如下 R7, R8
P2MP ID/LSP ID R12 P2MP ID/LSP ID R13
在点到多点 LSP ( P2MP LSP )建立后， 进行备份路径的建立过 程中， 以 R2为 R6进行本地修复备份路径的建立为例。
首先， R2计算出重路由的备份路径， 如图 2中虚线所示， 备份 路径为
R2— R3— R4— R8— R12
R11— R15— R14— R13
关于备份路径的计算为现有技术， 此处不再赘述。
R2以该路由为 PATH消息的 ERO及 SERO对象， 沿该路由发送 PATH消息进行重路由的备份路径的建立。 这里， 本发明实施例扩展 PATH消息， 新增对象< ^^(^(1 node> object, 用以记录这次重路由 路径保护的叶子节点信息。在本实例中， R2为 R6进行本地修复的备 份路径最终是为实现对 R12, R13的保护， 所以发送的 PATH消息中 <protected nodo^t象应包含 R12, R13两项。
备份路径上的节点收到 PATH消息后根据 <protected node>对象， 和节点中的叶子节点表比较， 如果叶子节点表中存在除 <protected node>)?†象中的节点之外的其他节点，则在该节点路径状态中做上 flag 标识， 表明可以以本节点为故障无关分支节点建立备份路径， 当故障 发生时从该节点开始将业务复制转发至工作路径的下游节点和备份 路径的下游节点。
备份路径中，可以以 R3, R4为故障无关分支节点建立备份路径， 这样 R3, R4在节点路径状态中做上 flag标识。
当 R12, R13收到 PATH消息后， 回送 RESV消息， 节点在接收 到 Resv消息后根据 flag标识做出相应的处理，节点没有 flag标识时， 按协议规定转发；当节点有 flag标识表明可以以本节点为故障无关分 支节点建立备份路径， 节点进行标签映射， 在图 2中， R4收到 Resv 消息后， 节点路径状态中有 flag 标识， 所以在 R4 进行标签映射， Lsl^Ll , 其中 Lsl 为点到多点 LSP ( P2MP LSP ) 工作路径上 R4 的入标签， L1为备份路径上 R4的出标签。 同时， R4向本地修复节 点 R2 ( PLR )发送 Notify消息， 通知 R2在 R4对工作路径进行分支， 建立备份路径，并清除 flag标识。这里， Notify消息在 < ERROR_SPEC> 对象中新增一种通知类型， 携带该故障无关分支节点信息， 表明可以 以该节点为故障无关分支节点建立备份路径。
如图 2点划线所示， 这样， R2为 R6进行本地修复建立的备份路 径为：
R4— R8— R12
R11— R15— R14— R13
R2— R3— R4这段利用工作路径。而 R8— R12间的备份路径和工 作路径能够进行合并， 这种情况和单播情况相同， 为现有技术， 在此 不再赘述。
本发明实施例提供的一种建立备份标签交换路径的方法，有效利 用了点到多点 LSP ( P2MP LSP )上不受故障影响的节点， 以其为故 障无关分支节点， 建立备份路径， 有效避免了备份路径和工作路径的 重叠， 防止了故障发生时数据在同一链路上发送多次， 减少了备份路 径带来的资源浪费， 以用最少的资源实现有效的点到多点 LSP ( P2MP LSP )保护。
图 3 示出了本发明另一实施例提供的一种建立备份标签交换路 径的方法。 图 3中， R1为点到多点 LSP ( P2MP LSP ) 的根节点， R5、 R12、 R13为点到多点 LSP ( P2MP LSP ) 的叶子节点， 图中实 线路径为点到多点 LSP ( P2MP LSP )的树拓朴。 按照和图 2实施例 相似的处理方式， 可以看到， 节点 R3, R4的叶子节点表为
P2MP ID/LSP ID R5
R7, R8的叶子节点表为
P2MP ID/LSP ID R12 R9的叶子节点表为
P2MP ID/LSP ID R13
同样， 当 R2为 R6节点进行本地修复备份路径的建立过程中， 首先 R2计算本地修复的 重路由 ， 如 图 3虚线所示 ， R2— R3— R4— R8— R 12
R7— R9— R13
关于备份路径的计算为现有技术， 此处不再赘述。
R2发送 PATH消息， 其中^^^(^(1 110(16>为1 12, R13; 接收到 PATH消息的节点根据叶子节点表和^^^(^(1 110(16>比较， 如果叶子 节点表中包含除 <protected node^†象中的节点之外的其他节点，则在 该节点在节点路径状态中做上 flag标识，表明可以以本节点为故障无 关分支节点建立备份路径。 图 3中， R3、 R4可以设置 flag标识， 而 R7的叶子节点表中 R12包含在 <protected node>中， 所以不能作为分 支节点建立备份路径。
R13、 R12收到 PATH消息后向 R2回送 RESV消息。 R4收到分 别从 R12和 R13发送来的 RESV消息， 按照点到多点 LSP ( P2MP LSP ) 中 RSVP的处理办法， 首先合并两个 RESV消息， 然后查看节 点路径状态，节点路径状态中有 flag标识表明可以作为故障无关分支 节点建立备份路径， 在 R4进行标签映射， Lsl Ll , Lsl^L2, 其中 Lsl为点到多点 LSP ( P2MP LSP )工作路径上 R4的入标签， L1为 备份路径支路上 R7的入标签， L2为备份路径支路上 R8的入标签。 同时， R4向本地修复节点 R2 ( PLR )发送 Notify消息， 通知 R2在 R4对工作路径进行分支， 建立备份路径， 并清除 flag标识。
如图 3点划线所示， 这样， R2为 R6进行本地修复建立的备份路 径为：
R4— R8— R12 R7— R9— R13 R2— R3— R4部分利用工作路径。 R8— R12, R9— R13间的备份 路径和工作路径能够进行合并， 这种情况和单播情况相同， 为现有技 术， 在此不再赘述。
本发明实施例提供的一种建立备份标签交换路径的方法，有效利 用了点到多点 LSP ( P2MP LSP )上不受故障影响的节点， 以其为故 障无关分支节点， 建立备份路径， 有效避免了备份路径和工作路径的 重叠， 防止了故障发生时数据在同一链路上发送多次， 减少了备份路 径带来的资源浪费， 以用最少的资源实现有效的点到多点 LSP ( P2MP LSP )保护。
图 4 示出了本发明另一实施例提供的一种建立备份标签交换路 径的方法。 R1为点到多点 LSP ( P2MP LSP ) 的根节点， R5、 R12、 R13、 R14为点到多点 LSP ( P2MP LSP ) 的叶子节点， 图中实线路 径为点到多点 LSP ( P2MP LSP )的树拓朴。 按照和图 2实施例相似 的处理方式， 可以看到， R2的叶子节点表为
Figure imgf000012_0001
节点 R3, R4的叶子节点表为
P2MP ID/LSP ID R5
R7, R8的叶子节点表为
P2MP ID/LSP ID R12
R9的叶子节点表为
P2MP ID/LSP ID R13 R14 同样， 当 R6为 R9节点进行本地修复备份路径的建立过程中 首先 R6 计算本地修复的重路由， 如图 4 中虚线所示 R6— R2— R3— R4— R8— Rll— RIO— R14 R15— R13 关于备份路径的计算为现有技术， 此处不再赘述。
R6发送 PATH消息， 其中^^^(^(1 110(16>为1 13, R14; 接收到 PATH消息的节点根据叶子节点表和^^^(^(1 110(16>比较， 如果叶子 节点表中包含除 <protected node^†象中的节点之外的其他节点，则在 该节点在节点路径状态中做上 flag标识，表明可以以本节点为故障无 关分支节点建立备份路径。 图 4中， R2、 R3、 R4、 R8可以设置 flag 标识。
R13、 R14收到 PATH消息后向 R6回送 Resv消息。 R8收到从 R14发送来的 Resv消息，查看节点路径状态，节点路径状态中有 flag 标识， 则表明可以作为故障无关分支节点建立备份路径， 在 R8进行 标签映射， Ls2 L2, 其中 Ls2为点到多点 LSP ( P2MP LSP )工作 路径上 R8的入标签， L2为备份路径上 R11的入标签。 同时， R8向 本地修复节点 R6 ( PLR )发送 Notify消息， 通知 R6在 R8对工作路 径进行分支， 建立备份路径， 并清除 flag标识。 在 R2节点处， 收到 从 R13发来的 Resv消息， 及 R8发送的 Notify消息。 R2处理从 R13 发来的 RESV消息， 建立标签映射， Lsl Ll , 其中 Lsl为点到多点 LSP ( P2MP LSP )上工作路径 R2的入标签， L1为 RESV消息携带 的 R15的入标签， 并向 R6发送 Notify消息， 表明 R2也为故障无关 分支节点建立备份路径， 并清除路径状态标识。
这样， R6 为 R9 进行本地修复建立的备份路径包括两部分， R8— Rll— RIO— R14, R2— R15— R13。 这样， 当故障发生时， 可以 在 R2处将多播业务复制转发到备份路径 R2— R15— R13上， 避免了 多播业务经过 R2— R6 , 在 R6 处再复制转发到备份路径 R6— R2— R15o RIO— R14间的备份路径和工作路径能够进行合并， 这种情况和单播情况相同， 为现有技术， 在此不再赘述。 本发明实施例提供的一种建立备份标签交换路径的方法，有效利 用了点到多点 LSP ( P2MP LSP )上不受故障影响的节点， 以其为故 障无关分支节点， 建立备份路径， 有效避免了备份路径和工作路径的 重叠以及备份路径和工作路径形成的回路，防止了故障发生时数据在 同一链路上发送多次， 减少了备份路径带来的资源浪费， 以用最少的 资源实现有效的点到多点 LSP ( P2MP LSP )保护。 图 5 示出了本发明另一实施例提供的一种建立备份标签交换路 径的方法。
R6为 R9进行本地修复建立备份路径时计算出的备份路由如图 5 中虚线所示。
R6— R16— R2— R3— R4— R8— R11— RIO— R14
R15— R13 关于备份路径的计算为现有技术， 此处不再赘述。
R6发送 PATH消息， 其中^^^(^(1 110(16>为1 13, R14; 接收到 PATH消息的节点根据叶子节点表和^^^(^(1 110(16>比较， 如果叶子 节点表中包含除 <protected node^†象中的节点之外的其他节点，则在 该节点在节点路径状态中做上 flag标识，表明可以以本节点为故障无 关分支节点建立备份路径。 图 5中， R2、 R3、 R4、 R8可以设置 flag 标识。
R13、 R14收到 PATH消息后向 R6回送 RESV消息。 R8收到从 R14发送来的 RESV消息，查看节点路径状态，节点路径状态中有 flag 标识， 则表明可以作为故障无关分支节点建立备份路径， 在 R8进行 标签映射， Ls2 L2, 其中 Ls2为点到多点 LSP ( P2MP LSP )工作 路径上 R8的入标签， L2为备份路径上 R11的入标签。 同时， R8向 本地修复节点 R6 ( PLR )发送 Notify消息， 通知 R6在 R8对工作路 径进行分支， 建立备份路径， 并清除 flag标识。 在 R2节点处， 收到 从 R13发来的 RESV消息，及 R8发送的 Notify消息， R2处理从 R13 发来的 RESV消息， 建立标签映射， Lsl Ll , 其中 Lsl为点到多点 LSP ( P2MP LSP )上工作路径 R2的入标签， L1为 RESV消息携带 的 R15的入标签， 并向 R6发送 Notify消息， 表明 R2也为分支节点 建立备份路径， 并清除路径状态标识。
这样， R6 为 R9 进行本地修复建立的备份路径包括两部分， R8— R11— RIO— R14, R2— R15— R13。 R10— R14 间的备份路径和 工作路径能够进行合并， 这种情况和单播情况相同， 为现有技术， 在 此不再赘述。
本发明实施例提供的一种建立备份标签交换路径的方法，有效利 用了点到多点 LSP ( P2MP LSP )上不受故障影响的节点， 以其为故 障无关分支节点， 建立备份路径， 有效避免了备份路径和工作路径的 重叠以及备份路径和工作路径形成的回路，防止了故障发生时数据在 同一链路上发送多次， 减少了备份路径带来的资源浪费， 以用最少的 资源实现有效的点到多点 LSP ( P2MP LSP )保护。
本发明实施例还提供一种建立备份标签交换路径的方法，备份路 由上的各个节点接收本地修复点发送的建立备份标签交换路径的信 令， 该信令中携带故障无关分支节点信息。 该故障无关分支节点信息 是通过本地修复点根据工作路径信令的路由信息和根据拓朴计算的 备份路径路由信息进行对比获得。
当该故障无关分支节点根据接收的信令中携带的故障无关分支 节点信息判断本节点是故障无关分支节点，则将上游备份路径和下游 工作路径进行绑定；
具体可以采用建立本节点的备份入标签和工作出标签间的标签 映射进行绑定， 也可以采用任何其他绑定方式。
假设故障无关分支节点为上游备份路径分配的标签，即该节点的 备份入标签为 Ls4, 该故障无关分支节点的下游工作路径上的下游节 点 R5为该故障无关分支节点的下游工作路径分配的标签， 即该节点 的工作出标签为 Ls5, 则建立标签映射 Ls4 Ls5。 该故障无关分支节点向上游节点发送消息完成备份标签交换路 径的建立。 比如可以向上有节点发送 Resv消息， 直到本地修复点接 收到该 Resv消息后， 备份标签交换路径建立完成。
本发明实施例还提供一种建立备份标签交换路径的方法， 以图 6 为例， R1为工作点到多点 LSP ( P2MP LSP ) 的根节点， R5、 R12、 Rl 3为工作点到多点 LSP ( P2MP LSP )的叶子节点， 图 6中实线路 径为工作点到多点 LSP ( P2MP LSP ) 的树拓朴。 具体， 以 R2保护 R6为例， 即 R2为本地修复点 PLR, 建立备份点到多点 LSP, 实现针 对 R6故障或 R2到 R6的链路故障的保护。
首先， R2节点根据 R1发送的工作路径信令中携带的工作 P2MP
LSP的路由信息和 R2节点本身根据拓朴计算的备份路径路由信息比 较获得故障无关分支节点信息。 具体为
R2接收到建立工作 P2MP LSP的信令中携带的显式路由信息为：
ERO: {R2, R3, R4, R5} , <S2L_SUB_LSP> object-R5
SERO: {R2, R6, R7, R8, R12} , <S2L_SUB_LSP> object-R12
SERO: {R6, R9, R13} , <S2L_SUB_LSP>object-R13 而 R2根据拓朴计算出的备份 P2MP LSP的路由信息， 这里表示 为：
ERO: {R2, R3, R4, R8, R12} , <S2L_SUB_LSP> object-R12
SERO: {R8, Rll , R15, R14, R13 } , <S2L_SUB_LSP>object-R13
R2根据工作 P2MP LSP的显式路由信息可以判断： R5分支路径 不包含 R6, 故 R5所在分支路径为故障无关分支路径； R2根据备份 P2MP LSP的路由信息可以判断：保护 P2MP LSP的 R12和 R13所在 分支路径与工作 P2MP LSP上的故障无关分支路径即 R5分支路径的 最后一个路由重合点为 R4, 则确定 R4为故障无关分支节点。
值得说明的是， 在工作 P2MP LSP的信令未提供工作 P2MP LSP 的显式路由对象 ERO的情况下， 工作 P2MP LSP的路由信息也可以 通过工作 P2MP LSP的记录路由对象 RRO获得。 然后， R2发起建立备份 P2MP LSP的信令， 其中携带有故障无 关分支节点信息。 具体为：
R2发起的建立备份 P2MP LSP的 Path消息中携带有一个 joint 对象， 其中包含故障无关分支节点信息， 在这里为节点 R4的地址信 息；
所述故障无关分支节点信息还可以包括其中各故障无关分支节 点对应的工作 P2MP LSP上的下游出标签和出端口信息。在这里即为 R4节点在工作 P2MP LSP上的 R5分支上的下游出标签和出端口信 息， 如图 6所示， R4的下游出标签为 103, 殳出端口为 3, 则将 R4地址信息，下游出标签和出端口三元组信息 <R4, 103, 3>携带在 R2 发起的建立备份 P2MP LSP的 Path消息的故障无关分支节点信息中。
所述各故障无关分支节点对应的工作 P2MP LSP上的下游出标签 和出端口信息可以通过工作 P2MP LSP信令的记录路由对象 RRO获 得。 即在工作树根节点发起建立工作 P2MP LSP信令时， 携带 RRO 对象， 其中要求记录节点地址信息、 下游出标签信息和出端口信息。
当然， R2发起的建立备份 P2MP LSP的 Path消息中还带有备份 P2MP LSP的显式路由对象。
另外值得说明的是， R2发起的建立备份 P2MP LSP的 Path消息 中的会话属性 session attribute对象中除了发起者地址 sender address 由 R1变为 R2之外， 其余与工作路径信令相同的 session属性。 另外 还需要在 session attribute对象中设置预留方式为 SE (共享显式路由, shared explicit )属性或 WF (通配符过滤， wildcard filtering)属性来保 证当备份 P2MP LSP和工作 P2MP LSP共享一部分链路资源时实现带 宽资源共享， 而不需要额外分配带宽资源。 然后， 当其它节点接收到建立备份 P2MP LSP的信令后， 根据其 中携带的故障无关分支节点信息判断自己是否是故障无关分支节点， 如果是， 则建立本节点在备份 P2MP LSP 的上游入标签和在工作 P2MP LSP上的下游出标签的转发表项。 具体为
当 R4从端口 2接收到来自 R3的建立备份 P2MP LSP的 Path消 息后， 由于 Path消息中携带的故障无关分支节点信息中的 <R4, 103, 3>包含本节点地址， 则判断本节点为故障无关分支节点。 此时 R4不 仅要向 R3分配上游标签 402, 还要建立如下转发表项：
Figure imgf000018_0001
值得说明的是， 如果接收到的 Path消息中携带的故障无关分支 节点信息不包含各个故障无关分支节点的工作 P2MP LSP上的下游出 标签和下游出端口信息， 节点 R4也可以通过查询转发表信息等方式 获得。 另外， 根据 RSVP-TE协议， R4还会根据显式路由对象向 R8发 送 Path消息，当 R4从端口 5收到从 R8发来的携带有标签 403的 Resv 消息时， R4还会建立另外一个转发表项：
Figure imgf000018_0002
这样在 R4节点处， 当接收到备份 P2MP LSP的流量时， 会同时 将流量发送到备份 P2MP LSP的下游节点和工作 P2MP LSP的下游节 点。
值得说明的是， 当节点接收到建立备份 P2MP LSP的信令， 判断 自身并不是故障无关分支节点时， 直接按照 RSVP-TE协议的方式进 行处理。
当 PLR点在完成备份路径的建立后， 配置保护倒换关系， 即故 障时工作标签将交换到备份标签上。 值得说明的是， 如果 PLR在另 一个工作分支上时， 配置倒换关系时， 也需要把这个工作分支上的标 签倒换到备份标签上， 以避免保护在重合路径上的重复发送。 PLR是 否在另一个工作分支上可以通过工作路径的 ERO对象或 RRO对象得 知。
图 7描述了建立的备份 P2MP LSP, R2为 PLR点， 则 R2上配置 的保护关系为： { 100— >200, 100— >101 }倒换到 { 100— >401 }。 如图 8所示， 本发明实施例还提供一种故障的保护倒换方法， 包 括：
步骤 801 , 发生故障时， 本地修复点向故障无关分支节点发送业 务报文。
步骤 802, 该故障无关分支节点将该业务报文分别发送到工作路 径的下游节点和备份路径的下游节点。
本发明另一实施例提供的一种故障的保护倒换方法， 包括： 发生 故障时，该本地修复点通过工作标签向该故障无关分支节点发送该业 务报文，该故障无关分支节点接收到该本地修复点发送的倒换通告消 息后，将该业务报文分别发送到工作路径的下游节点和备份路径的下 游节点。
本发明另一实施例提供的一种故障的保护倒换方法， 包括： 发生 故障时，该本地修复点通过备份标签向该故障无关分支节点发送该业 务报文，该故障无关分支节点将该业务报文分别发送到工作路径的下 游节点和备份路径的下游节点。
本发明另一实施例提供的一种故障的保护倒换方法， 其中， 该故 障无关分支节点根据其保存的本节点和工作路径的下游节点及备份 路径的下游节点的标签映射，将该业务报文分别发送到工作路径的下 游节点和备份路径的下游节点。 其中， 本节点的工作入标签和备份出 标签之间的标签映射及本节点的备份入标签和工作出标签的标签映 射， 采用本发明实施例提供的一种建立备份标签交换路径的方法获 得；本节点的工作入标签和工作出标签之间的标签映射 及 本节点的 当利用本发明实施例提供的一种建立备份标签交换路径的方法 建立备份标签交换路径后 ,本发明实施例还提供一种故障的保护倒换 方法， 可以是节点保护， 也可以是链路保护。
如图 9左半部分为故障发生之前， 业务报文发送示意图。 图中标 签 101为工作标签。 如图 9右半部分为 A检测到节点 D或者 A >D 的链路发生故障时（例如通过 BFD检测， 或者检测到链路层产生的 告警等检测方式）， 进行保护倒换动作： 本地修复点 A通过工作标签 101向故障无关分支节点 B发送业务报文；该本地修复点 A还向该故 障无关分支节点 B发送倒换通告消息， 即图中 indication消息； 当该 故障无关分支节点 B接收到该本地修复点 A发送的倒换通告消息后， 根据其保存的本节点和工作路径的下游节点 C及备份路径的下游节 点 E的标签映射 { 101 >102, 101 >401 } ,将该业务报文分别发送到工 作路径的下游节点和备份路径的下游节点， 该图中倒换点为 B。
本发明实施例提供的一种故障的保护倒换方法， 利用点到多点 LSP ( P2MP LSP )上不受故障影响的节点， 即故障无关分支节点， 有效避免了备份路径和工作路径的重叠，防止了故障发生时数据在同 一链路上发送多次， 减少了备份路径带来的资源浪费， 以用最少的资 源实现有效的点到多点 LSP ( P2MP LSP )保护。
当利用本发明实施例提供的一种建立备份标签交换路径的方法 得到故障无关分支节点后，本发明实施例还提供一种故障的保护倒换 方法， 可以是节点保护， 也可以是链路保护。
如图 10左半部分为故障发生之前， 业务报文发送示意图。 图中 标签 101为工作标签。如图 10右半部分为 A检测到节点 D或者 A-->D 的链路发生故障时（例如通过 BFD检测， 或者检测到链路层产生的 告警等检测方式）， 进行保护倒换动作： 本地修复点 A通过备份标签 400向故障无关分支节点 B发送业务报文， 该图中倒换点为 A; 该故 障无关分支节点 B 根据其保存的本节点和工作路径的下游节点及备 份路径的下游节点的标签映射 {400-->102, 400-->401 } ,将该业务报文 分别发送到工作路径的下游节点和备份路径的下游节点。
本发明实施例提供的一种故障的保护倒换方法， 利用点到多点 LSP ( P2MP LSP )上不受故障影响的节点， 即故障无关分支节点， 有效避免了备份路径和工作路径的重叠，防止了故障发生时数据在同 一链路上发送多次， 减少了备份路径带来的资源浪费， 以用最少的资 源实现有效的点到多点 LSP ( P2MP LSP )保护。
如图 11所示， 本发明实施例还提供一种节点， 包括：
接收单元 1101 , 用于接收建立备份标签交换路径的信令； 判断单元 1102, 用于判断本节点是否是故障无关分支节点； 处理单元 1103 , 用于当判断单元的判断结果为是时， 将上下游 的工作路径和备份路径进行绑定。
本发明实施例提供的一种节点， 还包括：
存储单元， 用于保存叶子节点信息， 还用于保存本节点的工作入 标签和备份出标签间的标签映射或本节点的备份入标签和工作出标 签间的标签映射。
本发明实施例提供的一种节点， 即故障无关分支节点， 有效避免 了备份路径和工作路径的重叠以及备份路径和工作路径形成的回路， 防止了故障发生时数据在同一链路上发送多次，减少了备份路径带来 的资源浪费，以用最少的资源实现有效的点到多点 LSP ( P2MP LSP ) 保护。 如图 12所示， 本发明实施例还提供一种故障的保护倒换系统， 包括：
第一节点 1201 , 用于发送业务 文；
第二节点 1202, 用于将接收到的该第一节点 1201发送的业务报 文分别发送到工作路径的下游节点和备份路径的下游节点。
本发明实施例提供的一种故障的保护倒换系统，该第二节点具体 包括：
存储单元，用于保存本节点和工作路径的下游节点及备份路径的 下游节点的标签映射；
发送单元，用于将该业务报文分别发送到工作路径的下游节点和 备份路径的下游节点。
本发明实施例提供的一种故障的保护倒换系统，该第一节点具体 包括：
业务报文发送单元， 用于向该第二节点发送业务报文。
倒换通告消息发送单元， 用于向该第二节点发送倒换通告消息。 本发明实施例提供的一种故障的保护倒换系统， 当第一节点通过 备份标签向该第二节点发送该业务 "¾文，则该保护倒换系统可以不包 括倒换通告消息发送单元。
本发明实施例提供的一种故障的保护倒换系统， 利用点到多点
LSP ( P2MP LSP )上不受故障影响的第二节点， 即故障无关分支节 点，有效避免了备份路径和工作路径的重叠以及备份路径和工作路径 形成的回路， 防止了故障发生时数据在同一链路上发送多次， 减少了 备份路径带来的资源浪费， 以用最少的资源实现有效的点到多点 LSP ( P2MP LSP )保护。 通过以上的实施方式的描述，本领域的技术人员可以清楚地了解 到本发明可以通过硬件实现，也可以可借助软件加必要的通用硬件平 台的方式来实现基于这样的理解，本发明的技术方案可以以软件产品 的形式体现出来， 该软件产品可以存储在一个非易失性存储介质（可 以是 CD-ROM, U盘， 移动硬盘等） 中， 包括若干指令用以使得一 台计算机设备（可以是个人计算机， 服务器， 或者网络设备等）执行 本发明各个实施例所述的方法。
总之， 以上所述仅为本发明的较佳实施例而已， 并非用于限定本 发明的保护范围。 凡在本发明的精神和原则之内， 所作的任何修改、 等同替换、 改进等， 均应包含在本发明的保护范围之内。

Claims

权利要求
1、 一种建立备份标签交换路径的方法， 其特征在于， 包括： 接收建立备份标签交换路径的信令；
判断本节点是否是故障无关分支节点， 如果是， 则将上下游 的工作路径和备份路径进行绑定。
2、 如权利要求 1所述的方法， 其特征在于， 所述信令中携带 备份路径保护的叶子节点信息， 则所述节点根据所述携带的备份 路径保护的叶子节点信息和本节点保存的叶子节点信息， 判断本 节点是否是故障无关分支节点。
3、 如权利要求 1所述的方法， 其特征在于， 所述信令中携带 故障无关分支节点信息， 则所述节点根据其中携带的故障无关分 支节点信息判断本节点是否是故障无关分支节点。
4、 如权利要求 1所述的方法， 其特征在于， 将上下游的工作 路径和备份路径进行绑定具体为建立本节点的工作入标签和备份 出标签间的标签映射或建立本节点的备份入标签和工作出标签间 的标签映射。
5、 如权利要求 4所述的方法， 其特征在于， 所述信令中携带 各个故障无关分支节点对应的工作出标签和出端口信息， 则所述 故障无关分支节点根据所述携带的工作出标签和出端口信息建立 备份入标签和工作出标签间的标签映射。
6、 如权利要求 2所述的方法， 其特征在于， 所述根据所述携 带的备份路径保护的叶子节点信息和本节点保存的叶子节, ^信 息， 判断本节点是否是故障无关分支节点具体为：
如果本节点保存的叶子节点信息中包含除了所述携带的备份 路径保护的叶子节点信息以外的其他节点信息， 则判断本节点是 故障无关分支节点。
7、 如权利要求 3所述的方法， 其特征在于， 所述故障无关分 支节点信息是通过本地修复点根据工作路径信令的路由信息和根 据拓朴计算的备份路径路由信息进行对比获得。
8、 如权利要求 2所述的方法， 其特征在于， 所述方法还包括： 向本地修复点发送携带所述故障无关分支节点的通知消息。
9、 一种故障的保护倒换方法， 其特征在于， 包括：
发生故障时， 本地修复点向故障无关分支节点发送业务报文， 所述故障无关分支节点将所述业务报文分别发送到工作路径的下 游节点和备份路径的下游节点。
10、 如权利要求 9所述的方法， 其特征在于， 所述方法具体包 括：
发生故障时，所述本地修复点通过工作标签向所述故障无关分 支节点发送所述业务报文， 所述故障无关分支节点接收到所述本 地修复点发送的倒换通告消息后， 将所述业务报文分别发送到工 作路径的下游节点和备份路径的下游节点。
11、 如权利要求 9所述的方法， 其特征在于， 所述方法具体包 括：
发生故障时，所述本地修复点通过备份标签向所述故障无关分 支节点发送所述业务报文， 所述故障无关分支节点将所述业务报 文分别发送到工作路径的下游节点和备份路径的下游节点。
12、 如权利要求 9所述的方法， 其特征在于， 所述故障无关分 支节点将所述业务报文分别发送到工作路径的下游节点和备份路 径的下游节点具体为：
所述故障无关分支节点根据其保存的本节点和工作路径的下 游节点及备份路径的下游节点的标签映射， 将所述业务报文分别 发送到工作路径的下游节点和备份路径的下游节点。
13、 一种节点， 其特征在于， 包括：
接收单元， 用于接收建立备份标签交换路径的信令；
判断单元， 用于判断本节点是否是故障无关分支节点； 处理单元， 用于当判断单元的判断结果为是时， 将上下游的 工作路径和备份路径进行绑定。
14、 如权利要求 13所述的节点， 其特征在于， 还包括： 存储单元， 用于保存叶子节点信息， 还用于保存本节点的工 作入标签和备份出标签间的标签映射或本节点的备份入标签和工 作出标签间的标签映射。
15、 一种故障的保护倒换系统， 其特征在于， 包括： 第一节点， 用于发送业务报文；
第二节点， 用于将接收到的所述第一节点发送的业务报文分 别发送到工作路径的下游节点和备份路径的下游节点。
16、 如权利要求 15所述的系统， 其特征在于， 所述第二节点 具体包括：
存储单元， 用于保存本节点和工作路径的下游节点及备份路 径的下游节点的标签映射；
发送单元， 用于将所述业务报文分别发送到工作路径的下游 节点和备份路径的下游节点。
17、 如权利要求 15所述的系统， 其特征在于， 所述第一节点 具体包括：
业务报文发送单元， 用于向所述第二节点发送业务报文； 倒换通告消息发送单元， 用于向所述第二节点发送倒换通告 消息。
PCT/CN2009/071104 2008-03-31 2009-03-31 一种建立备份标签交换路径的方法及节点和系统 WO2009121292A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200810066448.8 2008-03-31
CN 200810066448 CN101552715B (zh) 2008-03-31 2008-03-31 一种建立备份标签交换路径的方法及节点

Publications (1)

Publication Number Publication Date
WO2009121292A1 true WO2009121292A1 (zh) 2009-10-08

Family

ID=41134844

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2009/071104 WO2009121292A1 (zh) 2008-03-31 2009-03-31 一种建立备份标签交换路径的方法及节点和系统

Country Status (2)

Country Link
CN (1) CN101552715B (zh)
WO (1) WO2009121292A1 (zh)

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101814997B (zh) * 2010-03-26 2011-10-05 电子科技大学 一种增强组播抗毁性的方法
CN102143043B (zh) * 2010-07-14 2014-11-05 华为技术有限公司 一种建立标签交换路径的方法和装置
CN102480368B (zh) * 2010-11-22 2015-07-22 中兴通讯股份有限公司 一种聚合链路的保护方法及系统
CN102315967B (zh) * 2011-09-19 2017-04-12 中兴通讯股份有限公司 一种组播标签交换路径的中间节点保护方法及装置
CN103248565A (zh) * 2012-02-06 2013-08-14 中兴通讯股份有限公司 一种建立保护标签交换路径（lsp）的方法及系统
CN103973536A (zh) * 2013-02-05 2014-08-06 中国移动通信集团公司 点对多点环网保护方法和装置
CN103490998B (zh) * 2013-09-09 2017-09-05 新华三技术有限公司 保护隧道建立方法及装置，流量切换方法及装置
CN105227479B (zh) * 2014-06-03 2018-10-09 新华三技术有限公司 快速重路由处理方法及装置
CN105634948B (zh) * 2014-10-28 2020-04-10 中兴通讯股份有限公司 一种p2mp中lsp重汇聚识别方法和装置
CN105656782B (zh) * 2014-11-17 2020-03-27 中兴通讯股份有限公司 点对多点组播流量工程隧道系统及其路径选择方法和装置
CN105991427B (zh) * 2015-01-27 2019-05-07 杭州迪普科技股份有限公司 备份路径确定及切换的方法和装置
US9843508B2 (en) 2015-03-06 2017-12-12 Juniper Networks, Inc. RSVP make-before-break label reuse
US9838306B2 (en) * 2015-03-31 2017-12-05 Juniper Networks, Inc. RSVP make-before-break label reuse
CN107181677A (zh) * 2016-03-09 2017-09-19 中兴通讯股份有限公司 一种p2mp主隧道节点保护的方法及装置
CN107306197A (zh) * 2016-04-20 2017-10-31 中兴通讯股份有限公司 一种隧道保护的方法及装置
CN112995026A (zh) * 2019-12-13 2021-06-18 中兴通讯股份有限公司 一种链路保护方法、装置，入口节点及存储介质
CN112398730A (zh) * 2020-10-28 2021-02-23 上海欣诺通信技术股份有限公司 数据中心网络中的报文转发方法、装置、设备及存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1675901A (zh) * 2002-08-16 2005-09-28 西门子公司 在网络中建立替代路径的方法
CN1838606A (zh) * 2005-03-24 2006-09-27 华为技术有限公司 使用mpls建立信令传递网用于mesh网保护的方法
CN1859376A (zh) * 2005-11-16 2006-11-08 华为技术有限公司 一种基于路由的链路备份方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1675901A (zh) * 2002-08-16 2005-09-28 西门子公司 在网络中建立替代路径的方法
CN1838606A (zh) * 2005-03-24 2006-09-27 华为技术有限公司 使用mpls建立信令传递网用于mesh网保护的方法
CN1859376A (zh) * 2005-11-16 2006-11-08 华为技术有限公司 一种基于路由的链路备份方法

Also Published As

Publication number Publication date
CN101552715A (zh) 2009-10-07
CN101552715B (zh) 2011-12-07

Similar Documents

Publication Publication Date Title
WO2009121292A1 (zh) 一种建立备份标签交换路径的方法及节点和系统
US9350650B2 (en) Switching to a backup traffic path by a label switching router in a multi-protocol label switching network
US9860163B2 (en) MPLS traffic engineering for point-to-multipoint label switched paths
US9369335B2 (en) mRSVP-TE based fast reroute in detour (1:1) protection mode
Pan et al. Fast reroute extensions to RSVP-TE for LSP tunnels
US7602702B1 (en) Fast reroute of traffic associated with a point to multi-point network tunnel
EP2071768B1 (en) A method for implementing the multicast fast-reroute and a node
EP2360880B1 (en) Optimized fast re-route in MPLS-TP ring topologies
US20090219806A1 (en) Method, apparatus, and system for protecting head node of point to multipoint label switched path
WO2009056053A1 (fr) Procédé, dispositif et système de commutateur de capacité de flux à ingénierie de trafic et commutation multiprotocole par étiquette
US9246838B1 (en) Label switched path setup using fast reroute bypass tunnel
WO2007016834A1 (fr) Procede rapide de convergence de services de point a point et dispositif associe cote fournisseur de services
US11962491B2 (en) Source routing tunnel ingress protection
WO2013113218A1 (zh) 相交环保护方法、设备和系统
WO2011103759A1 (zh) 关联的双向标签交换路径的创建方法及系统
CN106572012A (zh) 一种vpn frr的实现方法和pe设备
Pan et al. RFC 4090: Fast reroute extensions to RSVP-TE for LSP tunnels
WO2008064612A1 (fr) Procédé, dispositif et système permettant d&#39;effectuer un reroutage rapide dans un réseau mpls
WO2010045838A1 (zh) 报文处理的方法和装置
CN102437955B (zh) 一种lsp保护方法和设备
WO2015042840A1 (zh) 一种故障恢复的方法、节点和路径计算单元
US20240048483A1 (en) PCE for BIER-TE Ingress Protection
Tomar et al. MPLS-A Fail Safe Approach to Congestion Control
WO2016177186A1 (zh) 带宽保护的方法及装置
WO2012159316A1 (zh) 用于在网络中确定等值路径的方法、网络装置和系统

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: 09726595

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 09726595

Country of ref document: EP

Kind code of ref document: A1