CN115022235A - CSPF (common service platform function) -based link protection method and system - Google Patents
CSPF (common service platform function) -based link protection method and system Download PDFInfo
- Publication number
- CN115022235A CN115022235A CN202210532547.0A CN202210532547A CN115022235A CN 115022235 A CN115022235 A CN 115022235A CN 202210532547 A CN202210532547 A CN 202210532547A CN 115022235 A CN115022235 A CN 115022235A
- Authority
- CN
- China
- Prior art keywords
- link
- path
- exclusion
- main
- standby
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a link protection method and a system based on CSPF, relating to the technical field of routing, wherein the method comprises the following steps: recording IP addresses of all nodes and links between the nodes on the main link and the standby link to generate a best effort exclusion linked list; calculating all candidate excluding links by using an SPF algorithm, respectively contrasting a main path and a standby path for each candidate excluding link, finding out the same link between two adjacent nodes of the nodes in a best effort excluding linked list, and calculating a corresponding excluding key value; calculating exclusion key values of each candidate exclusion link in a superposition manner to generate a TE escape path constraint condition; and generating and issuing a TE escape path according to the escape path constraint condition. The link protection method and system based on CSPF provided by the invention can avoid the generated link passing through the main/standby path as best as possible, and can avoid the link protection failure caused by the main/standby link failure as much as possible.
Description
Technical Field
The invention relates to the technical field of routing, in particular to a link protection method and system based on CSPF.
Background
When an IGP protocol (such as IS-IS protocol, OSPF protocol, etc.) selects a transmission path for Traffic Engineering (TE), there IS a need to generate an escape path after both active and standby paths fail.
As in the existing network topology shown in fig. 1, the source is R1 and the destination is R9. IGP protocol is deployed in the whole network, TE function is enabled, and RSVP protocol is enabled on all interfaces. When the TE traffic engineering works normally, the TE traffic engineering selects a main path to be R1-R3-R6-R8-R9; the backup path is R1-R2-R5-R7-R9, when the links between R1-R2 and between R3-R6 are all in fault, the system needs to wait for IGP to carry out reconvergence, and after a new route is calculated, CSPF calculation is carried out again, and the traffic engineering can be normally forwarded. In the process, the flow is lost in the time of route convergence and CSPF calculation, which causes the second-level flow loss.
In order to solve the problems in the above scenario, an escape path that avoids the main/standby links as much as possible is generated each time the main/standby paths are generated, and when the main/standby links fail, a path with the least influence can be protected. The selection of the active/standby path can be performed by constraint calculation in the current technology by using strict constraint, loose constraint and the like. The escape route should be generated to avoid the failed path on the main/standby link for the purpose of use. Due to the complex topology in the network, the complexity of setting by constraining the fixed path is too large, and a dynamic calculation mode is needed. Meanwhile, in order to make the formed escape path as stable as possible, the constraint condition of the relevant dynamic calculation should be to exclude the original main and standby links as possible.
In the prior art, there is no method that can be used for eliminating the original main and standby links as much as possible and calculating and acquiring the best-effort link in a dynamic calculation mode.
Disclosure of Invention
Aiming at the defects in the prior art, the invention aims to provide a link protection method and system based on CSPF, which can avoid the generated links passing through the main/standby path as much as possible and avoid the link protection failure caused by the failure of the main/standby link as much as possible.
In order to achieve the above purposes, the technical scheme adopted by the invention is as follows:
in a first aspect, the present invention provides a CSPF-based link protection method, which includes the steps of:
s1, recording IP addresses of each node and the link between the nodes on the main link and the standby link to generate a best effort exclusion linked list; s2, calculating all candidate excluding links by using an SPF algorithm, respectively contrasting the main path and the standby path for each candidate excluding link, finding out the same link between two adjacent nodes of the nodes in the best effort excluding linked list, and calculating a corresponding excluding key value; s3, calculating exclusion key values of each candidate exclusion link in an overlapping mode, and generating TE escape path constraint conditions; and S4, generating a TE escape path according to the escape path constraint condition and issuing the TE escape path.
In a preferred embodiment, before the step S1, the method further includes:
configuring constraint conditions of the main link and the standby link by using a best effort dynamic constraint algorithm; and calculating and issuing the paths of the main TE link and the standby TE link according to the constraint conditions of the main TE link and the standby TE link.
Further, the process of configuring the constraint condition of the active/standby link by using the best effort dynamic constraint algorithm includes:
collecting and recording IP addresses of each node and links among the nodes on the main link and the standby link in a linked list mode; and configuring constraint conditions of the main link and the standby link by using an SPF path algorithm with constraint.
In another preferred embodiment, the calculating, by superposition, each candidate excluded link exclusion key value to generate a TE escape path constraint condition specifically includes:
for each candidate exclusion link, overlapping exclusion key values of nodes of the main path and the standby path and links between two adjacent nodes to obtain all exclusion key values of the candidate exclusion link, wherein the exclusion key values of the nodes not on the main path and the standby path and the links between two adjacent nodes are 0; superposing all exclusion key values of the candidate exclusion link to obtain a final result; and forming a linked list by all candidate excluded path links and corresponding results to serve as TE escape path constraint conditions.
Further, the step of generating the TE escape path according to the escape path constraint condition includes: and comparing the final results of all candidate excluded links, and screening the link with the minimum final result as a best-effort path.
In another preferred embodiment, after the TE escape path is generated, the method further comprises:
and (4) after the main and standby paths are changed every time, adding a new escape path constraint condition, repeating the steps S1-S4, and calculating a new TE escape path.
In a second aspect, the present invention also provides a CSPF-based link protection system, which includes:
the RSVP module is used for performing chain table form combination on the main and standby paths, sending the combined paths to the CSPF module as a best effort exclusion constraint condition, and receiving the main and standby TE link paths and the TE escape path issued by the CSPF module; the CSPF module is used for calculating the exclusion path and the superposition weight of the exclusion path after receiving the exclusion condition linked list which is the best effort, generating an escape path constraint condition according to the main TE link path and the standby TE link path and the TE escape path which are sent by the IGP module and sending the main TE link path and the TE escape path to the RSVP module; and the IGP module is used for generating a TE escape path in a best effort mode according to the escape path constraint condition, calculating a main TE link path according to the constraint condition of the main link and the standby TE link path and sending the main TE link path and the TE escape path to the CSPF module.
In a preferred embodiment, the CSPF module is further configured to:
after the primary TE link path and the secondary TE link path are calculated, the links of the primary path and the secondary path are gathered to form a best effort exclusion linked list; and matching the links in the best effort exclusion linked list, and overlapping exclusion key values of all the links in the matched exclusion linked list to generate a TE escape path constraint condition.
In another preferred embodiment, the CSPF module is further configured to:
after the primary and secondary TE link paths are calculated, the link sets of the primary and secondary candidate paths form a best effort exclusion linked list; calculating to obtain a candidate exclusion path, matching the candidate exclusion path with links in the best effort exclusion linked list, and calculating exclusion key values of each node in each candidate path link in the matched exclusion linked list and links between two adjacent nodes; and overlapping the elimination key values of all the candidate path links to generate a TE escape path constraint condition.
In another preferred embodiment, the IGP module is further configured to: and comparing the elimination key values of all the candidate elimination path links, and screening the link with the minimum elimination key value in all the candidate elimination path links as a best-effort path.
Compared with the prior art, the invention has the advantages that:
(1) the CSPF-based link protection method can calculate and manage the escape path through the specified constraint conditions to form a path which does not pass through the generated links on the main and standby paths as far as possible, and compared with a common constraint path protection mode, the CSPF-based link protection method can avoid the generated links passing through the main and standby paths as far as possible, can avoid link protection failure caused by the faults of the main and standby links as far as possible, and improves the stability of the protection links.
(2) The link protection method based on CSPF of the invention avoids the links on the main and standby paths to the maximum extent through the best effort link protection, is a dynamic path generation method, does not depend on any fixed configuration compared with the mode of configuring the fixed constraint path in the prior art, is simpler and more convenient than the common constraint mode, and is especially suitable for dealing with complex networks.
(3) The CSPF-based link protection system controls the path constraint condition by configuring the RSVP module, the constraint of the main path and the standby path is calculated according to the configuration requirement, and the best-effort dynamic constraint forms a best-effort exclusion linked list by using the link set of the main path and the standby path after the main path and the standby path are calculated, so that the CSPF-based link protection system can be well completed.
Drawings
Fig. 1 is a diagram of a prior art network topology in which an IGP protocol network operates;
fig. 2 is a signaling interaction diagram of a protection system based on a CSPF best effort link according to an embodiment of the present invention;
fig. 3 is a flowchart of a protection method based on a CSPF best effort link according to an embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples.
Referring to fig. 3, an embodiment of the present invention provides a method for protecting a link based on CSPF, including the following steps:
s1, recording IP addresses of each node and the link between the nodes on the main link and the standby link to generate a best effort exclusion linked list;
s2, calculating all candidate exclusion links by using an SPF algorithm, respectively contrasting the main path and the standby path for each candidate exclusion link, finding out the same link between two adjacent nodes of the nodes in a best effort exclusion linked list, and calculating a corresponding exclusion key value;
s3, calculating exclusion key values of each candidate exclusion link in an overlapping mode, and generating TE escape path constraint conditions;
and S4, generating a TE escape path according to the escape path constraint condition and issuing the TE escape path.
In one embodiment, before the step S1, the method further includes: configuring constraint conditions of the main link and the standby link by using a best effort dynamic constraint algorithm; and calculating and issuing the paths of the main TE link and the standby TE link according to the constraint conditions of the main TE link and the standby TE link.
In one embodiment, the process of configuring the constraint condition of the active/standby link using the best effort dynamic constraint algorithm in step S1 includes: collecting and recording IP addresses of each node and links among the nodes on the main link and the standby link in a linked list form; and configuring constraint conditions of the main link and the standby link by using an SPF path algorithm with constraint.
In a specific embodiment, the generating of the escape path constraint condition according to the active and standby TE link paths in step S3 specifically includes: recording IP addresses of all nodes and links between the nodes on the main link and the standby link to generate a best effort exclusion linked list; calculating all candidate excluding links by using an SPF algorithm, respectively contrasting a main path and a standby path for each candidate excluding link, finding out the same link between two adjacent nodes of the nodes in a best effort excluding linked list, and calculating a corresponding excluding key value; and calculating the exclusion key value of each candidate exclusion link in an overlapping manner to generate the TE escape path constraint condition.
Preferably, the calculating, by superposition, the elimination key value of each candidate elimination link to generate the TE escape path constraint condition specifically includes: for each candidate exclusion link, overlapping exclusion key values of nodes of the main path and the standby path and links between two adjacent nodes to obtain all exclusion key values of the candidate exclusion link, wherein the exclusion key values of the nodes not on the main path and the standby path and the links between two adjacent nodes are 0; superposing all the exclusion key values of the candidate exclusion link to obtain a final result; and forming a linked list by all candidate excluded path links and corresponding results to serve as TE escape path constraint conditions.
The step of generating the TE escape path according to the escape path constraint condition comprises the following steps: and comparing the final results of all candidate excluded links, and screening the link with the minimum final result as a best-effort path.
In a preferred embodiment, after the TE escape path is generated, the method further comprises:
and (4) after the main path and the standby path are changed every time, adding a new escape path constraint condition, repeating the processes of the steps S1-S4, and calculating a new TE escape path.
In the embodiment of the invention, the elimination key value of each node in each candidate path link and the link between two adjacent nodes can be specified and calculated according to the following method:
giving each node in the main and standby paths and links between two adjacent nodes to exclude initial values, and recording in a linked list form;
giving excluding weight to each node and the adjacent two-node link according to the position of each node and the adjacent two-node link in the main and standby links, whether the node and the adjacent two-node link are positioned at the overlapping part of the main and standby links, the number of the adjacent links or nodes and other parameters;
and multiplying the weight initial value of each node or the link between two adjacent nodes by the exclusion weight to obtain the exclusion key value of each node or the link between two adjacent nodes.
Referring to fig. 2, an embodiment of the present invention further provides a link protection system based on CSPF, which includes a CSPF module (Constrained Shortest Path First algorithm), an RSVP module (Resource ReSerVation Protocol), and an IGP module (internal Gateway Protocol).
The signaling interaction process of the related modules is shown in the figure, wherein the RSVP module is used for performing chain table form combination on the main and standby paths, sending the combined path to the CSPF module as a best effort exclusion constraint condition, and receiving the main and standby TE link paths and the TE escape path issued by the CSPF module; the CSPF module is used for calculating the exclusion path and the superposition weight of the exclusion path after receiving the exclusion condition linked list which is the best effort, generating an escape path constraint condition according to the main TE link path and the standby TE link path and the TE escape path which are sent by the IGP module and sending the main TE link path and the TE escape path to the RSVP module; and the IGP module is used for generating a TE escape path as best as possible according to the restriction condition of the escape path, calculating a main TE link path and a standby TE link path according to the restriction condition of the main TE link, and sending the main TE link path and the TE escape path to the CSPF module.
In a specific embodiment, the CSPF module is further configured to: after the primary TE link path and the secondary TE link path are calculated, the links of the primary path and the secondary path are gathered to form a best effort exclusion linked list; and matching the links in the best effort exclusion linked list, and overlapping exclusion key values of all the links in the matched exclusion linked list to generate a TE escape path constraint condition.
Preferably, the CSPF module is further configured to: after obtaining a best-effort exclusion linked list, calculating an exclusion path by using an SPF algorithm, and marking an exclusion key value of each main path and each standby path matched with each link; and overlapping the elimination key values of all links by the main and standby paths of different links to obtain the elimination key values of all candidate links.
Preferably, the IGP module is further configured to: and comparing the exclusion key values of all the candidate links, and screening the link with the minimum exclusion key value in all the candidate links as a best-effort path.
In a preferred embodiment, the IGP module in the present invention IS an IS-IS module (Intermediate System-to-Intermediate System) or an OSPF module (Open Shortest Path First).
The technical solution of the present invention is described in detail below with reference to a specific example:
in the network shown in the attached figure 1 of the specification, the primary link is R1-R3-R6-R8-R9, and the standby link is R1-R2-R5-R7-R9.
The resulting excluded constraint segments are { R1R3} { R3R6} { R6R8} { R8R9} { R1R2} { R2R5} { R5R7} { R7R9}, and these segments are superimposed with the key for the excluded path (each segment is considered to be 1 by default here).
Through the shortest path tree algorithm, a plurality of candidate paths can be calculated (the algorithm avoids loop behavior in principle), and the candidate paths calculated in this embodiment are as follows:
{R1-R2-R5-R6-R8-R9}
{R1-R2-R5-R6-R7-R9}
{R1-R2-R5-R7-R6-R8-R9}
{R1-R2-R5-R7-R9}
{R1-R3-R4-R5-R6-R7-R9}
{R1-R3-R4-R5-R6-R8-R9}
{R1-R3-R4-R5-R7-R6-R8-R9}
{R1-R3-R4-R5-R7-R9}
{R1-R3-R6-R5-R7-R9}
{R1-R3-R6-R5-R7-R9}
{R1-R3-R6-R7-R9}
{R1-R3-R6-R8-R9}
then, the calculated various paths are added into a candidate list, and the comparison sorting of the exclusion key (set as 1 in this example) and the shortest path is performed to select the optimal path:
{ R1-R2-R5-R6-R8-R9} hit exclusion path { R1R2} { R2R5} { R6R8} { R8R9}, with an exclusion key value of 4;
{ R1-R2-R5-R6-R7-R9} hit exclusion path { R1R2}, { R2R5}, { R7R9} exclusion key value is 3;
{ R1-R2-R5-R7-R6-R8-R9} hit exclusion path { R1R2}, { R2R5}, { R5R7}, { R6R8}, and { R8R9} exclusion key value is 5;
{ R1-R2-R5-R7-R9} (alternate path);
the { R1-R3-R4-R5-R6-R7-R9} hit exclusion path { R1R3}, { R7R9} exclusion key value is 2;
the { R1-R3-R4-R5-R6-R8-R9} hit exclusion path { R1R3}, { R6R8}, { R8R9} exclusion key value is 3;
{ R1-R3-R4-R5-R7-R6-R8-R9} hit exclusion path { R1R3}, { R5R7}, { R6R8}, { R8R9} exclusion key value is 4;
{ R1-R3-R4-R5-R7-R9} hit exclusion path { R1R3}, { R5R7}, { R7R9} exclusion key is 3;
{ R1-R3-R6-R5-R7-R9} hit exclusion path { R1R3}, { R3R6}, { R5R7}, { R7R9} exclusion key value is 4;
{ R1-R3-R6-R5-R7-R9} hit exclusion path { R1R3}, { R3R6}, { R5R7}, { R7R9} exclusion key value is 4;
the { R1-R3-R6-R7-R9} hit exclusion path { R1R3}, { R3R6}, { R7R9} exclusion key value is 3;
{ R1-R3-R6-R8-R9} (being the primary path).
In this embodiment, the sorting in the linked list of the candidate paths is performed according to the following procedures:
1. firstly, a main path and a standby path need to be eliminated;
2. sorting according to the size of the exclusion key values (the smaller the key value, the higher the priority level of the link is);
3. in the same case of excluding the key value, sorting can be performed according to the hop count of the candidate list path or the cost value of the link, and the smaller the priority is, the higher the priority is;
4. finally, a linked list is preferably selected.
In this embodiment, since the exclusion key is 2, which is the smallest, and there is only one exclusion key, the escape route selected is { R1-R3-R4-R5-R6-R7-R9 }.
The present invention is not limited to the above-described embodiments, and it will be apparent to those skilled in the art that various modifications and improvements can be made without departing from the principle of the present invention, and such modifications and improvements are also considered to be within the scope of the present invention. Those not described in detail in this specification are within the skill of the art.
Claims (10)
1. A link protection method based on CSPF is characterized by comprising the following steps:
s1, recording IP addresses of each node and links among the nodes on the main and standby links to generate a best effort exclusion linked list;
s2, calculating all candidate excluding links by using an SPF algorithm, respectively contrasting the main path and the standby path for each candidate excluding link, finding out the same link between two adjacent nodes of the nodes in the best effort excluding linked list, and calculating a corresponding excluding key value;
s3, calculating exclusion key values of each candidate exclusion link in an overlapping mode, and generating TE escape path constraint conditions;
and S4, generating a TE escape path according to the escape path constraint condition and issuing the TE escape path.
2. The CSPF-based link protection method according to claim 1, further comprising, before the step S1:
configuring constraint conditions of the main link and the standby link by using a best effort dynamic constraint algorithm;
and calculating and issuing the paths of the main TE link and the standby TE link according to the constraint conditions of the main TE link and the standby TE link.
3. The CSPF-based link protection method of claim 2, wherein said process of configuring the constraints of the active and standby links using a best effort dynamic constraint algorithm comprises:
collecting and recording IP addresses of each node and links among the nodes on the main link and the standby link in a linked list mode;
and configuring constraint conditions of the main link and the standby link by using an SPF path algorithm with constraint.
4. The CSPF-based link protection method according to claim 1, wherein the calculating, by superposition, each candidate excluded link exclusion key value to generate the TE escape path constraint condition specifically includes:
for each candidate exclusion link, overlapping exclusion key values of nodes of the main path and the standby path and links between two adjacent nodes to obtain all exclusion key values of the candidate exclusion link, wherein the exclusion key values of the nodes not on the main path and the standby path and the links between two adjacent nodes are 0;
superposing all exclusion key values of the candidate exclusion link to obtain a final result;
and forming a linked list by all candidate excluded path links and corresponding results to serve as TE escape path constraint conditions.
5. The CSPF-based link protection method of claim 4, wherein the generating the TE escape path according to the escape path constraint condition comprises:
and comparing the final results of all candidate excluded links, and screening the link with the minimum final result as a best-effort path.
6. The CSPF-based link protection method of claim 1, further comprising, after generating the TE escape path:
and (4) after the main and standby paths are changed every time, adding a new escape path constraint condition, repeating the steps S1-S4, and calculating a new TE escape path.
7. A CSPF-based link protection system, comprising:
the RSVP module is used for performing chain table form combination on the main and standby paths, sending the combined paths to the CSPF module as a best effort exclusion constraint condition, and receiving the main and standby TE link paths and the TE escape path issued by the CSPF module;
the CSPF module is used for calculating an exclusion path and the superposition weight of the exclusion path after receiving a best-effort exclusion condition linked list, generating an escape path constraint condition according to the main TE link path, receiving the main TE link path and the TE escape path sent by the IGP module and issuing the main TE link path and the TE escape path to the RSVP module;
and the IGP module is used for generating a TE escape path in a best effort mode according to the escape path constraint condition, calculating a main TE link path according to the constraint condition of the main link and the standby TE link path and sending the main TE link path and the TE escape path to the CSPF module.
8. The CSPF-based link protection system of claim 1, wherein the CSPF module is further configured to:
after the primary TE link path and the secondary TE link path are calculated, the links of the primary path and the secondary path are gathered to form a best effort exclusion linked list; and matching the links in the best effort exclusion linked list, and overlapping exclusion key values of all the links in the matched exclusion linked list to generate a TE escape path constraint condition.
9. The CSPF-based link protection system of claim 1, wherein the CSPF module is further configured to:
after the primary and secondary TE link paths are calculated, the link sets of the primary and secondary candidate paths form a best effort exclusion linked list; calculating to obtain a candidate exclusion path, matching the candidate exclusion path with the links in the best effort exclusion linked list, and calculating exclusion key values of each node in each candidate path link in the matched exclusion linked list and the links between two adjacent nodes; and overlapping the elimination key values of all the candidate path links to generate a TE escape path constraint condition.
10. The CSPF-based link protection system of claim 1, wherein the IGP module is further to: and comparing the elimination key values of all the candidate elimination path links, and screening the link with the minimum elimination key value in all the candidate elimination path links as a best-effort path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210532547.0A CN115022235B (en) | 2022-05-07 | 2022-05-07 | CSPF-based link protection method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210532547.0A CN115022235B (en) | 2022-05-07 | 2022-05-07 | CSPF-based link protection method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115022235A true CN115022235A (en) | 2022-09-06 |
| CN115022235B CN115022235B (en) | 2023-05-26 |
Family
ID=83068194
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210532547.0A Active CN115022235B (en) | 2022-05-07 | 2022-05-07 | CSPF-based link protection method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115022235B (en) |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5940372A (en) * | 1995-07-13 | 1999-08-17 | International Business Machines Corporation | Method and system for selecting path according to reserved and not reserved connections in a high speed packet switching network |
| JP2003224585A (en) * | 2002-01-28 | 2003-08-08 | Matsushita Electric Ind Co Ltd | Device for setting communication pass |
| JP2005159846A (en) * | 2003-11-27 | 2005-06-16 | Nippon Telegr & Teleph Corp <Ntt> | Method and apparatus for setting multicast transfer path |
| US20050276216A1 (en) * | 2004-06-15 | 2005-12-15 | Jean-Philippe Vasseur | Avoiding micro-loop upon failure of fast reroute protected links |
| US20120239965A1 (en) * | 2009-11-18 | 2012-09-20 | Shihua Wu | Method and Device for Link Protection in Virtual Private Local Area Network |
| US20120307644A1 (en) * | 2011-06-02 | 2012-12-06 | Cisco Technology, Inc. | System and method for link protection using shared srlg association |
| CN105763450A (en) * | 2016-04-14 | 2016-07-13 | 烽火通信科技股份有限公司 | High-efficiency LSP protection method based on RSVP-TE dynamic tunnel |
| CN109547269A (en) * | 2019-01-04 | 2019-03-29 | 烽火通信科技股份有限公司 | A kind of IP RAN equipment realizes the method and device of LSP protection |
| CN110011913A (en) * | 2019-03-20 | 2019-07-12 | 烽火通信科技股份有限公司 | A kind of path calculation method and system |
| CN111654435A (en) * | 2020-06-02 | 2020-09-11 | 中电科航空电子有限公司 | Link protection fault processing system and method based on LACP |
| CN112615780A (en) * | 2020-12-03 | 2021-04-06 | 新华三大数据技术有限公司 | Method and device for determining alternative path of data flow in SDN network |
| CN113285871A (en) * | 2020-02-19 | 2021-08-20 | 中国电信股份有限公司 | Link protection method, SDN controller and communication network system |
| CN113691445A (en) * | 2020-05-18 | 2021-11-23 | 华为技术有限公司 | Message forwarding backup path determining method and related equipment |
-
2022
- 2022-05-07 CN CN202210532547.0A patent/CN115022235B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5940372A (en) * | 1995-07-13 | 1999-08-17 | International Business Machines Corporation | Method and system for selecting path according to reserved and not reserved connections in a high speed packet switching network |
| JP2003224585A (en) * | 2002-01-28 | 2003-08-08 | Matsushita Electric Ind Co Ltd | Device for setting communication pass |
| JP2005159846A (en) * | 2003-11-27 | 2005-06-16 | Nippon Telegr & Teleph Corp <Ntt> | Method and apparatus for setting multicast transfer path |
| US20050276216A1 (en) * | 2004-06-15 | 2005-12-15 | Jean-Philippe Vasseur | Avoiding micro-loop upon failure of fast reroute protected links |
| US20120239965A1 (en) * | 2009-11-18 | 2012-09-20 | Shihua Wu | Method and Device for Link Protection in Virtual Private Local Area Network |
| US20120307644A1 (en) * | 2011-06-02 | 2012-12-06 | Cisco Technology, Inc. | System and method for link protection using shared srlg association |
| CN105763450A (en) * | 2016-04-14 | 2016-07-13 | 烽火通信科技股份有限公司 | High-efficiency LSP protection method based on RSVP-TE dynamic tunnel |
| CN109547269A (en) * | 2019-01-04 | 2019-03-29 | 烽火通信科技股份有限公司 | A kind of IP RAN equipment realizes the method and device of LSP protection |
| CN110011913A (en) * | 2019-03-20 | 2019-07-12 | 烽火通信科技股份有限公司 | A kind of path calculation method and system |
| CN113285871A (en) * | 2020-02-19 | 2021-08-20 | 中国电信股份有限公司 | Link protection method, SDN controller and communication network system |
| CN113691445A (en) * | 2020-05-18 | 2021-11-23 | 华为技术有限公司 | Message forwarding backup path determining method and related equipment |
| CN111654435A (en) * | 2020-06-02 | 2020-09-11 | 中电科航空电子有限公司 | Link protection fault processing system and method based on LACP |
| CN112615780A (en) * | 2020-12-03 | 2021-04-06 | 新华三大数据技术有限公司 | Method and device for determining alternative path of data flow in SDN network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115022235B (en) | 2023-05-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102002189B1 (en) | Method and apparatus for resilient routing of control traffic in a split-architecture system | |
| EP1859561B1 (en) | Algorithm for backup pe selection | |
| CA2383735C (en) | Route protection in a communication network | |
| CN101371150B (en) | Dynamic protection against failure of a head-end node of one or more TE-LSPs | |
| US8559414B2 (en) | Automatically detecting best paths from shadow route reflectors | |
| CN102123088B (en) | Set up the method and apparatus of traffic engineering tunnel | |
| Wang et al. | On understanding transient interdomain routing failures | |
| US20120124238A1 (en) | Prioritization of routing information updates | |
| EP1762053A1 (en) | Method and system for network topology updating using topology perturbation | |
| CN103200097B (en) | A kind of route computing method and the network equipment | |
| CN101601238A (en) | The method of network router and configuration network router | |
| Li et al. | SafeGuard: safe forwarding during route changes | |
| Alexandrovich et al. | Proactive backup scheme of routes in distributed computer networks | |
| Liu et al. | A fast rerouting scheme for OSPF/IS-IS networks | |
| Clarke et al. | An integrated system for designing minimum cost survivable telecommunications networks | |
| Buob et al. | Designing optimal iBGP route-reflection topologies | |
| RU2007107870A (en) | METHODS, DEVICES, AND COMPUTER SOFTWARE PRODUCTS FOR SELECTIVE CONTROL OF A NETWORK IN A NETWORK CONTAINING SEVERAL ACTIVE ROUTES TO A GENERAL REMAINING CENTER | |
| Li et al. | Search-tree based SDN candidate selection in hybrid IP/SDN network | |
| CN112511435A (en) | Method for realizing OSPF quick convergence in internal gateway protocol | |
| Feamster et al. | Network-wide BGP route prediction for traffic engineering | |
| Menth et al. | Robust IP link costs for multilayer resilience | |
| CN115022235B (en) | CSPF-based link protection method and system | |
| CN113726646B (en) | Fast protection switching method and device for segmented routing | |
| CN114827010B (en) | Intra-domain route protection method based on node forwarding probability | |
| Mérindol et al. | Low complexity link state multipath routing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |