WO2017177647A1 - 基于rsvp-te动态隧道的高效lsp保护方法 - Google Patents

基于rsvp-te动态隧道的高效lsp保护方法 Download PDF

Info

Publication number
WO2017177647A1
WO2017177647A1 PCT/CN2016/102801 CN2016102801W WO2017177647A1 WO 2017177647 A1 WO2017177647 A1 WO 2017177647A1 CN 2016102801 W CN2016102801 W CN 2016102801W WO 2017177647 A1 WO2017177647 A1 WO 2017177647A1
Authority
WO
WIPO (PCT)
Prior art keywords
lsp
primary
route
rsvp
backup
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/CN2016/102801
Other languages
English (en)
French (fr)
Inventor
邓梦莲
高军
蒋玉玲
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fiberhome Telecommunication Technologies Co Ltd
Original Assignee
Fiberhome Telecommunication 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 Fiberhome Telecommunication Technologies Co Ltd filed Critical Fiberhome Telecommunication Technologies Co Ltd
Priority to SG11201804251TA priority Critical patent/SG11201804251TA/en
Priority to MYPI2018701881A priority patent/MY197891A/en
Publication of WO2017177647A1 publication Critical patent/WO2017177647A1/zh
Priority to PH12018501086A priority patent/PH12018501086A1/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4633—Interconnection of networks using encapsulation techniques, e.g. tunneling
    • 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

Definitions

  • the present invention relates to the field of data and IP transmission equipment, and in particular to an efficient LSP protection method based on RSVP-TE dynamic tunnel.
  • RSVP-TE Resource Reservation Protocol-Traffic Engineering
  • RSVP Resource Reservation Protocol
  • MPLS TE Multi-Protocol
  • Label Switching Traffic Labeling Label Switching Path
  • the LSPs that are established and deleted by the RSVP protocol are all CR-LSPs (constrained route-Label Switched Paths).
  • the primary LSP When the primary LSP is a strict routing constraint and the backup LSP is in strict routing or automatic establishment mode, the primary LSP cannot be re-established successfully until the primary LSP fails. In this case, When the standby LSP also fails The active/standby LSPs cannot be switched between the active and standby LSPs, causing service interruption and generating a spoofing path.
  • the present invention aims to provide an efficient LSP protection method based on the RSVP-TE dynamic tunnel, and can quickly generate a new primary LSP or a primary LSP or a backup failure in the link.
  • the backup active LSP is used to perform the active/standby switchover at any time to avoid service interruption and improve the efficiency of active/standby LSP protection.
  • the present invention adopts an efficient LSP protection method based on the RSVP-TE dynamic tunnel, which includes: establishing a primary LSP by using a loose routing constraint, and establishing a backup LSP by using an automatic or loose routing constraint to form an active/standby LSP protection; After the LSP is faulty, the service is switched to the standby LSP in the UP state to establish a new primary LSP, and the path between the new primary LSP and the backup LSP is not completely overlapped. The primary and backup LSPs are protected. When the primary LSP is in the Up state, the new LSP is re-established. The new backup LSP is not completely overlapped with the primary LSP. The primary LSP forms a new primary and backup LSP protection.
  • the RSVP when the primary LSP is established by the loose routing constraint, the RSVP has the condition of loose routing constraints, and requests the primary LSP to the CSPF. If successful, the primary LSP is established; if it fails, the RSVP does not carry. The constraint is used to request the primary LSP route from the CSPF until the primary LSP is successfully established.
  • the RSVP performs a routing request to the CSPF with the condition of excluding the primary constraint, that is, when calculating the route, the route of the primary LSP is completely excluded, if not completely If it is excluded, the backup LSP route that satisfies the condition is calculated by excluding some of the primary LSP routes.
  • the standby route is established by using loose routing constraints.
  • RSVP makes a routing request to CSPF
  • it has two conditions: loose routing constraint and exclusion of primary constraint. If the request is successful, a standby LSP is established; if the request fails, the request is excluded from the condition of the primary constraint.
  • the backup LSP is successfully established; the condition for excluding the primary constraint is that the route of the primary LSP is completely excluded when the route is calculated. If the route is not completely excluded, the backup LSP that satisfies the condition is calculated by excluding some of the primary LSP routes. routing.
  • the path configuration of the primary LSP and the backup LSP is first performed, and then the primary LSP and the backup LSP are respectively created, and the backup LSP starts at the primary LSP. Create it at any time after creation.
  • the re-establishment timer of the primary LSP is started, and a new primary LSP is established to determine whether the route requested by the backup LSP returns RSVP. If the RSVP performs the primary LSP routing request to the CSPF, Two conditions with loose routing constraints and exclusion of spare constraints; if not, only conditions with loose routing constraints; the exclusion of secondary constraints is that when calculating routes, the routes of the standby LSP are completely excluded, if not completely excluded, The primary LSP that meets the condition is calculated by excluding a part of the backup LSP route. After the primary LSP is successfully routed, the primary LSP is established.
  • the RSVP fails to perform the primary LSP routing request to the CSPF, it is determined whether the number of failures is greater than three times. If not, the primary LSP is established according to the procedure of claim 7; if yes, the primary LSP is still started. The reestablishment timer determines whether the route requested by the standby LSP returns RSVP. If yes, the RSVP requests the primary LSP route to the CSPF if the condition for excluding the backup constraint is excluded. If not, the RSVP requests the primary LSP route to the CSPF without the constraint. And after the primary LSP routing request succeeds, Establish the primary LSP.
  • the standby LSP is configured to determine whether the route requested by the primary LSP returns RSVP. If the RSVP makes a backup LSP routing request to the CSPF, the routing protocol has a loose routing constraint. And excluding the two conditions of the primary constraint, if not, only the condition of the loose routing constraint; the exclusion of the primary constraint is to completely exclude the route of the primary LSP when calculating the route, and if not completely excluded, Some primary LSP routes are used to calculate the alternate LSP routes that meet the conditions.
  • the backup LSP is not reconfigured, if the backup LSP is not configured with a loose routing constraint, it is determined whether the route requested by the primary LSP returns RSVP. If the RSVP makes a backup LSP routing request to the CSPF, only the exclusion is performed. The condition of the primary constraint; if not, there is no constraint; the exclusion of the primary constraint is that the route of the primary LSP is completely excluded when the route is calculated, and if not completely excluded, the partial primary LSP is excluded. Route to calculate the alternate LSP route that satisfies the condition.
  • the backup LSP routing request is successful, a new standby LSP is established, and if the request fails, it is determined whether the number of failed requests is greater than three times. If yes, the backup LSP re-establishment timer is started, and according to the claims The step of 11 is performed; if not, the re-establishment timer of the standby LSP is started, and after waiting for the timeout, a new standby LSP is established, and it is determined whether the backup LSP is configured with a loose routing constraint.
  • the route returned by the CSPF is compared with the route of the current primary LSP to determine whether there is a change.
  • the backup LSP is re-optimized; if so, the primary LSP is re-optimized and reconstructed.
  • the primary LSP is re-optimized and reconstructed.
  • the session state and the BFD state of the standby LSP are Up
  • the original primary LSP is deleted, and when the RSVP requests the route from the CSPF, the routing rule is loose.
  • the condition is to establish an optimized primary LSP.
  • the backup LSP re-optimization when the backup LSP re-optimization is started, after the RSVP requests the route to the CSPF, the route returned by the CSPF is compared with the route of the current backup LSP to determine whether there is a change, and if not, the process ends; if not, The backup LSP re-optimization is performed.
  • the session state and the BFD state of the active LSP are Up, the original backup LSP is deleted.
  • the RSVP requests the route from the CSPF, the condition for excluding the primary constraint is established, and the optimized backup LSP is established.
  • the backup LSP does not completely overlap with the primary LSP.
  • the primary constraint is excluded.
  • the route is calculated, the route of the primary LSP is completely excluded. If the route is not completely excluded, the primary LSP route is excluded to calculate the condition. Alternate LSP route.
  • the beneficial effects of the present invention are: the active/standby relationship of the protection group is not changed, and when the link of the primary LSP or the backup LSP is faulty, the primary LSP or the backup LSP is re-established successfully, and the original backup LSP or the primary is successfully established.
  • a new active/standby LSP protection is formed by using LSPs. After the active/standby LSP is switched, the active/standby LSP protection can be formed again. This prevents the generation of the LSP.
  • FIG. 1 is a flowchart of establishing a primary LSP by using loose routing constraints in the present invention
  • FIG. 2 is a flowchart of establishing a backup LSP in an automatically established manner according to the present invention
  • FIG. 3 is a flowchart of establishing a backup LSP by using a loose routing constraint according to the present invention
  • FIG. 4 is a flowchart of a fault that the primary LSP is faulty and reconstructed to form a new primary and backup LSP protection
  • FIG. 5 is a flowchart of a backup LSP failure and reconstruction to form a new primary and backup LSP protection
  • FIG. 6 is a flowchart of a specific implementation of the active and standby LSP protection re-optimization according to the present invention.
  • the invention is based on an efficient LSP protection method for an RSVP-TE dynamic tunnel, including:
  • the primary LSP is set up by the loose routing constraint.
  • the primary LSP is set up by using the established or the detached LSP.
  • the active and standby LSPs are set up.
  • the loose routing constraint means that when the RSVP performs a routing request to the constrained shortest path first (CSPF), the next hop can be loosely bound by the routing, and the two nodes are not required to be directly connected, and There are other nodes. After a loose routing constraint is configured, you can ensure that a new primary or secondary LSP can be quickly reestablished after the primary LSP or the standby LSP is faulty. On the basis of the loose routing constraint method, the node constraint is also included.
  • the node constraint can not only perform path constraint according to the link, but also perform path constraint according to the node.
  • the node constraint can ensure that when a link passing through the node fails, the route calculation can still calculate the optimal path including the node through another link of the node.
  • the service is switched to the standby LSP in the UP state to establish a new primary LSP, and the path between the new primary LSP and the secondary LSP is guaranteed. Incompletely overlapping, forming a new primary and backup LSP protection with the backup LSP;
  • the backup LSP After the backup LSP is faulty, the primary LSP is re-established, and the new backup LSP is not completely overlapped with the active LSP. A new active/standby LSP protection is formed.
  • the step of establishing a primary LSP by using loose routing constraints includes:
  • RSVP has the condition of loose routing constraint and requests the primary LSP route from CSPF.
  • RSVP has a loose routing constraint condition to make a routing request to CSPF, it needs to perform routing request according to the included conditions as much as possible.
  • A2. Determine whether the primary LSP route is successful, if yes, enter A5; if not, enter A3.
  • RSVP does not have a constraint and requests the primary LSP route from CSPF.
  • A4. Determine whether the primary LSP route is successful (if the RSVP receives the routing information returned by the CSPF, the request is successful), if not, go to A3; if yes, enter A5.
  • the primary LSP is set up in the automatic LSP to ensure that the active and standby LSPs can be protected.
  • the specific steps include:
  • RSVP makes a backup LSP routing request to CSPF, it has the condition of excluding the primary constraint. Exclude the primary LSP, that is, the route of the primary LSP is completely excluded when the route is calculated. If the route is not completely excluded, the route of the backup LSP that satisfies the condition is calculated by excluding some of the primary LSP routes. Not completely heavy Hehe.
  • B2. Determine whether the request of the standby LSP is successful (if the RSVP receives the routing information returned by the CSPF, the request is successful), if yes, enter B3; if not, go to B1.
  • the backup LSP is also established by using the loose routing constraint.
  • the specific steps include:
  • RSVP makes a backup LSP routing request to CSPF, it has two conditions: loose routing constraints and exclusion of primary constraints.
  • RSVP carries out the condition of excluding the primary constraint and makes a standby LSP routing request to CSPF.
  • the primary and secondary LSPs are set up. After the configuration is complete, the primary and secondary LSPs are set up. After the active and standby LSPs are established, the active and standby LSPs are formed. In general, the path configuration of the standby LSP loose routing constraint is slightly later than the path configuration of the primary LSP loose routing constraint. Therefore, the backup LSP is created later than the primary LSP.
  • the primary LSP is faulty and reestablished to form a new primary and backup LSP protection.
  • the specific steps are as follows:
  • RSVP only has the condition of loose routing constraint, and performs the primary LSP routing request to CSPF and enters D6.
  • RSVP makes a primary LSP routing request to CSPF, it has two conditions: loose routing constraints and exclusion of standby constraints. Exclude the backup constraint, that is, completely exclude the route of the standby LSP when calculating the route. If the route cannot be completely excluded, the route of the primary LSP that satisfies the condition is calculated by excluding some of the backup LSP routes; the exclusion of the backup constraint can exclude the backup as much as possible.
  • the LSP is routed so that the newly established primary LSP can be established successfully.
  • the primary LSP does not completely overlap with the backup LSP. The same number of links is as small as possible.
  • D7 Determine whether the number of failed route requests is greater than 3 times. If not, go to D2; if yes, enter D8.
  • the re-establishment timer of the primary LSP is still started, waiting for the re-establishment timer to expire.
  • the standby LSP is faulty and reestablished to form a new active and standby LSP protection.
  • the specific steps include:
  • the backup LSP link is faulty. If the status of the primary LSP is Up, the faulty backup LSP is deleted.
  • RSVP makes a backup LSP routing request to CSPF, it enters E10 with two conditions: loose routing constraint and exclusion of primary constraint.
  • E8.RSVP only has the condition of excluding the primary constraint, and makes a backup LSP routing request to CSPF and enters E10.
  • E9.RSVP does not carry any constraints, and makes a backup LSP routing request to CSPF and enters E10.
  • the re-optimization function mainly includes the manual mode and the automatic mode.
  • the manual mode is to re-optimize the LSPs of all the trunks that are ingress by the node through the command line.
  • the automatic mode is to pre-configure a re-optimized timer. When the timer expires and the re-optimization is satisfied, the LSPs in all the trunks that are ingress are automatically re-optimized. There are two conditions for re-optimization. One is the path with the fewest hops, and the other is the path with the lowest cost when the hop count is the same.
  • the re-optimization strategy is: when the session state of the primary LSP and the backup LSP and the BFD (Bidirectional Forwarding Detection) state are both UP, the re-optimization starts.
  • the active LSP is re-optimized only when the session state and the BFD state of the standby LSP are Up.
  • the standby LSP is optimized only when the session state and the BFD state of the active LSP are Up.
  • the two LSPs that form the active/standby protection cannot be optimized at the same time. They can only be optimized in sequence, otherwise the service will be interrupted. After the optimization of the primary LSP is completed, the standby re-optimization is started.
  • the implementation process of re-optimization is mainly divided into two parts, one is re-optimized query, and the other is re-optimized reconstruction, in these two processes,
  • the request is routed to the CSPF (involving the ISIS or OSPF protocol).
  • the re-optimization reconstruction will be performed.
  • the specific methods include:
  • F3. Determine whether the RSVP requests the re-optimized primary LSP route from the CSPF. If the query is successful (if the RSVP receives the routing information returned from the CSPF, the query is successful), if yes, enter F4; if not, the re-optimization ends.
  • F5. Indicates that the primary LSP has a better route. In this case, the primary LSP needs to be optimized, and the primary LSP is re-optimized and re-established into F6.
  • F6 It is determined whether the session state and the BFD state of the standby LSP are all UP, and if yes, enter F7; if not, the re-optimization ends.
  • the RSVP requests a better route from the CSPF, so as to establish a new primary LSP, and judges whether the request for the primary LSP is successful, and if so, enters F9; if not, the re-optimization ends.
  • RSVP requests routing from CSPF, it has the condition of loose routing constraints.
  • the current primary LSP route is optimal, no need to re-optimize or the primary LSP re-optimization is completed, and the standby LSP re-optimization is started.
  • F12 Determine whether the RSVP requests the re-optimized backup LSP route from the CSPF, whether the query is successful (if the RSVP receives the routing information returned from the CSPF, the query is successful), if yes, enters F13; if not, the re-optimization ends.
  • F15 Determine whether the session state and the BFD state of the primary LSP are all UP, and if yes, enter F16; if not, the re-optimization ends.
  • the RSVP requests a better route from the CSPF, so as to establish a new standby LSP, and judges whether the request for the backup LSP is successful, and if so, enters F18; if not, the re-optimization ends.
  • RSVP requests routing from CSPF, it has the condition of excluding the primary constraint.
  • the backup LSP is re-optimized.
  • the backup LSP is re-optimized, if the backup LSP is configured with a loose route constraint, the backup LSP is configured with the loose route constraint and the exclusion of the primary constraint. The route is requested to the CSPF. If the backup LSP is not configured with the loose route constraint, The route is requested to the CSPF only with the condition that the primary constraint is excluded, so as to ensure that the primary LSP and the backup LSP do not completely coincide.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

基于RSVP-TE动态隧道的高效LSP保护方法，涉及数据和IP传输设备领域，包括：采用松散路由约束建立主用LSP，自动建立或松散路由约束建立备用LSP，形成主备LSP保护；当主用LSP链路故障后，业务倒换到备用LSP，建立一条新的主用LSP，并保证新的主用LSP与备用LSP的路径不完全重合，形成新的主备LSP保护；当备用LSP链路故障后，重建一条新的备用LSP，并保证新的备用LSP与主用LSP的路径不完全重合，与主用LSP形成新的主备LSP保护。本发明在链路中主备LSP均出现故障的时候，仍能够进行主备倒换，避免造成业务中断，提高主备LSP保护的效率。

Description

基于RSVP-TE动态隧道的高效LSP保护方法 技术领域
本发明涉及数据和IP传输设备领域，具体来讲涉及一种基于RSVP-TE动态隧道的高效LSP保护方法。
背景技术
在RSVP-TE(Resource Reservation Protocol-Traffic Engineering基于流量工程扩展的资源预留协议)中，RSVP(Resource Reservation Protocol，资源预留协议)作为一种信令协议，用于在MPLS TE(Multi-Protocol Label Switching Traffic Engineering基于多协议标签交换的流量工程技术)中动态建立LSP(Label Switching Path标签交换路径)。通常情况下，通过RSVP协议建立和删除的LSP，均为CR-LSP(Constrained Route-Label Switched Path基于路由约束的标签交换路径)。
为了实现对重要LSP的保护，在配置LSP的时候，会给该LSP配置一条备用LSP，形成主备LSP保护。正常情况下，业务走主用LSP；当主用LSP故障后，业务会倒换到备用LSP，同时主用LSP会定时重试建立。当主用LSP故障恢复后，再将业务倒换回主用LSP。当备用LSP故障后，如果主备用都已故障，此时可能会产生业务中断，并生成逃生路径LSP，同时备用LSP会定时重试建立。
当主用LSP采用的是严格路由约束，备用LSP采用的是严格路由约束或自动建立的方式时，在主用LSP故障消失之前，主用LSP是无法重试建立成功的；而在这种情况下，当备用LSP也出现故障 的时候，主备LSP是无法进行主备倒换的，造成业务中断并生成逃生路径，影响主备LSP保护的效率。
发明内容
针对现有技术中存在的缺陷，本发明的目的在于提供基于RSVP-TE动态隧道的高效LSP保护方法，在链路中主用LSP或者备用出现故障的时候，能够快速生成新的主用LSP或备用主用LSP，随时进行主备倒换，避免造成业务中断，提高主备LSP保护的效率。
为达到以上目的，本发明采取基于RSVP-TE动态隧道的高效LSP保护方法，包括：采用松散路由约束建立主用LSP，采用自动建立或松散路由约束建立备用LSP，形成主备LSP保护；当主用LSP链路故障后，业务倒换到状态为UP的备用LSP，建立一条新的主用LSP，并保证新的主用LSP与所述备用LSP的路径不完全重合，与所述备用LSP形成新的主备LSP保护；当备用LSP链路故障后，在主用LSP状态为UP的情况下，重建一条新的备用LSP，并保证新的备用LSP与所述主用LSP的路径不完全重合，与所述主用LSP形成新的主备LSP保护。
在上述技术方案的基础上，采用松散路由约束建立主用LSP时，RSVP带有松散路由约束的条件，向CSPF请求主用LSP路由，若成功，则建立主用LSP；若失败，RSVP不带有约束条件向CSPF请求主用LSP路由，直至成功建立主用LSP。
在上述技术方案的基础上，采用自动建立备用LSP过程中，RSVP向CSPF进行路由请求时带有排除主用约束的条件，即，在计算路由时，完全排除主用LSP的路由，如果不能完全排除，则通过排除部分主用LSP路由，来计算满足条件的备用LSP路由。
在上述技术方案的基础上，采用松散路由约束建立备用LSP过 程中，RSVP向CSPF进行路由请求时，带有松散路由约束和排除主用约束两个条件，若请求成功，则建立备用LSP；若请求失败，则带有排除主用约束的条件进行请求，直至成功建立备用LSP；所述排除主用约束的条件为，在计算路由时，完全排除主用LSP的路由，如果不能完全排除，则通过排除部分主用LSP路由，来计算满足条件的备用LSP路由。
在上述技术方案的基础上，所述主备LSP均采用松散路由约束建立时，先进行主用LSP以及备用LSP的路径配置，然后分别创建主用LSP和备用LSP，备用LSP在主用LSP开始创建后随时创建。
在上述技术方案的基础上，当主用LSP链路故障后，业务倒换到状态为UP的备用LSP，删除故障主用LSP，启动主用LSP的重建定时器，等待重建定时器超时后，开始建立一条新的主用LSP。
在上述技术方案的基础上，启动主用LSP的重建定时器，建立一条新的主用LSP过程中，判断备用LSP请求的路由是否返回RSVP，若是，RSVP向CSPF进行主用LSP路由请求时，带有松散路由约束和排除备用约束两个条件；若否，仅带有松散路由约束的条件；所述排除备用约束为，在计算路由时，完全排除备用LSP的路由，如果不能完全排除，则通过排除部分备用LSP路由，来计算满足条件的主用LSP路由；在所述主用LSP路由请求成功后，建立主用LSP。
在上述技术方案的基础上，当RSVP向CSPF进行主用LSP路由请求失败时，判断失败次数是否大于3次，若否，按照权利要求7的步骤建立主用LSP；若是，仍旧启动主用LSP的重建定时器，判断备用LSP请求的路由是否返回RSVP，若是，RSVP带有排除备用约束的条件，向CSPF请求主用LSP路由，若否，RSVP不带有约束条件向CSPF请求主用LSP路由；且在主用LSP路由请求成功后，建 立主用LSP。
在上述技术方案的基础上，当备用LSP链路故障后，在主用LSP状态为UP的情况下，删除故障备用LSP，启动备用LSP的重建定时器，等待重建定时器超时后，开始建立一条新的备用LSP。
在上述技术方案的基础上，备用LSP在重建时，若备用LSP配置松散路由约束，判断主用LSP请求的路由是否返回RSVP，若是，RSVP向CSPF进行备用LSP路由请求时，带有松散路由约束和排除主用约束两个条件，若否，仅带有松散路由约束的条件；所述排除主用约束为，在计算路由时，完全排除主用LSP的路由，如果不能完全排除，则通过排除部分主用LSP路由，来计算满足条件的备用LSP路由。
在上述技术方案的基础上，备用LSP在重建时，若备用LSP没有配置松散路由约束，判断主用LSP请求的路由是否返回RSVP，若是，RSVP向CSPF进行备用LSP路由请求时，仅带有排除主用约束的条件；若否，则不带有任何约束条件；所述排除主用约束为，在计算路由时，完全排除主用LSP的路由，如果不能完全排除，则通过排除部分主用LSP路由，来计算满足条件的备用LSP路由。
在上述技术方案的基础上，若备用LSP路由请求成功，建立新的备用LSP，若请求失败，则判断请求失败的次数是否大于3次，若是，启动备用LSP的重建定时器，并按照权利要求11的步骤进行；若否，启动备用LSP的重建定时器，等待超时后，建立一条新的备用LSP，重新判断备用LSP是否配置松散路由约束。
在上述技术方案的基础上，当主用LSP或备用LSP的链路故障恢复后，通过手动或自动进行重优化，将主备LSP保护中不是最优的一条或两条LSP的路由，重优化到未出现故障时的预期路径。
在上述技术方案的基础上，启动主用LSP的重优化时，在RSVP向CSPF请求路由成功后，将CSPF返回的路由与当前主用LSP的路由进行比较，判断是否有变化，若否，启动备用LSP重优化；若是，主用LSP重优化重建。
在上述技术方案的基础上，进行主用LSP重优化重建，在备用LSP的会话状态和BFD状态为UP情况下，将原来的主用LSP删除，RSVP向CSPF请求路由时，带有松散路由约束的条件，建立优化后的主用LSP。
在上述技术方案的基础上，启动备用LSP重优化时，在RSVP向CSPF请求路由成功后，将CSPF返回的路由与当前备用LSP的路由进行比较，判断是否有变化，若否，结束；若是，进行备用LSP重优化重建，在主用LSP的会话状态和BFD状态为UP情况下，删除原来的备用LSP，RSVP向CSPF请求路由时，带有排除主用约束的条件，建立优化后的备用LSP，备用LSP与主用LSP不完全重合；且排除主用约束为，在计算路由时，完全排除主用LSP的路由，如果不能完全排除，则通过排除部分主用LSP路由，来计算满足条件的备用LSP路由。
本发明的有益效果在于：没有改变保护组的主备关系，在主用LSP或者备用LSP的链路出现故障时候，保证主用LSP或者备用LSP定时重新建立成功，并与原来的备用LSP或者主用LSP形成新的主备LSP保护。且在发生一次主备LSP倒换后，能再次形成主备LSP保护，避免逃生路径生成的可能性，避免工程应用中业务中断，提高主备LSP保护的效率。
附图说明
图1为本发明采用松散路由约束建立主用LSP的流程图；
图2为本发明采用自动建立的方式建立备用LSP的流程图；
图3为本发明采用松散路由约束建立备用LSP的流程图；
图4为本发明主用LSP故障并重建，形成新的主备LSP保护的流程图；
图5为本发明备用LSP故障并重建，形成新的主备LSP保护的流程图；
图6为本发明主备LSP保护重优化的具体实现流程图。
具体实施方式
以下结合附图及实施例对本发明作进一步详细说明。
本发明基于RSVP-TE动态隧道的高效LSP保护方法，包括：
采用松散路由约束建立主用LSP，采用自动建立或松散路由约束建立备用LSP，形成主备LSP保护，在建立主备LSP之前，按照所需建立方式，对主备LSP进行配置。所述松散路由约束是指，RSVP向CSPF(Constrained Shortest Path First，基于约束的最短路径优先算法)进行路由请求时，可以松散路由约束下一跳，两个节点之间不要求直接相连，且可以存在其他节点。配置松散路由约束之后，可以保证当主用LSP或者备用的LSP链路故障之后，可以快速的重建一条新的主用LSP或者备用LSP，以便于形成新的主备LSP保护。在松散路由约束方式基础上，还包括节点约束，节点约束是指RSVP向CSPF进行路由请求时，不仅能够按链路进行路径约束，同时还能够按节点进行路径约束。节点约束能保证在经过该节点的某一条链路出现故障时，路由计算时仍然能够通过经过该节点的另一条链路，计算出包含该节点的最优路径。
当主用LSP链路故障后，业务倒换到状态为UP的备用LSP，建立一条新的主用LSP，并保证新的主用LSP与所述备用LSP的路径 不完全重合，与所述备用LSP形成新的主备LSP保护；
当备用LSP链路故障后，在主用LSP状态为UP的情况下，重建一条新的备用LSP，并保证新的备用LSP与所述主用LSP的路径不完全重合，与所述主用LSP形成新的主备LSP保护。
如图1所示，具体的，采用松散路由约束建立主用LSP的步骤包括：
A1.RSVP带有松散路由约束的条件，向CSPF请求主用LSP路由。RSVP带有松散路由约束的条件向CSPF进行路由请求时，需要尽可能的按照包含的条件进行路由请求。
A2.判断主用LSP路由是否请求成功，若是，进入A5；若否，进入A3。
A3.RSVP不带有约束条件，向CSPF请求主用LSP路由。
A4.判断主用LSP路由是否请求成功(如果RSVP收到了CSPF返回的路由信息，则表示请求成功)，若否，转到A3；若是，进入A5。
A5.成功建立主用LSP。
上述步骤中，不论是否带有约束条件，都是采用松散路由约束的方式，并非使用严格约束的配置。
如图2所示，在主用LSP采用松散路由约束的前提下，采用自动建立的方式建立备用LSP，以便于能够与主用LSP形成主备LSP保护，具体步骤包括：
B1.RSVP向CSPF进行备用LSP路由请求时，带有排除主用约束的条件。排除主用约束，即，在计算路由时完全排除主用LSP的路由，如果不能完全排除，则通过排除部分主用LSP路由，来计算满足条件的备用LSP路由，可以保证主用LSP与备用LSP不完全重 合。
B2.判断备用LSP路由是否请求成功(如果RSVP收到了CSPF返回的路由信息，则表示请求成功)，若是，进入B3；若否，转入B1。
B3.成功建立备用LSP。
如图3所示，在主用LSP采用松散路由约束的前提下，同样采用松散路由约束建立备用LSP，具体步骤包括：
C1.RSVP向CSPF进行备用LSP路由请求时，带有松散路由约束和排除主用约束两个条件。
C2.判断备用LSP路由是否请求成功，若是，进入C5；若否，进入C3。
C3.RSVP带有排除主用约束的条件，向CSPF进行备用LSP路由请求。
C4.判断备用LSP路由是否请求成功，若是，进入C5；若否，转入C3。
C5.成功建立备用LSP。
在采用松散路由约束建立主用LSP和备用LSP之前，先要进行约束路径的配置，配置完成后，根据各自的松散路由约束条件，进行满足条件的路由请求，请求成功后分别建立主备LSP，主备LSP均建立成功后，就形成了主备LSP保护。一般情况下，备用LSP松散路由约束的路径配置会稍晚于主用LSP松散路由约束的路径配置，因此备用LSP的创建会稍晚于主用LSP的创建。
如图4所示，为主用LSP故障并重建，形成新的主备LSP保护的流程图，具体步骤为：
D1.当主用LSP链路故障后，在备用LSP状态为UP的情况下， 业务倒换到备用LSP，删除故障主用LSP。
D2.启动主用LSP的重建定时器，等待重建定时器超时。
D3.判断备用LSP请求的路由是否返回RSVP(若返回，则表示备用LSP路由查询成功)，若否，进入D4；若是，进入D5。
D4.说明此时不用考虑备用LSP的路由，RSVP仅带有松散路由约束的条件，向CSPF进行主用LSP路由请求，进入D6。
D5.RSVP向CSPF进行主用LSP路由请求时，带有松散路由约束和排除备用约束两个条件。排除备用约束，即，在计算路由时完全排除备用LSP的路由，如果不能完全排除，则通过排除部分备用LSP路由，来计算满足条件的主用LSP路由；排除备用约束能够尽可能多的排除备用LSP的路由，以便于新建立的主用LSP能够建立成功，主用LSP与备用LSP不完全重合，相同的链路数尽可能地少。
D6.判断主用LSP路由是否请求成功，若是，进入D13；若否，进入D7。
D7.判断路由请求的失败次数，是否大于3次，若否，转入D2；若是，进入D8。
D8.仍旧启动主用LSP的重建定时器，等待重建定时器超时。
D9.判断备用LSP请求的路由是否返回RSVP，若否，进入D10；若是，进入D11。
D10.RSVP不带有约束条件向CSPF请求主用LSP路由，进入D12。
D11.RSVP带有排除备用约束的条件，向CSPF请求主用LSP路由，进入D12。
D12.判断主用LSP路由是否请求成功，若是，进入D13；若否，转入D8。
D13.建立新的主用LSP，并与备用LSP形成新的主备LSP保护。
如图5所示，为备用LSP故障并重建，形成新的主备LSP保护的流程图，具体步骤包括：
E1.备用LSP链路故障，在主用LSP状态为UP的情况下，删除故障备用LSP。
E2.启动备用LSP的重建定时器，等待重建定时器超时。
E3.对备用LSP本身是否配置了松散路由约束的条件进行检查，判断是否配置松散路由约束，若是，进入E4；若否，进入E7。
E4.判断主用LSP请求的路由是否返回RSVP(若返回，则表示主用LSP路由查询成功)，若是，进入E5；若否，进入E6。
E5.RSVP向CSPF进行备用LSP路由请求时，带有松散路由约束和排除主用约束两个条件，进入E10。
E6.RSVP仅带有松散路由约束的条件，向CSPF进行备用LSP路由请求，进入E10。
E7.判断主用LSP请求的路由是否返回RSVP，若是，进入E8；若否，进入E9。
E8.RSVP仅带有排除主用约束的条件，向CSPF进行备用LSP路由请求，进入E10。
E9.RSVP不带有任何约束条件，向CSPF进行备用LSP路由请求，进入E10。
E10.判断备用LSP路由是否请求成功，若是，进入E13；若否，进入E11。
E11.则判断请求失败的次数是否大于3次，若是，进入E12；若否，转入E2。
E12.启动备用LSP的重建定时器，等待重建定时器超时后，转入 E7。
E13.建立新的备用LSP，与主用LSP形成新的主备LSP保护。
当主用LSP或备用LSP的链路故障恢复之后，此时需要将处于主备LSP保护中，不是最优的一条或两条LSP的路由，重优化到未出现故障时的预期路径。重优化功能主要包括手动方式和自动方式，手动方式是指通过命令行，立即对以该节点为Ingress的所有Trunk下的LSP进行重优化；自动方式是指预先配置一个重优化的定时器，当定时器超时且满足重优化的情况下，自动对以该节点为Ingress的所有Trunk下的LSP进行重优化。重优化有两个条件，一是经过的跳数最少的路径，二是在跳数相同的情况下选择cost最小的路径。
重优化的策略为：在主用LSP和备用LSP的会话状态与BFD(Bidirectional Forwarding Detection，双向转发检测)状态均为UP的情况下，重优化开始。并且，只有在备用LSP的会话状态和BFD状态为UP的情况下，才会重优化主用LSP；同样只有在主用LSP的会话状态和BFD状态为UP的情况下，才会优化备用LSP。形成主备保护的两条LSP，不能同时优化，只能顺序优化，否则业务会中断；主用LSP优化完成后，再启动备用重优化。
如图6所示，为主备LSP保护重优化的具体实现，重优化的实现过程主要分为两个部分，一个是重优化的查询，一个是重优化的重建，在这两个过程中，都会向CSPF(涉及到ISIS或OSPF协议)请求路由；当重优化查询路由请求成功后，才会进行重优化重建，具体方法包括：
F1.当主用LSP和备用LSP的会话状态与BFD状态均为UP的时候，重优化开始，此时启动主用LSP的重优化。
F2.进行主用LSP的重优化查询。
F3.判断RSVP向CSPF请求重优化的主用LSP路由，是否查询成功(如果RSVP接收到来自CSPF返回的路由信息，则表示查询成功)，若是，进入F4；若否，重优化结束。
F4.将CSPF返回的路由与当前主用LSP的路由进行比较，判断是否有变化，若是，进入F5；若否，进入F10。
F5.说明主用LSP存在更优的路由，此时需要优化主用LSP，进行主用LSP重优化重建，进入F6。
F6.判断备用LSP的会话状态和BFD状态是否都为UP，若是，进入F7；若否，重优化结束。
F7.将原来的主用LSP删除。
F8.RSVP向CSPF请求更优的路由，以便于建立新的主用LSP，并判断请求主用LSP路由是否成功，若是，进入F9；若否，重优化结束。其中，RSVP向CSPF请求路由时，带有松散路由约束的条件。
F9.建立优化后的主用LSP。
F10.当前主用LSP的路由已是最优，不需要再优化或者是主用LSP重优化已完成，启动备用LSP重优化。
F11.进行备用LSP的重优化查询。
F12.判断RSVP向CSPF请求重优化的备用LSP路由，是否查询成功(如果RSVP接收到来自CSPF返回的路由信息，则表示查询成功)，若是，进入F13；若否，重优化结束。
F13.将CSPF返回的路由与当前备用LSP的路由进行比较，判断是否有变化，若是，进入F14；若否，重优化结束。
F14.进行备用LSP重优化重建。
F15.判断主用LSP的会话状态和BFD状态是否都为UP，若是，进入F16；若否，重优化结束。
F16.删除原来的备用LSP。
F17.RSVP向CSPF请求更优的路由，以便于建立新的备用LSP，并判断请求备用LSP路由是否成功，若是，进入F18；若否，重优化结束。其中，RSVP向CSPF请求路由时，带有排除主用约束的条件。
F18.建立优化后的备用LSP。
在重优化时，请求主用LSP路由的时候，只要带有松散路由约束的条件即可，因为主用LSP重优化完毕之后，会进行备用LSP重优化。备用LSP重优化的时候，请求路由时，若备用LSP配置了松散路由约束，则带有松散路由约束和排除主用约束两个条件，向CSPF请求路由，若备用LSP未配置松散路由约束，则仅带有排除主用约束的条件向CSPF请求路由，以此来保证主用LSP与备用LSP不完全重合。
本发明不局限于上述实施方式，对于本技术领域的普通技术人员来说，在不脱离本发明原理的前提下，还可以做出若干改进和润饰，这些改进和润饰也视为本发明的保护范围之内。本说明书中未作详细描述的内容属于本领域专业技术人员公知的现有技术。

Claims (16)

  1. 基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于，包括：
    采用松散路由约束建立主用LSP，采用自动建立或松散路由约束建立备用LSP，形成主备LSP保护；
    当主用LSP链路故障后，业务倒换到状态为UP的备用LSP，建立一条新的主用LSP，并保证新的主用LSP与所述备用LSP的路径不完全重合，与所述备用LSP形成新的主备LSP保护；
    当备用LSP链路故障后，在主用LSP状态为UP的情况下，重建一条新的备用LSP，并保证新的备用LSP与所述主用LSP的路径不完全重合，与所述主用LSP形成新的主备LSP保护。
  2. 如权利要求1所述的基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于：采用松散路由约束建立主用LSP时，RSVP带有松散路由约束的条件，向CSPF请求主用LSP路由，若成功，则建立主用LSP；若失败，RSVP不带有约束条件向CSPF请求主用LSP路由，直至成功建立主用LSP。
  3. 如权利要求1所述的基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于：采用自动建立备用LSP过程中，RSVP向CSPF进行路由请求时带有排除主用约束的条件，即，在计算路由时，完全排除主用LSP的路由，如果不能完全排除，则通过排除部分主用LSP路由，来计算满足条件的备用LSP路由。
  4. 如权利要求1所述的基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于：采用松散路由约束建立备用LSP过程中，RSVP向CSPF进行路由请求时，带有松散路由约束和排除主用约束两个条件，若请求成功，则建立备用LSP；若请求失败，则带有排除主用约 束的条件进行请求，直至成功建立备用LSP；所述排除主用约束的条件为，在计算路由时，完全排除主用LSP的路由，如果不能完全排除，则通过排除部分主用LSP路由，来计算满足条件的备用LSP路由。
  5. 如权利要求4所述的基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于：所述主备LSP均采用松散路由约束建立时，先进行主用LSP以及备用LSP的路径配置，然后分别创建主用LSP和备用LSP，备用LSP在主用LSP开始创建后随时创建。
  6. 如权利要求1所述的基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于：当主用LSP链路故障后，业务倒换到状态为UP的备用LSP，删除故障主用LSP，启动主用LSP的重建定时器，等待重建定时器超时后，开始建立一条新的主用LSP。
  7. 如权利要求6所述的基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于：启动主用LSP的重建定时器，建立一条新的主用LSP过程中，判断备用LSP请求的路由是否返回RSVP，若是，RSVP向CSPF进行主用LSP路由请求时，带有松散路由约束和排除备用约束两个条件；若否，仅带有松散路由约束的条件；所述排除备用约束为，在计算路由时，完全排除备用LSP的路由，如果不能完全排除，则通过排除部分备用LSP路由，来计算满足条件的主用LSP路由；在所述主用LSP路由请求成功后，建立主用LSP。
  8. 如权利要求7所述的基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于：当RSVP向CSPF进行主用LSP路由请求失败时，判断失败次数是否大于3次，若否，按照权利要求7的步骤建立主用LSP；若是，仍旧启动主用LSP的重建定时器，判断备用LSP请求的路由是否返回RSVP，若是，RSVP带有排除备用约束的条件， 向CSPF请求主用LSP路由，若否，RSVP不带有约束条件向CSPF请求主用LSP路由；且在主用LSP路由请求成功后，建立主用LSP。
  9. 如权利要求1所述的基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于：当备用LSP链路故障后，在主用LSP状态为UP的情况下，删除故障备用LSP，启动备用LSP的重建定时器，等待重建定时器超时后，开始建立一条新的备用LSP。
  10. 如权利要求9所述的基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于：备用LSP在重建时，若备用LSP配置松散路由约束，判断主用LSP请求的路由是否返回RSVP，若是，RSVP向CSPF进行备用LSP路由请求时，带有松散路由约束和排除主用约束两个条件，若否，仅带有松散路由约束的条件；所述排除主用约束为，在计算路由时，完全排除主用LSP的路由，如果不能完全排除，则通过排除部分主用LSP路由，来计算满足条件的备用LSP路由。
  11. 如权利要求9所述的基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于：备用LSP在重建时，若备用LSP没有配置松散路由约束，判断主用LSP请求的路由是否返回RSVP，若是，RSVP向CSPF进行备用LSP路由请求时，仅带有排除主用约束的条件；若否，则不带有任何约束条件；所述排除主用约束为，在计算路由时，完全排除主用LSP的路由，如果不能完全排除，则通过排除部分主用LSP路由，来计算满足条件的备用LSP路由。
  12. 如权利要求11所述的基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于：若备用LSP路由请求成功，建立新的备用LSP，若请求失败，则判断请求失败的次数是否大于3次，若是，启动备用LSP的重建定时器，并按照权利要求11的步骤进行；若否，启动备用LSP的重建定时器，等待超时后，建立一条新的备用LSP， 重新判断备用LSP是否配置松散路由约束。
  13. 如权利要求1所述的基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于：当主用LSP或备用LSP的链路故障恢复后，通过手动或自动进行重优化，将主备LSP保护中不是最优的一条或两条LSP的路由，重优化到未出现故障时的预期路径。
  14. 如权利要求13所述的基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于：启动主用LSP的重优化时，在RSVP向CSPF请求路由成功后，将CSPF返回的路由与当前主用LSP的路由进行比较，判断是否有变化，若否，启动备用LSP重优化；若是，主用LSP重优化重建。
  15. 如权利要求14所述的基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于：进行主用LSP重优化重建，在备用LSP的会话状态和BFD状态为UP情况下，将原来的主用LSP删除，RSVP向CSPF请求路由时，带有松散路由约束的条件，建立优化后的主用LSP。
  16. 如权利要求14或15所述的基于RSVP-TE动态隧道的高效LSP保护方法，其特征在于：启动备用LSP重优化时，在RSVP向CSPF请求路由成功后，将CSPF返回的路由与当前备用LSP的路由进行比较，判断是否有变化，若否，结束；若是，进行备用LSP重优化重建，在主用LSP的会话状态和BFD状态为UP情况下，删除原来的备用LSP，RSVP向CSPF请求路由时，带有排除主用约束的条件，建立优化后的备用LSP，备用LSP与主用LSP不完全重合；且排除主用约束为，在计算路由时，完全排除主用LSP的路由，如果不能完全排除，则通过排除部分主用LSP路由，来计算满足条件的备用LSP路由。
PCT/CN2016/102801 2016-04-14 2016-10-21 基于rsvp-te动态隧道的高效lsp保护方法 Ceased WO2017177647A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
SG11201804251TA SG11201804251TA (en) 2016-04-14 2016-10-21 Efficient lsp protection method based on rsvp-te dynamic tunnel
MYPI2018701881A MY197891A (en) 2016-04-14 2016-10-21 Efficient lsp protection method based on rsvp-te dynamic tunnel
PH12018501086A PH12018501086A1 (en) 2016-04-14 2018-05-21 Efficient lsp protection method based on rsvp-te dynamic tunnel

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610231676.0A CN105763450B (zh) 2016-04-14 2016-04-14 基于rsvp-te动态隧道的高效lsp保护方法
CN201610231676.0 2016-04-14

Publications (1)

Publication Number Publication Date
WO2017177647A1 true WO2017177647A1 (zh) 2017-10-19

Family

ID=56334963

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/102801 Ceased WO2017177647A1 (zh) 2016-04-14 2016-10-21 基于rsvp-te动态隧道的高效lsp保护方法

Country Status (6)

Country Link
CN (1) CN105763450B (zh)
CL (1) CL2018001304A1 (zh)
MY (1) MY197891A (zh)
PH (1) PH12018501086A1 (zh)
SG (1) SG11201804251TA (zh)
WO (1) WO2017177647A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113810278A (zh) * 2020-06-11 2021-12-17 中兴通讯股份有限公司 隧道路径切换方法、路径配置方法、设备、系统和介质
CN114567593A (zh) * 2020-11-26 2022-05-31 南京中兴软件有限责任公司 路径切换方法及其装置、网络设备、计算机可读存储介质

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105763450B (zh) * 2016-04-14 2019-04-02 烽火通信科技股份有限公司 基于rsvp-te动态隧道的高效lsp保护方法
CN109547269B (zh) * 2019-01-04 2021-12-14 烽火通信科技股份有限公司 一种ip ran设备实现lsp保护的方法及装置
CN112073319B (zh) * 2019-06-10 2022-04-29 烽火通信科技股份有限公司 一种路径切换方法及系统
CN112217721A (zh) * 2020-09-29 2021-01-12 北京东土军悦科技有限公司 交换芯片中通信路径确定方法、计算机设备及存储介质
CN115022235B (zh) * 2022-05-07 2023-05-26 烽火通信科技股份有限公司 一种基于cspf的链路保护方法及系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070076755A1 (en) * 2005-09-30 2007-04-05 Fujitsu Limited Method of reserving network bandwidth resources, and communications system and network device using the same
CN101159690A (zh) * 2007-11-19 2008-04-09 杭州华三通信技术有限公司 多协议标签交换转发方法、装置及标签交换路径管理模块
CN101826954A (zh) * 2010-03-30 2010-09-08 中兴通讯股份有限公司 集中式网络节点中实现热备份的方法及系统
CN105763450A (zh) * 2016-04-14 2016-07-13 烽火通信科技股份有限公司 基于rsvp-te动态隧道的高效lsp保护方法

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101562536B (zh) * 2009-05-19 2012-03-07 迈普通信技术股份有限公司 一种局部路径保护的快速重路由方法
CN101908998B (zh) * 2009-06-03 2012-11-21 华为技术有限公司 路径计算方法、路径计算单元及路径计算系统
CN101626527A (zh) * 2009-08-19 2010-01-13 烽火通信科技股份有限公司 一种ason网络实现备用路由优化的返回式共享恢复的方法
CN102571401B (zh) * 2010-12-24 2015-07-08 华为技术有限公司 建立备份路径的方法及设备、选取备份路径的方法及设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070076755A1 (en) * 2005-09-30 2007-04-05 Fujitsu Limited Method of reserving network bandwidth resources, and communications system and network device using the same
CN101159690A (zh) * 2007-11-19 2008-04-09 杭州华三通信技术有限公司 多协议标签交换转发方法、装置及标签交换路径管理模块
CN101826954A (zh) * 2010-03-30 2010-09-08 中兴通讯股份有限公司 集中式网络节点中实现热备份的方法及系统
CN105763450A (zh) * 2016-04-14 2016-07-13 烽火通信科技股份有限公司 基于rsvp-te动态隧道的高效lsp保护方法

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113810278A (zh) * 2020-06-11 2021-12-17 中兴通讯股份有限公司 隧道路径切换方法、路径配置方法、设备、系统和介质
CN114567593A (zh) * 2020-11-26 2022-05-31 南京中兴软件有限责任公司 路径切换方法及其装置、网络设备、计算机可读存储介质

Also Published As

Publication number Publication date
CL2018001304A1 (es) 2018-10-05
PH12018501086A1 (en) 2019-01-28
SG11201804251TA (en) 2018-06-28
MY197891A (en) 2023-07-24
CN105763450B (zh) 2019-04-02
CN105763450A (zh) 2016-07-13

Similar Documents

Publication Publication Date Title
WO2017177647A1 (zh) 基于rsvp-te动态隧道的高效lsp保护方法
CN101715149B (zh) 一种多层多域分布式光网络并行跨域故障恢复方法和装置
US9088485B2 (en) System, method and apparatus for signaling and responding to ERO expansion failure in inter-domain TE LSP
CN101986622B (zh) 一种pce状态属性的自动识别方法及系统
CN101286892B (zh) 进行业务恢复的装置和方法
WO2012088967A1 (zh) 一种网络恢复方法和装置
US20130301403A1 (en) Fast reroute using loop free alternate next hops for multipoint label switched paths
WO2008037198A1 (fr) Procédés de mise en oeuvre de réacheminement rapide multidiffusion et noeud
CN103368843A (zh) 受保护标签交换路径快速重路由的oam标签交换路径
CN101459535A (zh) 进行业务恢复的装置和方法
CN104243015B (zh) 一种光网络用户网络接口故障恢复方法
WO2009092249A1 (zh) 一种实现共享网格保护的方法和网络设备
EP2866394B1 (en) Method and device for sending inter-domain fault information
CN102036129B (zh) 一种基于路径计算单元的路径保护方法及系统
EP2658177B1 (en) Method for detecting tunnel faults and traffic engineering node
EP2997700B1 (en) Method for assured network state configuration and rollback in link-state packet networks
CN101374106A (zh) 一种mpls lsp上转发数据包的方法、网络节点和系统
CN102065006A (zh) 一种跨域标签交换路径域间失效的恢复方法
CN101710899B (zh) 一种mpls网络保护切换方法、lsr和系统
CN101494801A (zh) 故障恢复方法、系统及网络设备
WO2015039554A1 (zh) 一种基于wson网络减少波长连续性限制的方法
Martínez et al. Experimental validation of dynamic restoration in GMPLS-controlled multi-layer networks using PCE-based global concurrent optimization
CN101150491B (zh) 一种多协议标签交换网络中的组播树的优化方法
CN106130895B (zh) Sdn网络故障的重路由方法及装置
CN104184661B (zh) 控制业务回切的方法及装置

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 12018501086

Country of ref document: PH

WWE Wipo information: entry into national phase

Ref document number: 11201804251T

Country of ref document: SG

WWE Wipo information: entry into national phase

Ref document number: DZP2018000359

Country of ref document: DZ

NENP Non-entry into the national phase

Ref country code: DE

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

Ref document number: 16898460

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 16898460

Country of ref document: EP

Kind code of ref document: A1