[go: up one dir, main page]

WO2008037198A1 - Procédés de mise en oeuvre de réacheminement rapide multidiffusion et noeud - Google Patents

Procédés de mise en oeuvre de réacheminement rapide multidiffusion et noeud Download PDF

Info

Publication number
WO2008037198A1
WO2008037198A1 PCT/CN2007/070417 CN2007070417W WO2008037198A1 WO 2008037198 A1 WO2008037198 A1 WO 2008037198A1 CN 2007070417 W CN2007070417 W CN 2007070417W WO 2008037198 A1 WO2008037198 A1 WO 2008037198A1
Authority
WO
WIPO (PCT)
Prior art keywords
lsp
backup
standby
path
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2007/070417
Other languages
English (en)
French (fr)
Inventor
Haiyan Zhang
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to EP07785412.3A priority Critical patent/EP2071768B1/en
Publication of WO2008037198A1 publication Critical patent/WO2008037198A1/zh
Priority to US12/413,144 priority patent/US7940647B2/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

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/16—Multipoint 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/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/48—Routing tree calculation
    • 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/502—Frame based
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
    • H04L47/726—Reserving resources in multiple paths to be used simultaneously
    • H04L47/728—Reserving resources in multiple paths to be used simultaneously for backup paths

Definitions

  • the present invention relates to a network local protection technology for MPLS (Multiple Protocol Label Switch), and in particular, to a method and a node for implementing a Fast Reroute (FRR).
  • MPLS Multiple Protocol Label Switch
  • FRR Fast Reroute
  • FRR is a technology for implementing local protection of MPLS networks proposed by the Internet Engineering Task Force (IETF). This technology provides fast protection for Label Switched Path (LSP) by means of MPLS traffic engineering capabilities. Switching ability.
  • LSP Label Switched Path
  • MPLS fast rerouting is characterized by rapid response, timely switching, smooth transition of service data, and reduced service interruption. It establishes a local backup path in advance. When a fault occurs, the device that detects the link or node failure can quickly take the service. Switching to the backup path protects the LSP from link or node failures and reduces data loss. At the same time, the source node of the LSP will try to find a new path to re-establish the LSP and switch the data to the new path. Before the new LSP is established successfully, the service data will be forwarded through the protection path.
  • P2P point-to-point
  • unicast LSP fast re-routing There are two main ways to implement point-to-point (P2P), that is, unicast LSP fast re-routing, namely 1:1 protection mode and tunnel protection mode.
  • the 1:1 protection mode is to create a protection path for each potential local repair point of a protected LSP.
  • the tunnel protection mode means that a bypass tunnel is used to protect multiple LSPs that traverse the same node and link.
  • a primary LSP is set up by using the Resource Reservation Protocol-Traffic Engineering (RSVP-TE) signaling, and the signaling is carried in the protection characteristics, including whether it is needed.
  • Local protection yes Whether node protection, bandwidth protection, and attributes of the standby LSP are required.
  • Each node on the primary LSP except the sink node is a point of local repair (PLR).
  • PLR calculates and establishes a backup LSP from the PLR to the primary LSP sink node according to the protection characteristics of the primary LSP and the local policy. To protect its downstream links and nodes.
  • Figure 1 shows the implementation of unicast 1:1 fast reroute.
  • the primary LSP is [Rl, R2, R3, R4, R5, and R6]
  • the backup LSP1 is [ R2, R7, R8, R9, R4, R5, R6]
  • LSP2 is [R3, R8, R9, R5, R6].
  • Figure 2 shows the implementation of point-to-multipoint (P2MP), multicast 1:1 fast reroute.
  • the basic idea is to split the point-to-multipoint LSP into multiple point-to-point sub-LSPs.
  • an object of the present invention is to provide a method and a node for implementing multicast fast rerouting to save protection bandwidth.
  • the standby LSP route is determined according to the tree topology of the point-to-multipoint primary label switching path LSP, and the standby LSP is established according to the determined backup LSP route.
  • the determining the standby LSP route according to the tree topology of the point-to-multipoint primary LSP includes: the local repair point PLR determines the protection object information to be protected by using the routing information carried in the primary LSP setup message, and according to the routing information And the protection attribute of the primary LSP to the backup LSP determines the backup LSP route.
  • the source node of the standby LSP is a PLR
  • the sink node is a set of sink nodes of the downstream node of the PLR on the primary LSP
  • the backup LSP route crosses the protection object to be protected.
  • the process of establishing the standby LSP by the PLR includes: the PLR sends a path establishment request carrying the backup LSP route to the sink node; after receiving the path establishment request of the standby LSP, the sink node returns a path establishment response to the PLR to perform resource reservation.
  • the method further includes: combining the path establishment request message of the primary LSP and its corresponding standby LSP.
  • the merging includes: a node that receives the primary LSP and the standby LSP path setup request message with the same set of sink nodes, merges the path setup request messages of the primary LSP and the backup LSP, and retains the path setup request message of the primary LSP after the merge .
  • the merging includes: receiving a node with a standby LSP path setup request message of the same sink node set, the next hop node, and the output interface, combining the path establishment request messages of the backup LSP, and selecting the merge according to a certain policy. After the reserved path establishment request message.
  • the policy includes: a path establishment request message that does not reserve a backup LSP that traverses the nodes protected by other backup LSPs.
  • the policy includes: a path establishment request message that reserves the backup LSP that is closest to the primary LSP.
  • the standby LSP closest to the primary LSP is the one with the smallest weight from the primary LSP since the protection path merged point.
  • the policy includes: merging a point local policy retention path establishment request message according to a protection path.
  • the PLR further reports the protection status and the backup LSP status to the source node of the primary LSP.
  • the present invention further provides a node, the node includes a transceiver unit for transmitting and receiving messages, and a backup LSP path establishing unit, and the standby LSP path establishing unit is configured to determine a standby LSP route according to a tree topology structure of the point-to-multipoint primary LSP. And establish a standby LSP according to the determined backup LSP route.
  • the standby LSP path establishing unit is further configured to receive a path establishment request message of the primary LSP and the corresponding backup LSP sent by the transceiver unit, and merge the received path establishment request message, and pass the merged path establishment request message.
  • the transceiver unit sends out.
  • the standby LSP is determined according to the tree topology of the point-to-multipoint primary LSP, and the standby LSP is established according to the determined backup LSP, and the standby LSP is not separately established for each sub-LSP;
  • the message merging mechanism can reduce the number of network signaling states, save protection bandwidth, optimize network resource utilization, and improve resource utilization.
  • FIG. 1 is a schematic diagram of implementation of unicast 1:1 fast rerouting in the prior art.
  • FIG. 2 is a schematic diagram of implementation of multicast 1:1 fast rerouting in the prior art.
  • FIG. 3 is a schematic structural diagram of a node in the present invention.
  • FIG. 4 is a flowchart of a method for implementing multicast fast re-routing according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a process of establishing a primary LSP according to an embodiment of the present invention.
  • FIG. 6 is a schematic diagram of explicit routing of a standby LSP according to an embodiment of the present invention.
  • FIG. 7 is a schematic diagram of a path after a message is merged according to an embodiment of the present invention. Mode for carrying out the invention
  • the present invention further provides a node.
  • the node includes: a transceiver unit for sending and receiving messages and a backup LSP path establishing unit, where
  • the LSP path establishing unit is configured to determine a backup LSP route according to the tree topology structure of the point-to-multipoint primary LSP, and establish a standby LSP according to the determined backup LSP route.
  • the backup LSP path establishing unit may be further configured to receive a path establishment request message of the primary LSP and the corresponding backup LSP sent by the transceiver unit, and merge the received path establishment request message, and pass the merged path establishment request message.
  • the transceiver unit sends out.
  • the method for implementing multicast fast re-routing in this embodiment mainly includes the following steps:
  • Step 401 Establish a point-to-multipoint primary LSP.
  • the source node S in the process of establishing a point-to-multipoint primary LSP, the source node S carries the path establishment request (such as the Path Message, and the following uses the Path Message as an example) to carry the protection features of the primary LSP, including whether it is needed.
  • the local point-to-multipoint LSP has the same protection feature.
  • the local point-to-multipoint LSP has the same protection feature.
  • the sink nodes dl, dl2, d3, and d4 receive the Path Message of the primary LSP.
  • a response is set up to the sending path (for example, the Resv Message is described in the following example). The resource reservation is performed.
  • the source node S After receiving the Resv Message, the source node S indicates that the primary LSP is successfully established.
  • the PLR After receiving the Resv Message of the primary LSP, the PLR determines whether the LSP is required to be set up and the LSP protection is based on the protection characteristics of the primary LSP and the local policy. Attribute requirements such as nodes and/or links.
  • Step 402 After determining that the backup LSP of the 1:1 protection needs to be established, the PLR obtains the list of the downstream nodes of the primary LSP through the routing information carried in the setup message of the primary LSP (such as the Path Message and/or the Resv Message), and determines the need for protection.
  • the protection object information of the downstream node and/or the link is determined according to the routing information and the protection attribute requirement of the primary LSP for the backup LSP. Routing.
  • the standby LSP is a point-to-multipoint LSP whose number of sink nodes is greater than or equal to one.
  • the explicit route of the standby LSP has the following characteristics:
  • the source node is a PLR
  • the sink node is a set of sink nodes of the downstream node of the PLR on the primary LSP (ie, the protected node or the downstream node of the protected link).
  • FIG. 6 shows the explicit routes of three standby LSPs, as follows:
  • the S node establishes a standby LSP as a PLR, and protects its downstream node A and link S-A.
  • the standby LSP crosses node A and link S-A, and its sink node is the sink node set of downstream node A (dl, d2). , d3 , d4 ) , that is, the standby LSP1 shown by the dotted line in FIG. 6;
  • a node establishes a standby LSP as a PLR, and protects its downstream node C and link A - C.
  • the standby LSP crosses node C and link A _ C , and its sink node is the sink node set of downstream node C ( d3 , d4 ), that is, the standby LSP2 shown by the horizontal line in FIG. 6;
  • the C node establishes a backup LSP as a PLR, and protects its downstream node D and link C-D.
  • the standby LSP spans node D and link C_D, and its sink node is the sink node set U3, d4 of the downstream node D. , that is, the standby LSP3 shown by the dotted line in FIG.
  • Step 403 After the explicit route of the standby LSP is determined, the PLR sends a path establishment request (for example, a Path Message) to the sink node, which is used as an example to establish a standby LSP.
  • a path establishment request for example, a Path Message
  • the process of establishing the standby LSP is specifically performed by the standby LSP path establishing unit, and the standby LSP path establishing unit determines the standby LSP route according to the tree topology structure of the point-to-multipoint primary LSP.
  • the routing information carried in the primary LSP setup message determines the protection object information to be protected, and determines the backup LSP route according to the routing information and the protection attribute requirements of the primary LSP for the backup LSP.
  • Step 404 Receive a node of the Path LSP of the primary LSP and the corresponding multiple backup LSPs. You can combine the Path Messages between the primary and backup LSPs or the backup LSP to reduce the number of network signaling states, optimize network resource utilization, and improve resource utilization.
  • the node that combines the primary and backup LSP messages is called the merge point (MP, Merge Point), and the node that performs the message merge between the backup LSPs is called the Detour Merge Point (DMP).
  • MP merge point
  • DMP Detour Merge Point
  • the signaling message includes a Session Object (including P2MP ID, Tunnel ID, and Extended Tunnel ID).
  • ⁇ Sender Template Object including Tunnel Sender Address ⁇ LSP ID, Sub-Group Originator ID, Sub-Group ID), where (P2MP ID + Tunnel ID + Extended Tunnel ID + Tunnel Sender Address + LSP ID ) uniquely identifies a point-to-multipoint LSP.
  • the primary LSP and its corresponding standby LSP have the same LSP identifier, that is, the same (P2MP ID + Tunnel ID + Extended Tunnel ID + Tunnel Sender Address + LSP ID), and the signaling message of the standby LSP carries the Detour Object.
  • the primary LSP and its corresponding standby LSP are distinguished by whether the Detour Object is carried in the signaling message. There is no correspondence between the primary and backup LSPs for the Sub-Group Originator ID and Sub-Group ID in the Sender Template Object.
  • the policy of selecting the Path Message retained after the combination may be as follows:
  • the path message of the standby LSP is the same as that of the primary LSP.
  • each backup LSP is calculated from DMP according to an algorithm.
  • the weight of the primary LSP is the same as the primary LSP. If the path information of multiple standby LSPs remains after the selection of b, the path is retained by the DMP local policy. Message is forwarded downstream.
  • node 8 receives the master! ⁇ ? and the backup! ⁇ ?1? & ⁇ 1688&86 , they have the same set of sink nodes (dl , d2 ) , according to the message merge principle 1 ) , the Path Message of the primary LSP is retained without retaining the Path Message of the standby LSP1 , and the node B becomes the MP.
  • Node X receives the Path Messages of the standby LSP1 and the standby LSP2, and they have different set of sink nodes, which are (dl, d2, d3, d4) and (d3, d4), respectively, which do not conform to the message merge original shell, U). It also does not comply with the message merge principle 2), therefore, message merge cannot be performed.
  • Node Y receives the standby LSP1, ⁇ LSP2 ⁇ LSP3 ⁇ Path Message, which all have the same set of sink nodes (d3, d4), the same next hop node and output interface, conform to the message merge principle 2), can message merge. Then, according to the policy, b, c, the path message that is reserved after the merge is selected. The backup LSP2 traverses the node D protected by the standby LSP3. Therefore, according to the policy a, the Path Message of the standby LSP2 is not reserved.
  • the weight of each hop before the intersection is 1 and the weight of the LSP1 and the primary LSP is 4, and the weight of the LSP3 and the primary LSP is also 4, and the LSP1 and the standby LSP3 are equal.
  • the selection is made.
  • the node Y selects a Path Message that retains a standby LSP according to the local policy (for example, by comparing the size relationship of the PLR addresses corresponding to the two standby LSPs), for example, retaining the Path Message of the standby LSP1, and the node Y becomes the DMP. .
  • Figure 7 shows the path status after Path Message merge according to the above principle.
  • Step 405 After receiving the Path Message of the standby LSP, the sink node sends a path establishment response (such as a Resv Message, and the following takes Resv Message as an example).
  • a path establishment response such as a Resv Message, and the following takes Resv Message as an example.
  • the MP or DMP After receiving the Resv Message of the primary LSP or the backup LSP, the MP or DMP receives the Resv Message.
  • the LSP is successfully established after the Resv Message is received from the upstream and backup LSPs of the LSP. As shown in Figure 7, if the link A - C fails, after the node A detects the fault, the traffic originally forwarded by the node A to the link A - C will be forwarded by the node A to the corresponding standby LSP2. Subsequent routes for this service are [A, X, Y, Z, M, d3 & d4].
  • the PLR can report the updated protection status and the standby LSP status to the source node of the primary LSP through the status indicator carried in the RRO Sub-Object in the Resv Message of the primary LSP, including the local Whether protection is available, whether local protection is enabled, whether bandwidth protection is provided, node protection, etc.

Landscapes

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

Description

一种实现组播快速重路由的方法及一种节点 技术领域
本发明涉及多协议标签交换（ MPLS , Multiple Protocol Label Switch )网 络局部保护技术， 尤其涉及一种实现组播快速重路由 （FRR, Fast Reroute ) 的方法及一种节点。 发明背景
FRR是互联网工程任务组（ IETF, Internet Engineering Task Force )提 出的一种实现 MPLS网络局部保护的技术， 这种技术借助 MPLS流量工程 的能力， 为标签交换路径（LSP, Label Switched Path )提供快速保护倒换 能力。
MPLS快速重路由的特点是迅速响应、 及时切换， 保证业务数据的平 滑过渡， 减少业务中断， 其预先建立本地备份路径， 当故障发生时， 检测 到链路或节点故障的设备就可以快速将业务切换到备份路径上， 保护 LSP 不会受链路或节点故障的影响， 减少数据丢失。 同时， LSP的源节点会尝 试寻找新的路径来重新建立 LSP, 并将数据切换到新路径上， 在新的 LSP 建立成功之前， 业务数据会一直通过保护路径转发。
现有的实现点到点（P2P )即单播 LSP快速重路由的方式主要有两种， 即 1 :1保护方式和隧道保护方式。 其中， 1:1保护方式是指， 为一条被保护 LSP的每个潜在本地修复点创建一条保护路径； 隧道保护方式是指， 用一 条旁路隧道保护穿越相同节点和链路的多条 LSP。
在 1:1保护方式中， 通过基于流量工程的资源预留扩展协议 ( RSVP-TE, Resource Reservation Protocol-Traffic Engineering )信令建立 一条主 LSP, 且建立信令中携带其保护特性， 包括是否需要本地保护、 是 否需要节点保护、 是否需要保护带宽、 备 LSP的属性等。 主 LSP上除宿节 点外的每个节点都是本地修复点 （PLR, Point of Local Repair ) , PLR根 据主 LSP的保护特性和本地策略， 计算并建立由本 PLR至主 LSP宿节点的 备 LSP, 以保护其下游链路和节点。
图 1所示为单播 1:1快速重路由的实现示意图， 有一条主 LSP、 两条备 LSP, 其中， 主 LSP为 [Rl, R2, R3, R4, R5, R6], 备 LSP1为 [R2, R7, R8, R9, R4, R5, R6], 备 LSP2为 [R3, R8, R9, R5, R6]。 当 R2与 R3 之间的链路发生故障时， 主 LSP上的业务将被 R2切换到备 LSP上， 业务传 送路径为 [Rl, R2, R7, R8, R9, R5, R6]。 这样， 就不会由于 R2与 R3 之间的链路故障而产生业务中断。
图 2所示为点到多点 （P2MP) 即组播 1:1快速重路由的实现示意图， 其基本思想是： 将点到多点 LSP拆分成多个点到点的子 LSP, 如图 2中共有 4条子 LSP, 分别为： [S, A, B, dl]、 [S, A, B, E, d2]、 [S, A, C, D, d3]和 [S, A, C, D, d4], 并遵循已有的点到点快速重路由机制， 分别为 每个子 LSP建立备 LSP进行保护。
可见， 现有的组播快速重路由的实现方案需要分别为每个子 LSP建立 备 LSP进行保护， 由于各个子 LSP存在的链路或节点可能重合， 因此， 如 果对于每个子 LSP都分别建立备 LSP, 则容易建立大量冗余的保护路径， 消耗大量的保护带宽， 从而造成网络资源的浪费。 发明内容
有鉴于此，本发明的目的在于提供一种实现组播快速重路由的方法及 一种节点， 以节省保护带宽。
为达到上述目的， 本发明提供的实现组播快速重路由的方法如下： 根据点到多点主标签交换路径 LSP的树拓朴结构确定备 LSP路由， 并 根据确定的备 LSP路由建立备 LSP。 其中， 所述根据点到多点主 LSP的树拓朴结构确定备 LSP路由包括： 本地修复点 PLR通过主 LSP建立消息中携带的路由信息确定需要保护的保 护对象信息， 并根据所述路由信息及主 LSP对备 LSP的保护属性要求， 确 定备 LSP路由。
所述备 LSP路由的源节点为 PLR，宿节点为 PLR在主 LSP上的下游节点 的宿节点集合， 且备 LSP路由跨越需要保护的保护对象。
所述 PLR建立备 LSP的过程包括： PLR向宿节点发送携带备 LSP路由的 路径建立请求； 宿节点收到备 LSP的路径建立请求后， 向 PLR返回路径建 立应答， 进行资源预留。
在建立备 LSP的过程中进一步包括：对主 LSP及其相应备 LSP的路径建 立请求消息进行合并。
所述合并包括： 接收到具有相同宿节点集合的主 LSP和备 LSP路径建 立请求消息的节点， 对主 LSP和备 LSP的路径建立请求消息进行合并， 且 合并后保留主 LSP的路径建立请求消息。
所述合并包括： 接收到一个以上具有相同宿节点集合、 下一跳节点和 输出接口的备 LSP路径建立请求消息的节点， 对备 LSP的路径建立请求消 息进行合并， 且按照一定的策略选择合并后保留的路径建立请求消息。
所述策略包括： 不保留穿越其它备 LSP所保护节点的备 LSP的路径建 立请求消息。
所述策略包括： 保留与主 LSP最近的备 LSP的路径建立请求消息。 所述与主 LSP最近的备 LSP为自保护路径合并点起与主 LSP相距的权 值最小者。
所述策略包括： 按保护路径合并点本地策略保留路径建立请求消息。 在建立备 LSP过程中进一步包括： PLR向主 LSP的源节点上报保护状 态及备 LSP状态。 本发明还提供了一种节点， 该节点包括用于收发消息的收发单元， 以 及备 LSP路径建立单元，备 LSP路径建立单元用于根据点到多点主 LSP的树 拓朴结构确定备 LSP路由， 并根据确定的备 LSP路由建立备 LSP。
所述备 LSP路径建立单元进一步用于接收收发单元发送来的主 LSP及 其相应备 LSP的路径建立请求消息， 并对收到的路径建立请求消息进行合 并， 将合并后的路径建立请求消息通过收发单元发送出去。
由此可见， 在本发明中是根据点到多点主 LSP的树拓朴结构确定备 LSP路由， 并根据确定的备 LSP路由建立备 LSP, 无需分别为每个子 LSP建 立备 LSP; 并且， 通过消息合并机制能够减少网络信令状态数量， 节省保 护带宽， 优化网络资源利用， 提高资源利用率。 附图简要说明
图 1为现有技术中单播 1:1快速重路由的实现示意图。
图 2为现有技术中组播 1： 1快速重路由的实现示意图。
图 3为本发明中的节点结构示意图。
图 4为本发明实施例中实现组播快速重路由的方法流程图。
图 5为本发明实施例中主 LSP的建立过程示意图。
图 6为本发明实施例中备 LSP的显式路由示意图。
图 7为本发明实施例中消息合并后的路径示意图。 实施本发明的方式
为使本发明的目的、 技术方案及优点更加清楚明白， 下面参照附图并 举实施例， 对本发明作进一步详细说明。
本发明提供的实现组播快速重路由的方法的基本思想是：根据点到多 点主 LSP的树拓朴结构确定备 LSP路由， 并根据确定的备 LSP路由建立备 LSP。 对应本发明所提供的方法， 本发明还提供了一种节点， 参见图 3所示， 该节点包括： 用于收发消息的收发单元和备 LSP路径建立单元， 其中， 备
LSP路径建立单元用于根据点到多点主 LSP的树拓朴结构确定备 LSP路由， 并根据确定的备 LSP路由建立备 LSP。
备 LSP路径建立单元还可进一步用于接收收发单元发送来的主 LSP及 其相应备 LSP的路径建立请求消息， 并对收到的路径建立请求消息进行合 并， 将合并后的路径建立请求消息通过收发单元发送出去。
下面以图 2所示的点到多点 LSP树拓朴结构为例， 对本发明进行详细 阐述， 具体参见图 4所示， 本实施例中实现组播快速重路由的方法主要包 括以下步骤：
步骤 401 : 建立点到多点主 LSP。
参见图 5所示， 在点到多点主 LSP的建立过程中， 源节点 S通过路径建 立请求 （如 Path Message, 下面均以 Path Message为例进行说明）携带主 LSP的保护特性， 包括是否需要本地保护、 是否需要节点保护、 是否需要 保护带宽、 备 LSP的属性等， 整个点到多点 LSP具有相同的保护特性； 宿 节点 dl、 dl2、 d3、 d4收到主 LSP的 Path Message后， 反向发送路径建立应 答（如 Resv Message, 下面均以 Resv Message为例进行说明） ， 进行资源 预留， 源节点 S收到 Resv Message后， 表示主 LSP建立成功。
PLR即主 LSP上除宿节点外的各个节点接收到主 LSP的 Resv Message 后， 根据主 LSP的保护特性及本地策略， 确定是否需要建立 1:1保护的备 LSP , 以及备 LSP保护的对象是节点和 /或链路等属性要求。
步骤 402: PLR在确定需要建立 1: 1保护的备 LSP后， 通过主 LSP的建立 消息 （如 Path Message和 /或 Resv Message ) 中携带的路由信息获得主 LSP 的下游节点列表， 确定需要保护的下游节点和 /或链路等保护对象信息， 并根据上述路由信息及主 LSP对备 LSP的保护属性要求，确定备 LSP的显式 路由。
其中， 备 LSP是一条点到多点 LSP, 其宿节点数量大于等于一个。 备 LSP的显式路由具有以下特征：
1 )跨越要保护的保护对象（链路和 /或节点） ；
2 )其源节点为 PLR, 宿节点为 PLR在主 LSP上的下游节点 （即被保护 节点或被保护链路的下游节点） 的宿节点集合。
图 6列举了三条备 LSP的显式路由， 分别如下：
S节点作为 PLR建立一条备 LSP,保护其下游节点 A及链路 S - A, 该备 LSP跨越节点 A及链路 S - A, 且其宿节点为下游节点 A的宿节点集合（ dl , d2, d3 , d4 ) , 即图 6中虚线所示的备 LSP1 ;
A节点作为 PLR建立一条备 LSP, 保护其下游节点 C及链路 A - C, 该 备 LSP跨越节点 C及链路 A _ C , 且其宿节点为下游节点 C的宿节点集合 ( d3 , d4 ) , 即图 6中点横线所示的备 LSP2;
C节点作为 PLR建立一条备 LSP, 保护其下游节点 D及链路 C - D, 该 备 LSP跨越节点 D及链路 C _ D , 且其宿节点为下游节点 D的宿节点集合 U3 , d4 ) , 即图 6中点线所示的备 LSP3。
步骤 403: 备 LSP的显式路由确定后， PLR向宿节点发送携带备 LSP显 式路由的路径建立请求（如 Path Message， 下面均以 Path Message为例进行 说明 ) , 以建立备 LSP。
建立备 LSP的过程具体由备 LSP路径建立单元完成，所述备 LSP路径建 立单元根据点到多点主 LSP的树拓朴结构确定备 LSP路由， 实际上就是备 LSP路径建立单元根据收发单元发送来的主 LSP建立消息中携带的路由信 息确定需要保护的保护对象信息， 并根据所述路由信息及主 LSP对备 LSP 的保护属性要求， 确定备 LSP路由。
步骤 404: 接收到主 LSP和相应的多个备 LSP的 Path Message的节点， 可以对主、备 LSP或备 LSP之间的 Path Message进行合并， 以减少网络信令 状态数量， 优化网络资源利用， 提高资源利用率。
其中，进行主、备 LSP消息合并的节点称为合并点（ MP, Merge Point ) , 进行备 LSP间消息合并的节点称为保护路径合并点 （ DMP, Detour Merge Point ) 。
信令消息中包含 Session Object (包括 P2MP ID、 Tunnel ID、 Extended Tunnel ID )^ Sender Template Object (包括 Tunnel Sender Address ^ LSP ID、 Sub-Group Originator ID、 Sub-Group ID ) , 其中， （ P2MP ID + Tunnel ID + Extended Tunnel ID + Tunnel Sender Address + LSP ID ) 可以唯一标识一 个点到多点 LSP。 主 LSP及其相应的备 LSP具有相同的 LSP标识， 即相同的 ( P2MP ID + Tunnel ID + Extended Tunnel ID + Tunnel Sender Address + LSP ID ) , 而备 LSP的信令消息中携带 Detour Object, 节点可以通过信令 消息中是否携带 Detour Object来区分主 LSP及其相应的备 LSP。对于 Sender Template Object中的 Sub-Group Originator ID和 Sub-Group ID, 主、 备 LSP 间没有对应关系。
消息合并原则具体如下：
1 )具有相同宿节点集合的主 LSP和备 LSP可以进行消息合并， 且合并 后保留主 LSP的 Path Message;
2 ) 具有相同宿节点集合、 下一跳节点和输出接口的备 LSP间可以进 行消息合并， 且按照一定的策略选择合并后保留的 Path Message。
所述选择合并后保留的 Path Message的策略可具体如下：
a、 若某备 LSP穿越了其它备 LSP所保护的节点， 则不保留该备 LSP的 Path Message;
b、 若按 a选择后仍剩余多个备 LSP的 Path Message, 则保留与主 LSP最 近的备 LSP的 Path Message, 比如， 按照某种算法计算各个备 LSP自 DMP 起与主 LSP相距的权值， 得到的权值最小者即为与主 LSP最近的备 LSP; c、 若按 b选择后仍剩余多个备 LSP的 Path Message, 则按 DMP本地策 略保留一个 Path Message向下游转发。
比如， 在图 6中， 节点8接收到主!^?和备!^?1的？& ^1688&86 , 它们 具有相同的宿节点集合（dl , d2 ) , 按照消息合并原则 1 ) , 则保留主 LSP 的 Path Message, 而不保留备 LSP1的 Path Message, 节点 B成为 MP。
节点 X接收到备 LSP1和备 LSP2的 Path Message, 它们具有的宿节点集 合不同， 分别为 （dl , d2, d3 , d4 )和（d3 , d4 ) , 既不符合消息合并原 贝，U ) , 也不符合消息合并原则 2 ) , 因此， 不能进行消息合并。
节点 Y接收到备 LSP1、 ^LSP2^^LSP3^Path Message, 它们均具有 相同的宿节点集合（d3 , d4 ) , 相同的下一跳节点和输出接口， 符合消息 合并原则 2 ) , 可以进行消息合并。 然后， 按照策略 、 b、 c选择合并后保 留的 Path Message: 备 LSP2穿越了备 LSP3所保护的节点 D, 因此按照策略 a, 不保留备 LSP2的 Path Message; 若将自节点 Y起与主 LSP相交前的每一 跳权值记为 1 , 则备 LSP1与主 LSP距离的权值为 4, 备 LSP3与主 LSP距离的 权值也为 4, 备 LSP1与备 LSP3权值相等， 无法按照策略 b作出选择； 最后， 节点 Y根据本地策略 （如通过比较两备 LSP对应的 PLR地址的大小关系来 选择等） 选择保留一条备 LSP的 Path Message , 比如保留备 LSP1的 Path Message, 节点 Y成为 DMP。
图 7所示为按照上述原则进行 Path Message合并之后的路径状态。
步骤 405: 宿节点收到备 LSP的 Path Message后， 反向发送路径建立响 应（如 Resv Message, 下面均以 Resv Message为例进行说明）， MP或 DMP 收到主 LSP或备 LSP的 Resv Message后， 向被其合并的多条主、 备 LSP的上 游转发 Resv Message, PLR接收到备 LSP的 Resv Message后， 备 LSP建立成 功。 如图 7所示， 若链路 A - C发生故障， 则节点 A在检测到故障后， 原来 由节点 A转发到链路 A - C上的业务将被节点 A转发到相应的备 LSP2上，该 业务后续的路由为 [A, X, Y, Z, M, d3 & d4]。
在建立备 LSP过程中或备 LSP建立成功之后， PLR可以通过主 LSP的 Resv Message中 RRO Sub-Object携带的状态指示位， 向主 LSP的源节点上 报更新的保护状态及备 LSP状态， 包括本地保护是否可用、 本地保护是否 已启用、 是否提供带宽保护、 是否节点保护等。
以上所述对本发明的目的、技术方案和有益效果进行了进一步的详细 说明， 所应理解的是， 以上所述并不用以限制本发明， 凡在本发明的精神 和原则之内， 所做的任何修改、 等同替换、 改进等， 均应包含在本发明的 保护范围之内。

Claims

权利要求书
1、 一种实现组播快速重路由的方法， 其特征在于， 包括：
主标签交换路径 LSP上的本地修复点 PLR根据主 LSP路由信息以及备 LSP需要保护的保护对象信息， 确定备 LSP路由；
根据确定的备 LSP路由建立备 LSP。
2、 根据权利要求 1所述的方法， 其特征在于， 所述确定备 LSP路由的 过程包括：
所述 PLR根据主 LSP路由信息确定自身在主 LSP上的下游节点的宿节 点集合， 根据所述保护对象信息确定备 LSP需要保护的保护对象， 并根据 所述宿节点集合及保护对象确定备 LSP路由， 其中， 所述备 LSP路由的源 节点为所述 PLR自身， 宿节点为所述宿节点集合， 且所述备 LSP路由跨越 所述保护对象。
3、 根据权利要求 2所述的方法， 其特征在于， 所述根据确定的备 LSP 路由建立备 LSP的过程包括：
PLR向所述备 LSP路由的宿节点发送携带所述备 LSP路由的路径建立 请求消息；
宿节点收到备 LSP的路径建立请求消息后， 向 PLR返回路径建立应答 消息， 并进行资源预留， 建立备 LSP。
4、 根据权利要求 3所述的方法， 其特征在于， 所述建立备 LSP的过程 中进一步包括：
对所述主 LSP的路径建立请求消息及所述备 LSP的路径建立请求消息 进行合并。
5、 根据权利要求 4所述的方法， 其特征在于， 所述对所述主 LSP的路 径建立请求消息及所述备 LSP的路径建立请求消息进行合并包括：
接收到具有相同宿节点集合的主 LSP和备 LSP路径建立请求消息的节 点， 对所述主 LSP和备 LSP的路径建立请求消息进行合并， 且合并后保留 主 LSP的路径建立请求消息。
6、 根据权利要求 4所述的方法， 其特征在于， 所述对所述主 LSP的路 径建立请求消息及所述备 LSP的路径建立请求消息进行合并包括：
接收到一个以上具有相同宿节点集合、 下一跳节点和输出接口的备 LSP路径建立请求消息的节点， 对所述备 LSP的路径建立请求消息进行合 并， 且按照一定的策略选择合并后保留的路径建立请求消息。
7、 根据权利要求 6所述的方法， 其特征在于， 所述按照一定的策略选 择合并后保留的路径建立请求消息包括：
保留未穿越其它备 LSP所保护节点的备 LSP的路径建立请求消息。
8、根据权利要求 7所述的方法，其特征在于， 当所述未穿越其它备 LSP 所保护节点的备 LSP个数大于 1时， 所述按照一定的策略选择合并后保留 的路径建立请求消息还包括：
从所述未穿越其它备 LSP所保护节点的备 LSP中选择一个与主 LSP最 近的备 LSP, 并保留该被选择的备 LSP的路径建立请求消息， 其中， 所述 与主 LSP最近的备 LSP为自保护路径合并点起与主 LSP相距的权值最小的 备 LSP。
9、 根据权利要求 8所述的方法， 其特征在于， 当所述与主 LSP最近的 备 LSP个数大于 1时， 所述按照一定的策略选择合并后保留的路径建立请 求消息还包括：
按照保护路径合并点本地策略， 从所述与主 LSP最近的备 LSP中选择 一个备 LSP , 并保留该被选择的备 LSP的路径建立请求消息。
10、一种节点， 用于实现组播快速重路由， 其特征在于， 该节点包括： 收发单元和备 LSP路径建立单元， 其中，
收发单元， 用于将收到的主 LSP路由信息及备 LSP需要保护的保护对 象信息发送给备 LSP路径建立单元；
备 LSP路径建立单元，用于根据收到的主 LSP路由信息及备 LSP需要保 护的保护对象信息确定备 LSP路由， 并根据确定的备 LSP路由建立备 LSP。
11、 根据权利要求 10所述的节点， 其特征在于， 所述备 LSP路径建立 单元， 根据收到的主 LSP路由信息确定所述节点在主 LSP上的下游节点的 宿节点集合， 根据收到的保护对象信息确定备 LSP需要保护的保护对象， 并根据所述宿节点集合及保护对象确定备 LSP路由， 其中， 所述备 LSP路 由的源节点为所述节点自身， 宿节点为所述宿节点集合， 且所述备 LSP路 由跨越所述保护对象。
12、 根据权利要求 10或 11所述的节点， 其特征在于， 所述备 LSP路径 建立单元，进一步用于在收到主 LSP路径请求消息及与主 LSP相应的备 LSP 路径建立请求消息后， 对收到的路径建立请求消息进行合并， 并通过收发 单元将合并后的路径建立请求消息发送出去。
PCT/CN2007/070417 2006-09-27 2007-08-06 Procédés de mise en oeuvre de réacheminement rapide multidiffusion et noeud Ceased WO2008037198A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP07785412.3A EP2071768B1 (en) 2006-09-27 2007-08-06 A method for implementing the multicast fast-reroute and a node
US12/413,144 US7940647B2 (en) 2006-09-27 2009-03-27 Method and node for implementing multicast fast reroute

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200610127898.4 2006-09-27
CN2006101278984A CN101155124B (zh) 2006-09-27 2006-09-27 一种实现组播快速重路由的方法

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/413,144 Continuation US7940647B2 (en) 2006-09-27 2009-03-27 Method and node for implementing multicast fast reroute

Publications (1)

Publication Number Publication Date
WO2008037198A1 true WO2008037198A1 (fr) 2008-04-03

Family

ID=39229741

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2007/070417 Ceased WO2008037198A1 (fr) 2006-09-27 2007-08-06 Procédés de mise en oeuvre de réacheminement rapide multidiffusion et noeud

Country Status (4)

Country Link
US (1) US7940647B2 (zh)
EP (1) EP2071768B1 (zh)
CN (1) CN101155124B (zh)
WO (1) WO2008037198A1 (zh)

Families Citing this family (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101087207B (zh) * 2006-06-09 2010-05-12 华为技术有限公司 一种多节点通信故障的处理方法
JP5039639B2 (ja) * 2008-06-09 2012-10-03 株式会社日立製作所 パスプロテクション機能を有する通信装置及びその通信装置を使用するネットワークシステム
CN101714940B (zh) * 2008-09-30 2012-10-17 华为技术有限公司 路径计算及建立方法、路径计算单元和节点、网络
CN101753342B (zh) * 2008-12-02 2012-08-08 华为技术有限公司 一种业务保护方法、节点和系统
CN101826954B (zh) * 2010-03-30 2014-12-10 中兴通讯股份有限公司 集中式网络节点中实现热备份的方法及系统
US8976646B2 (en) 2011-11-11 2015-03-10 Futurewei Technologies, Inc. Point to multi-point based multicast label distribution protocol local protection solution
KR20130055392A (ko) 2011-11-18 2013-05-28 한국전자통신연구원 점 대 다점 네트워크에서의 보호 절체 방법 및 장치
CN103139005B (zh) * 2011-12-02 2015-08-19 中国移动通信集团北京有限公司 对网络资源配置合理性进行检测的方法及装置
US9083636B2 (en) * 2012-02-13 2015-07-14 Cisco Technology, Inc. System and method for multipoint label distribution protocol node protection using a targeted session in a network environment
US9270426B1 (en) * 2012-09-11 2016-02-23 Juniper Networks, Inc. Constrained maximally redundant trees for point-to-multipoint LSPs
US9571387B1 (en) 2012-03-12 2017-02-14 Juniper Networks, Inc. Forwarding using maximally redundant trees
WO2013188802A1 (en) * 2012-06-14 2013-12-19 Huawei Technologies Co., Ltd. Mrsvp-te based fast reroute in facility (1:n) protection mode
US9219614B2 (en) * 2012-06-14 2015-12-22 Futurewei Technologies, Inc. mRSVP-TE based fast reroute in detour (1:1) protection mode
US9258221B2 (en) * 2013-05-31 2016-02-09 Alcatel Lucent System and method for rapid protection of RSVP based LSP
US9225589B2 (en) * 2013-06-19 2015-12-29 Cisco Technology, Inc. Fast reroute using different frequency-hopping schedules
US9344359B1 (en) 2013-09-10 2016-05-17 Juniper Networks, Inc. Ingress protection for multipoint label switched paths
US10020984B1 (en) * 2014-01-10 2018-07-10 Juniper Networks, Inc. RSVP local protection signaling reduction
CN105099907B (zh) * 2014-04-25 2019-12-17 华为技术有限公司 路径检测方法、宿节点设备及通信系统
US9674075B1 (en) * 2014-12-22 2017-06-06 Juniper Networks, Inc. Multicast only fast re-route for PIM ASM mode
US9660860B1 (en) 2014-12-30 2017-05-23 Juniper Networks, Inc. Path computation delay timer in multi-protocol label switched networks
US10230621B2 (en) * 2017-05-09 2019-03-12 Juniper Networks, Inc. Varying a per-hop-bandwidth constraint in multi-path label switched paths
US10554425B2 (en) 2017-07-28 2020-02-04 Juniper Networks, Inc. Maximally redundant trees to redundant multicast source nodes for multicast protection
CN107248954B (zh) * 2017-08-04 2020-06-12 山西大学 一种基于网络交叉度的域内路由保护方法
US11252081B2 (en) 2019-08-06 2022-02-15 Arista Networks, Inc. Optimized programming of forwarding data in network device hardware
US11436047B2 (en) 2019-08-06 2022-09-06 Arista Networks, Inc. System and method for processing information hierarchy management
CN113839751B (zh) * 2020-06-08 2023-05-09 中国移动通信有限公司研究院 路径损耗参考信号更新及指示更新方法、设备及介质
CN113810938B (zh) * 2021-06-29 2022-09-27 荣耀终端有限公司 通道切换方法、电子设备及存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20050047667A (ko) * 2003-11-18 2005-05-23 한국전자통신연구원 Ｍｐｌｓ 시스템에서의 동적 경로 보호 방법
US20060126496A1 (en) * 2004-12-10 2006-06-15 Clarence Filsfils Fast reroute (FRR) protection at the edge of a RFC 2547 network
CN1805412A (zh) * 2005-01-14 2006-07-19 三星电子株式会社 针对mpls组播的快速重路由设备和方法

Family Cites Families (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100725005B1 (ko) * 2000-11-22 2007-06-04 주식회사 케이티 다중 프로토콜 레이블 스위칭 망에서의 고속 재라우팅 방법
EP1271844B1 (en) * 2001-06-21 2009-12-09 SK Telecom Co.,Ltd. Route determining method in a multi protocol label switching network
US7088679B2 (en) * 2001-12-12 2006-08-08 Lucent Technologies Inc. Method and system for providing failure protection in a ring network that utilizes label switching
US7702810B1 (en) * 2003-02-03 2010-04-20 Juniper Networks, Inc. Detecting a label-switched path outage using adjacency information
US7626925B1 (en) * 2003-06-19 2009-12-01 Cisco Technology, Inc. Methods for finding a merge point node for MPLS fast re-route
US7539131B2 (en) * 2003-11-26 2009-05-26 Redback Networks Inc. Nexthop fast rerouter for IP and MPLS
US7680952B1 (en) * 2004-06-16 2010-03-16 Juniper Networks, Inc. Protecting connection traffic using filters
JP2006135434A (ja) * 2004-11-02 2006-05-25 Ntt Communications Kk Ｌｓｐの状態把握方法、その方法を実現する通信装置、通信装置の制御方法、およびプログラム
US7512063B2 (en) * 2004-12-14 2009-03-31 Cisco Technology, Inc. Border router protection with backup tunnel stitching in a computer network
CN100479459C (zh) * 2005-01-27 2009-04-15 华为技术有限公司 多协议标签交换系统中建立返回标签交换路径的方法
US7835267B2 (en) * 2005-05-09 2010-11-16 Cisco Technology, Inc. Dynamic path protection in an optical network
US7586841B2 (en) * 2005-05-31 2009-09-08 Cisco Technology, Inc. System and method for protecting against failure of a TE-LSP tail-end node
US8072879B2 (en) * 2006-02-03 2011-12-06 Cisco Technology, Inc. Technique for determining whether to reestablish fast rerouted primary tunnels based on backup tunnel path quality feedback
US7693046B2 (en) * 2006-06-05 2010-04-06 Tellabs San Jose, Inc. Method and apparatus for maintaining network connectivity via label switched path(s)
US7643499B2 (en) * 2006-06-30 2010-01-05 Alcatel Lucent Extending IP/MPLS services reachability over ATM backbone networks
US7889641B2 (en) * 2006-07-18 2011-02-15 Opnet Technologies, Inc. Path flow formulation for fast reroute bypass tunnels in MPLS networks
US7899049B2 (en) * 2006-08-01 2011-03-01 Cisco Technology, Inc. Methods and apparatus for minimizing duplicate traffic during point to multipoint tree switching in a network
US7792111B2 (en) * 2008-04-23 2010-09-07 Cisco Technology, Inc. Point-to-multipoint for multicast and unicast forwarding

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20050047667A (ko) * 2003-11-18 2005-05-23 한국전자통신연구원 Ｍｐｌｓ 시스템에서의 동적 경로 보호 방법
US20060126496A1 (en) * 2004-12-10 2006-06-15 Clarence Filsfils Fast reroute (FRR) protection at the edge of a RFC 2547 network
CN1805412A (zh) * 2005-01-14 2006-07-19 三星电子株式会社 针对mpls组播的快速重路由设备和方法

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"Dynamic routing of bandwidth guaranteed multicasts with failure backup", NETWORK PROTOCOL, 2002. PROCEEDINGS. 10TH IEEE INTERNATIONAL CONFERENCE CE, 12 November 2002 (2002-11-12), pages 259 - 268
See also references of EP2071768A4

Also Published As

Publication number Publication date
US20090185478A1 (en) 2009-07-23
EP2071768B1 (en) 2016-10-12
US7940647B2 (en) 2011-05-10
EP2071768A4 (en) 2009-09-09
CN101155124B (zh) 2011-09-14
EP2071768A1 (en) 2009-06-17
CN101155124A (zh) 2008-04-02

Similar Documents

Publication Publication Date Title
WO2008037198A1 (fr) Procédés de mise en oeuvre de réacheminement rapide multidiffusion et noeud
CN104737502B (zh) 用于从次优主要的p2mp切换流量至备用p2mp的方法与系统
US9369335B2 (en) mRSVP-TE based fast reroute in detour (1:1) protection mode
KR100693052B1 (ko) Ｍｐｌｓ 멀티캐스트의 고속 재경로 설정 장치 및 방법
JP5759637B2 (ja) リング型ネットワークのラベル・スイッチ・パスを作成する方法、関連するデバイス、及び通信システム
WO2009056053A1 (en) A method, device and system of multi-protocol label exchange traffic engineering flow capacity switch
WO2008006268A1 (fr) Procédé,système et dispositif de noeud permettant de réaliser une protection de service dans un réseau optique commuté automatiquement
CN102204190B (zh) 路径建立方法和装置
WO2011009380A1 (zh) 一种多层多域分布式光网络并行跨域故障恢复方法和装置
WO2008098451A1 (en) Tunnel establishing method, network node device and network system
CN101160761B (zh) 链路故障的恢复方法及装置
WO2006081767A1 (en) A method for implementing master and backup transmission path
WO2006017982A1 (en) A rerouting method in the multi-protocol label switch network
JP2010541313A (ja) Ｍｐｌｓ−ｆｒｒ帯域幅最適化のためのｒｓｖｐ−ｔｅ強化
CN102036129B (zh) 一种基于路径计算单元的路径保护方法及系统
CN100527683C (zh) 故障保护方法和系统
WO2008064612A1 (en) A method and device and system for performing fast rerouting in a mpls network
CN101483491B (zh) 共享保护环及其组播源路由保护方法和节点
CN100591051C (zh) 多链路失效的处理方法及标签交换路由器
CN101610203A (zh) 实现组播重路由的方法、装置及系统
JP3780987B2 (ja) 経路制御方法及び装置及び経路制御プログラム及び経路制御プログラムを格納した記憶媒体
WO2009074057A1 (fr) Procede de protection de nœud de tete, systeme et dispositif pour le trajet de commutation d'etiquettes point a multipoint
CN101022449A (zh) 一种建立旁路lsp的方法及系统及节点设备
Habib An efficient hybrid recovery mechanism for MPLS-based networks
Veni et al. Protection switching and rerouting in MPLS

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

REEP Request for entry into the european phase

Ref document number: 2007785412

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2007785412

Country of ref document: EP