A path determination method and apparatus

Abstract

The application provides a path determination method and device. The method is applied to an SDN controller and comprises the following steps: when it is necessary to determine a forwarding path of target service traffic, a corresponding network topology graph is acquired; for each pair of adjacent network nodes in the network topology graph, a link quality evaluation factor of two links is calculated according to current time delays, current jitter rates and current packet loss rates of corresponding forward links and reverse links; a traffic evaluation factor of the two links is calculated according to current bandwidth occupancy rates of the two links and a traffic priority value; a link cost evaluation factor of the two links is calculated according to the current time delays, the current jitter rates, the current packet loss rates, a link cost value and link attribute information of the two links; a path weight value between the pair of adjacent network nodes is calculated according to the evaluation factors, and a corresponding forward forwarding path and a reverse forwarding path are determined by using a Dijkstra algorithm. The application can improve user experience.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a path determination method and apparatus. Background Technology

[0002] Software-defined networking (SDN) is a novel network architecture that enables flexible control of network traffic by separating the control plane and the data plane.

[0003] In certain network scenarios, some users may need an SDN controller that can both guarantee the bandwidth and quality of service, and ensure that the forward and reverse forwarding paths of related service traffic are consistent. Therefore, determining the forwarding path that meets these requirements is a problem that needs to be solved. Summary of the Invention

[0004] To overcome the problems existing in related technologies, this application provides a path determination method and apparatus.

[0005] According to a first aspect of the embodiments of this application, a path determination method is provided, the method being applied to an SDN controller, the method comprising:

[0006] When it is necessary to determine the forwarding path of target service traffic, obtain the network topology map of the target network managed by the SDN controller;

[0007] For each pair of adjacent network nodes in the obtained network topology graph, the link quality evaluation factor of the forward and reverse links between the pair of adjacent network nodes is calculated based on the current latency, current jitter rate and current packet loss rate of the forward and reverse links between the pair of adjacent network nodes.

[0008] Based on the current bandwidth utilization and traffic priority values ​​of the forward and reverse links between the adjacent network nodes, calculate the traffic evaluation factors of the forward and reverse links between the adjacent network nodes.

[0009] Based on the current latency, current jitter rate, current packet loss rate, link cost value, and link attribute information of the forward and reverse links between the pair of adjacent network nodes, calculate the link cost evaluation factor of the forward and reverse links between the pair of adjacent network nodes.

[0010] Based on the calculated link quality evaluation factor, traffic evaluation factor and link cost evaluation factor of the forward and reverse links between the pair of adjacent network nodes, calculate the path weight value between the pair of adjacent network nodes.

[0011] Based on the calculated path weights between all adjacent network nodes, the Dijkstra algorithm is used to determine the shortest path from the source node of the target service traffic to the destination node of the target service traffic in the network topology graph.

[0012] The determined path is designated as the forward forwarding path of the target service traffic, and the corresponding reverse path is designated as the reverse forwarding path of the target service traffic.

[0013] According to a second aspect of the embodiments of this application, a path determination apparatus is provided, the apparatus being applied to an SDN controller, the apparatus comprising:

[0014] The acquisition module is used to acquire the network topology map of the target network managed by the SDN controller when it is necessary to determine the forwarding path of the target service traffic;

[0015] The first calculation module is used to calculate the link quality evaluation factor of the forward and reverse links between each pair of adjacent network nodes in the obtained network topology graph, based on the current latency, current jitter rate and current packet loss rate of the forward and reverse links between the pair of adjacent network nodes.

[0016] The second calculation module is used to calculate the traffic evaluation factors of the forward and reverse links between the adjacent network nodes based on the current bandwidth utilization and traffic priority values ​​of the forward and reverse links between the adjacent network nodes.

[0017] The third calculation module is used to calculate the link cost evaluation factor of the forward and reverse links between the pair of adjacent network nodes based on the current latency, current jitter rate, current packet loss rate, link cost value and link attribute information of the forward and reverse links between the pair of adjacent network nodes.

[0018] The fourth calculation module is used to calculate the path weight value between the pair of adjacent network nodes based on the calculated link quality evaluation factor, traffic evaluation factor and link cost evaluation factor of the forward and reverse links between the pair of adjacent network nodes.

[0019] The first determining module is used to determine the shortest path from the source node of the target service traffic to the destination node of the target service traffic in the network topology graph based on the calculated path weight values ​​between all adjacent network nodes and using the Dijkstra algorithm.

[0020] The second determining module is used to determine the determined path as the forward forwarding path of the target service traffic, and to determine the reverse path corresponding to the determined path as the reverse forwarding path of the target service traffic.

[0021] The technical solutions provided by the embodiments of this application may include the following beneficial effects:

[0022] In this embodiment, for the SDN controller, when it needs to determine the forwarding path of target service traffic, it can first obtain the network topology map of the target network managed by the SDN controller; then, for each pair of adjacent network nodes in the obtained network topology map, it calculates the link quality assessment factor of the forward and reverse links between the pair of adjacent network nodes based on the current latency, current jitter rate, and current packet loss rate of the forward and reverse links between the pair of adjacent network nodes; it calculates the traffic assessment factor of the forward and reverse links between the pair of adjacent network nodes based on the current bandwidth utilization and traffic priority value of the forward and reverse links between the pair of adjacent network nodes; and it calculates the traffic assessment factor of the forward and reverse links between the pair of adjacent network nodes based on the current latency of the forward and reverse links between the pair of adjacent network nodes. Based on the current jitter rate, current packet loss rate, link cost value, and link attribute information, calculate the link cost evaluation factors for the forward and reverse links between the pair of adjacent network nodes. Then, based on the calculated link quality evaluation factors, traffic evaluation factors, and link cost evaluation factors for the forward and reverse links between the pair of adjacent network nodes, calculate the path weight values ​​between the pair of adjacent network nodes. Finally, based on the calculated path weight values ​​between all adjacent network nodes, use Dijkstra's algorithm to determine the shortest path from the source node of the target service traffic to the destination node of the target service traffic in the network topology. The determined path is designated as the forward forwarding path for the service traffic, and the corresponding reverse path is designated as the reverse forwarding path for the service traffic.

[0023] In the above path determination process, factors such as link quality, traffic priority, bandwidth, and link cost of the forward and reverse links between adjacent network nodes are comprehensively considered. In this way, not only are the network nodes on the determined forwarding path used to forward relevant service traffic the same as those on the reverse forwarding path, but the transmission quality of these two paths is also optimized to meet the user's needs and improve the user experience.

[0024] It should be understood that the above general description and the following detailed description are exemplary and explanatory only, and do not limit this application. Attached Figure Description

[0025] The accompanying drawings, which are incorporated in and form part of this application, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application.

[0026] Figure 1 A flowchart illustrating a path determination method provided in an embodiment of this application;

[0027] Figure 2 This application provides a network topology diagram of the target network managed by the SDN controller in an embodiment of the application.

[0028] Figure 3 This is a schematic diagram of the structure of a path determination device provided in an embodiment of this application;

[0029] Figure 4 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. Detailed Implementation

[0030] Exemplary embodiments will now be described in detail, examples of which are illustrated in the accompanying drawings. When the following description relates to the drawings, unless otherwise indicated, the same numbers in different drawings denote the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with this application. Rather, they are merely examples of apparatuses and methods consistent with some aspects of this application as detailed in the appended claims.

[0031] The terminology used in this application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. The singular forms “a,” “the,” and “the” used in this application and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise. It should also be understood that the term “and / or” as used herein refers to and includes any or all possible combinations of one or more of the associated listed items.

[0032] The embodiments of this application will now be described in detail.

[0033] This application provides a path determination method, which is applied to an SDN controller, such as... Figure 1 As shown, the method may include the following steps:

[0034] S11. When it is necessary to determine the forwarding path of the target service traffic, obtain the network topology map of the target network managed by the SDN controller.

[0035] S12. For each pair of adjacent network nodes in the obtained network topology graph, calculate the link quality evaluation factor of the forward and reverse links between the pair of adjacent network nodes based on the current latency, current jitter rate and current packet loss rate of the forward and reverse links between the pair of adjacent network nodes.

[0036] S13. Based on the current bandwidth utilization and traffic priority values ​​of the forward and reverse links between the adjacent network nodes, calculate the traffic evaluation factors of the forward and reverse links between the adjacent network nodes.

[0037] S14. Based on the current latency, current jitter rate, current packet loss rate, link cost value, and link attribute information of the forward and reverse links between the pair of adjacent network nodes, calculate the link cost evaluation factor of the forward and reverse links between the pair of adjacent network nodes.

[0038] S15. Based on the calculated link quality evaluation factor, traffic evaluation factor, and link cost evaluation factor of the forward and reverse links between the pair of adjacent network nodes, calculate the path weight value between the pair of adjacent network nodes.

[0039] S16. Based on the calculated path weight values ​​between all adjacent network nodes, use Dijkstra's algorithm to determine the shortest path from the source node of the target service traffic to the destination node of the target service traffic in the network topology graph.

[0040] S17. The determined path is designated as the forward forwarding path of the target service traffic, and the corresponding reverse path is designated as the reverse forwarding path of the target service traffic.

[0041] It should be noted that in step S11 above, when the target service traffic needs to be forwarded initially, the SDN controller can be considered as needing to determine the forwarding path of the target service traffic; when the path (forward forwarding path or reverse forwarding path) for forwarding the target service traffic is abnormal, the SDN controller can also be considered as needing to determine the forwarding path of the target service traffic; of course, the SDN controller can also consider it necessary to determine the forwarding path of the target service traffic in other situations, which will not be listed here.

[0042] In this embodiment, after executing step S11, the SDN controller may first execute any one of steps S12 to S14, then execute any one of the remaining two steps, and finally execute the remaining step. That is, this application does not limit the order in which the SDN controller executes steps S12 to S14.

[0043] Specifically, in step S12 above, the SDN controller can calculate the link quality evaluation factors for the forward and reverse links between the pair of adjacent network nodes in the following manner:

[0044] The link quality assessment factor for the forward link between the pair of adjacent network nodes is calculated using the following formula:

[0045] Formula 1: Q l =w1(1-aD) l )+w2(1-bJ l )+w3(1-L l );

[0046] Among them, Q l Q is the link quality assessment factor for the forward link between this pair of adjacent network nodes. l Used to evaluate the quality of the forward link;

[0047] D l The current latency of the forward link between the pair of adjacent network nodes, obtained by the SDN controller;

[0048] J l The current jitter rate of the forward link between the pair of adjacent network nodes, obtained by the SDN controller;

[0049] L l The current packet loss rate of the forward link between the pair of adjacent network nodes, obtained by the SDN controller;

[0050] a = 1 / 1600, b = 1 / 1600;

[0051] In D l When >1 / a, w1 = 0; in D l When ≤1 / a, w1=0.2;

[0052] In J l When >1 / b, w2 = 0; in J l When ≤1 / b, w2=0.2; w3=0.6;

[0053] The link quality assessment factor for the reverse link between the two adjacent network nodes is calculated using the following formula:

[0054] Formula 2: Q m =w1(1-aD) m )+w2(1-bJ m )+w3(1-L m );

[0055] Among them, Q mQ is the link quality evaluation factor for the reverse link between this pair of adjacent network nodes. m Used to assess the link quality of this reverse link;

[0056] D m The current latency of the reverse link between the pair of adjacent network nodes, obtained by the SDN controller:

[0057] J m The current jitter rate of the reverse link between the pair of adjacent network nodes, obtained by the SDN controller;

[0058] L m The current packet loss rate of the reverse link between the pair of adjacent network nodes, obtained by the SDN controller;

[0059] a = 1 / 1600, b = 1 / 1600;

[0060] In D m When >1 / a, w1 = 0; in D m When ≤1 / a, w1=0.2;

[0061] In J m When >1 / b, w2 = 0; in J m When ≤1 / b, w2=0.2; w3=0.6.

[0062] In step S13 above, the SDN controller can calculate the traffic evaluation factors for the forward and reverse links between the pair of adjacent network nodes in the following way:

[0063] The traffic evaluation factor for the forward link between the two adjacent network nodes is calculated using the following formula:

[0064] Formula 3: F s =w p B s ;

[0065] Among them, F s F is the traffic evaluation factor for the forward link between the two adjacent network nodes. s Used to assess the speed of traffic transmission on the forward link;

[0066] w p The traffic priority value of the forward link between the two adjacent network nodes obtained by the SDN controller, where 0 < w p ≤1;

[0067] B s The bandwidth utilization of the forward link between the pair of adjacent network nodes, calculated by the SDN controller, is initially B. s=1, in non-initial cases, B s = Current bandwidth of the forward link between the two adjacent network nodes / Set minimum bandwidth;

[0068] The traffic evaluation factor for the reverse link between the two adjacent network nodes is calculated using the following formula:

[0069] Formula 4: F r =w q B r ;

[0070] Among them, F r F is the traffic evaluation factor for the reverse link between adjacent network nodes. r Used to assess the speed of traffic transmission on the reverse link;

[0071] w q The traffic priority value of the reverse link between the pair of adjacent network nodes obtained by the SDN controller, 0 < w q ≤1;

[0072] B r The bandwidth utilization of the reverse link between the pair of adjacent network nodes, calculated by the SDN controller, is initially B. r =1, in non-initial cases, B r = Current bandwidth of the reverse link between the two adjacent network nodes / Minimum bandwidth set.

[0073] In step S14 above, the SDN controller can calculate the link cost evaluation factors for the forward and reverse links between the pair of adjacent network nodes in the following way:

[0074] The link cost evaluation factor for the forward link between the two adjacent network nodes is calculated using the following formula:

[0075] Formula 5:

[0076] Among them, C l C is the link cost evaluation factor for the forward link between the two adjacent network nodes. l Used to evaluate the link overhead of the forward link;

[0077] D T J is the set delay threshold. T L is the set jitter rate threshold. T The set delay threshold;

[0078] Cost l The link cost value of the forward link between the pair of adjacent network nodes obtained by the SDN controller;

[0079] l1 is the affinity attribute color of the path corresponding to the forward link between the pair of adjacent network nodes, obtained by the SDN controller;

[0080] l2 is the evasion attribute color of the path corresponding to the forward link between the pair of adjacent network nodes, obtained by the SDN controller.

[0081] Color is the set of colors for affinity attributes, and Void is the set of colors for avoidance attributes;

[0082] V color V is the set affinity coefficient. void The set avoidance attribute coefficient;

[0083] l1∈Color represents that at least one affinity attribute color of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller is in the set affinity attribute color set;

[0084] This means that all affinity attribute colors of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller are not in the set affinity attribute color set;

[0085] l2∈Void represents that at least one evasion attribute color of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller is in the set evasion attribute color set;

[0086] This means that all the avoidance attribute colors of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller are not in the set avoidance attribute color set;

[0087] The link cost evaluation factor for the reverse link between the two adjacent network nodes is calculated using the following formula:

[0088] Formula Six:

[0089] Among them, C m C is the link cost evaluation factor for the reverse link between the two adjacent network nodes. m Used to evaluate the link overhead of the reverse link;

[0090] D T J T and L T The value of is the same as D in Formula 5. T J T and L T The values ​​are the same;

[0091] Cost m The link cost value of the reverse link between the pair of adjacent network nodes obtained by the SDN controller;

[0092] l3 is the affinity attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes, obtained by the SDN controller.

[0093] l4 is the evasion attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes, obtained by the SDN controller.

[0094] Color, Void, V color and V void The meanings of Color, Void, and V in Formula 5 color and V void The contents are the same;

[0095] l3∈Color represents that at least one affinity attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller is in the set affinity attribute color set;

[0096] This means that all affinity attribute colors of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller are not in the set affinity attribute color set;

[0097] l4∈Void represents that at least one evasion attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller is in the set evasion attribute color set.

[0098] The avoidance attribute colors for all paths corresponding to the reverse links between the pair of adjacent network nodes obtained by the SDN controller are not in the set avoidance attribute color set;

[0099] V color <V void V color >5Cost l And V color >5Cost m .

[0100] It should be noted that, in this embodiment of the application, an affinity attribute color set, an avoidance attribute color set, a set of affinity attribute coefficients, and a set of avoidance attribute coefficients are configured in advance on the SDN controller side. Furthermore, the SDN controller side also records the affinity attribute color and avoidance attribute color of the forward and reverse links between each pair of adjacent network nodes in the network topology diagram of the target network it manages. This is to optimize the link cost values ​​of the corresponding forward and reverse links based on the affinity attribute color and avoidance attribute color of the forward and reverse links between each pair of adjacent network nodes, so as to determine the forwarding path with the best transmission quality.

[0101] Taking a forward link between a pair of adjacent network nodes as an example, suppose the affinity attribute color of this forward link is red and yellow, and the avoidance attribute color is blue; further suppose the affinity attribute color set includes red, green, and yellow, and the avoidance attribute color set includes blue, orange, and pink; then, since red is in the affinity attribute color set and blue is in the avoidance attribute color set, the link cost factor of this forward link is the link cost value of the forward link + V. void .

[0102] In step S15 above, the SDN controller can calculate the path weight value between the pair of adjacent network nodes in the following way:

[0103] The path weight between the pair of adjacent network nodes is calculated using the following formula:

[0104] Formula 7:

[0105] Where M is the path weight value between the pair of adjacent network nodes;

[0106] F s This is the traffic evaluation factor for the forward link between the two adjacent network nodes;

[0107] C l This is the link cost evaluation factor for the forward link between the two adjacent network nodes;

[0108] F r This is the traffic evaluation factor for the reverse link between the two adjacent network nodes;

[0109] C m This is the link cost evaluation factor for the reverse link between the two adjacent network nodes;

[0110] Q l This is the link quality assessment factor for the forward link between the two adjacent network nodes;

[0111] Q mThis is the link quality assessment factor for the reverse link between the two adjacent network nodes;

[0112] c = 0.2.

[0113] It should be noted that, for the SDN controller, information such as the current latency, current jitter rate, current packet loss rate, traffic priority value, and link cost value of the forward and reverse links between each pair of adjacent network nodes can be obtained through existing methods. The acquisition process will not be described in detail here.

[0114] It should be further noted that the process of determining the shortest path from the source node of the target service traffic to the destination node of the target service traffic in the network topology graph using the Dijkstra algorithm in step S16 above is existing technology and will not be described in detail here.

[0115] For example, suppose initially, the SDN controller needs to determine the forwarding path of service traffic 1 in network 1. The SDN controller first obtains the network topology map of network 1 (e.g., ...). Figure 2 (as shown); then, the SDN controller can calculate the network node A by executing the above steps S12 to S15. Figure 2 The diagram shows A and network node C. Figure 2 The weight values ​​between network node C and network node B are shown in the figure. Figure 2 The weight values ​​between B and C are shown in the figure, and the weight values ​​between network node C and network node D are shown in the figure. Figure 2 The weight values ​​between network node C and network node G are shown in the figure below. Figure 2 The weight values ​​between network node C and network node J are shown in the figure. Figure 2 The weight values ​​between network node D and network node E are shown in the figure. Figure 2 The weight values ​​between network node G and network node H are shown in the figure (E). Figure 2 The weight values ​​between network node J and network node K are shown in the figure below (H). Figure 2 The weight values ​​between network node E and network node F are shown in K). Figure 2 The weight values ​​between network node H and network node I are shown in the figure. Figure 2 The weight values ​​between network node K and network node L are shown in the figure. Figure 2 The weight values ​​between network node F and network node M are shown in the figure (L). Figure 2 The weight values ​​between network node I and network node M, the weight values ​​between network node L and network node M, and the weight values ​​between network node M and network node N (shown as M) are as follows: Figure 2 The weight values ​​between network node M and network node P are shown in the figure. Figure 2The values ​​shown in the middle are the weights between P and P.

[0116] The subsequent SDN controller can determine, based on the calculated path weights between all adjacent network nodes, using Dijkstra's algorithm, how to... Figure 2 The network topology diagram shown illustrates the shortest path from the source node (e.g., network node A) of traffic flow 1 to the destination node (e.g., network node P) of traffic flow 1. This determined path is then designated as the forwarding path for traffic flow 1. For example, ... Figure 2 The path shown is A->C->D->E->F->M->P, and the reverse path corresponding to the determined path is set as the reverse forwarding path for service traffic 1. For example, ... Figure 2 The diagram shows P->M->F->E->D->C->A.

[0117] As can be seen from the above technical solutions, in this embodiment of the application, for the SDN controller, when it is necessary to determine the forwarding path of the target service traffic, it can first obtain the network topology map of the target network managed by the SDN controller; then, for each pair of adjacent network nodes in the obtained network topology map, based on the current latency, current jitter rate, and current packet loss rate of the forward and reverse links between the pair of adjacent network nodes, the link quality evaluation factor of the forward and reverse links between the pair of adjacent network nodes is calculated; based on the current bandwidth utilization and traffic priority value of the forward and reverse links between the pair of adjacent network nodes, the traffic ... Based on the current latency, current jitter rate, current packet loss rate, link cost, and link attribute information of the path, calculate the link cost evaluation factors for the forward and reverse links between the pair of adjacent network nodes. Then, based on the calculated link quality evaluation factors, traffic evaluation factors, and link cost evaluation factors for the forward and reverse links between the pair of adjacent network nodes, calculate the path weight values ​​between the pair of adjacent network nodes. Finally, based on the calculated path weight values ​​between all adjacent network nodes, use Dijkstra's algorithm to determine the shortest path from the source node of the target service traffic to the destination node of the target service traffic in the network topology. The determined path is designated as the forward forwarding path for the service traffic, and the corresponding reverse path is designated as the reverse forwarding path for the service traffic.

[0118] In the above path determination process, factors such as link quality, traffic priority, bandwidth, and link cost of the forward and reverse links between adjacent network nodes are comprehensively considered. In this way, not only are the network nodes on the determined forwarding path used to forward relevant service traffic the same as those on the reverse forwarding path, but the transmission quality of these two paths is also optimized to meet the user's needs and improve the user experience.

[0119] Based on the same inventive concept, this application also provides a path determination device, which is applied to an SDN controller, and its structural schematic diagram is shown below. Figure 3 As shown, it specifically includes:

[0120] The acquisition module 31 is used to acquire the network topology map of the target network managed by the SDN controller when it is necessary to determine the forwarding path of the target service traffic;

[0121] The first calculation module 32 is used to calculate the link quality evaluation factor of the forward and reverse links between each pair of adjacent network nodes in the obtained network topology graph, based on the current latency, current jitter rate and current packet loss rate of the forward and reverse links between the pair of adjacent network nodes.

[0122] The second calculation module 33 is used to calculate the traffic evaluation factors of the forward and reverse links between the adjacent network nodes based on the current bandwidth utilization and traffic priority values ​​of the forward and reverse links between the adjacent network nodes.

[0123] The third calculation module 34 is used to calculate the link cost evaluation factor of the forward and reverse links between the pair of adjacent network nodes based on the current latency, current jitter rate, current packet loss rate, link cost value and link attribute information of the forward and reverse links between the pair of adjacent network nodes.

[0124] The fourth calculation module 35 is used to calculate the path weight value between the pair of adjacent network nodes based on the calculated link quality evaluation factor, traffic evaluation factor and link cost evaluation factor of the forward and reverse links between the pair of adjacent network nodes.

[0125] The first determining module 36 is used to determine the shortest path from the source node of the target service traffic to the destination node of the target service traffic in the network topology graph based on the calculated path weight values ​​between all adjacent network nodes and using the Dijkstra algorithm.

[0126] The second determining module 37 is used to determine the determined path as the forward forwarding path of the target service traffic, and to determine the reverse path corresponding to the determined path as the reverse forwarding path of the target service traffic.

[0127] Preferably, the first calculation module 32 is specifically used to calculate the link quality evaluation factors of the forward and reverse links between the pair of adjacent network nodes in the following manner:

[0128] The link quality assessment factor for the forward link between the two adjacent network nodes is calculated using the following formula:

[0129] Formula 1: Q l =w1(1-aD) l )+w2(1-bJ l )+w3(1-L l );

[0130] Among them, Q l This is the link quality assessment factor for the forward link between the two adjacent network nodes;

[0131] D l The current latency of the forward link between the pair of adjacent network nodes is obtained by the SDN controller.

[0132] J l The current jitter rate of the forward link between the pair of adjacent network nodes, obtained by the SDN controller;

[0133] L l The current packet loss rate of the forward link between the pair of adjacent network nodes is obtained by the SDN controller.

[0134] a = 1 / 1600, b = 1 / 1600;

[0135] In D l When >1 / a, w1 = 0; in D l When ≤1 / a, w1=0.2;

[0136] In J l When >1 / b, w2 = 0; in J l When ≤1 / b, w2=0.2; w3=0.6;

[0137] The link quality assessment factor for the reverse link between the two adjacent network nodes is calculated using the following formula:

[0138] Formula 2: Q m =w1(1-aD) m )+w2(1-bJ m )+w3(1-Lm );

[0139] Among them, Q m This is the link quality assessment factor for the reverse link between the two adjacent network nodes;

[0140] D m The current latency of the reverse link between the pair of adjacent network nodes is obtained by the SDN controller.

[0141] J m The current jitter rate of the reverse link between the pair of adjacent network nodes, obtained by the SDN controller;

[0142] L m The current packet loss rate of the reverse link between the pair of adjacent network nodes is obtained by the SDN controller.

[0143] a = 1 / 1600, b = 1 / 1600;

[0144] In D m When >1 / a, w1 = 0; in D m When ≤1 / a, w1=0.2;

[0145] In J m When >1 / b, w2 = 0; in J m When ≤1 / b, w2=0.2; w3=0.6.

[0146] Preferably, the second calculation module 33 is specifically used to calculate the traffic evaluation factors of the forward and reverse links between the pair of adjacent network nodes in the following manner:

[0147] The traffic evaluation factor for the forward link between the two adjacent network nodes is calculated using the following formula:

[0148] Formula 3: F s =w p B s ;

[0149] Among them, F s This is the traffic evaluation factor for the forward link between the two adjacent network nodes;

[0150] w p The traffic priority value of the forward link between the pair of adjacent network nodes obtained by the SDN controller, where 0 < w p ≤1;

[0151] B s The bandwidth utilization rate of the forward link between the pair of adjacent network nodes calculated by the SDN controller is initially B. s=1, in non-initial cases, B s = Current bandwidth of the forward link between the two adjacent network nodes / Set minimum bandwidth;

[0152] The traffic evaluation factor for the reverse link between the two adjacent network nodes is calculated using the following formula:

[0153] Formula 4: F r =w q B r ;

[0154] Among them, F r This is the traffic evaluation factor for the reverse link between the two adjacent network nodes;

[0155] w q The traffic priority value of the reverse link between the pair of adjacent network nodes obtained by the SDN controller, where 0 < w q ≤1;

[0156] B r The bandwidth utilization rate of the reverse link between the pair of adjacent network nodes calculated by the SDN controller is initially B. r =1, in non-initial cases, B r = Current bandwidth of the reverse link between the two adjacent network nodes / Minimum bandwidth set.

[0157] Preferably, the third calculation module 34 is specifically used to calculate the link cost evaluation factors of the forward and reverse links between the pair of adjacent network nodes in the following manner:

[0158] The link cost evaluation factor for the forward link between the two adjacent network nodes is calculated using the following formula:

[0159] Formula 5:

[0160] Among them, C l This is the link cost evaluation factor for the forward link between the two adjacent network nodes;

[0161] D T J is the set delay threshold. T L is the set jitter rate threshold. T The set delay threshold;

[0162] Cost l The link cost value of the forward link between the pair of adjacent network nodes obtained by the SDN controller;

[0163] l1 is the affinity attribute color of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller;

[0164] l2 is the avoidance attribute color of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller.

[0165] Color is the set of colors for affinity attributes, and Void is the set of colors for avoidance attributes;

[0166] V color V is the set affinity coefficient. void The set avoidance attribute coefficient;

[0167] 21∈Color represents that at least one affinity attribute color of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller is in the set affinity attribute color set;

[0168] All affinity attribute colors representing the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller are not in the set affinity attribute color set;

[0169] l2∈Void represents that at least one evasion attribute color of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller is in the set evasion attribute color set.

[0170] All the avoidance attribute colors of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller are not in the set avoidance attribute color set;

[0171] The link cost evaluation factor for the reverse link between adjacent network nodes is calculated using the following formula:

[0172] Formula Six:

[0173] Among them, C m This is the link cost evaluation factor for the reverse link between the two adjacent network nodes;

[0174] D T J T and L T The value of is the same as D in Formula 5. T J T and L T The values ​​are the same;

[0175] Cost mThe link cost value of the reverse link between the pair of adjacent network nodes obtained by the SDN controller;

[0176] l3 is the affinity attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller;

[0177] l4 is the evasion attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller.

[0178] Color, Void, V color and V void The meanings of Color, Void, and V in Formula 5 color and V void The contents are the same;

[0179] l3∈Color represents at least one affinity attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller, which is in the set affinity attribute color set;

[0180] All affinity attribute colors representing the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller are not in the set affinity attribute color set;

[0181] l4∈Void represents that at least one evasion attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller is in the set evasion attribute color set.

[0182] All the avoidance attribute colors of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller are not in the set avoidance attribute color set;

[0183] V color <V void V color >5Cost l And V color >5Cost m .

[0184] Preferably, the fourth calculation module 35 is specifically used to calculate the path weight value between the pair of adjacent network nodes in the following manner:

[0185] The path weight between the pair of adjacent network nodes is calculated using the following formula:

[0186] Formula 7:

[0187] Where M is the path weight value between the pair of adjacent network nodes;

[0188] F s This is the traffic evaluation factor for the forward link between the two adjacent network nodes;

[0189] C l This is the link cost evaluation factor for the forward link between the two adjacent network nodes;

[0190] F r This is the traffic evaluation factor for the reverse link between the two adjacent network nodes;

[0191] C m This is the link cost evaluation factor for the reverse link between the two adjacent network nodes;

[0192] Q l This is the link quality assessment factor for the forward link between the two adjacent network nodes;

[0193] Q m This is the link quality assessment factor for the reverse link between the two adjacent network nodes;

[0194] c = 0.2.

[0195] As can be seen from the above technical solutions, in this embodiment of the application, for the SDN controller, when it is necessary to determine the forwarding path of the target service traffic, it can first obtain the network topology map of the target network managed by the SDN controller; then, for each pair of adjacent network nodes in the obtained network topology map, based on the current latency, current jitter rate, and current packet loss rate of the forward and reverse links between the pair of adjacent network nodes, the link quality evaluation factor of the forward and reverse links between the pair of adjacent network nodes is calculated; based on the current bandwidth utilization and traffic priority value of the forward and reverse links between the pair of adjacent network nodes, the traffic ... Based on the current latency, current jitter rate, current packet loss rate, link cost, and link attribute information of the path, calculate the link cost evaluation factors for the forward and reverse links between the pair of adjacent network nodes. Then, based on the calculated link quality evaluation factors, traffic evaluation factors, and link cost evaluation factors for the forward and reverse links between the pair of adjacent network nodes, calculate the path weight values ​​between the pair of adjacent network nodes. Finally, based on the calculated path weight values ​​between all adjacent network nodes, use Dijkstra's algorithm to determine the shortest path from the source node of the target service traffic to the destination node of the target service traffic in the network topology. The determined path is designated as the forward forwarding path for the service traffic, and the corresponding reverse path is designated as the reverse forwarding path for the service traffic.

[0196] In the above path determination process, factors such as link quality, traffic priority, bandwidth, and link cost of the forward and reverse links between adjacent network nodes are comprehensively considered. In this way, not only are the network nodes on the determined forwarding path used to forward relevant service traffic the same as those on the reverse forwarding path, but the transmission quality of these two paths is also optimized to meet the user's needs and improve the user experience.

[0197] This application also provides an electronic device, such as... Figure 4 As shown, it includes a processor 41 and a machine-readable storage medium 42, the machine-readable storage medium 42 storing machine-executable instructions that can be executed by the processor 41, the processor 41 being prompted by the machine-executable instructions to implement the steps of the above-described path determination method.

[0198] The aforementioned machine-readable storage medium may include random access memory (RAM) or non-volatile memory (NVM), such as at least one disk storage device. Optionally, the machine-readable storage medium may also be at least one storage device located remotely from the aforementioned processor.

[0199] The processors mentioned above can be general-purpose processors, including central processing units (CPUs), network processors (NPs), etc.; they can also be digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.

[0200] In another embodiment provided in this application, a computer-readable storage medium is also provided, which stores a computer program that, when executed by a processor, implements the steps of the path determination method described above.

[0201] The above description is merely a preferred embodiment of this application and is not intended to limit this application. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the scope of protection of this application.

Claims

1. A path determination method, characterized in that, The method is applied to an SDN controller, and the method includes: When it is necessary to determine the forwarding path of target service traffic, obtain the network topology map of the target network managed by the SDN controller; For each pair of adjacent network nodes in the obtained network topology graph, the link quality evaluation factor of the forward and reverse links between the pair of adjacent network nodes is calculated based on the current latency, current jitter rate and current packet loss rate of the forward and reverse links between the pair of adjacent network nodes. Based on the current bandwidth utilization and traffic priority values ​​of the forward and reverse links between the adjacent network nodes, calculate the traffic evaluation factors of the forward and reverse links between the adjacent network nodes. Based on the current latency, current jitter rate, current packet loss rate, link cost value, and link attribute information of the forward and reverse links between the pair of adjacent network nodes, calculate the link cost evaluation factor of the forward and reverse links between the pair of adjacent network nodes. Based on the calculated link quality evaluation factor, traffic evaluation factor and link cost evaluation factor of the forward and reverse links between the pair of adjacent network nodes, calculate the path weight value between the pair of adjacent network nodes. Based on the calculated path weights between all adjacent network nodes, the Dijkstra algorithm is used to determine the shortest path from the source node of the target service traffic to the destination node of the target service traffic in the network topology graph. The determined path is designated as the forward forwarding path of the target service traffic, and the corresponding reverse path is designated as the reverse forwarding path of the target service traffic.

2. The method according to claim 1, characterized in that, The link quality assessment factors for the forward and reverse links between the two adjacent network nodes are calculated as follows: The link quality assessment factor for the forward link between the pair of adjacent network nodes is calculated using the following formula: Formula 1: Q l =w1(1-aD) l )+w2(1-bJ l )+w3(1-L l ); Among them, Q l This is the link quality assessment factor for the forward link between the two adjacent network nodes; D l The current latency of the forward link between the pair of adjacent network nodes is obtained by the SDN controller. J l The current jitter rate of the forward link between the pair of adjacent network nodes, obtained by the SDN controller; L l The current packet loss rate of the forward link between the pair of adjacent network nodes is obtained by the SDN controller. a = 1 / 1600, b = 1 / 1600; In D l When >1 / a, w1 = 0; in D l When ≤1 / a, w1=0.2; In J l When >1 / b, w2 = 0; in J l When ≤1 / b, w2=0.2; w3=0.6; The link quality assessment factor for the reverse link between the two adjacent network nodes is calculated using the following formula: Formula 2: Q m =w1(1-aD) m )+w2(1-bJ m )+w3(1-L m ); Among them, Q m This is the link quality assessment factor for the reverse link between the two adjacent network nodes; D m The current latency of the reverse link between the pair of adjacent network nodes is obtained by the SDN controller. J m The current jitter rate of the reverse link between the pair of adjacent network nodes, obtained by the SDN controller; L m The current packet loss rate of the reverse link between the pair of adjacent network nodes is obtained by the SDN controller. a = 1 / 1600, b = 1 / 1600; In D m When >1 / a, w1 = 0; in D m When ≤1 / a, w1=0.2; In J m When >1 / b, w2 = 0; in J m When ≤1 / b, w2=0.2; w3=0.

6.

3. The method according to claim 2, characterized in that, The traffic evaluation factors for the forward and reverse links between this pair of adjacent network nodes are calculated as follows: The traffic evaluation factor for the forward link between the two adjacent network nodes is calculated using the following formula: Formula 3: F s =w p B s ; Among them, F s This is the traffic evaluation factor for the forward link between the two adjacent network nodes; w p The traffic priority value of the forward link between the pair of adjacent network nodes obtained by the SDN controller, where 0 < w p ≤1; B s The bandwidth utilization rate of the forward link between the pair of adjacent network nodes calculated by the SDN controller is initially B. s =1, in non-initial cases, B s = Current bandwidth of the forward link between the two adjacent network nodes / Set minimum bandwidth; The traffic evaluation factor for the reverse link between the two adjacent network nodes is calculated using the following formula: Formula 4: F r =w q B r ; Among them, F r This is the traffic evaluation factor for the reverse link between the two adjacent network nodes; w q The traffic priority value of the reverse link between the pair of adjacent network nodes obtained by the SDN controller, where 0 < w q ≤1; B r The bandwidth utilization rate of the reverse link between the pair of adjacent network nodes calculated by the SDN controller is initially B. r =1, in non-initial cases, B r = Current bandwidth of the reverse link between the two adjacent network nodes / Minimum bandwidth set.

4. The method according to claim 3, characterized in that, The link cost evaluation factors for the forward and reverse links between this pair of adjacent network nodes are calculated as follows: The link cost evaluation factor for the forward link between the two adjacent network nodes is calculated using the following formula: Formula 5: Among them, C l This is the link cost evaluation factor for the forward link between the two adjacent network nodes; D T J is the set delay threshold. T L is the set jitter rate threshold. T The set delay threshold; Cost l The link cost value of the forward link between the pair of adjacent network nodes obtained by the SDN controller; l1 is the affinity attribute color of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller; l2 is the avoidance attribute color of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller. Color is the set of colors for affinity attributes, and Void is the set of colors for avoidance attributes; V color V is the set affinity coefficient. void The set avoidance attribute coefficient; l1∈Color represents that at least one affinity attribute color of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller is in the set affinity attribute color set; All affinity attribute colors representing the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller are not in the set affinity attribute color set; l2∈Void represents that at least one evasion attribute color of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller is in the set evasion attribute color set. All the avoidance attribute colors of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller are not in the set avoidance attribute color set; The link cost evaluation factor for the reverse link between the two adjacent network nodes is calculated using the following formula: Formula Six: Among them, C m This is the link cost evaluation factor for the reverse link between the two adjacent network nodes; D T J T and L T The value of is the same as D in Formula 5. T J T and L T The values ​​are the same; Cost m The link cost value of the reverse link between the pair of adjacent network nodes obtained by the SDN controller; l3 is the affinity attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller; l4 is the evasion attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller. Color, Void, V color and V void The meanings of Color, Void, and V in Formula 5 color and V void The contents are the same; l3∈Color represents at least one affinity attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller, which is in the set affinity attribute color set; All affinity attribute colors representing the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller are not in the set affinity attribute color set; l4∈Void represents that at least one evasion attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller is in the set evasion attribute color set. All the avoidance attribute colors of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller are not in the set avoidance attribute color set; V color <V void V color >nCost l And V color >n Cost m n is a positive integer greater than 1.

5. The method according to claim 4, characterized in that, The path weight between the pair of adjacent network nodes is calculated in the following way: The path weight between the pair of adjacent network nodes is calculated using the following formula: Formula 7: Where M is the path weight value between the pair of adjacent network nodes; F s This is the traffic evaluation factor for the forward link between the two adjacent network nodes; C l This is the link cost evaluation factor for the forward link between the two adjacent network nodes; F r This is the traffic evaluation factor for the reverse link between the two adjacent network nodes; C m This is the link cost evaluation factor for the reverse link between the two adjacent network nodes; Q l This is the link quality assessment factor for the forward link between the two adjacent network nodes; Q m This is the link quality assessment factor for the reverse link between the two adjacent network nodes; c＝0.2。 6. A path determination device, characterized in that, The device is used in an SDN controller, and the device includes: The acquisition module is used to acquire the network topology map of the target network managed by the SDN controller when it is necessary to determine the forwarding path of the target service traffic; The first calculation module is used to calculate the link quality evaluation factor of the forward and reverse links between each pair of adjacent network nodes in the obtained network topology graph, based on the current latency, current jitter rate and current packet loss rate of the forward and reverse links between the pair of adjacent network nodes. The second calculation module is used to calculate the traffic evaluation factors of the forward and reverse links between the adjacent network nodes based on the current bandwidth utilization and traffic priority values ​​of the forward and reverse links between the adjacent network nodes. The third calculation module is used to calculate the link cost evaluation factor of the forward and reverse links between the pair of adjacent network nodes based on the current latency, current jitter rate, current packet loss rate, link cost value and link attribute information of the forward and reverse links between the pair of adjacent network nodes. The fourth calculation module is used to calculate the path weight value between the pair of adjacent network nodes based on the calculated link quality evaluation factor, traffic evaluation factor and link cost evaluation factor of the forward and reverse links between the pair of adjacent network nodes. The first determining module is used to determine the shortest path from the source node of the target service traffic to the destination node of the target service traffic in the network topology graph based on the calculated path weight values ​​between all adjacent network nodes and using the Dijkstra algorithm. The second determining module is used to determine the determined path as the forward forwarding path of the target service traffic, and to determine the reverse path corresponding to the determined path as the reverse forwarding path of the target service traffic.

7. The apparatus according to claim 6, characterized in that, The first calculation module is specifically used to calculate the link quality evaluation factors of the forward and reverse links between the pair of adjacent network nodes in the following manner: The link quality assessment factor for the forward link between the pair of adjacent network nodes is calculated using the following formula: Formula 1: Q l =w1(1-aD) l )+w2(1-bJ l )+w3(1-L l ); Among them, Q l This is the link quality assessment factor for the forward link between the two adjacent network nodes; D l The current latency of the forward link between the pair of adjacent network nodes is obtained by the SDN controller. J l The current jitter rate of the forward link between the pair of adjacent network nodes, obtained by the SDN controller; L l The current packet loss rate of the forward link between the pair of adjacent network nodes, obtained by the SDN controller; a = 1 / 1600, b = 1 / 1600; In D l When >1 / a, w1 = 0; in D l When ≤1 / a, w1=0.2; In J l When >1 / b, w2 = 0; in J l When ≤1 / b, w2=0.2; w3=0.6; The link quality assessment factor for the reverse link between the two adjacent network nodes is calculated using the following formula: Formula 2: Q m =w1(1-aD) m )+w2(1-bJ m )+w3(1-L m ); Among them, Q m This is the link quality assessment factor for the reverse link between the two adjacent network nodes; D m The current latency of the reverse link between the pair of adjacent network nodes is obtained by the SDN controller. J m The current jitter rate of the reverse link between the pair of adjacent network nodes, obtained by the SDN controller; L m The current packet loss rate of the reverse link between the pair of adjacent network nodes is obtained by the SDN controller. a = 1 / 1600, b = 1 / 1600; In D m When >1 / a, w1 = 0; in D m When ≤1 / a, w1=0.2; In J m When >1 / b, w2 = 0; in J m When ≤1 / b, w2=0.2; w3=0.

6.

8. The apparatus according to claim 7, characterized in that, The second calculation module is specifically used to calculate the traffic evaluation factors of the forward and reverse links between the pair of adjacent network nodes in the following manner: The traffic evaluation factor for the forward link between the two adjacent network nodes is calculated using the following formula: Formula 3: F s =w p B s ; Among them, F s This is the traffic evaluation factor for the forward link between the two adjacent network nodes; w p The traffic priority value of the forward link between the pair of adjacent network nodes obtained by the SDN controller, where 0 < w p ≤1; B s The bandwidth utilization rate of the forward link between the pair of adjacent network nodes calculated by the SDN controller is initially B. s =1, in non-initial cases, B s = Current bandwidth of the forward link between the two adjacent network nodes / Set minimum bandwidth; The traffic evaluation factor for the reverse link between the two adjacent network nodes is calculated using the following formula: Formula 4: F r =w q B r ; Among them, F r This is the traffic evaluation factor for the reverse link between the two adjacent network nodes; w q The traffic priority value of the reverse link between the pair of adjacent network nodes obtained by the SDN controller, where 0 < w q ≤1; B r The bandwidth utilization rate of the reverse link between the pair of adjacent network nodes calculated by the SDN controller is initially B. r =1, in non-initial cases, B r = Current bandwidth of the reverse link between the two adjacent network nodes / Minimum bandwidth set.

9. The apparatus according to claim 8, characterized in that, The third calculation module is specifically used to calculate the link cost evaluation factors for the forward and reverse links between the pair of adjacent network nodes in the following manner: The link cost evaluation factor for the forward link between the two adjacent network nodes is calculated using the following formula: Formula 5: Among them, C l This is the link cost evaluation factor for the forward link between the two adjacent network nodes; D T J is the set delay threshold. T L is the set jitter rate threshold. T The set delay threshold; Cost l The link cost value of the forward link between the pair of adjacent network nodes obtained by the SDN controller; l1 is the affinity attribute color of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller; l2 is the avoidance attribute color of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller. Color is the set of colors for affinity attributes, and Void is the set of colors for avoidance attributes; V color V is the set affinity coefficient. void The set avoidance attribute coefficient; l1∈Color represents that at least one affinity attribute color of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller is in the set affinity attribute color set; All affinity attribute colors representing the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller are not in the set affinity attribute color set; l2∈Void represents that at least one evasion attribute color of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller is in the set evasion attribute color set. All the avoidance attribute colors of the path corresponding to the forward link between the pair of adjacent network nodes obtained by the SDN controller are not in the set avoidance attribute color set; The link cost evaluation factor for the reverse link between the two adjacent network nodes is calculated using the following formula: Formula Six: Among them, C m This is the link cost evaluation factor for the reverse link between the two adjacent network nodes; D T J T and L T The value of is the same as D in Formula 5. T J T and L T The values ​​are the same; Cost m The link cost value of the reverse link between the pair of adjacent network nodes obtained by the SDN controller; l3 is the affinity attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller; l4 is the evasion attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller. Color, Void, V color and V void The meanings of Color, Void, and V in Formula 5 color and V void The contents are the same; l3∈Color represents at least one affinity attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller, which is in the set affinity attribute color set; All affinity attribute colors representing the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller are not in the set affinity attribute color set; l4∈Void represents that at least one evasion attribute color of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller is in the set evasion attribute color set. All the avoidance attribute colors of the path corresponding to the reverse link between the pair of adjacent network nodes obtained by the SDN controller are not in the set avoidance attribute color set; V color <V void ,V color >5Cost l ,且V color >5Cost m 。 10. The apparatus according to claim 9, characterized in that, The fourth calculation module is specifically used to calculate the path weight value between the pair of adjacent network nodes in the following manner: The path weight between the pair of adjacent network nodes is calculated using the following formula: Formula 7: Where M is the path weight value between the pair of adjacent network nodes; F s This is the traffic evaluation factor for the forward link between the two adjacent network nodes; C l This is the link cost evaluation factor for the forward link between the two adjacent network nodes; F r This is the traffic evaluation factor for the reverse link between the two adjacent network nodes; C m This is the link cost evaluation factor for the reverse link between the two adjacent network nodes; Q l This is the link quality assessment factor for the forward link between the two adjacent network nodes; Q m This is the link quality assessment factor for the reverse link between the two adjacent network nodes; c＝0.2。

Images