CN112291143A - Method and system for optimizing main and standby routes of label switched path - Google Patents
Method and system for optimizing main and standby routes of label switched path Download PDFInfo
- Publication number
- CN112291143A CN112291143A CN202011169511.8A CN202011169511A CN112291143A CN 112291143 A CN112291143 A CN 112291143A CN 202011169511 A CN202011169511 A CN 202011169511A CN 112291143 A CN112291143 A CN 112291143A
- Authority
- CN
- China
- Prior art keywords
- network element
- path
- shortest
- shortest path
- source
- 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.)
- Pending
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/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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- 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
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0005—Switch and router aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/0079—Operation or maintenance aspects
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a method and a system for optimizing primary and standby routes of a label switched path. The label switching path master-slave same-route optimizing method and system convert the fiber connection information between network elements in the network into an adjacent matrix, wherein the weight value in the matrix indicates that no optical fiber connection exists between the network elements, after the label switching path with the master-slave same-route phenomenon exists in the network is screened, the position where the same route occurs is judged, and the source/host network element same-route is optimized by using a port cutting scheme, namely, if other available board cards exist in the network element with the same route, the optical fiber is switched to the available board cards, so that the purpose of eliminating the source/host network element same-route is achieved. The intermediate network element co-route searches all paths between the source and host network elements by utilizing a KSP algorithm, screens out all paths which do not have the same route with the original main path, and selects the path with the least number of network elements to replace the original standby path, thereby achieving the effect of eliminating the main and the host co-routes.
Description
Technical Field
The invention relates to the field of PTN network optimization, in particular to a method and a system for optimizing primary and standby routes of a label switched path.
Background
With the arrival of the mobile big data era, the full-service IP is promoted, the IP of the transmission Network has become a trend, new technologies such as PTN (Packet Transport Network) and OTN (Optical Transport Network) become the mainstream of IP transmission, PTN is a fusion product of transmission and Packet technologies, and is more and more highly concerned by operators and deployed in a large scale, and the optimization of the PTN Network is now on the aspects of optimizing and improving the operation quality of the existing Network.
In order to improve user experience, ensure reliability of service transmission, and enable a network to operate safely and stably, operators generally deploy a complete protection mechanism for a PTN network. When a primary Path of an LSP (Label Switching Path) that is transmitting a service fails, a system should automatically switch the service to a backup Path to ensure that a service flow is not interrupted. However, due to geographical condition limitations, construction period, investment income, improper initial configuration and other reasons, the problem of network co-routing still exists.
In LSP, once a failure occurs in an optical fiber or a network element at the same route position of the physical main/standby path, or when an optical fiber constituting a logical ring network optical cable is damaged, the main path and the standby path (also called a protection path) are interrupted at the same time, which causes an actual protection failure and a failure in service transmission.
Disclosure of Invention
In order to solve the problem of the primary/secondary common route in the prior art, the invention provides a method and a system for optimizing the primary/secondary common route of a label switched path.
In order to achieve the purpose, the invention provides the following scheme:
a method for optimizing active/standby routes of a label switching path comprises the following steps:
acquiring source/host network element information and intermediate network element information between a main path and a standby path which have the same routing phenomenon in a network;
judging whether the board card information of the main path is the same as the board card information of the standby path according to the source/host network element information; if the same, the same board card of the source/host network element is judged, whether the same board card type and idle board card exist in the network element of the same board card is judged, and if the same board card exists, the port of the standby path is switched to the board card; if the two paths are different, the intermediate network element is the same board card, at the moment, after the shortest path between the source/host network elements is searched by adopting a Dijkstra algorithm, the k shortest paths between the source/host network elements are searched by adopting a KSP algorithm on the basis of the shortest path, and a shortest path set is obtained;
performing ascending order arrangement on each shortest path in the shortest path set according to the size of the path hop number, and judging whether each shortest path in the shortest path set and the main path have the same route; if not, replacing the standby path by the first shortest path; if yes, judging whether a second shortest path in the shortest path set and the main path have the same route or not until a shortest available path is found in the shortest path set in sequence to replace the standby path.
Preferably, the finding the shortest path between the source/sink network elements by using Dijkstra algorithm specifically includes:
acquiring a network diagram, and constructing an adjacency matrix by taking optical fiber connection among network elements in the network diagram as an edge weight 1, taking no optical fiber connection among the network elements as an edge weight infinity, and taking a diagonal line among the network elements as an edge weight 0;
putting each network element in the network diagram into an inaccessible network element set, and using dis [ x ]]Recording the initial network element V0To network element VxSum of shortest path edge weights, i.e. V0To VxThe shortest hop count therebetween, and judges the network element VjWhether the formula dis [ V ] is satisfiedj]<＝min(dis[Vj-1]) If yes, then network element V is setjAdding the accessed network element set and adding the network element VjDeleting from the set of non-visited network elements;
judging whether the sum of the edge weight from the source end network element to the middle network element and the edge weight from the middle network element to the destination end network element is less than the edge weight from the source end network element to the destination end network element; if the sum is less than the preset threshold value, taking the edge weight value from the source end network element to the destination end network element as the sum of the edge weight value from the source end network element to the intermediate network element and the edge weight value from the intermediate network element to the destination end network element, and taking the path between the source end network element and the destination end network element as the shortest path; otherwise, directly keeping the sum of the edge weight from the source end network element to the intermediate network element and the edge weight from the intermediate network element to the destination end network element, and taking the paths among the source end network element, the intermediate network element and the destination end network element as the shortest path;
and returning to the step of judging whether the sum of the edge weight from the source end network element to the intermediate network element and the edge weight from the intermediate network element to the destination end network element is less than the edge weight from the source end network element to the destination end network element or not until the set of the net elements which are not visited is empty, and outputting the shortest path.
Preferably, the finding k shortest paths between the source/destination network elements by using the KSP algorithm to obtain the shortest path set specifically includes:
sequentially taking n-1 network elements on the shortest path between the source network element and the destination network element, which is searched by adopting a Dijkstra algorithm, along the direction from the source network element to the destination network element as deviation points; the n-1 network elements are network elements except the host end network element;
determining a deviation path from the deviation point to the sink terminal network element by adopting the Dijkstra algorithm;
putting paths formed by paths from a source end node to each deviation point in the shortest paths and deviation paths corresponding to the source end node and the deviation points into a candidate path set;
taking the path with the minimum path weight in the candidate path set as the current shortest path, putting the path into the first shortest path set, and deleting the path from the candidate path set;
judging whether the number of paths in the first shortest path set is less than the number k of target shortest paths and whether the candidate path set is not empty, if yes, taking the current shortest path newly added into the first shortest path set as the shortest path, and returning to the step of 'taking n-1 network elements along the direction from the source end network element to the sink end network element on the shortest path as deviation points in turn'; if not, outputting a shortest path set containing k shortest paths; the shortest path set containing k shortest paths is the shortest path set.
Preferably, the determining whether each shortest path in the shortest path set and the primary path have the same route specifically includes:
judging whether the same network elements or board cards exist between the main path and the first shortest path in the shortest path set except for a source host network element;
if yes, the same route occurs; otherwise, the route is not the same.
Corresponding to the method for optimizing the main and standby routes of the label switching path, the invention also provides a system for optimizing the main and standby routes of the label switching path, which comprises the following steps:
a network element information acquisition module, configured to acquire source/sink network element information and intermediate network element information between a main path and a standby path in a network, where the main path and the standby path have a same routing phenomenon;
a first judging module, configured to judge whether the board card information of the main path and the board card information of the standby path are the same according to the source/sink network element information; if the same, the same board card of the source/host network element is judged, whether the same board card type and idle board card exist in the network element of the same board card is judged, and if the same board card exists, the port of the standby path is switched to the board card; if the two paths are different, the intermediate network element is the same board card, at the moment, after the shortest path between the source/host network elements is searched by adopting a Dijkstra algorithm, the k shortest paths between the source/host network elements are searched by adopting a KSP algorithm on the basis of the shortest path, and a shortest path set is obtained;
a second determining module, configured to arrange the shortest paths in the shortest path set in an ascending order according to the hop count of the path, and determine whether the shortest paths in the shortest path set and the main path share the same route; if not, replacing the standby path by the first shortest path; if yes, judging whether a second shortest path in the shortest path set and the main path have the same route or not until a shortest available path is found in the shortest path set in sequence to replace the standby path.
Preferably, the first determining module specifically includes:
an obtaining unit, configured to obtain a network graph, and construct an adjacency matrix by using optical fiber connections among network elements in the network graph as edge weights 1, using no optical fiber connections among the network elements as edge weights ∞, and using diagonals among the network elements as edge weights 0;
a first judging unit, configured to put each network element in the network graph into an inaccessible network element set, using dis [ x [ ]]Recording the initial network element V0To network element VxSum of shortest path edge weights, i.e. V0To VxThe shortest hop count therebetween, and judges the network element VjWhether the formula dis [ V ] is satisfiedj]<＝min(dis[Vj-1]) If yes, then network element V is setjAdding the accessed network element set and adding the network element VjDeleting from the set of non-visited network elements;
the second judging unit is used for judging whether the sum of the edge weight from the source end network element to the middle network element and the edge weight from the middle network element to the destination end network element is less than the edge weight from the source end network element to the destination end network element; if the sum is less than the preset threshold value, taking the edge weight value from the source end network element to the destination end network element as the sum of the edge weight value from the source end network element to the intermediate network element and the edge weight value from the intermediate network element to the destination end network element, and taking the path between the source end network element and the destination end network element as the shortest path; otherwise, directly keeping the sum of the edge weight from the source end network element to the intermediate network element and the edge weight from the intermediate network element to the destination end network element, and taking the paths among the source end network element, the intermediate network element and the destination end network element as the shortest path;
and the returning unit is used for returning to the step of judging whether the sum of the edge weight from the source end network element to the intermediate network element and the edge weight from the intermediate network element to the destination end network element is less than the edge weight from the source end network element to the destination end network element or not until the set of the non-visited network elements is empty, and outputting the shortest path.
Preferably, the first determining module specifically includes:
a deviation point determining unit, configured to sequentially use n-1 network elements in a direction from a source-end network element to a sink-end network element on a shortest path between the source/sink network elements, which is found by using a Dijkstra algorithm, as deviation points; the n-1 network elements are network elements except the host end network element;
a deviation path determining unit, configured to determine a deviation path from the deviation point to the sink network element by using the Dijkstra algorithm;
a candidate path set constructing unit, configured to put paths, which are included by paths from a source end node to each deviation point in the shortest path and deviation paths corresponding to the source end node and the deviation points, into a candidate path set;
the shortest path set determining unit is used for taking the path with the minimum path weight in the candidate path set as the current shortest path and putting the path into the first shortest path set, and deleting the path from the candidate path set;
a third determining unit, configured to determine whether the number of paths in the first shortest path set is less than a target shortest path number k, and whether the candidate path set is not empty, if yes, taking a current shortest path newly added to the first shortest path set as a shortest path, and returning to "take n-1 network elements on the shortest path along a direction from a source network element to a sink network element, and sequentially taking the n-1 network elements as deviation points"; if not, outputting a shortest path set containing k shortest paths; the shortest path set containing k shortest paths is the shortest path set.
Preferably, the second determining module specifically includes:
a fourth judging unit, configured to judge whether a same network element or board card exists between the main path and the first shortest path in the shortest path set except for the source/sink network element;
if yes, the same route occurs; otherwise, the route is not the same.
According to the specific embodiment provided by the invention, the invention discloses the following technical effects:
the invention provides a method and a system for optimizing primary and standby common routes of a label switched path, which convert fiber connection information among network elements in a network into an adjacent matrix, wherein weight values in the matrix indicate that no optical fiber connection exists among the network elements, the label switched path with the primary and standby common routes exists in the network is screened, and after the position of the common route is determined, the scheme of utilizing port switching for the common route of a source/host network element is optimized, namely, if other available board cards exist in the network element with the common route, optical fibers are switched to the available board cards, so that the aim of eliminating the common route of the source/host network element is fulfilled. The intermediate network element co-route uses KSP algorithm to find out the first K shortest paths between the source and host network elements, and screens out the paths which do not have the same route with the original main path and have the least number of network elements to replace the original standby path, thereby achieving the effect of eliminating the main and standby co-routes.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings without inventive exercise.
Fig. 1 is a flowchart of a method for optimizing primary and secondary label switched paths in a same route according to the present invention;
fig. 2 is a flowchart of a method for implementing label switched path primary/secondary common route optimization according to the present invention;
fig. 3 is a network element adjacency matrix diagram provided in the embodiment of the present invention;
fig. 4 is an exemplary diagram of active/standby common routing of a source end network element in an embodiment of the present invention;
fig. 5 is an exemplary diagram of primary and standby routes of a host network element in the embodiment of the present invention;
fig. 6 is an exemplary diagram of master-slave common routing of an intermediate network element in the embodiment of the present invention;
fig. 7 is a schematic structural diagram of the label switched path primary/secondary routing optimization system provided in the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The invention aims to provide a method and a system for optimizing main and standby common routes of a label switched path, so as to solve the problem of the main and standby common routes in the prior art.
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in further detail below.
Fig. 1 is a flowchart of a method for optimizing primary/secondary common routes of a label switched path according to the present invention, and as shown in fig. 1, the method for optimizing primary/secondary common routes of a label switched path includes:
step 100: and acquiring source/host network element information and intermediate network element information between the main path and the standby path with the same routing phenomenon in the network.
Step 101: and judging whether the board card information of the main path is the same as the board card information of the standby path according to the source/host network element information. If the two types of the same board cards are the same, the same board card of the source/host network element is judged, whether the board card which is the same as the main path board card and is idle exists in the network element of the same board card is judged, and if the board card exists, the port of the standby path is switched to the board card. If the two paths are different, the intermediate network element is the same board card, at the moment, after the shortest path between the source/host network elements is searched by adopting a Dijkstra algorithm, the k shortest paths between the source/host network elements are searched by adopting a KSP algorithm on the basis of the shortest path, and the shortest path set is obtained.
The finding of the shortest path between the source/sink network elements by using the Dijkstra algorithm specifically includes:
and acquiring a network diagram, and constructing an adjacency matrix by taking optical fiber connection among network elements in the network diagram as an edge weight 1, taking no optical fiber connection among the network elements as an edge weight infinity, and taking a diagonal line among the network elements as an edge weight 0.
Putting each network element in the network diagram into the set of the non-accessed network elements, and using dis [ x ]]Recording the initial network element V0To network element VxSum of shortest path edge weights, i.e. V0To VxThe shortest hop count therebetween, and judges the network element VjWhether the formula dis [ V ] is satisfiedj]<＝min(dis[Vj-1]) If yes, then network element V is setjAdding the accessed network element set and adding the network element VjDeleted from the set of inaccessible network elements.
And judging whether the sum of the edge weight from the source end network element to the middle network element and the edge weight from the middle network element to the destination end network element is less than the edge weight from the source end network element to the destination end network element. If the sum is less than the threshold value, the edge weight value from the source end network element to the destination end network element is used as the sum of the edge weight value from the source end network element to the intermediate network element and the edge weight value from the intermediate network element to the destination end network element, and the path between the source end network element and the destination end network element is used as the shortest path. Otherwise, the sum of the edge weight from the source end network element to the intermediate network element and the edge weight from the intermediate network element to the sink end network element is directly reserved, and the path among the source end network element, the intermediate network element and the sink end network element is used as the shortest path.
And returning to the step of judging whether the sum of the edge weight from the source end network element to the intermediate network element and the edge weight from the intermediate network element to the destination end network element is less than the edge weight from the source end network element to the destination end network element or not until the set of the unvisited network elements is empty, and outputting the shortest path.
Adopting KSP algorithm to search k shortest paths between source/host network elements to obtain a shortest path set, specifically comprising:
and sequentially taking n-1 network elements on the shortest path between the source network element and the destination network element, which is searched by adopting a Dijkstra algorithm, along the direction from the source network element to the destination network element as deviation points. The n-1 network elements are network elements except the host end network element.
And determining a deviation path from the deviation point to the host terminal network element by adopting a Dijkstra algorithm.
And putting paths formed by paths from the source end node to each deviation point in the shortest paths and the deviation paths corresponding to the source end node and the deviation points into a candidate path set.
And taking the path with the minimum path weight in the candidate path set as the current shortest path to be put into the first shortest path set, and deleting the path from the candidate path set.
And judging whether the number of the paths in the first shortest path set is less than the number k of the target shortest paths and whether the candidate path set is not empty, if so, taking the current shortest path newly added into the first shortest path set as the shortest path, and returning to the step of taking n-1 network elements along the direction from the source end network element to the sink end network element on the shortest path as deviation points in sequence. If not, outputting a shortest path set containing k shortest paths. The shortest path set containing k shortest paths is the shortest path set.
Step 102: and (4) carrying out ascending order arrangement on each shortest path in the shortest path set according to the hop count of the path, and judging whether each shortest path in the shortest path set and the main path have the same route. And if not, replacing the standby path by the first shortest path. If yes, judging whether a second shortest path in the shortest path set and the main path have the same route or not until finding a shortest available path in the shortest path set in sequence to replace the standby path. The determining whether the shortest path in the shortest path set and the primary path have the same route specifically includes:
and judging whether the same network elements or board cards exist between the main path and the first shortest path in the shortest path set except the source-host network element.
If so, the same route occurs. Otherwise, the route is not the same.
The following describes the method for optimizing the primary/standby label switched paths and the same route according to the present invention in detail by taking the implementation flow shown in fig. 2 as an example.
As shown in fig. 2, the specific process of the present invention is to compare the network element information of the primary path and the standby path of the original data with the board card information, and if it is determined that the source/sink network element is the same as the board card, the scheme of port switching is adopted for optimization. Comparing the network element information and the board card information of the main path and the standby path of the original data, if the intermediate network element is the same or the intermediate network element and the board card are the same, regarding the intermediate network element as the same route, finding out the first k shortest paths between the source/host network elements by using a KSP algorithm and storing the shortest paths into a set P, sequentially traversing the set P, and if a path which is not the same route as the original main path exists, replacing the original standby path with the path to complete the optimization. In the specific implementation process, the method mainly comprises the following steps:
step 1: and judging the positions of the same route in the network. If the source/sink network element is the same board card, the port is cut, and if the intermediate network element is the same board card, the following operations are performed.
Step 1.1: and comparing the source/sink network element information between the original main path and the standby path, and if the board cards are the same, determining that the board cards are the same as the source/sink board cards.
Step 1.2: searching network element information of a source/destination end, judging whether a board card which is not used and has the same type with the same routing board card exists in the network element, if so, selecting one board card as a starting board card of a standby path, and switching a starting port of the standby path to the board card. Otherwise, it is ignored.
Step 2: and finding out the shortest path between the source network element and the sink network element by utilizing a Dijkstra algorithm.
Step 2.1, determining a network graph G as (V, E) according to the fiber connection state between network elements, and taking the edge weight value as 1 if optical fiber connection exists between the network elements in the graph and taking the edge weight value as 1 if no optical fiber connection existsThe value of ∞ principle establishes the adjacency matrix W, where WijRepresenting the state of connecting fibers from the network element i to the network element j, respectively recording the accessed network element and the non-accessed network element of the shortest path by using a set S and a set U, and using dis [ x ]]Recording the initial network element V0To network element VxSum of shortest path edge weights, i.e. V0To VxThe shortest number of hops in between.
And 2.2, if the network element satisfies the formula (1), adding the network element j into the visited network element set S, and deleting the network element j from the visited network element set U.
dis[j]<＝min(dis[j-1])，Vj-1∈V-S (1)
Step 2.3 comparing the initial network element V0To network element VxThe edge weight value and the network element VxTo terminating network element VtSum of edge weights of and initial network element V0To terminating network element VtIf the former is smaller than the latter, then update dis [ t [ [ t ]]For initiating network element V0To network element VxThe shortest path edge weight dis x]And network element VxEdge weights W to termination network element VtxtAnd, as shown in equation (2):
If dis[x]+Wxt<dis[t]
dis[t]＝dis[x]+Wxt (2)
and 2.4, judging whether the set U is empty, outputting the set S as the network element set of the shortest path if the set U is empty, and continuing to execute the step 2.2 until the set U is empty if the set U is not empty.
And step 3: on the basis of the shortest path found by the Dijkstra algorithm, the first 5 shortest paths between the source/sink network elements are found by using the KSP algorithm.
And 3.1, respectively recording the first k shortest paths and the candidate paths by using a set P and a set B, wherein the shortest paths and the candidate paths are empty initially, and i represents the number of the paths in the set P. Solving source end v by utilizing Dijkstra algorithm0To the sink vtAnd put into the set P.
Step 3.2-shortest Path p for ithiRemoving the end point v from the upper n nodestN-1 nodes other than the node(s) of (a), as deviation points v in turnj(wherein j ═ s1,2,.,n-1)。
Step 3.3, utilizing the Dijkstra algorithm to sequentially calculate the deviation point to the sink node VtTo ensure loop-free, the shortest path h of (2) ensures the deviation path hiThe shortest path p to the ithiSource end node v in0The path to the off-set node has no duplicate nodes, and the off-set path hiThe sent edges are different from the front i shortest path node v in the set P.
Step 3.4: the source end node v in the ith shortest path p0To the point of departure vjIs a path of deviation from a path hiAnd (wherein i is 1,2, … …, n-1) putting the path into the candidate path set B.
Step 3.5: taking the path with the minimum path weight in the candidate path set B as pi+1Put the previous k shortest paths in the set P and delete the path from the set B.
Step 3.6: and (3) judging whether the number i of the paths in the set P is less than k and whether the set B is not empty, if so, turning to the step 3.2, and if not, outputting the previous k shortest path sets.
Step 3.7: and (3) arranging the first K shortest path sets P in an ascending order according to the number of the network elements in each path, judging whether the first path in the shortest path set P and the original main path have the same route, if not, replacing the original standby path by the path, and if so, comparing the second path until the replacement is successful.
And 4, step 4: an appropriate path is selected to replace the original backup path.
Step 4.1: and comparing the original main path with the first path searched by the KSP, and judging whether the same network element or board card as the original main path exists except the source host network element.
Step 4.2: if yes, judging the next path, otherwise, replacing the original standby path by the path until the replacement is successful.
Further, in the process of storing the connectivity information between the network elements in the network in the form of the adjacency matrix according to the present invention, it is assumed that there are 2977 network elements, if there is a fiber connection between any two network elements, the corresponding zero-order matrix weight is 1, if there is no connection, the corresponding adjacency matrix weight is ∞, and the diagonal position weights are all 0, as shown in fig. 3, which is used for KSP to find the shortest path.
Fig. 4 is a schematic diagram of a port-switching strategy adopted for the problem of the same route of the source network element in the present invention, where one or more boards may exist in one network element, and if the source network element boards of the main route and the standby route are the same, it indicates that the same route of the source network element occurs, and at this time, it is necessary to find whether an available board exists in the network element at the position where the same route occurs, the method for determining the available board is to find a board that is not used in the network element at which the same route occurs first, then screen out a board of the same type as the board of the original standby route to form an available board list, and if the list is not empty, select one of the boards as the source network element board of the standby route, and switch the optical fiber connecting the original standby route to the source network element to the board.
Fig. 5 is a schematic diagram of a port-switching strategy adopted for the problem of the same route of the host network element in the present invention, where one network element may have one or more boards, if the host network element boards of the main path and the standby path are the same, it indicates that the same route of the host network element occurs, and at this time, it is necessary to find whether an available board exists in the network element at the position where the same route occurs, and the determination method is to find out a board that is not used in the network element at which the same route occurs, then screen out a board of the same type as the board of the original standby path to form an available board list, and if the list is not empty, select one of the boards of the host network element as the standby path, and switch the optical fiber connecting the original standby path to the host network element to the board, thereby eliminating the problem of the.
Moreover, as shown in fig. 6, when the present invention proposes that the intermediate network elements are the same or the intermediate network elements and the corresponding boards are the same in the main path and the standby path, the present invention proposes to search the available paths between the source and sink network elements in the existing resources by using the KSP algorithm, and arrange them in an ascending order according to the length of the paths. And (4) selecting paths which do not have the same routing with the original main path from the paths searched by the KSP (preferably selecting shorter paths) to replace the original standby paths, thereby eliminating the same routing phenomenon among the nodes of the intermediate network element. Assume that the primary path is: the board 1 of the starting network element → the board 1 of the intermediate network element 1 → the board 1 of the intermediate network element 2 → the board 1 of the intermediate network element 3 → the board 1 of the terminating network element, and the original standby path is: the initial network element board 2 → the board 1 of the intermediate network element 4 → the board 1 of the intermediate network element 2 → the board 1 of the intermediate network element 5 → the board 2 of the terminating network element, the main path and the standby path have the same intermediate network element 2 and the same board is connected to the intermediate network element 2, and at this time, the KSP algorithm is used to find the available path 1: the board 2 of the originating network element-the board 1 of the intermediate network element 4 → the board 1 of the intermediate network element 6 → the board 1 of the intermediate network element 5 → the board 2 of the terminating network element. After the original standby path is replaced by the available path 1, the problem of primary and standby routing is successfully solved, and no new physical equipment is added, so that the utilization rate of the existing resources is improved, the primary and standby routing rate in the network is reduced, and the service protection rate is improved.
The advantages of the above-described technical solutions of the present invention are further illustrated below by means of experiments.
The method comprises the steps that a staff does not consider that the phenomenon of main/standby common routing is avoided when the staff initially configures the Xianning mobile network, so that a large number of LSP main/standby common routing problems exist in the Xianning mobile network, and the evaluation result of the network shows that the LSP main/standby common routing rate is up to 24.4% (the same routing rate is the number of tunnels generating the main/standby common routing in the network/the total number of tunnels), and the label switching path main/standby common routing optimization method provided by the invention is adopted for optimizing the problems.
Each network element in the Yanning mobile network is taken as a node, no optical fiber connection exists between the network elements as a weight to establish an adjacency matrix, the first 5 paths between the two network elements are searched on the basis of the adjacency matrix by utilizing a KSP algorithm, and the original standby path is replaced by a path which does not have the same main and standby routes with the original main path. After the network of the Yanning is optimized by the scheme, as shown in table 1, the same routing rate is reduced to 6.5%, and is reduced by 17.9%. The LSP primary and secondary identical route optimization method based on the KSP algorithm has feasibility, not only can reduce the primary and secondary identical route rate in the network, but also can improve the utilization rate of network resources.
TABLE 1
In addition, corresponding to the method for optimizing the primary/secondary label switched path routing, the present invention further provides a system for optimizing the primary/secondary label switched path routing, as shown in fig. 7, where the system includes:
the network element information acquiring module 1 is configured to acquire source/sink network element information and intermediate network element information between a main path and a standby path in a network, where the same routing phenomenon exists.
And the first judging module 2 is configured to judge whether the board card information of the main path is the same as the board card information of the standby path according to the source/sink network element information. If the two types of the same board cards are the same, the same board card of the source/host network element is judged, whether the board card which is the same as the main path board card and is idle exists in the network element of the same board card is judged, and if the board card exists, the port of the standby path is switched to the board card. If the two paths are different, the intermediate network element is the same board card, at the moment, after the shortest path between the source/host network elements is searched by adopting a Dijkstra algorithm, the k shortest paths between the source/host network elements are searched by adopting a KSP algorithm on the basis of the shortest path, and the shortest path set is obtained.
And the second judging module 3 is used for arranging the shortest paths in the shortest path set in an ascending order according to the hop count of the paths, and judging whether the shortest paths in the shortest path set and the main path have the same route. And if not, replacing the standby path by the first shortest path. If yes, judging whether a second shortest path in the shortest path set and the main path have the same route or not until finding a shortest available path in the shortest path set in sequence to replace the standby path.
Preferably, the first determining module 2 specifically includes:
and the acquisition unit is used for acquiring the network graph, and constructing the adjacency matrix by taking optical fiber connection among network elements in the network graph as an edge weight 1, taking no optical fiber connection among the network elements as an edge weight infinity, and taking a diagonal line among the network elements as an edge weight 0.
A first judging unit, configured to put each network element in the network graph into the set of non-visited network elements, using dis [ x [ ]]Recording the initial network element V0To network element VxSum of shortest path edge weights, i.e. V0To VxThe shortest hop count therebetween, and judges the network element VjWhether the formula dis [ V ] is satisfiedj]<＝min(dis[Vj-1]) If yes, then network element V is setjAdding the accessed network element set and adding the network element VjDeleted from the set of inaccessible network elements.
And the second judging unit is used for judging whether the sum of the edge weight from the source end network element to the intermediate network element and the edge weight from the intermediate network element to the destination end network element is smaller than the edge weight from the source end network element to the destination end network element. If the sum is less than the threshold value, the edge weight value from the source end network element to the destination end network element is used as the sum of the edge weight value from the source end network element to the intermediate network element and the edge weight value from the intermediate network element to the destination end network element, and the path between the source end network element and the destination end network element is used as the shortest path. Otherwise, the sum of the edge weight from the source end network element to the intermediate network element and the edge weight from the intermediate network element to the sink end network element is directly reserved, and the path among the source end network element, the intermediate network element and the sink end network element is used as the shortest path.
And the returning unit is used for returning to the step of judging whether the sum of the edge weight from the source end network element to the intermediate network element and the edge weight from the intermediate network element to the destination end network element is less than the edge weight from the source end network element to the destination end network element or not until the set of the inaccessible network elements is empty, and outputting the shortest path.
Preferably, the first determining module 2 specifically includes:
and the deviation point determining unit is used for sequentially taking n-1 network elements in the direction from the source end network element to the host end network element on the shortest path between the source/host network elements searched by adopting a Dijkstra algorithm as deviation points. The n-1 network elements are network elements except the host end network element.
And the deviation path determining unit is used for determining a deviation path from the deviation point to the sink terminal network element by adopting a Dijkstra algorithm.
And the candidate path set constructing unit is used for putting paths formed by paths from the source end node to each deviation point in the shortest path and the deviation paths corresponding to the source end node and the deviation points into the candidate path set.
And the shortest path set determining unit is used for taking the path with the minimum path weight in the candidate path set as the current shortest path to be put into the first shortest path set, and deleting the path from the candidate path set.
And the third judging unit is used for judging whether the number of the paths in the first shortest path set is less than the number k of the target shortest paths and whether the candidate path set is not empty, if so, taking the current shortest path newly added into the first shortest path set as the shortest path, and returning to the step of taking n-1 network elements along the direction from the source end network element to the destination end network element on the shortest path as deviation points in sequence. If not, outputting a shortest path set containing k shortest paths. The shortest path set containing k shortest paths is the shortest path set.
Preferably, the second determining module 3 specifically includes:
and the fourth judging unit is used for judging whether the same network element or board card exists between the main path and the first shortest path in the shortest path set except for the source and destination network elements.
If so, the same route occurs. Otherwise, the route is not the same.
In summary, the technical solution provided by the present invention has the following advantages over the downstream technology:
1. the invention provides a primary and standby route optimization algorithm of a KSP-based label switched path, which is operated on the basis of the existing resources, so that the scheme cost is lower.
2. The invention optimizes the LSP primary and standby same route based on the existing resources, and improves the resource utilization rate in the network.
3. The invention provides the method for classifying the positions of the main and standby same routes, different types of main and standby same routes adopt different optimization strategies, if the main and standby same routes are the source/host standby same routes, the operation of switching the board card is adopted, if the intermediate network element is the intermediate network element same route, KSP is adopted to search other available paths for replacement so as to achieve the purpose of optimization, the main and standby same route rate in the network is reduced, and the service protection rate is improved.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. For the system disclosed by the embodiment, the description is relatively simple because the system corresponds to the method disclosed by the embodiment, and the relevant points can be referred to the method part for description.
The principles and embodiments of the present invention have been described herein using specific examples, which are provided only to help understand the method and the core concept of the present invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, the specific embodiments and the application range may be changed. In view of the above, the present disclosure should not be construed as limiting the invention.
Claims (8)
1. A method for optimizing active/standby routes of a label switched path is characterized by comprising the following steps:
acquiring source/host network element information and intermediate network element information between a main path and a standby path which have the same routing phenomenon in a network;
judging whether the board card information of the main path is the same as the board card information of the standby path according to the source/host network element information; if the same, the same board card of the source/host network element is judged, whether the same board card type and idle board card exist in the network element of the same board card is judged, and if the same board card exists, the port of the standby path is switched to the board card; if the two paths are different, the intermediate network element is the same board card, at the moment, after the shortest path between the source/host network elements is searched by adopting a Dijkstra algorithm, the k shortest paths between the source/host network elements are searched by adopting a KSP algorithm on the basis of the shortest path, and a shortest path set is obtained;
performing ascending order arrangement on each shortest path in the shortest path set according to the size of the path hop number, and judging whether each shortest path in the shortest path set and the main path have the same route; if not, replacing the standby path by the first shortest path; if yes, judging whether a second shortest path in the shortest path set and the main path have the same route or not until a shortest available path is found in the shortest path set in sequence to replace the standby path.
2. The method for optimizing primary/standby label switched path routing according to claim 1, wherein a Dijkstra algorithm is used to find the shortest path between source/destination network elements, and specifically comprises:
acquiring a network diagram, and constructing an adjacency matrix by taking optical fiber connection among network elements in the network diagram as an edge weight 1, taking no optical fiber connection among the network elements as an edge weight infinity, and taking a diagonal line among the network elements as an edge weight 0;
putting each network element in the network diagram into an inaccessible network element set, and using dis [ x ]]Recording the initial network element V0To network element VxSum of shortest path edge weights, i.e. V0To VxThe shortest hop count therebetween, and judges the network element VjWhether the formula dis [ V ] is satisfiedj]<＝min(dis[Vj-1]) If yes, then network element V is setjAdding the accessed network element set and adding the network element VjDeleting from the set of non-visited network elements;
judging whether the sum of the edge weight from the source end network element to the middle network element and the edge weight from the middle network element to the destination end network element is less than the edge weight from the source end network element to the destination end network element; if the sum is less than the preset threshold value, taking the edge weight value from the source end network element to the destination end network element as the sum of the edge weight value from the source end network element to the intermediate network element and the edge weight value from the intermediate network element to the destination end network element, and taking the path between the source end network element and the destination end network element as the shortest path; otherwise, directly keeping the sum of the edge weight from the source end network element to the intermediate network element and the edge weight from the intermediate network element to the destination end network element, and taking the paths among the source end network element, the intermediate network element and the destination end network element as the shortest path;
and returning to the step of judging whether the sum of the edge weight from the source end network element to the intermediate network element and the edge weight from the intermediate network element to the destination end network element is less than the edge weight from the source end network element to the destination end network element or not until the set of the net elements which are not visited is empty, and outputting the shortest path.
3. The method according to claim 1, wherein the finding k shortest paths between source/sink network elements using KSP algorithm to obtain a shortest path set comprises:
sequentially taking n-1 network elements on the shortest path between the source network element and the destination network element, which is searched by adopting a Dijkstra algorithm, along the direction from the source network element to the destination network element as deviation points; the n-1 network elements are network elements except the host end network element;
determining a deviation path from the deviation point to the sink terminal network element by adopting the Dijkstra algorithm;
putting paths formed by paths from a source end node to each deviation point in the shortest paths and deviation paths corresponding to the source end node and the deviation points into a candidate path set;
taking the path with the minimum path weight in the candidate path set as the current shortest path, putting the path into the first shortest path set, and deleting the path from the candidate path set;
judging whether the number of paths in the first shortest path set is less than the number k of target shortest paths and whether the candidate path set is not empty, if yes, taking the current shortest path newly added into the first shortest path set as the shortest path, and returning to the step of 'taking n-1 network elements along the direction from the source end network element to the sink end network element on the shortest path as deviation points in turn'; if not, outputting a shortest path set containing k shortest paths; the shortest path set containing k shortest paths is the shortest path set.
4. The method according to claim 1, wherein determining whether each shortest path in the set of shortest paths and the primary path have the same route specifically includes:
judging whether the same network elements or board cards exist between the main path and the first shortest path in the shortest path set except for a source host network element;
if yes, the same route occurs; otherwise, the route is not the same.
5. A label switched path active/standby same route optimization system is characterized by comprising:
a network element information acquisition module, configured to acquire source/sink network element information and intermediate network element information between a main path and a standby path in a network, where the main path and the standby path have a same routing phenomenon;
a first judging module, configured to judge whether the board card information of the main path and the board card information of the standby path are the same according to the source/sink network element information; if the same, the same board card of the source/host network element is judged, whether the same board card type and idle board card exist in the network element of the same board card is judged, and if the same board card exists, the port of the standby path is switched to the board card; if the two paths are different, the intermediate network element is the same board card, at the moment, after the shortest path between the source/host network elements is searched by adopting a Dijkstra algorithm, the k shortest paths between the source/host network elements are searched by adopting a KSP algorithm on the basis of the shortest path, and a shortest path set is obtained;
a second determining module, configured to arrange the shortest paths in the shortest path set in an ascending order according to the hop count of the path, and determine whether the shortest paths in the shortest path set and the main path share the same route; if not, replacing the standby path by the first shortest path; if yes, judging whether a second shortest path in the shortest path set and the main path have the same route or not until a shortest available path is found in the shortest path set in sequence to replace the standby path.
6. The system according to claim 5, wherein the first determining module specifically includes:
an obtaining unit, configured to obtain a network graph, and construct an adjacency matrix by using optical fiber connections among network elements in the network graph as edge weights 1, using no optical fiber connections among the network elements as edge weights ∞, and using diagonals among the network elements as edge weights 0;
a first judging unit, configured to put each network element in the network graph into an inaccessible network element set, using dis [ x [ ]]Recording the initial network element V0To network element VxSum of shortest path edge weights, i.e. V0To VxThe shortest hop count therebetween, and judges the network element VjWhether the formula dis [ V ] is satisfiedj]<＝min(dis[Vj-1]) If yes, then network element V is setjAdding the accessed network element set and adding the network element VjDeleting from the set of non-visited network elements;
the second judging unit is used for judging whether the sum of the edge weight from the source end network element to the middle network element and the edge weight from the middle network element to the destination end network element is less than the edge weight from the source end network element to the destination end network element; if the sum is less than the preset threshold value, taking the edge weight value from the source end network element to the destination end network element as the sum of the edge weight value from the source end network element to the intermediate network element and the edge weight value from the intermediate network element to the destination end network element, and taking the path between the source end network element and the destination end network element as the shortest path; otherwise, directly keeping the sum of the edge weight from the source end network element to the intermediate network element and the edge weight from the intermediate network element to the destination end network element, and taking the paths among the source end network element, the intermediate network element and the destination end network element as the shortest path;
and the returning unit is used for returning to the step of judging whether the sum of the edge weight from the source end network element to the intermediate network element and the edge weight from the intermediate network element to the destination end network element is less than the edge weight from the source end network element to the destination end network element or not until the set of the non-visited network elements is empty, and outputting the shortest path.
7. The system according to claim 5, wherein the first determining module specifically includes:
a deviation point determining unit, configured to sequentially use n-1 network elements in a direction from a source-end network element to a sink-end network element on a shortest path between the source/sink network elements, which is found by using a Dijkstra algorithm, as deviation points; the n-1 network elements are network elements except the host end network element;
a deviation path determining unit, configured to determine a deviation path from the deviation point to the sink network element by using the Dijkstra algorithm;
a candidate path set constructing unit, configured to put paths, which are included by paths from a source end node to each deviation point in the shortest path and deviation paths corresponding to the source end node and the deviation points, into a candidate path set;
the shortest path set determining unit is used for taking the path with the minimum path weight in the candidate path set as the current shortest path and putting the path into the first shortest path set, and deleting the path from the candidate path set;
a third determining unit, configured to determine whether the number of paths in the first shortest path set is less than a target shortest path number k, and whether the candidate path set is not empty, if yes, taking a current shortest path newly added to the first shortest path set as a shortest path, and returning to "take n-1 network elements on the shortest path along a direction from a source network element to a sink network element, and sequentially taking the n-1 network elements as deviation points"; if not, outputting a shortest path set containing k shortest paths; the shortest path set containing k shortest paths is the shortest path set.
8. The system according to claim 5, wherein the second determining module specifically includes:
a fourth judging unit, configured to judge whether a same network element or board card exists between the main path and the first shortest path in the shortest path set except for the source/sink network element;
if yes, the same route occurs; otherwise, the route is not the same.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011169511.8A CN112291143A (en) | 2020-10-28 | 2020-10-28 | Method and system for optimizing main and standby routes of label switched path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011169511.8A CN112291143A (en) | 2020-10-28 | 2020-10-28 | Method and system for optimizing main and standby routes of label switched path |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112291143A true CN112291143A (en) | 2021-01-29 |
Family
ID=74373570
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011169511.8A Pending CN112291143A (en) | 2020-10-28 | 2020-10-28 | Method and system for optimizing main and standby routes of label switched path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112291143A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114630214A (en) * | 2022-03-25 | 2022-06-14 | 凯通科技股份有限公司 | Service route calculation method and device, electronic equipment and readable storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110912818A (en) * | 2019-11-26 | 2020-03-24 | 中盈优创资讯科技有限公司 | Method and system for judging same route of PTN (packet transport network) service |
| CN110995348A (en) * | 2019-11-01 | 2020-04-10 | 中国移动通信集团广东有限公司 | System and method for troubleshooting and avoiding hidden physical routing danger of transmission network |
-
2020
- 2020-10-28 CN CN202011169511.8A patent/CN112291143A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110995348A (en) * | 2019-11-01 | 2020-04-10 | 中国移动通信集团广东有限公司 | System and method for troubleshooting and avoiding hidden physical routing danger of transmission network |
| CN110912818A (en) * | 2019-11-26 | 2020-03-24 | 中盈优创资讯科技有限公司 | Method and system for judging same route of PTN (packet transport network) service |
Non-Patent Citations (2)
| Title |
|---|
| ZAONING WANG 等: "《2020 IEEE 5th International Symposium on Smart and Wireless Systems within the Conferences on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS-SWS)》", 18 September 2020 * |
| 吴云峰等: "本地传输网的网络优化", 《光通信技术》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114630214A (en) * | 2022-03-25 | 2022-06-14 | 凯通科技股份有限公司 | Service route calculation method and device, electronic equipment and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8897141B2 (en) | Network system and routing method | |
| EP2737671B1 (en) | Method and apparatus for resilient routing of control traffic in a split-architecture system | |
| EP2817928B1 (en) | Controller placement for fast failover in the split architecture | |
| US9282030B2 (en) | Transport control server that calculates routing information | |
| CN106464589B (en) | Method and apparatus for partial software defined network switch replacement in IP networks | |
| CN103380605B (en) | The MPLS of LDP is used to re-route method and the NE of LDP-FRR fast | |
| US20140140210A1 (en) | Network system and load balancing method | |
| JP2002281068A (en) | Bypass route designing method for communication network | |
| US20010034853A1 (en) | Load distribution failure recovery system and method | |
| CN102347885B (en) | A kind of method and apparatus of route handoff | |
| US8593941B2 (en) | Method for implementing permanent ring network protection in an MESH network | |
| CN113727221A (en) | Intelligent optical network control method, device and system | |
| CN112291143A (en) | Method and system for optimizing main and standby routes of label switched path | |
| US7443832B2 (en) | Device for determining switching paths in a label switched communication network in the presence of selection attributes | |
| CN106603401B (en) | Fast rerouting method and device | |
| CN101552936A (en) | A method and device to determine the route based on the Fabric Shortest Path First protocol | |
| JP4852568B2 (en) | Overlay network communication route determination method, system and program | |
| CN114448868A (en) | Path scheduling method, device and equipment based on segmented routing strategy | |
| WO2005015834A1 (en) | A method of automatic protection switching | |
| JP4700662B2 (en) | Rerouting method, rerouting program and routing device | |
| JP2008211656A (en) | Apparatus, method, and program for creating multicast tree | |
| WO2024001210A1 (en) | Path calculation method, controller, and computer readable storage medium | |
| JP5339605B2 (en) | Route search method and system | |
| CN108494690B (en) | Minimum failure probability optical tree construction method and device | |
| Hounkonnou et al. | Enhanced OSPF graceful restart |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210129 |
|
| RJ01 | Rejection of invention patent application after publication |