CN105763450B - Efficient LSP guard method based on RSVP-TE dynamic tunnel - Google Patents
Efficient LSP guard method based on RSVP-TE dynamic tunnel Download PDFInfo
- Publication number
- CN105763450B CN105763450B CN201610231676.0A CN201610231676A CN105763450B CN 105763450 B CN105763450 B CN 105763450B CN 201610231676 A CN201610231676 A CN 201610231676A CN 105763450 B CN105763450 B CN 105763450B
- Authority
- CN
- China
- Prior art keywords
- lsp
- primary
- spare
- routing
- rsvp
- 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.)
- Active
Links
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
Abstract
Efficient LSP guard method based on RSVP-TE dynamic tunnel, is related to data and IP transmission device field, comprising: establishes primary LSP using loose route restriction, automatic foundation or loose route restriction establish spare LSP, form active and standby LSP protection；After primary LSP link failure, business is switched to spare LSP, establishes a new primary LSP, and guarantees that new primary LSP is not exclusively overlapped with the path of spare LSP, forms new active and standby LSP protection；After spare LSP link failure, a new spare LSP is rebuild, and guarantees that new spare LSP is not exclusively overlapped with the path of primary LSP, new active and standby LSP is formed with primary LSP and protects.The present invention still is able to carry out masterslave switchover, avoids service disconnection when active and standby LSP breaks down in a link, and the efficiency of active and standby LSP protection is improved.
Description
Technical field
It is in particular to a kind of based on RSVP-TE dynamic tunnel the present invention relates to data and IP transmission device field
Efficient LSP guard method.
Background technique
In RSVP-TE, (Resource Reservation Protocol-Traffic Engineering is based on flow work
The Resource Reservation Protocol of journey extension) in, RSVP (Resource Reservation Protocol, Resource Reservation Protocol) conduct
A kind of signaling protocol, in MPLS TE (Multi-Protocol Label Switching Traffic Engineering
Technology of Traffic Engineering based on multiprotocol label switching) in dynamic establish LSP (Label Switching Path tag changeable path
Diameter).Under normal conditions, the LSP for establishing and deleting by RSVP protocol, is CR-LSP (Constrained Route-Label
Label switched path of the Switched Path based on route restriction).
In order to realize the protection to important LSP, when configuring LSP, a spare LSP can be configured to the LSP, be formed
Active and standby LSP protection.Under normal circumstances, business walks primary LSP；After primary lsp failure, business can be switched to spare LSP, simultaneously
Primary LSP can periodically retry foundation.Primary LSP is switched back to after primary lsp failure restores, then by business.When spare lsp failure
Afterwards, if standby usage is all failed, service disconnection may be generated at this time, and generates best-effort path LSP, while spare LSP meeting
Timing retries foundation.
It is established using stringent route restriction, spare LSP using stringent route restriction or automatically as primary LSP
When mode, before the disappearance of primary lsp failure, primary LSP can not be retried and is successfully established；And in this case, when standby
When also failure with LSP, active and standby LSP can not carry out masterslave switchover, cause service disconnection and generate best-effort path,
Influence the efficiency of active and standby LSP protection.
Summary of the invention
In view of the deficiencies in the prior art, the purpose of the present invention is to provide the height based on RSVP-TE dynamic tunnel
Imitate LSP guard method, in a link primary LSP or when spare failure, can quickly generate new primary LSP or
Spare primary LSP, carries out masterslave switchover at any time, avoids service disconnection, improves the efficiency of active and standby LSP protection.
To achieve the above objectives, the present invention is taken based on the efficient LSP guard method of RSVP-TE dynamic tunnel, comprising: adopts
Primary LSP is established with loose route restriction, spare LSP is established using automatic foundation or loose route restriction, active and standby LSP is formed and protects
Shield；After primary LSP link failure, business is switched to state to create successfully spare LSP, establishes a new primary LSP,
And guarantee that new primary LSP is not exclusively overlapped with the path of the spare LSP, new active and standby LSP, which is formed, with the spare LSP protects
Shield；After spare LSP link failure, in the case where primary LSP state is to create successful situation, a new spare LSP is rebuild, and
Guarantee that new spare LSP is not exclusively overlapped with the path of the primary LSP, forms new active and standby LSP with the primary LSP and protect
Shield.
Based on the above technical solution, when establishing primary LSP using loose route restriction, RSVP is with loose routing
The condition of constraint requests primary LSP routing to CSPF, if success, establishes primary LSP；If failure, RSVP is without constraint item
Part requests primary LSP routing to CSPF, until being successfully established primary LSP.
Based on the above technical solution, during using spare LSP is established automatically, RSVP, which carries out routing to CSPF, to be asked
With the condition for excluding primary constraint when asking, that is, when calculating routing, the routing of primary LSP is excluded completely, if cannot be complete
It excludes, then by the primary LSP routing of exclusive segment, to calculate the spare LSP routing of the condition of satisfaction.
Based on the above technical solution, during establishing spare LSP using loose route restriction, RSVP to CSPF into
When row route requests, with loose route restriction and two conditions of primary constraint are excluded, if requesting successfully, to establish spare LSP；
If request failure, makes requests with the condition for excluding primary constraint, until being successfully established spare LSP；The exclusion is primary
The condition of constraint is, when calculating routing, to exclude the routing of primary LSP completely, if cannot exclude completely, passes through exclusion portion
Divide primary LSP routing, to calculate the spare LSP routing of the condition of satisfaction.
Based on the above technical solution, it when the active and standby LSP is all made of loose route restriction and establishes, first carries out primary
The configuration of the path of LSP and spare LSP, is then respectively created primary LSP and spare LSP, spare LSP starts to create in primary LSP
It is created at any time after building.
Based on the above technical solution, after primary LSP link failure, it is successful for creation that business is switched to state
Spare LSP, deletes the primary LSP of failure, and the reconstruction timer for starting primary LSP is begun setting up after waiting timer expiry to be reconstructed
One new primary LSP.
Based on the above technical solution, the reconstruction timer for starting primary LSP establishes a new primary LSP mistake
Cheng Zhong, judges whether the routing of spare LSP request returns to RSVP, if so, when RSVP carries out primary LSP route requests to CSPF,
With loose route restriction and exclude two conditions of Reserve Constraint；If it is not, only having the condition of loose route restriction；The exclusion
Reserve Constraint is, when calculating routing, to exclude the routing of spare LSP completely, if cannot exclude completely, pass through exclusive segment
Spare LSP routing, to calculate the primary LSP routing of the condition of satisfaction；After the primary LSP route requests success, establish primary
LSP。
Based on the above technical solution, when RSVP, which carries out primary LSP route requests to CSPF, to fail, judge to fail
Whether number is greater than 3 times,
If it is not, starting the reconstruction timer of primary LSP, primary LSP is built, is specifically included: judging the routing of spare LSP request
Whether RSVP is returned to, if so, with loose route restriction and excluding spare when RSVP carries out primary LSP route requests to CSPF
Constrain two conditions；If it is not, only having the condition of loose route restriction；
If so, still starting the reconstruction timer of primary LSP, judge whether the routing of spare LSP request returns to RSVP, if
Be that RSVP requests primary LSP routing with the condition for excluding Reserve Constraint, to CSPF, if it is not, RSVP without Prescribed Properties to
CSPF requests primary LSP routing；And after the success of primary LSP route requests, primary LSP is established.
It based on the above technical solution, is that creation is successful in primary LSP state after spare LSP link failure
In the case of, the spare LSP of failure is deleted, the reconstruction timer for starting spare LSP is begun setting up after waiting timer expiry to be reconstructed
One new spare LSP.
Based on the above technical solution, spare LSP is when rebuilding, if spare LSP configures loose route restriction, judgement
Whether the routing of primary LSP request returns to RSVP, if so, having loose road when RSVP carries out spare LSP route requests to CSPF
By constraining and excluding two conditions of primary constraint, if it is not, only having the condition of loose route restriction；It is described to exclude primary constraint
When calculating routing, to exclude the routing of primary LSP completely, if cannot exclude completely, passing through the primary LSP of exclusive segment
Routing, to calculate the spare LSP routing of the condition of satisfaction.
Based on the above technical solution, spare LSP is when rebuilding, if spare LSP does not configure loose route restriction,
Judge whether the routing of primary LSP request returns to RSVP, if so, only having when RSVP carries out spare LSP route requests to CSPF
Exclude the condition of primary constraint；If it is not, then without any constraint condition；The exclusion is primary to be constrained to, when calculating routing,
The routing of primary LSP is excluded completely, if cannot exclude completely, by the primary LSP routing of exclusive segment, meets item to calculate
The spare LSP of part is routed.
Based on the above technical solution, if the success of spare LSP route requests, establishes new spare LSP, if request is lost
It loses, then judges whether the number of request failure is greater than 3 times,
If so, starting the reconstruction timer of spare LSP, spare LSP is built, is specifically included: if spare LSP is not configured loosely
Route restriction, judges whether the routing of primary LSP request returns to RSVP, if so, RSVP carries out spare LSP route requests to CSPF
When, only with the condition for excluding primary constraint；If it is not, then without any constraint condition；
If it is not, starting the reconstruction timer of spare LSP, after waiting time-out, a new spare LSP is established, is rejudged
Whether spare LSP configures loose route restriction.
Based on the above technical solution, after the link failure recovery of primary LSP or spare LSP, by manually or
It is automatic to carry out re-optimization, it will not be the routing of one or two optimal LSP in active and standby LSP protection, re-optimization is former to not occurring
Expectation path when barrier.
Based on the above technical solution, it when starting the re-optimization of primary LSP, is routed successfully in RSVP to CSPF request
Afterwards, the routing that CSPF is returned is compared with the routing of current primary LSP, judges whether to change, if it is not, starting is spare
LSP re-optimization；If so, primary LSP re-optimization is rebuild.
Based on the above technical solution, it carries out primary LSP re-optimization to rebuild, in the session status and BFD of spare LSP
State is to delete original primary LSP under creation successful instance, when RSVP requests to route to CSPF, about with loose routing
The condition of beam, the primary LSP after establishing optimization.
Based on the above technical solution, it when starting spare LSP re-optimization, is routed successfully in RSVP to CSPF request
Afterwards, the routing that CSPF is returned is compared with the routing of current spare LSP, judges whether to change, if it is not, terminating；If so,
It carries out spare LSP re-optimization to rebuild, in the case where the session status and BFD state of primary LSP are to create successful instance, delete original
When spare LSP, RSVP request to route to CSPF, with the condition for excluding primary constraint, the spare LSP after optimizing is established, it is spare
LSP is not exclusively overlapped with primary LSP；And exclude it is primary be constrained to, calculate routing when, exclude the routing of primary LSP completely, such as
Fruit cannot exclude completely, then by the primary LSP routing of exclusive segment, to calculate the spare LSP routing of the condition of satisfaction.
The beneficial effects of the present invention are: do not change the main and standby relation of protection group, primary LSP's or spare LSP
When link breaks down, guarantee primary LSP perhaps spare LSP timing re-establish success and with original spare LSP or
Primary LSP forms new active and standby LSP protection.And after primary active and standby LSP occurs and switches, active and standby LSP protection can be formed again, is kept away
Exempt from a possibility that best-effort path generates, avoid service disconnection in engineer application, improves the efficiency of active and standby LSP protection.
Detailed description of the invention
Fig. 1 is the flow chart that the present invention establishes primary LSP using loose route restriction；
Fig. 2 is the flow chart that the present invention establishes spare LSP by the way of establishing automatically；
Fig. 3 is the flow chart that the present invention establishes spare LSP using loose route restriction；
Fig. 4 is the primary lsp failure of the present invention and rebuilds, and forms the flow chart of new active and standby LSP protection；
Fig. 5 is the spare lsp failure of the present invention and rebuilds, and forms the flow chart of new active and standby LSP protection；
Fig. 6 is the specific implementation flow chart that the active and standby LSP of the present invention protects re-optimization.
Specific embodiment
Invention is further described in detail with reference to the accompanying drawings and embodiments.
The present invention is based on the efficient LSP guard methods of RSVP-TE dynamic tunnel, comprising:
Primary LSP is established using loose route restriction, spare LSP, shape are established using automatic foundation or loose route restriction
It is protected at active and standby LSP, before establishing active and standby LSP, establishes mode according to required, active and standby LSP is configured.The loose road
Referred to by constraint, RSVP is to CSPF (Constrained Shortest Path First, the shortest path first based on constraint
Algorithm) when carrying out route requests, can loose route restriction next-hop, do not require to be connected directly between two nodes, and can be with
There are other nodes.After configuring loose route restriction, it is ensured that after primary LSP or spare LSP link failure,
New a primary LSP or spare LSP can be rebuild, quickly in order to form new active and standby LSP protection.Loosely routing
It further include joint constraint on the basis of the way of restraint, it, can not only be by when joint constraint refers to that RSVP carries out route requests to CSPF
Link carries out path constraint, while can also carry out path constraint by node.Joint constraint can guarantee in certain for passing through the node
When one link breaks down, when router-level topology, still is able to through another link by the node, is calculated comprising should
The optimal path of node.
After primary LSP link failure, it is the spare LSP for creating successfully (UP) that business, which is switched to state, establishes one newly
Primary LSP, and guarantee that new primary LSP is not exclusively overlapped with the path of the spare LSP, formed newly with the spare LSP
Active and standby LSP protection；
After spare LSP link failure, in the case where primary LSP state is UP, a new spare LSP is rebuild, and
Guarantee that new spare LSP is not exclusively overlapped with the path of the primary LSP, forms new active and standby LSP with the primary LSP and protect
Shield.
As shown in Figure 1, specifically, the step of establishing primary LSP using loose route restriction includes:
A1.RSVP has the condition of loose route restriction, requests primary LSP routing to CSPF.RSVP is with loose routing
The condition of constraint to CSPF carry out route requests when, need as far as possible according to comprising condition carry out route requests.
A2. judge whether primary LSP routing requests success, if so, into A5；If it is not, into A3.
A3.RSVP requests primary LSP routing without Prescribed Properties, to CSPF.
A4. judge whether primary LSP routing requests successfully (if RSVP has received the routing iinformation of CSPF return, table
Show and request successfully), if it is not, going to A3；If so, into A5.
A5. it is successfully established primary LSP.
In above-mentioned steps, whether band Prescribed Properties, are all by the way of loose route restriction, not using tight
The configuration of lattice constraint.
As shown in Fig. 2, being established by the way of establishing automatically standby under the premise of primary LSP uses loose route restriction
With LSP, in order to be able to form active and standby LSP with primary LSP and protect, specific steps include:
When B1.RSVP carries out spare LSP route requests to CSPF, with the condition for excluding primary constraint.Exclude it is primary about
Beam, that is, the routing of primary LSP is excluded completely when calculating routing, it is primary by exclusive segment if cannot exclude completely
LSP routing, to calculate the spare LSP routing of the condition of satisfaction, it is ensured that primary LSP is not exclusively overlapped with spare LSP.
B2. judge whether spare LSP routing requests successfully (if RSVP has received the routing iinformation of CSPF return, table
Show and request successfully), if so, into B3；If it is not, being transferred to B1.
B3. it is successfully established spare LSP.
As shown in figure 3, equally being established using loose route restriction under the premise of primary LSP uses loose route restriction
Spare LSP, specific steps include:
When C1.RSVP carries out spare LSP route requests to CSPF, with loose route restriction and primary constraint two is excluded
Condition.
C2. judge whether spare LSP routing requests success, if so, into C5；If it is not, into C3.
C3.RSVP carries out spare LSP route requests with the condition for excluding primary constraint, to CSPF.
C4. judge whether spare LSP routing requests success, if so, into C5；If it is not, being transferred to C3.
C5. it is successfully established spare LSP.
Before establishing primary LSP and spare LSP using loose route restriction, the configuration of constrained path is first carried out, is matched
After the completion of setting, according to respective loose route restriction condition, the route requests for meeting condition is carried out, are established respectively after requesting successfully
Active and standby LSP after active and standby LSP is successfully established, is formed active and standby LSP protection.Under normal circumstances, spare LSP is loosely routed about
The path configuration of beam can be configured later than the path of the loose route restriction of primary LSP, therefore the creation of spare LSP can be later than master
With the creation of LSP.
As shown in figure 4, for primary lsp failure and rebuilding, the flow chart of new active and standby LSP protection, specific steps are formed are as follows:
D1. after primary LSP link failure, in the case where spare LSP state is UP, business is switched to spare LSP, deletes
Except the primary LSP of failure.
D2. the reconstruction timer for starting primary LSP, waits timer expiry to be reconstructed.
D3. judge the routing of spare LSP request whether return RSVP (if returning, then it represents that spare LSP routing inquiry at
Function), if it is not, into D4；If so, into D5.
D4. illustrate the routing for not having to consider spare LSP at this time, RSVP only has the condition of loose route restriction, to CSPF
Primary LSP route requests are carried out, into D6.
When D5.RSVP carries out primary LSP route requests to CSPF, with loose route restriction and exclusion Reserve Constraint two
Condition.Exclude Reserve Constraint, that is, lead to if cannot exclude completely calculating the routing for excluding spare LSP when routing completely
The spare LSP routing of exclusive segment is crossed, to calculate the primary LSP routing of the condition of satisfaction；Excluding Reserve Constraint can be as much as possible
The routing of spare LSP is excluded, in order to which newly-established primary LSP can be successfully established, primary LSP and the endless full weight of spare LSP
It closes, identical number of links is few as much as possible.
D6. judge whether primary LSP routing requests success, if so, into D13；If it is not, into D7.
D7. judge the frequency of failure of route requests, if be greater than 3 times, if it is not, being transferred to D2；If so, into D8.
D8. the reconstruction timer for still starting primary LSP, waits timer expiry to be reconstructed.
D9. judge whether the routing of spare LSP request returns to RSVP, if it is not, into D10；If so, into D11.
D10.RSVP requests primary LSP to route without Prescribed Properties to CSPF, into D12.
D11.RSVP requests primary LSP routing with the condition for excluding Reserve Constraint, to CSPF, into D12.
D12. judge whether primary LSP routing requests success, if so, into D13；If it is not, being transferred to D8.
D13. new primary LSP is established, and forms new active and standby LSP with spare LSP and protects.
As shown in figure 5, for spare lsp failure and rebuilding, the flow chart of new active and standby LSP protection, specific steps packet are formed
It includes:
E1. spare LSP link failure deletes the spare LSP of failure in the case where primary LSP state is UP.
E2. the reconstruction timer for starting spare LSP, waits timer expiry to be reconstructed.
E3. spare LSP condition for whether being configured with loose route restriction itself is checked, judges whether that configuration is loose
Route restriction, if so, into E4；If it is not, into E7.
E4. judge the routing of primary LSP request whether return RSVP (if returning, then it represents that primary LSP routing inquiry at
Function), if so, into E5；If it is not, into E6.
When E5.RSVP carries out spare LSP route requests to CSPF, with loose route restriction and primary constraint two is excluded
Condition, into E10.
E6.RSVP only has the condition of loose route restriction, spare LSP route requests is carried out to CSPF, into E10.
E7. judge whether the routing of primary LSP request returns to RSVP, if so, into E8；If it is not, into E9.
E8.RSVP only has the condition for excluding primary constraint, spare LSP route requests is carried out to CSPF, into E10.
E9.RSVP carries out spare LSP route requests without any constraint condition, to CSPF, into E10.
E10. judge whether spare LSP routing requests success, if so, into E13；If it is not, into E11.
E11. then judge whether the number of request failure is greater than 3 times, if so, into E12；If it is not, being transferred to E2.
E12. the reconstruction timer for starting spare LSP is transferred to E7 after waiting timer expiry to be reconstructed.
E13. new spare LSP is established, new active and standby LSP is formed with primary LSP and protects.
After the link failure recovery of primary LSP or spare LSP, needs to be in active and standby LSP protection at this time, not be
The routing of optimal one or two LSP, re-optimization to it is without failure when expectation path.Re-optimization function mainly includes hand
Flowing mode and automated manner, manual mode refer to through order line, immediately to the node under all Trunk of Ingress
LSP carry out re-optimization；Automated manner refers to the timer for being pre-configured with a re-optimization, when the timer times out and meets heavy excellent
In the case where change, re-optimization is carried out for the LSP under all Trunk of Ingress to the node automatically.There are two items for re-optimization
Part, first is that the least path of hop count passed through, second is that selecting the smallest path cost in the identical situation of hop count.
The strategy of re-optimization are as follows: in the session status of primary LSP and spare LSP and BFD (Bidirectional
Forwarding Detection, two-way converting detection) in the case that state is UP, re-optimization starts.Also, only standby
It, just can the primary LSP of re-optimization in the case where being UP with the session status of LSP and BFD state；Equally only in the meeting of primary LSP
In the case that speech phase and BFD state are UP, it can just optimize spare LSP.Two LSP of main-apparatus protection are formed, it cannot be excellent simultaneously
Change, can only sequential optimization, otherwise business can interrupt；After the completion of primary LSP optimization, restart spare re-optimization.
As shown in fig. 6, protecting the specific implementation of re-optimization for active and standby LSP, the realization process of re-optimization is broadly divided into two
Part, one be re-optimization inquiry, one is that the reconstruction of re-optimization (can all be related to during the two to CSPF
ISIS or ospf protocol) request routing；After re-optimization query routing is requested successfully, re-optimization reconstruction, specific side just will do it
Method includes:
F1. when the session status of primary LSP and spare LSP and BFD state are UP, re-optimization starts, at this time
Start the re-optimization of primary LSP.
F2. the re-optimization inquiry of primary LSP is carried out.
F3. judge primary LSP routing of the RSVP to CSPF request re-optimization, if successful inquiring is (if RSVP is received
The routing iinformation returned from CSPF, then it represents that successful inquiring), if so, into F4；If it is not, re-optimization terminates.
F4. the routing that CSPF is returned is compared with the routing of current primary LSP, judges whether to change, if so, into
Enter F5；If it is not, into F10.
F5. illustrate that primary LSP exists more preferably to route, need to optimize primary LSP at this time, carry out primary LSP re-optimization weight
It builds, into F6.
Whether the session status and BFD state for F6. judging spare LSP are all for UP, if so, into F7；If it is not, re-optimization knot
Beam.
F7. original primary LSP is deleted.
F8.RSVP is more preferably routed to CSPF request, in order to establish new primary LSP, and judges to request the primary road LSP
By whether succeeding, if so, into F9；If it is not, re-optimization terminates.Wherein, when RSVP requests to route to CSPF, with loose routing
The condition of constraint.
F9. the primary LSP after optimization is established.
F10. the routing of current primary LSP has been optimal, does not need re-optimization either primary LSP re-optimization and is completed,
Start spare LSP re-optimization.
F11. the re-optimization inquiry of spare LSP is carried out.
F12. judge spare LSP routing of the RSVP to CSPF request re-optimization, if successful inquiring is (if RSVP is received
The routing iinformation returned from CSPF, then it represents that successful inquiring), if so, into F13；If it is not, re-optimization terminates.
F13. the routing that CSPF is returned is compared with the routing of current spare LSP, judges whether to change, if so,
Into F14；If it is not, re-optimization terminates.
F14. spare LSP re-optimization is carried out to rebuild.
Whether the session status and BFD state for F15. judging primary LSP are all for UP, if so, into F16；If it is not, re-optimization
Terminate.
F16. original spare LSP is deleted.
F17.RSVP is more preferably routed to CSPF request, in order to establish new spare LSP, and judges to request spare LSP
Whether routing succeeds, if so, into F18；If it is not, re-optimization terminates.Wherein, when RSVP requests to route to CSPF, with exclusion
The condition of primary constraint.
F18. the spare LSP after optimization is established.
In re-optimization, when requesting primary LSP to route, as long as having the condition of loose route restriction, because
After primary LSP re-optimization finishes, spare LSP re-optimization will do it.When spare LSP re-optimization, when request routes, if standby
It is configured with loose route restriction with LSP, then with loose route restriction and exclusion two conditions of primary constraint, requests road to CSPF
By only requesting to route to CSPF with the condition for excluding primary constraint, with this if loose route restriction is not configured in spare LSP
To guarantee that primary LSP is not exclusively overlapped with spare LSP.
The present invention is not limited to the above-described embodiments, for those skilled in the art, is not departing from
Under the premise of the principle of the invention, several improvements and modifications can also be made, these improvements and modifications are also considered as protection of the invention
Within the scope of.The content being not described in detail in this specification belongs to the prior art well known to professional and technical personnel in the field.
Claims (14)
1. the efficient LSP guard method based on RSVP-TE dynamic tunnel characterized by comprising
Primary label switched path (LSP) is established using loose route restriction, is established using automatic foundation or loose route restriction
Spare LSP forms active and standby LSP protection；
After primary LSP link failure, business is switched to state to create successfully spare LSP, establish one it is new primary
LSP, and guarantee that new primary LSP is not exclusively overlapped with the path of the spare LSP is formed new active and standby with the spare LSP
LSP protection；
After spare LSP link failure, in the case where primary LSP state is to create successful situation, a new spare LSP is rebuild,
And guarantee that new spare LSP is not exclusively overlapped with the path of the primary LSP, new active and standby LSP, which is formed, with the primary LSP protects
Shield；
After the link failure recovery of primary LSP or spare LSP, re-optimization is manually or automatically carried out, active and standby LSP is protected
In be not one or two optimal LSP routing, re-optimization to it is without failure when expectation path；
When establishing primary LSP using loose route restriction, Resource Reservation Protocol (RSVP) has the condition of loose route restriction, to
Shortest-path first algorithm (CSPF) based on constraint requests primary LSP routing, if success, establishes primary LSP；If failure,
RSVP requests primary LSP to route without Prescribed Properties to CSPF, until being successfully established primary LSP.
2. the efficient LSP guard method based on RSVP-TE dynamic tunnel as described in claim 1, it is characterised in that: using certainly
It is dynamic to establish during spare LSP, with the condition for excluding primary constraint when RSVP carries out route requests to CSPF, that is, calculating
When routing, the routing of primary LSP is excluded completely, if cannot exclude completely, by the primary LSP routing of exclusive segment, to count
Calculate the spare LSP routing for the condition that meets.
3. the efficient LSP guard method based on RSVP-TE dynamic tunnel as described in claim 1, it is characterised in that: using pine
Scattered route restriction is established during spare LSP, when RSVP carries out route requests to CSPF, with loose route restriction and excludes master
With two conditions are constrained, if requesting successfully, to establish spare LSP；If request failure, with exclude the condition of primary constraint into
Row request, until being successfully established spare LSP；The condition for excluding primary constraint is, when calculating routing, to exclude completely primary
The routing of LSP, if cannot exclude completely, by the primary LSP routing of exclusive segment, to calculate the spare LSP of the condition of satisfaction
Routing.
4. the efficient LSP guard method based on RSVP-TE dynamic tunnel as claimed in claim 3, it is characterised in that: the master
When standby LSP is all made of loose route restriction and establishes, the path configuration of primary LSP and spare LSP is first carried out, is then respectively created
Primary LSP and spare LSP, spare LSP are created at any time after primary LSP starts creation.
5. the efficient LSP guard method based on RSVP-TE dynamic tunnel as described in claim 1, it is characterised in that: when primary
After LSP link failure, business is switched to state to create successfully spare LSP, deletes the primary LSP of failure, starts primary LSP's
Timer is rebuild, after waiting timer expiry to be reconstructed, begins setting up a new primary LSP.
6. the efficient LSP guard method based on RSVP-TE dynamic tunnel as claimed in claim 5, it is characterised in that: starting master
It with the reconstruction timer of LSP, establishes during a new primary LSP, judges whether the routing of spare LSP request returns
RSVP, if so, when RSVP carries out primary LSP route requests to CSPF, with loose route restriction and exclusion Reserve Constraint two
Condition；If it is not, only having the condition of loose route restriction；The exclusion Reserve Constraint is, when calculating routing, to exclude completely standby
It is routed by the spare LSP of exclusive segment, if cannot exclude completely to calculate the primary of the condition of satisfaction with the routing of LSP
LSP routing；After the primary LSP route requests success, primary LSP is established.
7. the efficient LSP guard method based on RSVP-TE dynamic tunnel as claimed in claim 6, it is characterised in that: work as RSVP
When carrying out the failure of primary LSP route requests to CSPF, judge whether the frequency of failure is greater than 3 times,
If it is not, starting the reconstruction timer of primary LSP, build primary LSP, specifically include: judge spare LSP request routing whether
RSVP is returned to, if so, with loose route restriction and excluding Reserve Constraint when RSVP carries out primary LSP route requests to CSPF
Two conditions；If it is not, only having the condition of loose route restriction；
If so, still starting the reconstruction timer of primary LSP, judge whether the routing of spare LSP request returns to RSVP, if so,
RSVP requests primary LSP routing with the condition for excluding Reserve Constraint, to CSPF, if it is not, RSVP without Prescribed Properties to
CSPF requests primary LSP routing；And after the success of primary LSP route requests, primary LSP is established.
8. the efficient LSP guard method based on RSVP-TE dynamic tunnel as described in claim 1, it is characterised in that: when spare
After LSP link failure, in the case where primary LSP state is to create successful situation, the spare LSP of failure is deleted, the weight of spare LSP is started
Timer is built, after waiting timer expiry to be reconstructed, begins setting up a new spare LSP.
9. the efficient LSP guard method based on RSVP-TE dynamic tunnel as claimed in claim 8, it is characterised in that: spare
LSP is when rebuilding, if spare LSP configures loose route restriction, judges whether the routing of primary LSP request returns to RSVP, if so,
When RSVP carries out spare LSP route requests to CSPF, with loose route restriction and two conditions of primary constraint are excluded, if it is not,
Only have the condition of loose route restriction；The exclusion is primary to be constrained to, and when calculating routing, excludes the road of primary LSP completely
By if cannot exclude completely, by the primary LSP routing of exclusive segment, to calculate the spare LSP routing of the condition of satisfaction.
10. the efficient LSP guard method based on RSVP-TE dynamic tunnel as claimed in claim 8, it is characterised in that: spare
LSP is when rebuilding, if spare LSP does not configure loose route restriction, judges whether the routing of primary LSP request returns to RSVP,
If so, when RSVP carries out spare LSP route requests to CSPF, only with the condition for excluding primary constraint；If it is not, then without appoint
What constraint condition；The exclusion is primary to be constrained to, and when calculating routing, the routing of primary LSP is excluded completely, if cannot be complete
It excludes, then by the primary LSP routing of exclusive segment, to calculate the spare LSP routing of the condition of satisfaction.
11. the efficient LSP guard method based on RSVP-TE dynamic tunnel as claimed in claim 10, it is characterised in that: if standby
With the success of LSP route requests, new spare LSP is established, if request failure, judges whether the number of request failure is greater than 3 times,
If so, starting the reconstruction timer of spare LSP, spare LSP is built, is specifically included: if spare LSP does not configure loose routing
Constraint, judges whether the routing of primary LSP request returns to RSVP, if so, when RSVP carries out spare LSP route requests to CSPF,
Only with the condition for excluding primary constraint；If it is not, then without any constraint condition；
If it is not, starting the reconstruction timer of spare LSP, after waiting time-out, a new spare LSP is established, is rejudged spare
Whether LSP configures loose route restriction.
12. the efficient LSP guard method based on RSVP-TE dynamic tunnel as described in claim 1, it is characterised in that: starting
When the re-optimization of primary LSP, after RSVP is routed successfully to CSPF request, the routing that CSPF is returned is with current primary LSP's
Routing is compared, and judges whether to change, if it is not, starting spare LSP re-optimization；If so, primary LSP re-optimization is rebuild.
13. the efficient LSP guard method based on RSVP-TE dynamic tunnel as claimed in claim 12, it is characterised in that: carry out
Primary LSP re-optimization is rebuild, in the case where session status and two-way converting detection (BFD) state of spare LSP is to create successful instance,
Original primary LSP is deleted, when RSVP requests to route to CSPF, the condition with loose route restriction, after establishing optimization
Primary LSP.
14. the efficient LSP guard method as described in claim 12 or 13 based on RSVP-TE dynamic tunnel, it is characterised in that:
When starting spare LSP re-optimization, after RSVP is routed successfully to CSPF request, by the CSPF routing returned and current spare LSP
Routing be compared, judge whether to change, if it is not, terminate；It is rebuild if so, carrying out spare LSP re-optimization, in primary LSP
Session status and BFD state be to delete original spare LSP under creation successful instance, when RSVP requests to route to CSPF, band
There is the condition for excluding primary constraint, the spare LSP after establishing optimization, spare LSP are not exclusively overlapped with primary LSP；And exclude master
With being constrained to, when calculating routing, the routing of primary LSP is excluded completely, if cannot exclude completely, passes through exclusive segment master
It is routed with LSP, to calculate the spare LSP routing of the condition of satisfaction.
Priority Applications (6)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610231676.0A CN105763450B (en) | 2016-04-14 | 2016-04-14 | Efficient LSP guard method based on RSVP-TE dynamic tunnel |
| PCT/CN2016/102801 WO2017177647A1 (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 |
| SG11201804251TA SG11201804251TA (en) | 2016-04-14 | 2016-10-21 | Efficient lsp protection method based on rsvp-te dynamic tunnel |
| CL2018001304A CL2018001304A1 (en) | 2016-04-14 | 2018-05-14 | Method of efficient protection of the lsp based on the dynamic tunnel rsvp-te |
| PH12018501086A PH12018501086A1 (en) | 2016-04-14 | 2018-05-21 | Efficient lsp protection method based on rsvp-te dynamic tunnel |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610231676.0A CN105763450B (en) | 2016-04-14 | 2016-04-14 | Efficient LSP guard method based on RSVP-TE dynamic tunnel |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105763450A CN105763450A (en) | 2016-07-13 |
| CN105763450B true CN105763450B (en) | 2019-04-02 |
Family
ID=56334963
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610231676.0A Active CN105763450B (en) | 2016-04-14 | 2016-04-14 | Efficient LSP guard method based on RSVP-TE dynamic tunnel |
Country Status (6)
| Country | Link |
|---|---|
| CN (1) | CN105763450B (en) |
| CL (1) | CL2018001304A1 (en) |
| MY (1) | MY197891A (en) |
| PH (1) | PH12018501086A1 (en) |
| SG (1) | SG11201804251TA (en) |
| WO (1) | WO2017177647A1 (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105763450B (en) * | 2016-04-14 | 2019-04-02 | 烽火通信科技股份有限公司 | Efficient LSP guard method based on RSVP-TE dynamic tunnel |
| CN109547269B (en) * | 2019-01-04 | 2021-12-14 | 烽火通信科技股份有限公司 | Method and device for realizing LSP protection of IP RAN equipment |
| CN112073319B (en) * | 2019-06-10 | 2022-04-29 | 烽火通信科技股份有限公司 | Path switching method and system |
| CN112217721A (en) * | 2020-09-29 | 2021-01-12 | 北京东土军悦科技有限公司 | Communication path determining method in switching chip, computer device and storage medium |
| CN115022235B (en) * | 2022-05-07 | 2023-05-26 | 烽火通信科技股份有限公司 | CSPF-based link protection method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101562536A (en) * | 2009-05-19 | 2009-10-21 | 迈普通信技术股份有限公司 | Rapid rerouting method for protecting local path |
| CN101626527A (en) * | 2009-08-19 | 2010-01-13 | 烽火通信科技股份有限公司 | Recoverable shared restoration method for optimizing spare routing by automatic switched optical network (ASON) |
| CN101908998A (en) * | 2009-06-03 | 2010-12-08 | 华为技术有限公司 | Path calculation method, path calculation unit and path calculation system |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4704171B2 (en) * | 2005-09-30 | 2011-06-15 | 富士通株式会社 | COMMUNICATION SYSTEM, TRANSMISSION DEVICE, AND RESERVED BAND SETTING METHOD |
| CN101159690B (en) * | 2007-11-19 | 2010-10-27 | 杭州华三通信技术有限公司 | Multi-protocol label switch forwarding method, device and label switching path management module |
| CN101826954B (en) * | 2010-03-30 | 2014-12-10 | 中兴通讯股份有限公司 | Method and system for realizing hot backup in centralized network nodes |
| CN102571401B (en) * | 2010-12-24 | 2015-07-08 | 华为技术有限公司 | Method and device for building backup path and method and device for selecting backup path |
| CN105763450B (en) * | 2016-04-14 | 2019-04-02 | 烽火通信科技股份有限公司 | Efficient LSP guard method based on RSVP-TE dynamic tunnel |
-
2016
- 2016-04-14 CN CN201610231676.0A patent/CN105763450B/en active Active
- 2016-10-21 WO PCT/CN2016/102801 patent/WO2017177647A1/en active Application Filing
- 2016-10-21 MY MYPI2018701881A patent/MY197891A/en unknown
- 2016-10-21 SG SG11201804251TA patent/SG11201804251TA/en unknown
-
2018
- 2018-05-14 CL CL2018001304A patent/CL2018001304A1/en unknown
- 2018-05-21 PH PH12018501086A patent/PH12018501086A1/en unknown
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101562536A (en) * | 2009-05-19 | 2009-10-21 | 迈普通信技术股份有限公司 | Rapid rerouting method for protecting local path |
| CN101908998A (en) * | 2009-06-03 | 2010-12-08 | 华为技术有限公司 | Path calculation method, path calculation unit and path calculation system |
| CN101626527A (en) * | 2009-08-19 | 2010-01-13 | 烽火通信科技股份有限公司 | Recoverable shared restoration method for optimizing spare routing by automatic switched optical network (ASON) |
Also Published As
| Publication number | Publication date |
|---|---|
| SG11201804251TA (en) | 2018-06-28 |
| MY197891A (en) | 2023-07-24 |
| CL2018001304A1 (en) | 2018-10-05 |
| PH12018501086A1 (en) | 2019-01-28 |
| CN105763450A (en) | 2016-07-13 |
| WO2017177647A1 (en) | 2017-10-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105763450B (en) | Efficient LSP guard method based on RSVP-TE dynamic tunnel | |
| CN101715149B (en) | Method and device for restoring parallel cross-domain fault of multilayer and multi-domain distributed optical network | |
| CN102907051B (en) | Label switching path establishing method, data forwarding method and equipment | |
| CN103209088B (en) | Ring network label switch path creation method and associated devices and communication system | |
| KR101430544B1 (en) | Method for inheriting attribute of forwarding adjacency in multilayer network and corresponding multilayer network | |
| CN101640637B (en) | Resource reservation protocol tunnel management method based on flow rate engineering and system thereof | |
| CN104243015B (en) | A kind of optical-fiber network User Network Interface fault recovery method | |
| US20050188100A1 (en) | Method for local protection of label-switching paths with resource sharing | |
| CN103647711B (en) | A kind of satellite network heavy route method based on priority mechanism | |
| WO2012088967A1 (en) | Method and device for restoring network | |
| JP4968117B2 (en) | Route calculation apparatus and route calculation system | |
| CN101431466B (en) | Fast rerouting method and label exchange router | |
| US20050259570A1 (en) | Fault recovery method and program therefor | |
| CN104718732A (en) | Method for exchanging information for establishing a path between two nodes of a communication network | |
| CN102150383A (en) | Utilizing optical bypass links in a communication network | |
| Velasco et al. | GMPLS-based multidomain restoration: Analysis, strategies, policies and experimental assessment | |
| CN105791108A (en) | Tunnel bandwidth reservation method and device based on binding interface | |
| Hasan et al. | Development of FRR mechanism by adopting SDN notion | |
| CN106027394A (en) | RSVP make-before-break label reuse | |
| EP2920927A1 (en) | Fast reroute in multi-protocol label switching traffic engineering network | |
| Giorgetti et al. | Path protection with hierarchical PCE in GMPLS-based multi-domain WSONs | |
| WO2016101492A1 (en) | Setting method and device for service forwarding table | |
| WO2012037757A1 (en) | Method and device for recovering service in automatic switch optical network | |
| WO2012129907A1 (en) | Method and device for implementing multi-protection overlapped protection groups | |
| CN106330701A (en) | Fast rerouting method and device for ring network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |