Path selection method and device
By adopting two computing targets in the communication network and dynamically selecting the transmission path according to the load situation, the load imbalance problem is solved, and efficient transmission and load balancing of service data are achieved.
Patent Information
- Application Number
- CN202310532025.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-05-10
- Publication Date
- 2024-11-12
AI Technical Summary
In communication networks, it is difficult for the prior art to effectively select appropriate transmission paths, resulting in unbalanced network load, some links are too high and other links are too low or idle, increasing the difficulty of network management and operation and maintenance.
A path selection method is proposed, using two arithmetic goals: select the path with the best cost, the best delay or the best hop number when the load is low; select the transmission path with the smallest path load when the load is high. to achieve load balancing.
By dynamically adjusting the transmission path, efficient transmission and load balancing of service data are achieved, avoiding the problems of traffic concentration and excessive link load, and reducing the difficulty of network management.
Smart Images

Figure CN118945093A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of information transmission, and more particularly to a method and device for selecting a path. Background Art
[0002] At present, with the development of communication networks, the topology of communication networks has gradually become complex. When it is necessary to transmit service data in the communication network, how to select a suitable transmission path for each service has become an important factor affecting the transmission efficiency of each service and the operation efficiency of the communication network. Summary of the invention
[0003] The present application provides a path selection method and device for selecting a transmission path for a service.
[0004] In the first aspect, a path selection method is provided, including: obtaining a path constraint corresponding to a first service. According to the path constraint, the first path calculation target and the load threshold, a transmission path of the first service that satisfies the first path calculation target and the path constraint and whose path load is lower than the load threshold is searched. If the transmission path of the first service that satisfies the first path calculation target and the path constraint and whose path load is lower than the load threshold is not found, the transmission path of the first service is determined according to the second path calculation target and the path constraint, and the second path calculation target is a path calculation target for determining the transmission path using the path load. In the above method of the present application, on the one hand, when the load in the network is low (for example, when the transmission path that satisfies the path constraint includes a transmission path whose load is lower than the load threshold), the first path calculation target can be used to select a transmission path with optimal cost, optimal delay or optimal number of hops as the transmission path of the first service, so as to achieve efficient transmission of the service data of the first service; on the other hand, when the load in the network is high (for example, when the load of the transmission path that satisfies the path constraint is higher than the load threshold), the second path calculation target can be used to determine the transmission path with lower path load in the transmission path that satisfies the path constraint as the transmission path of the first service, so as to achieve the effect of load balancing.
[0005] In one implementation, the load threshold includes: a bandwidth utilization threshold. The path load is lower than the load threshold, including: the maximum value of the bandwidth utilization of all links passed by the transmission path is lower than the bandwidth utilization threshold. Or, the load threshold includes: a residual bandwidth threshold. The path load is lower than the load threshold, including: the minimum value of the residual bandwidth of all links passed by the transmission path is higher than the residual bandwidth threshold. Through the above implementation, when the maximum value of the bandwidth utilization of the transmission path that meets the path constraint in the network is higher than the above bandwidth utilization threshold, or when the minimum value of the residual bandwidth of the transmission path that meets the path constraint in the network is lower than the residual bandwidth threshold, the second path calculation target is used to determine the transmission path with lower path load among the transmission paths that meet the path constraint as the transmission path of the first service, so as to achieve a load balancing effect.
[0006] In one implementation, the second path calculation objective includes: selecting a transmission path with the smallest path load. Through the above implementation, when the network load is high, the transmission path with the smallest path load among the transmission paths that meet the path constraints can be determined as the transmission path for the first service to achieve a load balancing effect.
[0007] In one implementation, the transmission path with the smallest path load includes: a transmission path with the smallest maximum value of bandwidth utilization of all links through which the transmission path passes; or, the transmission path with the smallest path load includes: a transmission path with the largest minimum value of remaining bandwidth of all links through which the transmission path passes.
[0008] In one implementation, the method further includes: determining a first path calculation target according to user input information; wherein the input information is used to determine the path calculation target corresponding to the first service. Through the above implementation, the user can set the first path calculation target as needed, so that when the network load is low, a transmission path can be allocated to the service according to the user's needs.
[0009] In one implementation, the first path calculation objective includes: selecting any one of a transmission path with the smallest cost, a transmission path with the smallest number of hops, or a transmission path with the lowest delay.
[0010] In one implementation, the first service is a tunnel service.
[0011] In a second aspect, a path selection device is provided, comprising: an acquisition unit, configured to acquire a path constraint of a first service; a processing unit, configured to search, based on the path constraint, a first path calculation target, and a load threshold, for a transmission path of the first service that satisfies the first path calculation target and the path constraint and whose path load is lower than the load threshold; and the processing unit is further configured to determine the transmission path of the first service based on a second path calculation target and the path constraint if a transmission path of the first service that satisfies the first path calculation target and the path constraint and whose path load is lower than the load threshold is not found, wherein the second path calculation target is a path calculation target that determines the transmission path using the path load.
[0012] In one implementation, the load threshold includes: a bandwidth utilization threshold; the path load being lower than the load threshold includes: the maximum value of the bandwidth utilization of all links through which the transmission path passes being lower than the bandwidth utilization threshold; or, the load threshold includes: a residual bandwidth threshold; the path load being lower than the load threshold includes: the minimum value of the residual bandwidth of all links through which the transmission path passes being higher than the residual bandwidth threshold.
[0013] In one implementation, the second path calculation objective includes: selecting a transmission path with the smallest path load.
[0014] In one implementation, the transmission path with the smallest path load includes: a transmission path with the smallest maximum value of bandwidth utilization of all links passed by the transmission path; or, the transmission path with the smallest path load includes: a transmission path with the largest minimum value of remaining bandwidth of all links passed by the transmission path.
[0015] In one implementation, the acquisition unit is further used to determine the first path calculation target according to user input information; wherein the input information is used to determine the path calculation target corresponding to the first service.
[0016] In one implementation, the first path calculation objective includes: selecting any one of a transmission path with the smallest cost, a transmission path with the smallest number of hops, or a transmission path with the lowest delay.
[0017] In one implementation, the first service is a tunnel service.
[0018] In a third aspect, a path selection device is provided, comprising a processor and an interface, wherein the processor receives or sends data through the interface, and wherein the processor is used to implement the method described in any one of the implementation modes of the second aspect after the first aspect.
[0019] In a fourth aspect, a software defined network (SDN) controller is provided, comprising a path selection device as described in any one of the second aspect or the third aspect.
[0020] According to a fifth aspect, a computer-readable storage medium is provided, wherein instructions are stored in the computer-readable storage medium. When the instructions are executed on a processor, the method described in any one of the implementation methods of the second aspect after the first aspect is implemented.
[0021] In a sixth aspect, a computer program product is provided, the computer program product comprising instructions, which, when executed on a processor, implement the method described in any one of the implementation modes of the second aspect after the first aspect. BRIEF DESCRIPTION OF THE DRAWINGS
[0022] Figure 1 One of the structural diagrams of a transmission network provided in an embodiment of the present application;
[0023] Figure 2 One of the flowcharts of a path selection method provided in an embodiment of the present application;
[0024] Figure 3 A second schematic diagram of a transmission network structure provided in an embodiment of the present application;
[0025] Figure 4 One of the structural diagrams of an SDN controller provided in an embodiment of the present application;
[0026] Figure 5 A second flowchart of a path selection method provided in an embodiment of the present application;
[0027] Figure 6 A third structural diagram of a transmission network provided in an embodiment of the present application;
[0028] Figure 7 A fourth structural diagram of a transmission network provided in an embodiment of the present application;
[0029] Figure 8 A fifth structural diagram of a transmission network provided in an embodiment of the present application;
[0030] Fig. 9 A sixth structural diagram of a transmission network provided in an embodiment of the present application;
[0031] Fig.10 One of the structural schematic diagrams of a path selection device provided in an embodiment of the present application;
[0032] Fig.11 A second structural diagram of a path selection device provided in an embodiment of the present application;
[0033] Fig.12 The third structural diagram of a path selection device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0034] The technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.
[0035] To facilitate understanding of the technical solutions provided in the embodiments of the present application, the relevant terms involved in the embodiments of the present application are first introduced:
[0036] 1. Path constraints
[0037] Path constraints refer to various constraints used to determine whether a transmission path can be used for a service (mainly taking tunnel services as an example below) when calculating the transmission path for the service. Taking a tunnel service as an example, the bandwidth, hop limit, latency limit, packet loss rate limit, bit error rate limit corresponding to the tunnel service, as well as the affinity attributes and network slice type corresponding to the tunnel service can all be used as a path constraint. In actual application, one or more path constraints can be set for a certain service, which may not be limited in the embodiments of the present application. In actual application, path constraints may also be referred to as constraints.
[0038] 2. Calculate the route target
[0039] The path calculation target refers to the condition for selecting the transmission path that is ultimately used to carry service data from all transmission paths that meet the path constraints when calculating the transmission path for the service.
[0040] Exemplarily, commonly used path calculation objectives include: optimal cost, optimal delay, minimum number of hops, maximum minimum remaining bandwidth, and minimum maximum link utilization (MLU), etc.
[0041] When the path calculation objective is to optimize the cost, the transmission path with the smallest sum of link costs can be selected from all transmission paths that meet the path constraints as the path calculation result (i.e., the transmission path is used to carry service data);
[0042] When the path calculation objective is delay optimization, the transmission path with the smallest sum of delays of the links passed through can be selected from all transmission paths that meet the path constraints as the path calculation result;
[0043] When the path calculation target is to minimize the number of hops, the transmission path with the smallest number of hops can be selected from all transmission paths that meet the path constraints as the path calculation result;
[0044] When the path calculation target is the maximum minimum residual bandwidth, that is, the minimum residual bandwidth of all links passed by the path is as large as possible. Therefore, from all transmission paths that meet the path constraints, the transmission path with the maximum minimum residual bandwidth of all links passed by the path can be selected as the path calculation result. For example, among all links passed by path a, the minimum residual bandwidth is 10M; among all links passed by path b, the minimum residual bandwidth is 50M, then path b is selected as the path calculation result.
[0045] When the path calculation target is to minimize MLU, that is, the smaller the maximum bandwidth utilization of all links that the path passes through, the better. Therefore, from all transmission paths that meet the path constraints, the transmission path with the smallest maximum bandwidth utilization of all links that the path passes through can be selected as the path calculation result. For example, among all the links that path a passes through, the maximum bandwidth utilization is 70%; among all the links that path b passes through, the maximum bandwidth utilization is 50%, then path b is selected as the path calculation result.
[0046] In related technologies, in order to improve the transmission efficiency of service data, conditions such as optimal cost, minimum number of hops or optimal delay are often used as path calculation targets to select the transmission path of the service.
[0047] However, in the embodiments of the present application, it is considered that when the conditions such as optimal cost, minimum number of hops or optimal delay are used as the path calculation target, the cost value, number of hops and delay of the link will not change with the change of the service in the network. This causes the path calculation result obtained according to the path calculation target to remain unchanged, which may make the path calculation targets of all services concentrated on a few transmission paths, and then some links in the network have high load or even overload, while other links have low load or even idle.
[0048] For example, Figure 1 As shown, it is a schematic diagram of the structure of a transmission network provided by an embodiment of the present application. Among them, the transmission network 10 may include multiple transmission nodes (transmission node 121-transmission node 125 is used as an example in the figure), and links can be established between each transmission node in a wireless or wired manner. When the transmission path from transmission node 121 to transmission node 125 is selected with the optimal cost as the path calculation target, the cost value of the link will not change with the change of the service in the network. Taking the path "transmission node 121-transmission node 122-transmission node 125" as the path with the smallest cost value in the transmission path from transmission node 121 to transmission node 125 as an example, no matter how the service traffic in the network changes, the path with the smallest cost value in the transmission path from transmission node 121 to transmission node 125 is always "transmission node 121-transmission node 122-transmission node 125". Therefore, if the optimal cost is used as the path calculation target, in the subsequent path allocation process, the service will continue to be allocated to the transmission path of "transmission node 121-transmission node 122-transmission node 125". As a result, some links in the network are highly loaded or even overloaded, while other links are less loaded or even idle.
[0049] In view of the above situation, the relevant technology can adopt the method of setting the path calculation target to the maximum minimum remaining bandwidth or the minimum MLU. In this way, in the subsequent path allocation process, the transmission path with the maximum minimum remaining bandwidth or the minimum MLU is used as the path calculation result each time. Thereby, the traffic can be avoided from being concentrated in certain links or paths. However, in the embodiment of the present application, it is considered that in the process of selecting the path by taking the maximum minimum remaining bandwidth or the minimum MLU as the path calculation target, the transmission performance of the service (i.e., the cost, delay and number of hops of the service data during the transmission process, etc.) is not taken into account, so it may cause the service data to take a detour during the transmission process. Especially when the overall load of the network is not high, the above problem is more obvious. Thereby increasing the difficulty of network management and operation and maintenance.
[0050] In view of the above technical problems, the present application proposes a path selection method. The method includes two path calculation targets (hereinafter referred to as "first path calculation target" and "second path calculation target"). Among them, the first path calculation target can be set arbitrarily as needed. For example, the first path calculation target can be set based on conditions such as optimal cost and optimal delay. The second path calculation target is a path calculation target that determines the transmission path using the path load. For example, the second path calculation target can be to select a transmission path with the maximum minimum remaining bandwidth or the minimum MLU.
[0051] Furthermore, if Figure 2 As shown, when allocating a transmission path for a service (hereinafter referred to as "the first service"), after obtaining the path constraint corresponding to the first service (S201), first, according to the path constraint, the first path calculation target and the pre-configured load threshold, a transmission path that satisfies the first path calculation target and the path constraint and whose path load is lower than the above load threshold is searched (S202). The found transmission path can be used as the transmission path of the first service.
[0052] In addition, if no transmission path that satisfies the first path calculation target and path constraint and whose path load is lower than the above-mentioned load threshold is found according to the content of S202, it can be understood that the loads of the transmission paths that meet the path constraints at this time are all high (the loads of the transmission paths that meet the path constraints at this time are all higher than the load threshold), then the transmission path of the first service is determined according to the second path calculation target and path constraint (S203). Among them, since the second path calculation target is to determine the path calculation target of the transmission path using the path load, the transmission path with a lower path load among the transmission paths that meet the path constraints can be determined as the transmission path of the first service through S203.
[0053] It can be understood that, through the path selection method provided in the embodiment of the present application, on the one hand, when the load in the network is low (for example, when the transmission path that meets the path constraint includes a transmission path with a load lower than the load threshold), the above-mentioned S202 content can be used to use the first path calculation target to select a transmission path with optimal cost, optimal delay or optimal number of hops as the transmission path of the first service, so as to achieve efficient transmission of the service data of the first service; on the other hand, when the load in the network is high (for example, when the load of the transmission path that meets the path constraint is higher than the load threshold), the above-mentioned S203 content can be used to use the second path calculation target to determine the transmission path with a lower path load among the transmission paths that meet the path constraint as the transmission path of the first service, so as to achieve the effect of load balancing.
[0054] The following is an introduction to the application scenarios of the embodiments of the present application with reference to examples:
[0055] In some application scenarios, it is considered that a controller for managing each transmission node may be included in the transmission network. In actual application, the controller in the transmission network may execute part or all of the content of the path selection method provided in the embodiment of the present application, thereby achieving the technical effect to be achieved in the embodiment of the present application.
[0056] For example Figure 3 As shown, the transmission network 10 may further include an SDN controller 11. The SDN controller 11 may be used to execute part or all of the content in the path selection method provided in the embodiment of the present application. Figure 3 In the example, the SDM controller 11 is connected to the transmission node 121 and the transmission node 122, so that the SDN controller 11 can interact with each transmission node in the transmission network 10 through the transmission node 121 or the transmission node 122. In practical applications, the SDN controller 11 can establish connections with more or fewer transmission nodes, which is not limited in the embodiments of the present application.
[0057] In one implementation, Figure 4 As shown, the SDN controller 11 may include: one or more functional modules of the client 111, the topology management module 112, the tunnel management module 113 and the path algorithm module 114. In practical applications, the functions of each functional module may be implemented by the corresponding software or hardware module in the SDN controller 11.
[0058] The client 111 may be used to receive user operations and manage the network through the topology management module and the tunnel management module according to the user operations.
[0059] The topology management module 112 can be used to interact with each transmission node in the transmission network to collect network topology information. For example, the topology management module 112 can be used to collect information such as the addition, deletion or change of transmission nodes / links. In addition, the topology management module 112 can also send the collected topology information to the path algorithm module 114 so that the path algorithm module 114 can calculate the path.
[0060] The tunnel management module 113 can be used to provide the client 111 with relevant application programming interfaces (APIs) for tunnel management, including tunnel addition, deletion, modification, and query, setting of path calculation strategies, triggering of path calculation, etc. When creating / modifying a tunnel service, the tunnel management module 113 can determine the path constraint corresponding to the tunnel service according to the indication information from the client 111, and can also determine the above-mentioned first path calculation target, second path calculation target, load threshold, and other information according to the indication information from the client 111. In addition, the tunnel management module 113 can send the above-mentioned path constraint, first path calculation target, second path calculation target, load threshold, and other information to the path algorithm module 114 so that the path algorithm module 114 can perform path calculation.
[0061] The path algorithm module 114 is used to use the topology information obtained from the topology management module 112 and the tunnel management module 113, as well as path constraints, first path calculation targets, second path calculation targets, load thresholds and other information to calculate the transmission path corresponding to the tunnel service according to the method provided in the embodiment of the present application.
[0062] It should be noted that the above Figure 3 and Figure 4 The application scenarios of the embodiments of the present application are only exemplified. It is understandable that in other application scenarios, when the functions of the above-mentioned controller can be implemented by each transmission node in the transmission network, the transmission network may not be configured with a controller for managing each transmission node. In addition, each transmission node may execute part or all of the contents of the path selection method provided in the embodiments of the present application. Figure 4 Mainly taking the case where the SDN controller 11 allocates paths for tunnel services as an example, the functional modules in the SDN controller 11 are introduced. In other application scenarios, the method provided in the embodiment of the present application can also be applied to the case where paths are allocated for services other than tunnel services, and the embodiment of the present application may not be limited to this.
[0063] The following is combined with the above Figure 4 In the scenario shown, taking the allocation of a transmission path to a tunnel service as an example, the specific implementation process of the path selection method provided in the embodiment of the present application is introduced. Specifically, the method may include:
[0064] S301. The SDN controller 11 obtains topology information in the transmission network.
[0065] For example, Figure 5As shown, the topology management module 112 in the SDN controller 11 can obtain topology information in the transmission network by exchanging information with each transmission node. The topology information may specifically include information such as addition, deletion, and change of transmission nodes / links.
[0066] In addition, after acquiring the topology information, the topology management module 112 may also notify the acquired topology information to the path algorithm module 114 so that the path algorithm module 114 can calculate the path according to the corresponding steps below.
[0067] Next, when it is necessary to allocate a transmission path for a certain tunnel service (hereinafter referred to as the first service), the method further includes:
[0068] S302: The SDN controller 11 obtains a path constraint, a first path calculation target, a second path calculation target, and a load threshold corresponding to the first service.
[0069] The path constraint, the first path calculation target, the second path calculation target and the load threshold corresponding to the first service are introduced below:
[0070] Among them, the path constraints corresponding to the first service may specifically include: one or more of the bandwidth requirements of the first service, the upper limit of the number of hops, the upper limit of the latency, the upper limit of the packet loss rate, the upper limit of the bit error rate, the affinity attributes, the network slice type or the explicit path.
[0071] The first path calculation target can be set according to actual needs. For example, the first path calculation target can be to select the transmission path with the smallest cost, or the first path calculation target can be to select the transmission path with the least hops, or the first path calculation target can be the transmission path with the shortest delay, etc. The specific content of the first path calculation target may not be limited in the embodiments of the present application.
[0072] In one implementation, the first path calculation target may be the path calculation target corresponding to the first service input by the user. For example, if in actual application, the user tends to select the transmission path with the minimum cost as the transmission path of the first service, the user may input corresponding input information through the client 111, and the input information is used to determine that the path calculation target corresponding to the first service is "select the transmission path with the minimum cost". Exemplarily, an option menu titled "Please select a path calculation target for the new tunnel service" may be displayed on the display interface of the client 111, and the option menu includes options such as "minimum cost", "minimum number of hops" and "shortest delay". When the user clicks on the corresponding option "minimum cost" in the option menu, the SDN controller 11 determines that the first path calculation target is to select the path with the minimum cost based on the user's input information (i.e., the input information corresponding to the user clicking the option "minimum cost").
[0073] In addition, in actual application, each time a service is created or updated, the first path calculation target corresponding to the service can be set according to the above implementation. In other application processes, it is not necessary to set the first path calculation target corresponding to the service each time a service is created or updated. Instead, after setting the first path calculation target once, the previously set first path calculation target is reused when the service is subsequently created or updated.
[0074] In addition, the second path calculation target is a path calculation target for determining a transmission path using a path load.
[0075] Among them, in the embodiment of the present application, the so-called "path load" can be specifically expressed as any parameter used to reflect the load size of the transmission path. For example, the path load can be specifically expressed as: the maximum value of the bandwidth utilization of all links passed by the transmission path. Among them, the larger the maximum value of the bandwidth utilization of all links passed by the transmission path, the larger the path load of the transmission path, and conversely, the smaller the maximum value of the bandwidth utilization of all links passed by the transmission path, the smaller the path load of the transmission path; for another example, the path load can be specifically expressed as: the minimum remaining bandwidth of all links passed by the transmission path. Among them, the larger the minimum remaining bandwidth of all links passed by the transmission path, the smaller the path load of the transmission path, and conversely, the smaller the minimum remaining bandwidth of all links passed by the transmission path, the larger the path load of the transmission path.
[0076] In a possible design, in order to better achieve the effect of load balancing, the second path calculation objective may specifically include: selecting a transmission path with the smallest path load.
[0077] In an optional implementation, the transmission path with the smallest path load may specifically be: a transmission path with the smallest maximum value of bandwidth utilization of all links passed by the transmission path.
[0078] by Figure 6 Take the transmission path between transmission node 121-transmission node 125 in as an example: For the convenience of description, the transmission path "transmission node 121-transmission node 122-transmission node 125" is referred to as path 1, the transmission path "transmission node 121-transmission node 123-transmission node 125" is referred to as path 2, and the transmission path "transmission node 121-transmission node 124-transmission node 125" is referred to as path 3.
[0079] Among them, Figure 6 As shown, the bandwidth utilization of the link between transmission node 121 and transmission node 122 on path 1 is 40%, and the bandwidth utilization of the link between transmission node 122 and transmission node 125 is 40%, that is, the bandwidth utilization of the two links is the same. The maximum bandwidth utilization of all links passed by path 1 is 40%.
[0080] The bandwidth utilization of the link between transmission node 121 and transmission node 123 on path 2 is 40%, and the bandwidth utilization of the link between transmission node 123 and transmission node 125 is 30%. The maximum bandwidth utilization of all links passed by path 2 is 40%.
[0081] The bandwidth utilization of the link between transmission node 121 and transmission node 124 on path 3 is 30%, and the bandwidth utilization of the link between transmission node 124 and transmission node 125 is 30%. The maximum bandwidth utilization of all links passed by path 3 is 30%.
[0082] Then, in Figure 6 Among paths 1, 2 and 3, the transmission path with the smallest path load is path 3.
[0083] In another optional implementation, the transmission path with the smallest path load may specifically be: a transmission path with the largest minimum value of the remaining bandwidths of all links passed by the transmission path.
[0084] by Figure 6 Take the transmission path between transmission node 121 and transmission node 125 in as an example. Assume that the bandwidth of the links between each transmission node is 100M. Then: the remaining bandwidth of the link between transmission node 121 and transmission node 122 on path 1 is 60M, and the remaining bandwidth of the link between transmission node 122 and transmission node 125 is 60M, that is, the remaining bandwidths of the two links are the same. Then the minimum value of the remaining bandwidth of all links passed by path 1 is 60M.
[0085] In addition, the remaining bandwidth of the link between transmission node 121 and transmission node 123 on path 2 is 60M, and the remaining bandwidth of the link between transmission node 123 and transmission node 125 is 70M. The minimum value of the remaining bandwidth of all links passed by path 2 is 60M.
[0086] In addition, the remaining bandwidth of the link between transmission node 121 and transmission node 124 on path 3 is 70M, and the remaining bandwidth of the link between transmission node 124 and transmission node 125 is 70M. The minimum value of the remaining bandwidth of all links passed by path 3 is 70M.
[0087] Then, in Figure 6 Among paths 1, 2 and 3, the transmission path with the smallest path load is path 3.
[0088] It is understandable that in the above design, in order to achieve a better load balancing effect, the transmission path with the smallest path load can be selected as the second path calculation target. In actual applications, the second path calculation target may not use the transmission path with the smallest path load, but select the transmission path with the second smallest (or third smallest, etc.) path load. There is no limitation on this in the embodiments of the present application.
[0089] In addition, in a possible design, the second path calculation target may be a path calculation target determined according to user input information.
[0090] Exemplarily, an option menu titled "Please select the alternative routing target to be used when the network load is high" may be displayed on the display interface of the client 111. The option menu includes options such as "the transmission path with the smallest maximum bandwidth utilization of all links passed by the transmission path" or "the transmission path with the largest minimum remaining bandwidth of all links passed by the transmission path". The user determines the second routing target by clicking the corresponding option.
[0091] In another possible design, the second path calculation target can be stored as initial configuration information in the SDN controller 11 (for example, in the path algorithm module 114). When a transmission path that satisfies the first path calculation target and the path constraint and whose path load is lower than the load threshold is not found, the path algorithm module 114 reads the second path calculation target and determines the transmission path of the first service according to the second path calculation target and the path constraint.
[0092] In addition, the load threshold can be specifically reflected as any quantifiable load standard of the transmission path. In one implementation, the load threshold can specifically be: a bandwidth utilization threshold. At this time, if the path load is lower than the load threshold, it can specifically include: the maximum bandwidth utilization of all links passed by the transmission path is lower than the bandwidth utilization threshold.
[0093] In another implementation, the load threshold may specifically be a residual bandwidth threshold. At this time, if the path load is lower than the load threshold, it may specifically include that the minimum value of the residual bandwidth of all links passed by the transmission path is higher than the residual bandwidth threshold.
[0094] S303 . The SDN controller 11 searches for a transmission path a that satisfies the first path calculation target and the path constraint and has a path load lower than the load threshold according to the path constraint corresponding to the first service, the first path calculation target, and the load threshold.
[0095] For example, Figure 5As shown, in the SDN controller 11, after the client 111 determines the path constraint, the first path calculation target, the second path calculation target and the load threshold corresponding to the first service, the client 111 sends the path constraint, the first path calculation target, the second path calculation target and the load threshold to the path algorithm module 114. The path algorithm module 114 searches for a transmission path a that satisfies the first path calculation target and the path constraint and whose path load is lower than the load threshold according to the path constraint, the first path calculation target and the load threshold corresponding to the first service (i.e., executes S303).
[0096] For example, in actual application, the path algorithm module 114 may use the load threshold as a path constraint, and then use the load threshold, the path constraint corresponding to the first service, and the first path calculation target to screen the transmission paths in the transmission network to find a transmission path a that meets the first path calculation target and the path constraint and whose path load is lower than the load threshold. If a transmission path a that meets the conditions is found, the transmission path a may be used as the transmission path for the first service.
[0097] On the other hand, when the load in the network is high (for example, when the load of the transmission paths satisfying the path constraint is higher than the load threshold), the transmission path a satisfying the condition cannot be found through the above S303. The method may further include:
[0098] S304 : If the SDN controller 11 fails to find a transmission path for the first service that meets the first path calculation objective and the path constraint and whose path load is lower than the load threshold, it determines a transmission path b according to the second path calculation objective and the path constraint.
[0099] For example, Figure 5 As shown, when the path algorithm module 114 in the SDN controller 11 fails to find a transmission path a that meets the conditions according to the path constraint, the first path calculation target and the load threshold corresponding to the first service (which can be understood as S303 search failure), the path algorithm module 114 determines the transmission path b according to the second path calculation target and the path constraint.
[0100] At this time, since transmission path b is determined according to the second path calculation target and the path constraint, the transmission path with a lower path load among the transmission paths that meet the path constraint can be determined as transmission path b. In this way, when using transmission path b to carry the data of the first service, a load balancing effect can be achieved.
[0101] S305 . The SDN controller 11 sends the path calculation result to each transmission node, so that each transmission path forwards the data of the first service according to the transmission path determined in S303 or S304 .
[0102] For example, Figure 5As shown, when the path algorithm module 114 in the SDN controller 11 determines the transmission path a or the transmission path b (i.e., the path calculation result) according to S303 or S304, the path algorithm module 114 sends the determined path calculation result to the tunnel management module 113. Then, after recording the path calculation result, the tunnel management module 113 sends the path calculation result to each transmission node, so that each transmission path forwards the data of the first service according to the transmission path determined by S303 or S304.
[0103] Below is Figure 3 As an example, in the transmission network shown in FIG. 1 , a transmission path is allocated for services A and B from transmission node 121 to transmission node 125. Figure 5 The process shown is used to introduce the specific implementation process of the path selection method of the embodiment of the present application. In this example, it is assumed that the path constraint of service A is: bandwidth constraint 10M; the path constraint of service B is: bandwidth constraint 40M.
[0104] In addition, in this example, it is assumed that the first path calculation target is to select the transmission path with the optimal cost, the second path calculation target is to select the transmission path with the minimum maximum bandwidth utilization of all links passed, and the load threshold is the bandwidth utilization threshold: 50%. In addition, it is assumed that the first path calculation target and the second path calculation target are global parameters, that is, unless otherwise set, when creating or updating a service, the service is defaulted to apply the above-mentioned first path calculation target and the second path calculation target.
[0105] In addition, before allocating a transmission path for service A, the status of each link in the transmission network 10 is as follows: Figure 7 As shown. The bandwidth of the link between transmission node 121 and transmission node 122 is 100M, the bandwidth utilization is 40%, and the cost value is 10; the bandwidth of the link between transmission node 121 and transmission node 123 is 100M, the bandwidth utilization is 40%, and the cost value is 20; the bandwidth of the link between transmission node 121 and transmission node 124 is 100M, the bandwidth utilization is 30%, and the cost value is 30; the bandwidth of the link between transmission node 122 and transmission node 125 is 100M, the bandwidth utilization is 40%, and the cost value is 10; the bandwidth of the link between transmission node 123 and transmission node 125 is 100M, the bandwidth utilization is 40%, and the cost value is 20; the bandwidth of the link between transmission node 124 and transmission node 125 is 100M, the bandwidth utilization is 30%, and the cost value is 10.
[0106] Furthermore, when allocating a transmission path for service A, it can be seen that when the maximum bandwidth utilization of all links is limited to 50%, the remaining available bandwidths of path 1, path 2, and path 3 are 10M, 10M, and 20M respectively. At this time, all three transmission paths meet the constraints. According to the first path calculation objective (optimal cost), the path calculation result is determined to be path 1. That is, path 1 is allocated to service A.
[0107] At this time, the status of each link in the transmission network 10 is as follows: Figure 8 As shown, in path 1, the bandwidth utilization rate of the link between the transmission node 121 and the transmission node 122 becomes 50%, and the bandwidth utilization rate of the link between the transmission node 122 and the transmission node 125 becomes 50%.
[0108] Next, a transmission path is allocated for service B. It can be seen that Figure 8 In the state shown, when the maximum value of the bandwidth utilization of all the links passed is limited to 50%, the remaining available bandwidths of path 1, path 2 and path 3 are 0M, 10M and 20M respectively. At this time, none of the three transmission paths can meet the bandwidth constraint (40M) of service B. According to the second path calculation target (selecting the transmission path with the smallest maximum value of the bandwidth utilization of all the links passed), the path calculation result is determined to be path 3.
[0109] At this time, the status of each link in the transmission network 10 is as follows: Fig. 9 As shown in FIG. 1 , the bandwidth utilization of the link between transmission node 121 and transmission node 124 in path 3 becomes 70%, and the bandwidth utilization of the link between transmission node 124 and transmission node 125 becomes 70%. The maximum values of the bandwidth utilization of path 1, path 2, and path 3 are 50%, 40%, and 70%, respectively.
[0110] It is understandable that if the optimal cost is directly used as the path calculation target to allocate transmission paths for services A and B, then services A and B are both allocated to path 1 (because the cost of path 1 is the smallest), and the maximum bandwidth utilization of the three paths will be 90%, 40%, and 30%. This results in the utilization of path 1 being significantly higher than that of other paths, resulting in uneven distribution of transmission resources. The method provided by the above embodiment of the present application can reduce the possibility of uneven distribution of transmission resources.
[0111] Based on the above method embodiment, the device provided by the embodiment of the present application is described below. Fig.10The figure is a schematic diagram of the structure of a path selection device provided in an embodiment of the present application. The path selection device 40 can be used to implement the functions of the SDN controller 11 described above. Specifically, the path selection device 40 can be used to implement the functions of the path algorithm module 114 in the SDN controller 11 described above.
[0112] Reference Fig.10 The path selection device 40 includes an acquisition unit 401 and a processing unit 402. These units can perform the corresponding functions of the path algorithm module 114 in the above method example.
[0113] Specifically, the acquisition unit 401 is configured to acquire the path constraint of the first service.
[0114] The processing unit 402 is configured to search, according to the path constraint, the first path calculation target and the load threshold, for a transmission path of the first service that meets the first path calculation target and the path constraint and has a path load lower than the load threshold.
[0115] The processing unit 402 is further used to determine the transmission path of the first service according to a second path calculation target and the path constraint if a transmission path for the first service that satisfies the first path calculation target and the path constraint and whose path load is lower than the load threshold is not found, wherein the second path calculation target is a path calculation target for determining the transmission path using the path load.
[0116] In one implementation, the load threshold includes: a bandwidth utilization threshold; the path load being lower than the load threshold includes: the maximum value of the bandwidth utilization of all links through which the transmission path passes being lower than the bandwidth utilization threshold; or, the load threshold includes: a residual bandwidth threshold; the path load being lower than the load threshold includes: the minimum value of the residual bandwidth of all links through which the transmission path passes being higher than the residual bandwidth threshold.
[0117] In one implementation, the second path calculation objective includes: selecting a transmission path with the smallest path load.
[0118] In one implementation, the transmission path with the smallest path load includes: a transmission path with the smallest maximum value of bandwidth utilization of all links passed by the transmission path; or, the transmission path with the smallest path load includes: a transmission path with the largest minimum value of remaining bandwidth of all links passed by the transmission path.
[0119] In one implementation, the acquisition unit 401 is further configured to determine the first path calculation target according to user input information, wherein the input information is used to determine the path calculation target corresponding to the first service.
[0120] In one implementation, the first path calculation objective includes: selecting any one of a transmission path with the smallest cost, a transmission path with the smallest number of hops, or a transmission path with the lowest delay.
[0121] In one implementation, the first service is a tunnel service.
[0122] It should be noted that the division of units in the embodiments of the present application is schematic and is only a logical function division. There may be other division methods in actual implementation. The functional units in the embodiments of the present application may be integrated into a processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated units may be implemented in the form of hardware or in the form of software functional units.
[0123] See also Fig.11 , which is a schematic diagram of the structure of another path selection device provided in an embodiment. The path selection device 50 can be used to implement the above-mentioned SDN controller 11 or part or all of the functions of the path calculation module 114 in the above-mentioned SDN controller 11.
[0124] See also Fig.11 As shown, the path selection device 50 includes: a processor 501, a communication interface 502 and a memory 503. The number of the processor 501 in the path selection device 50 can be one or more. Fig.11 In the embodiment of the present application, the processor 501, the communication interface 502 and the memory 503 may be connected via a bus system or other means, wherein: Fig.11 The connection via bus system 504 is taken as an example.
[0125] The processor 501 may be a central processor unit (CPU), a network processor (NP) or a combination of a CPU and a NP. The processor 501 may further include a hardware chip. The hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD) or a combination thereof. The PLD may be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a generic array logic (GAL) or any combination thereof.
[0126] The communication interface 502 is used to receive and send data. Specifically, the communication interface 502 may include a receiving interface and a sending interface. The receiving interface may be used to receive data, and the sending interface may be used to send data. The number of the communication interface 502 may be one or more.
[0127] The memory 503 may include a volatile memory, such as a random-access memory (RAM); the memory 503 may also include a non-volatile memory, such as a flash memory, a hard disk drive (HDD) or a solid-state drive (SSD); the memory 503 may also include a combination of the above-mentioned types of memories. The memory 503 may, for example, store the notification message mentioned above.
[0128] Optionally, the memory 503 stores an operating system and a program, an executable module or a data structure, or a subset thereof, or an extended set thereof, wherein the program may include various operating instructions for implementing various operations. The operating system may include various system programs for implementing various basic services and processing hardware-based tasks. The processor 501 may read the program in the memory 503 to implement the method provided in the embodiment of the present application.
[0129] The memory 503 may be a storage device in the path selection device 50 , or may be a storage device independent of the path selection device 50 .
[0130] The bus system 504 may be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus. The bus system 504 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.11 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.
[0131] Fig.12 1 is a schematic diagram of the structure of another path selection device 60 provided in an embodiment of the present application. The path selection device 60 can be used to implement the above-mentioned SDN controller 11 or part or all of the functions of the path calculation module 114 in the above-mentioned SDN controller 11.
[0132] The path selection device 60 includes: a main control board 601 and an interface board 603 .
[0133] The main control board 601 is also called a main processing unit (MPU) or a route processor card. The main control board 601 controls and manages each component in the path selection device 60, including route calculation, device management, device maintenance, and protocol processing functions. The main control board 601 includes: a central processing unit 6011 and a memory 6012.
[0134] The interface board 603 is also called a line processing unit (LPU), a line card or a service board. The interface board 603 is used to provide various service interfaces and realize the forwarding of data packets. The service interface includes but is not limited to an Ethernet interface, a POS (Packet over SONET / SDH) interface, etc., and the Ethernet interface is, for example, a flexible Ethernet service interface (FlexE Clients). The interface board 603 includes: a central processing unit 6031, a network processor 6032, a forwarding table entry memory 6034 and a physical interface card (PIC) 6033.
[0135] The central processor 6031 on the interface board 603 is used to control and manage the interface board 603 and communicate with the central processor 6011 on the main control board 601 .
[0136] The network processor 6032 is used to implement message forwarding processing. The network processor 6032 may be in the form of a forwarding chip. Specifically, the processing of uplink messages includes: message inbound interface processing, forwarding table search; the processing of downlink messages includes forwarding table search, etc.
[0137] The physical interface card 6033 is used to implement the docking function of the physical layer, and the original traffic enters the interface board 603 from this, and the processed message is sent from the physical interface card 6033. The physical interface card 6033 includes at least one physical interface, which is also called a physical port. The physical interface card 6033 is also called a daughter card, which can be installed on the interface board 603 and is responsible for converting the optical signal into a message and forwarding the message to the network processor 6032 for processing after checking the legitimacy of the message. In some embodiments, the central processor 6031 of the interface board 1103 can also perform the functions of the network processor 6032, such as implementing software forwarding based on a general-purpose CPU, so that the network processor 6032 is not required in the physical interface card 6033.
[0138] Optionally, the path selection device 60 includes a plurality of interface boards. For example, the path selection device 60 further includes an interface board 604 . The interface board 604 includes a central processor 6041 , a network processor 6042 , a forwarding table entry memory 6044 and a physical interface card 6043 .
[0139] Optionally, the path selection device 60 further includes a switching fabric board 602. The switching fabric board 602 may also be referred to as a switch fabric unit (SFU). In the case where the path selection device has multiple interface boards 603, the switching fabric board 602 is used to complete data exchange between the interface boards. For example, the interface board 603 and the interface board 604 may communicate through the switching fabric board 602.
[0140] The main control board 601 is coupled to the interface board 603. For example, the main control board 601, the interface board 603, the interface board 604, and the switching network board 602 are connected to the system backplane through a system bus to achieve intercommunication. In a possible implementation, an inter-process communication (IPC) channel is established between the main control board 601 and the interface board 603, and the main control board 601 and the interface board 603 communicate through the IPC channel.
[0141] Logically, the path selection device 60 includes a control plane and a forwarding plane. The control plane includes a main control board 601 and a central processor 6031. The forwarding plane includes various components for performing forwarding, such as a forwarding table entry memory 6034, a physical interface card 6033, and a network processor 6032. The control plane performs functions such as a router, generating a forwarding table, processing signaling and protocol messages, and configuring and maintaining the status of the device. The control plane sends the generated forwarding table to the forwarding plane. On the forwarding plane, the network processor 6032 forwards the message received by the physical interface card 6033 based on the forwarding table sent by the control plane. The forwarding table sent by the control plane can be stored in the forwarding table entry memory 6034. In some embodiments, the control plane and the forwarding plane can be completely separated and not on the same device.
[0142] It should be understood that the operation on the interface board 604 in the embodiment of the present application is consistent with the operation on the interface board 603, and for the sake of brevity, it will not be repeated. It should be understood that the path selection device 60 in the embodiment of the present application can correspond to the above-mentioned SDN controller 11. The main control board 601, the interface board 603 and / or the interface board 604 in the path selection device 60 can implement various steps in the above-mentioned various method embodiments, and for the sake of brevity, it will not be repeated here.
[0143] In some possible embodiments, the above-mentioned path selection device 40 can be implemented as a virtualized device. For example, the virtualized device can be a virtual machine (VM) running a program for sending a message function, and the virtual machine is deployed on a hardware device (for example, a physical server). A virtual machine refers to a complete computer system with complete hardware system functions simulated by software and running in a completely isolated environment. The virtual machine can be configured as a first network device or a second network device. For example, the function of the path selection device 40 can be implemented based on a general physical server in combination with network function virtualization (NFV) technology. Those skilled in the art can virtualize a virtualized device with the function of the path selection device 40 on a general physical server in combination with NFV technology by reading this application, and will not be repeated here.
[0144] The embodiment of the present application also provides a chip, including a processor and an interface circuit, the interface circuit is used to receive instructions and transmit them to the processor; the processor can be used to execute the above method. The processor is coupled to a memory, the memory is used to store programs or instructions, and when the program or instruction is executed by the processor, the chip system implements the method in any of the above method embodiments.
[0145] Optionally, the processor in the chip system may be one or more. The processor may be implemented by hardware or by software. When implemented by hardware, the processor may be a logic circuit, an integrated circuit, etc. When implemented by software, the processor may be a general-purpose processor implemented by reading software code stored in a memory.
[0146] Optionally, the memory in the chip system may be one or more. The memory may be integrated with the processor or may be separately provided with the processor, which is not limited in the present application. Exemplarily, the memory may be a non-transient processor, such as a read-only memory ROM, which may be integrated with the processor on the same chip or may be provided on different chips. The present application does not specifically limit the type of memory and the arrangement of the memory and the processor.
[0147] Exemplarily, the chip system can be a field programmable gate array (FPGA), an application-specific integrated circuit (ASIC), a system on chip (SoC), a central processor unit (CPU), a network processor (NP), a digital signal processor (DSP), a microcontroller unit (MCU), a programmable logic device (PLD) or other integrated chips.
[0148] The embodiments of the present application also provide a computer-readable storage medium, including instructions or computer programs, which, when executed on a computer, enable the computer to execute the methods provided in the above embodiments.
[0149] The embodiments of the present application also provide a computer program product including instructions or a computer program, which, when executed on a computer, enables the computer to execute the method provided in the above embodiments.
[0150] The terms "first", "second", "third", "fourth", etc. (if any) in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments described herein can be implemented in an order other than that illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.
[0151] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.
[0152] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of units is only a logical business division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.
[0153] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiments of the present application.
[0154] In addition, each business unit in each embodiment of the present application can be integrated into a processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software business units.
[0155] If the integrated unit is implemented in the form of a software business unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the various embodiments of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.
[0156] Those skilled in the art should be aware that in one or more of the above examples, the services described in this application can be implemented with hardware, software, firmware, or any combination thereof. When implemented using software, these services can be stored in a computer-readable medium or transmitted as one or more instructions or codes on a computer-readable medium. Computer-readable media include computer storage media and communication media, wherein communication media include any media that facilitates the transmission of computer programs from one place to another. Storage media can be any available media that a general or special-purpose computer can access.
[0157] The above specific implementation methods further describe in detail the purpose, technical solutions and beneficial effects of the present application. It should be understood that the above are only specific implementation methods of the present application.
[0158] The above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, a person of ordinary skill in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features thereof may be replaced by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present application.
Claims
1. A path selection method, It is characterized in that include: Obtaining a path constraint corresponding to the first service; According to the path constraint, the first path calculation target and the load threshold, searching for a transmission path for the first service that satisfies the first path calculation target and the path constraint and whose path load is lower than the load threshold; If a transmission path for the first service that satisfies the first path calculation target and the path constraint and whose path load is lower than the load threshold is not found, the transmission path for the first service is determined according to a second path calculation target and the path constraint, wherein the second path calculation target is a path calculation target for determining the transmission path using the path load.
2. The method according to claim 1, It is characterized in that The load threshold includes: a bandwidth utilization threshold; the path load is lower than the load threshold, including: the maximum bandwidth utilization of all links passed by the transmission path is lower than the bandwidth utilization threshold; Alternatively, the load threshold includes: a remaining bandwidth threshold; the path load being lower than the load threshold includes: a minimum value of the remaining bandwidths of all links passed by the transmission path being higher than the remaining bandwidth threshold.
3. The method according to claim 1 or 2, It is characterized in that The second path calculation target includes: selecting a transmission path with the smallest path load.
4. The method according to claim 3, It is characterized in that The transmission path with the smallest path load includes: a transmission path with the smallest maximum value of bandwidth utilization of all links passed by the transmission path; Alternatively, the transmission path with the smallest path load includes: a transmission path with the largest minimum value of the remaining bandwidths of all links passed by the transmission path.
5. The method according to any one of claims 1 to 4, It is characterized in that The method further includes: determining the first path calculation target according to user input information; wherein the input information is used to determine the path calculation target corresponding to the first service.
6. The method according to any one of claims 1 to 5, It is characterized in that The first path calculation target includes: selecting any one of a transmission path with the smallest cost, a transmission path with the smallest number of hops, or a transmission path with the lowest delay.
7. The method according to any one of claims 1 to 6, It is characterized in that The first service is a tunnel service.
8. A path selection device, It is characterized in that include: An acquiring unit, configured to acquire a path constraint of a first service; a processing unit, configured to search, according to the path constraint, the first path calculation target and the load threshold, for a transmission path of the first service that satisfies the first path calculation target and the path constraint and whose path load is lower than the load threshold; The processing unit is further used to determine the transmission path of the first service according to a second path calculation target and the path constraint if a transmission path for the first service that satisfies the first path calculation target and the path constraint and whose path load is lower than the load threshold is not found, wherein the second path calculation target is a path calculation target for determining the transmission path using the path load.
9. A path selection device, It is characterized in that The method comprises a processor and an interface, wherein the processor receives or sends data through the interface, and the processor is used to implement the method according to any one of claims 1 to 7.
10. A software defined network SDN controller, It is characterized in that It comprises the path selection device as claimed in claim 8 or 9 above.
11. A computer-readable storage medium, It is characterized in that The computer-readable storage medium stores instructions, and when the instructions are executed on a processor, the method according to any one of claims 1 to 7 is implemented.
12. A computer program product, It is characterized in that The computer program product comprises instructions, and when the instructions are executed on a processor, the method according to any one of claims 1 to 7 is implemented.
Citation Information
Cited By
Path selection method and device
CN120434176A
