CN113242176A - End-to-end multi-path rapid calculation method and device - Google Patents
End-to-end multi-path rapid calculation method and device Download PDFInfo
- Publication number
- CN113242176A CN113242176A CN202110357775.4A CN202110357775A CN113242176A CN 113242176 A CN113242176 A CN 113242176A CN 202110357775 A CN202110357775 A CN 202110357775A CN 113242176 A CN113242176 A CN 113242176A
- Authority
- CN
- China
- Prior art keywords
- path
- paths
- strategy
- nodes
- information
- 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
- 238000004364 calculation method Methods 0.000 title claims abstract description 46
- 238000000034 method Methods 0.000 claims abstract description 8
- 230000003287 optical effect Effects 0.000 claims description 10
- 238000012163 sequencing technique Methods 0.000 claims description 7
- 230000005540 biological transmission Effects 0.000 claims description 5
- 230000015572 biosynthetic process Effects 0.000 claims description 2
- 238000003786 synthesis reaction Methods 0.000 claims description 2
- 238000007726 management method Methods 0.000 description 5
- 238000013468 resource allocation Methods 0.000 description 5
- 239000013307 optical fiber Substances 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000007667 floating Methods 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000011144 upstream manufacturing Methods 0.000 description 1
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/24—Multipath
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application discloses an end-to-end multi-path fast calculation method and a device, which relate to the technical field of communication, and the multi-path fast calculation method comprises the following steps: setting user demand information, wherein the user demand information comprises source and destination nodes and other demand information, and the other demand information comprises maximum node hop count, necessary nodes, excluded nodes and link information; selecting at least one routing strategy and setting a weight coefficient corresponding to the selected routing strategy; acquiring a plurality of alternative physical paths which meet other requirement information between source and host nodes, and respectively calculating the path parameters of each alternative physical path corresponding to the selected routing strategy; and according to the selected routing strategy, the weight coefficient and the path parameters thereof, calculating the path comprehensive weight of each alternative physical path in parallel, and selecting the first paths according to the sequence of the path comprehensive weights from small to large. According to the method and the device, the purpose of quickly realizing multi-path calculation can be achieved by parallel calculation of the path comprehensive weights of the paths, and then quick path creation is realized.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method and an apparatus for fast end-to-end multipath computation.
Background
At present, with the rapid development of 5G (5th generation mobile networks) and SDN (Software Defined Network) Network technologies and the increasing scale of Network management and control of each mainstream operator, a Network user needs to perform routing calculation according to various routing strategies under a Network dynamic condition.
However, the current network management system does not support multipath computation, and cannot implement parallel computation and allocation of multi-node resources, resulting in poor network management and control capability and low efficiency.
Disclosure of Invention
In view of one of the drawbacks in the prior art, the present application provides an end-to-end multipath fast calculation method and apparatus, so as to solve the problem that multipath calculation is not supported in the related art.
The first aspect of the present application provides an end-to-end multipath fast calculation method, which includes the steps of:
setting user demand information, wherein the user demand information comprises source and destination nodes and other demand information, and the other demand information comprises maximum node hop count, necessary nodes, excluded nodes and link information;
selecting at least one routing strategy and setting a weight coefficient corresponding to the selected routing strategy;
acquiring a plurality of alternative physical paths which meet the other requirement information between the source and the destination nodes, and respectively calculating the path parameters of each alternative physical path corresponding to the selected routing strategy;
and according to the selected routing strategy, the weight coefficient and the path parameters thereof, calculating the path comprehensive weight of each alternative physical path in parallel, and selecting a plurality of paths from small to large according to the sequence of the path comprehensive weight and recommending the paths to the user.
In some embodiments, the obtaining a plurality of alternative physical paths between the source and sink nodes that satisfy the other requirement information specifically includes:
searching a physical full path between the source and destination nodes in a full path library, and if the searching is successful, returning the physical full path; if the searching fails, calculating a physical full path between the source and destination nodes which is not more than the maximum node hop number, and storing the physical full path into the full path library by taking the source and destination node pair as an index;
and selecting a plurality of alternative physical paths from the physical full paths according to the necessary nodes, the excluding nodes and the link information.
In some embodiments, the other requirement information further includes interface information and bandwidth information of a source-destination user network interface UNI;
and if the bandwidth of the input port or the output port of any node in any alternative physical path does not meet the bandwidth information, rejecting the alternative physical path.
In some embodiments, when the weight coefficient corresponding to the selected routing policy is set, the average weight is used as the weight coefficient of each routing policy, or the weight coefficient of each routing policy is set according to the service requirement of the user.
In some embodiments, the to-be-selected routing policy includes a shortest link policy, a minimum node policy, a load balancing policy, a minimum delay policy, an optimal performance policy, and a minimum risk policy;
the path parameters of the minimum node policy are as follows: the number of network element nodes on the path;
the path parameters of the shortest link policy are as follows: total optical path distance of the path;
the path parameters of the load balancing strategy are as follows: the maximum value of the bandwidth occupation ratio of the inlet port and the outlet port of each node link on the path;
the path parameters of the minimum delay strategy are as follows: the sum of the exchange delay of all nodes on the path and the transmission delay of the link;
the path parameters of the optimal performance policy are as follows: the sum of the average number of line errors/24 h of all nodes on the path;
the path parameters of the minimum risk policy are as follows: the number of failures and/month of all the nodes links on the path.
In some embodiments, the path synthesis weight W is:
wherein X is the kind of the selected routing strategy, axFor the weight coefficient, p, of the corresponding routing policy XxIs the normalized value of the path parameter corresponding to the routing policy X.
In some embodiments, the normalized value of the path parameter of a routing policy of the alternative physical path is: the maximum value of the path parameter is the maximum value in the path parameters of each alternative physical path.
In some embodiments, after the selecting the plurality of routes and recommending the routes to the user, the method further includes:
and according to the bandwidth information, distributing node resources to each node on the previous paths in parallel, and locking the node resources to be pre-occupied.
In some embodiments, the user requirement information further includes protection information;
after the selecting the plurality of paths before recommending to the user, the method further comprises the following steps:
based on the protection information, one of the plurality of paths is selected as a main path, the rest paths are used as standby paths, and the priority order among the standby paths is determined.
A second aspect of the present application provides an end-to-end multipath fast computing device, comprising:
the system comprises a first setting module, a second setting module and a third setting module, wherein the first setting module is used for setting user requirement information, the user requirement information comprises source and destination nodes and other requirement information, and the other requirement information comprises maximum node hop count, necessary nodes, excluded nodes and link information;
the second setting module is used for selecting at least one routing strategy and setting a weight coefficient corresponding to the selected routing strategy;
a first calculating module, configured to obtain multiple alternative physical paths between the source and destination nodes, where the multiple alternative physical paths satisfy the other requirement information, and calculate path parameters of each alternative physical path corresponding to the selected routing policy, respectively;
the second calculation module is used for calculating the path comprehensive weight of each alternative physical path in parallel according to the selected routing strategy, the weight coefficient and the path parameters thereof;
and the sequencing pushing module is used for sequencing from small to large according to the comprehensive weight of the paths and selecting a plurality of paths to recommend to a user.
The beneficial effect that technical scheme that this application provided brought includes:
according to the end-to-end multi-path fast calculation method and device, after user requirement information is set, at least one routing strategy can be selected according to user service requirements, the weight coefficient of the selected routing strategy is set, then a plurality of alternative physical paths meeting other requirement information between source nodes and destination nodes are obtained, and path parameters of the selected routing strategy corresponding to each alternative physical path are respectively calculated, namely, the path comprehensive weight of each alternative physical path can be calculated in parallel according to the selected routing strategy, the weight coefficient and the path parameters, the front paths are selected and recommended to users according to the sequence from small to large of the path comprehensive weights, therefore, the purpose of fast realizing multi-path calculation can be achieved through parallel calculation of the path comprehensive weights of the paths, and fast path creation is further achieved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a flowchart of an end-to-end multipath fast calculation method in an embodiment of the present application;
fig. 2 is a schematic diagram of a network between source and destination nodes in the embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. In addition, the technical features involved in the embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
As shown in fig. 1, the present application provides an embodiment of an end-to-end multipath fast calculation method, which includes the steps of:
s1, user demand information is set, wherein the user demand information comprises source and destination nodes and other demand information, and the other demand information comprises maximum node hop count, necessary nodes, excluded nodes and link information.
S2, selecting at least one routing strategy and setting a weight coefficient corresponding to the selected routing strategy.
And S3, acquiring a plurality of alternative physical paths which meet the other requirement information between the source and the destination nodes, and then respectively calculating the path parameters of each alternative physical path corresponding to the selected routing strategy.
And S4, according to the selected routing strategy, the weight coefficient and the path parameters thereof, calculating the path comprehensive weight of each alternative physical path in parallel, and selecting a plurality of paths from the first path to recommend to a user according to the sequence of the path comprehensive weight from small to large. In this embodiment, the path comprehensive weights are sorted from small to large, that is, the most optimal to worst sorting of each path is performed.
The user requirement information can also comprise the maximum path number N, namely the first N paths are selected for recommendation according to the sorting of the path comprehensive weight. Therefore, instead of calculating only one optimal path, multiple reachable paths may be calculated and selected between the source and sink nodes to implement multi-path calculation, where the end-to-end multi-paths between the source and sink nodes are the first N paths.
According to the end-to-end multi-path fast calculation method, after user requirement information is set, at least one routing strategy can be selected according to user service requirements, the weight coefficient of the selected routing strategy is set, then a plurality of alternative physical paths meeting other requirement information between source nodes and destination nodes are obtained, and path parameters of each alternative physical path corresponding to the selected routing strategy are respectively calculated, namely the path comprehensive weight of each alternative physical path can be calculated in parallel according to the selected routing strategy, the weight coefficient and the path parameters, the previous paths are selected and recommended to a user according to the sequence from small to large of the path comprehensive weights, therefore, the purpose of fast realizing multi-path calculation can be achieved through parallel calculation of the path comprehensive weights of the paths, and fast path creation is further achieved.
On the basis of the previous embodiment, in this embodiment, acquiring multiple alternative physical paths between the source and sink nodes that satisfy the other requirement information specifically includes:
firstly, searching a physical full path between the source and destination nodes in a full path library based on the information of the source and destination node pairs, and if the searching is successful, returning the physical full path; if the searching fails, calculating a physical full path between the source and destination nodes which is not more than the maximum node hop number by adopting an A Star algorithm, and storing the calculated physical full path routing information into the full path library by taking the source and destination node pair as an index.
Then, a plurality of candidate physical paths which meet the conditions are selected from the physical full paths according to the necessary nodes, the excluded nodes and the link information.
In this embodiment, the full path library initialization state does not have any path. The information of the calculated full path between the nodes is stored, so that the subsequent path searching speed between the existing nodes can be accelerated.
Further, the other requirement information further includes interface information and bandwidth information of the source-destination user network interface UNI.
And if the bandwidth of the input port or the output port of any node in any alternative physical path does not meet the bandwidth information, rejecting the alternative physical path, namely, the path parameter of the alternative physical path corresponding to the selected routing strategy does not need to be calculated. Therefore, the path comprehensive weight of the alternative physical path meeting the bandwidth requirement can be calculated finally.
On the basis of the second embodiment, in this embodiment, the to-be-selected routing policy includes a shortest link policy, a minimum node policy, a load balancing policy, a minimum delay policy, an optimal performance policy, and a minimum risk policy.
Preferably, when the weight coefficient corresponding to the selected routing policy is set, the average weight is used as the weight coefficient of each routing policy, or the weight coefficient of each routing policy is set according to the user service requirement, so as to represent the importance of different routing policies.
When the average weight is taken as the weight coefficient of each routing strategy, the weight coefficients of all the routing strategies selected by the user are the same, and the sum of the weight coefficients is 1.
When a single routing strategy is selected, the weight coefficient of the routing strategy is 1; when the double routing strategies are selected, the weight coefficients of the two routing strategies are 0.5 respectively; the weight coefficients when selecting multiple strategies are analogized and are not described in detail.
When setting the weight coefficient of each routing strategy according to the user service requirement, if selecting a single routing strategy, the weight coefficient of the routing strategy is still 1, but if selecting more than one routing strategy, the weight coefficient is distributed according to the priority of the set routing strategy.
In this embodiment, when the single routing policy is selected, the weight coefficient is 1; when the double routing strategy is selected, the weight coefficients of the double routing strategy and the double routing strategy are respectively 0.6 and 0.4; when the three routing strategies are selected, the weight coefficients of the three strategies are 0.5, 0.3 and 0.2 respectively; when the four-route strategy is selected, the weight coefficients are 0.5, 0.3, 0.1 and 0.1 respectively; when the five routing strategies are selected, the weight coefficients are 0.5, 0.2, 0.1 and 0.1; when the six-route strategy is selected, the weight coefficients are 0.5, 0.2, 0.1, 0.05 and 0.05 respectively.
For example, for the delay-sensitive service, a single policy, that is, a minimum delay policy, may be adopted, and the weight coefficient is set to be 1.
For a user large bandwidth service, it is desirable to preferentially reduce the conflict of peak bandwidth, and the delay is sensitive, and a dual strategy, i.e., a load balancing strategy and a minimum delay strategy, may be selected, where the weight coefficient of the load balancing strategy is 0.6, and the weight coefficient of the minimum delay strategy is 0.4.
In addition, for a user large bandwidth service, the user not only wants to preferentially reduce the conflict of peak bandwidth, but also wants to minimize the risk of interruption, and can select three strategies, namely a load balancing strategy, a minimum delay strategy and a minimum risk strategy, wherein the weight coefficient of the load balancing strategy is 0.5, the weight coefficient of the minimum delay strategy is 0.3, and the weight coefficient of the minimum risk strategy is 0.2. By analogy, the user service pays more attention to the guarantee of which aspect, that is, the priority of the corresponding routing strategy can be improved, and the weighting coefficient is emphasized.
In this embodiment, for any alternative physical path, if the minimum node policy is selected, the number of network element nodes on the path is directly calculated, that is, the path parameters of the minimum node policy are: and the number of network element nodes on the path.
If the shortest link policy is selected, the optical path distance between ports of upstream and downstream nodes of the path needs to be obtained, and the total distance of the path optical path is calculated, that is, the path parameters of the shortest link policy are as follows: total distance of optical paths of the paths.
If a load balancing strategy is selected, the bandwidth requirement and the idle bandwidth ratio of the input port and the output port of the link between two adjacent nodes on the path need to be calculated, and the maximum value of the bandwidth occupation ratio of the input port and the output port is selected, that is, the path parameters of the load balancing strategy are as follows: and the maximum value of the bandwidth occupation ratio of the inlet port to the outlet port of each node link on the path.
If the minimum delay strategy is selected, the static delay of each node link needs to be obtained, and then the sum of the exchange delay of all nodes on the path and the transmission delay of the link is calculated, namely the path parameters of the minimum delay strategy are as follows: the sum of the exchange delay and the link transmission delay of all nodes on the path.
The node exchange time delay is determined according to the type test of the node equipment, and the link transmission time delay is determined according to the unit distance time delay determined by the type of the link optical fiber and the length of the link optical fiber.
If the best performance strategy is selected, the average number of times of line error code out-of-limit/24 h of each node ingress port needs to be obtained, and then the sum of the average number of times of line error codes/24 h of all nodes on the path is calculated, namely the path parameters of the best performance strategy are as follows: the average number of line errors of all nodes on the path/the sum of 24 h.
If the minimum risk strategy is selected, the average failure times/month of the links on each node and the ingress port are acquired. And calculating the failure times and/month of all the node links on the path, namely the path parameters of the minimum risk strategy are as follows: the number of failures and/month of all the nodes links on the path.
On the basis of the foregoing embodiment, in this embodiment, the path comprehensive weight W of any one of the alternative physical paths is:
wherein X is the kind of the selected routing strategy, axFor the weight coefficient, p, of the corresponding routing policy XxThe path comprehensive weight value W is a normalized value of a path parameter corresponding to the routing policy X, and therefore, the calculated path comprehensive weight value W is a floating point number greater than or equal to 0.
In this embodiment, the normalized value of the path parameter of a certain routing policy of the alternative physical path is: the maximum value of the path parameter is the maximum value in the path parameters of the routing strategy corresponding to each alternative physical path.
On the basis of the foregoing embodiment, in this embodiment, after the selecting the previous several routes and recommending the routes to the user, the method further includes:
according to the bandwidth information, distributing node resources to each node on the previous paths in parallel, and locking the node resources to be pre-occupied, namely determining that all the node resources on the paths are distributed in parallel.
Optionally, the resource is a time slot resource meeting the requirement of a signal type for an SDH (Synchronous Digital Hierarchy) path; for a PTN (Packet Transport Network) Network is a tunnel label; for an OTN (Optical Transport Network) Network are wavelength, Optical channel data unit ODUk particles, etc.
On the basis of the above embodiment, in this embodiment, the user requirement information further includes protection information. After the selecting the plurality of paths before recommending to the user, the method further comprises the following steps:
based on the protection information, one of the plurality of paths is selected as a main path, the rest paths are used as standby paths, the priority order among the standby paths is determined, and the multi-path calculation is completed. In this embodiment, the calculation efficiency of rerouting is improved by providing a master-slave path.
As shown in fig. 2, taking node 1 as a source node and node 9 as a sink node as an example, assuming that the time delay of an optical fiber is 5 microseconds per kilometer, the time delay of the node is 5 microseconds, the occupied ratio of the link bandwidth occupied by the unlabeled bandwidth in the figure is 0, the number of link failures is 0, and the number of node error codes out-of-limit is 0. The calculation method of the embodiment specifically includes the following steps:
first, user requirement information, that is, the maximum path number N, the maximum node hop number, the source node (node 1 and node 9), the necessary node, the excluded node, and the link information required by the user, and interface information, bandwidth information, and protection information of the source and sink UNI set by the user, is set.
In this embodiment, before selecting the routing policy, state parameter information of the network object, such as length of each link, unit length delay, occupation ratio of bandwidth between an ingress port and an egress port of each link, statistics of number of times per day that a line error code of an ingress port of each node exceeds a limit, statistics of number of times of monthly failures of links on each node and the ingress port, and the like, may also be obtained in advance, so that after subsequently selecting the routing policy, a path parameter corresponding to the selected routing policy may be calculated quickly.
Wherein, the value range of N is 1-5, and the default is 2; the maximum node hop count is in the range of 6-20, and the default value is 10. In this embodiment, N is 5, and the maximum node hop count is 8.
Secondly, selecting a minimum time delay strategy, a minimum node strategy and a load balancing strategy, and setting the weight coefficients of all routing strategies to be 0.5, 0.3 and 0.2 respectively.
Then, a plurality of alternative physical paths between the node 1 and the node 9, which are obtained by searching from the full path library or obtained by calculation, and satisfy the other requirement information are as follows:
route 1: 1, 2, 5, 9;
route 2: 1, 2, 5, 6, 8, 9;
route 3: 1, 2, 5, 6, 7, 8, 9;
path 4: 1, 3, 6, 8, 9;
path 5: 1, 3, 6, 5, 9;
path 6: 1, 3, 4, 7, 6, 8, 9;
path 7: 1, 3, 4, 7, 6, 5, 9;
path 8: 1, 4, 7, 9;
path 9: 1,4,7,8,9.
Taking the above 9 paths as an example, the calculation of each routing policy parameter is shown in table 1 below, and the index (×) in table 1 is the optimal value of the single routing policy.
TABLE 1
As shown in fig. 2, taking the link between the node 3 and the node 6 as an example, the fiber distance of the link is 20KM, the bandwidth occupancy ratio is 30%, and the number of link failures is 1/month. Taking the total optical path distance of the shortest link policy as an example, the maximum value of the total optical path distance of each path is 210KM, and therefore, the normalized value of the total optical path distance in path 1 is 150/210.
In this embodiment, since the selected routing policy is the minimum delay, the minimum node and the load balancing, only the path parameters corresponding to the minimum delay, the minimum node and the load balancing policy of each path are needed, and the calculation result of the path comprehensive weight of each path is shown in table 2 below.
TABLE 2
In this embodiment, the selected path of the top 5 in the sequence is: the path 2, the path 9, the path 4, the path 8 and the path 3 take the path 2 as a main path and other paths as standby paths.
The application also provides an embodiment of an end-to-end multi-path fast computing device, which comprises a first setting module, a second setting module, a first computing module, a second computing module and a sequencing pushing module.
The first setting module is used for setting user requirement information, the user requirement information comprises source and destination nodes and other requirement information, and the other requirement information comprises maximum node hop count, necessary nodes, excluded nodes and link information.
The second setting module is used for selecting at least one routing strategy and setting a weight coefficient corresponding to the selected routing strategy.
The first calculation module is configured to obtain multiple alternative physical paths between the source and sink nodes that satisfy the other requirement information, and calculate path parameters of each alternative physical path corresponding to the selected routing policy, respectively.
And the second calculation module is used for calculating the path comprehensive weight of each alternative physical path in parallel according to the selected routing strategy, the weight coefficient and the path parameters thereof.
And the sequencing pushing module is used for sequencing the paths from small to large according to the comprehensive weight values of the paths and selecting a plurality of paths to recommend to a user.
Preferably, on the basis of the above embodiment, the other requirement information further includes interface information, bandwidth information, and protection information of the source-destination user network interface UNI.
The computing device also comprises a resource allocation module, wherein the resource allocation module is used for allocating node resources to each node on the previous paths in parallel according to the bandwidth information and locking the node resources to be pre-occupied.
Further, the computing device further comprises a third setting module, wherein the third setting module is used for selecting one path from the plurality of paths as a main path and the rest paths as standby paths based on the protection information, and determining the priority order among the standby paths.
The end-to-end multi-path fast calculation device of the embodiment is suitable for the calculation methods, is suitable for multi-path fast calculation and node resource allocation of a network management and control system under a large-scale network by adopting various routing strategies, and accelerates the calculation speed of routing because the calculation of the comprehensive weight of the paths of a plurality of paths is node-parallel, and simultaneously, the node resource allocation of the first N paths is also parallel, so that the calculation speed of resource allocation is accelerated, the calculation and the establishment of fast paths are further realized, and the management and control function and the efficiency of the network are optimized.
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. An end-to-end multipath fast calculation method, characterized in that it comprises the steps of:
setting user demand information, wherein the user demand information comprises source and destination nodes and other demand information, and the other demand information comprises maximum node hop count, necessary nodes, excluded nodes and link information;
selecting at least one routing strategy and setting a weight coefficient corresponding to the selected routing strategy;
obtaining a plurality of alternative physical paths which meet the other requirement information between the source and the destination nodes, and respectively calculating the path parameters of each alternative physical path corresponding to the selected routing strategy;
and according to the selected routing strategy, the weight coefficient and the path parameters thereof, calculating the path comprehensive weight of each alternative physical path in parallel, and selecting a plurality of paths from the first to the second in a sequence from small to large according to the path comprehensive weight and recommending to the user.
2. The end-to-end multipath fast calculation method of claim 1, wherein acquiring a plurality of alternative physical paths between the source and sink nodes that satisfy the other requirement information specifically includes:
searching a physical full path between the source and destination nodes in a full path library, and if the searching is successful, returning the physical full path; if the searching fails, calculating a physical full path between the source and destination nodes which is not more than the maximum node hop number, and storing the physical full path into the full path library by taking the source and destination node pair as an index;
and selecting a plurality of alternative physical paths from the physical full paths according to the necessary nodes, the excluded nodes and the link information.
3. An end-to-end multipath fast calculation method as claimed in claim 2, characterised in that: the other requirement information also comprises interface information and bandwidth information of a source-destination User Network Interface (UNI);
and if the bandwidth of the input port or the output port of any node in any alternative physical path does not meet the bandwidth information, rejecting the alternative physical path.
4. An end-to-end multipath fast calculation method as claimed in claim 1, characterised in that: and when the weight coefficient corresponding to the selected routing strategy is set, taking the average weight as the weight coefficient of each routing strategy, or setting the weight coefficient of each routing strategy according to the service requirement of a user.
5. The end-to-end multi-path fast calculation method of claim 4, characterized in that the to-be-selected routing strategy comprises a shortest link strategy, a minimum node strategy, a load balancing strategy, a minimum delay strategy, an optimal performance strategy and a minimum risk strategy;
the path parameters of the minimum node strategy are as follows: the number of network element nodes on the path;
the path parameters of the shortest link policy are as follows: total optical path distance of the path;
the path parameters of the load balancing strategy are as follows: the maximum value of the bandwidth occupation ratio of the inlet port and the outlet port of each node link on the path;
the path parameters of the minimum delay strategy are as follows: the sum of the exchange delay of all nodes on the path and the transmission delay of the link;
the path parameters of the optimal performance strategy are as follows: the sum of the average number of line errors/24 h of all nodes on the path;
the path parameters of the minimum risk policy are: the number of failures and/month of all the nodes links on the path.
6. An end-to-end multipath fast calculation method as claimed in claim 5, wherein the path synthesis weight W is:
wherein X is the kind of the selected routing strategy, axFor the weight coefficient, p, of the corresponding routing policy XxIs the normalized value of the path parameter corresponding to the routing policy X.
7. An end-to-end multipath fast calculation method as claimed in claim 6, characterised in that the normalized value of the path parameter of a certain routing strategy of the alternative physical path is: the routing policy comprises a ratio of a path parameter to a maximum value of the path parameter, wherein the maximum value of the path parameter is a maximum value in the path parameter of each alternative physical path.
8. An end-to-end multipath fast calculation method as claimed in claim 3, wherein after selecting the first several paths and recommending the paths to the user, the method further comprises:
and according to the bandwidth information, distributing node resources to each node on the previous paths in parallel, and locking the node resources to be pre-occupied.
9. An end-to-end multipath fast calculation method as claimed in claim 8, wherein the user requirement information further includes protection information;
after the selecting of the plurality of paths is recommended to the user, the method further comprises the following steps:
based on the protection information, one of the plurality of paths is selected as a main path, the rest paths are used as standby paths, and the priority order among the standby paths is determined.
10. An end-to-end multipath fast computing apparatus, comprising:
the system comprises a first setting module, a second setting module and a third setting module, wherein the first setting module is used for setting user demand information, the user demand information comprises source and destination nodes and other demand information, and the other demand information comprises maximum node hop count, necessary nodes, excluded nodes and link information;
the second setting module is used for selecting at least one routing strategy and setting a weight coefficient corresponding to the selected routing strategy;
a first calculation module, configured to obtain multiple candidate physical paths between the source and destination nodes that meet the other requirement information, and calculate path parameters of each candidate physical path corresponding to the selected routing policy, respectively;
the second calculation module is used for calculating the path comprehensive weight of each alternative physical path in parallel according to the selected routing strategy, the weight coefficient and the path parameters thereof;
and the sequencing pushing module is used for sequencing from small to large according to the path comprehensive weight value and selecting a plurality of paths to recommend to a user.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110357775.4A CN113242176A (en) | 2021-04-01 | 2021-04-01 | End-to-end multi-path rapid calculation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110357775.4A CN113242176A (en) | 2021-04-01 | 2021-04-01 | End-to-end multi-path rapid calculation method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113242176A true CN113242176A (en) | 2021-08-10 |
Family
ID=77130940
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110357775.4A Pending CN113242176A (en) | 2021-04-01 | 2021-04-01 | End-to-end multi-path rapid calculation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113242176A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114884824A (en) * | 2022-06-09 | 2022-08-09 | 中国联合网络通信集团有限公司 | Method, device and system for querying delay budget path |
| CN115208765A (en) * | 2022-05-26 | 2022-10-18 | 中国信息通信研究院 | Slice arranging method and system for power business |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1764146A (en) * | 2004-10-21 | 2006-04-26 | 华为技术有限公司 | Optimization route choosing method |
| CN107733796A (en) * | 2017-02-07 | 2018-02-23 | 深圳臻云技术股份有限公司 | A kind of preferentially path calculation method and system |
| CN108540876A (en) * | 2018-03-12 | 2018-09-14 | 上海欣诺通信技术股份有限公司 | Service path choosing method, SDN controllers, storage medium and electronic equipment |
-
2021
- 2021-04-01 CN CN202110357775.4A patent/CN113242176A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1764146A (en) * | 2004-10-21 | 2006-04-26 | 华为技术有限公司 | Optimization route choosing method |
| CN107733796A (en) * | 2017-02-07 | 2018-02-23 | 深圳臻云技术股份有限公司 | A kind of preferentially path calculation method and system |
| CN108540876A (en) * | 2018-03-12 | 2018-09-14 | 上海欣诺通信技术股份有限公司 | Service path choosing method, SDN controllers, storage medium and electronic equipment |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115208765A (en) * | 2022-05-26 | 2022-10-18 | 中国信息通信研究院 | Slice arranging method and system for power business |
| CN114884824A (en) * | 2022-06-09 | 2022-08-09 | 中国联合网络通信集团有限公司 | Method, device and system for querying delay budget path |
| CN114884824B (en) * | 2022-06-09 | 2023-06-16 | 中国联合网络通信集团有限公司 | Method, equipment and system for inquiring delay budget path |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Huang et al. | Survivable multipath provisioning with differential delay constraint in telecom mesh networks | |
| US7609624B2 (en) | Method and apparatus for pre-provisioning networks to support fast restoration with minimum overbuild | |
| US6882627B2 (en) | Methods and apparatus for selecting multiple paths taking into account shared risk | |
| US5274643A (en) | Method for optimizing a network having virtual circuit routing over virtual paths | |
| US6804199B1 (en) | Communications network system and method for routing based on disjoint pairs of paths | |
| JP2737828B2 (en) | Communication network and route selection method in the network | |
| CN101312464B (en) | Method for realizing load balance in automatic exchange optical network | |
| US9825844B2 (en) | Network topology of hierarchical ring with recursive shortcuts | |
| US20010029543A1 (en) | Link state routing techniques | |
| CN110247713B (en) | Virtual service mapping method and device based on quantum key distribution optical network | |
| CN108156041B (en) | Differentiated virtual optical network mapping method based on security perception | |
| Oliveira et al. | Protection, routing, modulation, core, and spectrum allocation in SDM elastic optical networks | |
| Yuan et al. | A RMSA algorithm for elastic optical network with a tradeoff between consumed resources and distance to boundary | |
| EP3868062B1 (en) | Methods and apparatus for transmitting data over multiple paths in a network | |
| CN113242176A (en) | End-to-end multi-path rapid calculation method and device | |
| Bao et al. | SDFA: A service-driven fragmentation-aware resource allocation in elastic optical networks | |
| US6711324B1 (en) | Software model for optical communication networks | |
| US20230308352A1 (en) | Optimization method and system for minimizing network energy consumption based on traffic grooming | |
| CA2440515A1 (en) | Constraint based routing with non-transitive exceptions | |
| US7593348B2 (en) | Traffic-independent allocation of working and restoration capacity in networks | |
| Das et al. | A partial-protection approach using multipath provisioning | |
| Wu et al. | Redundant routing provision in a FlexE-over-WDM network based on segment frame replication and elimination | |
| Lan et al. | A fragmentation-aware load-balanced RMSCA algorithm in space-division multiplexing elastic optical networks | |
| US7609965B2 (en) | Method for reorganizing wavelength division multiplexing network using dynamic watermarks | |
| Ravikumar et al. | Kautz graphs as attractive logical topologies in multihop lightwave networks |
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: 20210810 |
|
| RJ01 | Rejection of invention patent application after publication |