A network path selection method, apparatus, device, and storage medium

Abstract

The present application provides a network path selection method, apparatus, device, and storage medium, relating to the field of communication technologies, and is used to solve the problem of concentrated tunnel paths while improving the availability of network paths. The method includes: calculating the value corresponding to the betweenness centrality of paths passing through any node pair in the network topology; determining a candidate path set according to the value corresponding to the betweenness centrality; wherein, the candidate path set contains multiple candidate paths determined from the network topology; selecting an optimal path from the candidate path set according to the maximum utilization rate of each candidate path in the candidate path set; wherein, the utilization rate is used to indicate the efficiency of data transmission and reception per second of the path.

Description

Technical Field

[0001] The present application relates to the field of communication technologies, and provides a network path selection method, apparatus, device, and storage medium. Background Art

[0002] Currently, the existing path selection algorithms mainly include the shortest path first (SPF) algorithm and the Constrained Shortest Path First (CSPF) algorithm. These two algorithms can calculate the shortest path based on relevant constraint conditions such as network bandwidth. However, when using these two algorithms to select paths, it is impossible to avoid the tendency of traffic to be concentrated on the shortest path, resulting in concentrated tunnel paths and the inability to add new tunnel paths. Furthermore, the availability of network paths is relatively low. In addition, when there are more and more services in the network topology, the selected paths tend to be the same, leading to traffic imbalance. Summary of the Invention

[0003] Embodiments of the present application provide a network path selection method, apparatus, device, and storage medium, which are used to solve the problem of concentrated tunnel paths while improving the availability of network paths.

[0004] On the one hand, a network path selection method is provided. The method includes:

[0005] Calculating the value corresponding to the betweenness centrality of the paths passing through any node pair in the network topology;

[0006] Determining a candidate path set according to the value corresponding to the betweenness centrality; wherein, the candidate path set includes multiple candidate paths determined from the network topology;

[0007] Selecting an optimal path from the candidate path set according to the maximum utilization rate of each candidate path in the candidate path set; wherein, the utilization rate is used to indicate the efficiency of data reception and transmission per second of the path.

[0008] It can be seen that in the embodiments of the present application, since the candidate path set is determined based on the value corresponding to the betweenness centrality first, it is possible to avoid the problems of difficult path solving and low calculation efficiency caused by adding constraint conditions to calculate the path at one time in the prior art. In addition, since the maximum utilization rate of the candidate paths is also used to select the optimal path from the candidate path set, the availability of the network path can be maximized while solving the problem of concentrated tunnel paths.

[0009] In a possible implementation manner, the determining a candidate path set according to the value corresponding to the betweenness centrality includes:

[0010] Sort the values corresponding to the betweenness centrality of all node pairs in the network topology in descending order, and determine the node pairs with the values of betweenness centrality ranked in the top N as the node pairs of the core link;

[0011] Select all candidate paths passing through the node pairs of the core link from all paths in the network topology;

[0012] Determine the candidate path set according to all the candidate paths.

[0013] In a possible implementation manner, before selecting the optimal path from the candidate path set according to the maximum utilization rate of each candidate path in the candidate path set, the method further includes:

[0014] Determine the maximum utilization rate of each candidate path in the candidate path set according to a preset constraint condition; wherein, the preset constraint condition is used to constrain the relationship between the used bandwidth of any candidate path and the total bandwidth of any candidate path.

[0015] In a possible implementation manner, the preset constraint condition includes:

[0016] For any candidate path, the utilization rate of any candidate path is not less than the maximum first ratio corresponding to any candidate path; wherein, the first ratio is equal to the ratio of the used bandwidth of any candidate path to the total bandwidth of any candidate path.

[0017] On the one hand, a network path selection device is provided, and the device includes:

[0018] A betweenness centrality calculation unit, configured to calculate the value corresponding to the betweenness centrality of the paths passing through any node pair in the network topology;

[0019] A candidate path set determination unit, configured to determine a candidate path set according to the value corresponding to the betweenness centrality; wherein, the candidate path set includes multiple candidate paths determined from the network topology;

[0020] An optimal path selection unit, configured to select an optimal path from the candidate path set according to the maximum utilization rate of each candidate path in the candidate path set; wherein, the utilization rate is used to indicate the efficiency of data transmission and reception per second of the path.

[0021] In a possible implementation manner, the candidate path set determination unit is specifically configured to:

[0022] Sort the values corresponding to the betweenness centrality of all node pairs in the network topology in descending order, and determine the node pairs of the core link for the node pairs with the top N values of betweenness centrality after sorting;

[0023] Select all candidate paths passing through the node pairs of the core link from all paths in the network topology;

[0024] Determine the candidate path set according to all the candidate paths.

[0025] In a possible implementation manner, the apparatus further includes a utilization rate determination unit, where the utilization rate determination unit is configured to:

[0026] Determine the maximum utilization rate of each candidate path in the candidate path set according to a preset constraint condition; where the preset constraint condition is used to constrain the relationship between the used bandwidth of any candidate path and the total bandwidth of any candidate path.

[0027] In a possible implementation manner, the preset constraint condition includes:

[0028] For any candidate path, the utilization rate of any candidate path is not less than the maximum first ratio corresponding to any candidate path; where the first ratio is equal to the ratio of the used bandwidth of any candidate path to the total bandwidth of any candidate path.

[0029] On the one hand, a computer device is provided, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the computer program, the steps of the method described in the above aspect are implemented.

[0030] On the one hand, a computer storage medium is provided, on which computer program instructions are stored. When the computer program instructions are executed by a processor, the steps of the method described in the above aspect are implemented. Description of the Drawings

[0031] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the following will briefly introduce the drawings required for use in the description of the embodiments or related technologies. Obviously, the drawings in the following description are only the embodiments of the present application. For those of ordinary skill in the art, other drawings can be obtained according to the provided drawings without creative efforts.

[0032] Figure 1 A schematic diagram of an application scenario provided for an embodiment of the present application;

[0033] Figure 2A flowchart of the network path selection method provided by the embodiment of the present application;

[0034] Figure 3 A structural diagram of determining a candidate path set provided by the embodiment of the present application;

[0035] Figure 4 A schematic diagram of the SDN network directed graph provided by the embodiment of the present application;

[0036] Figure 5 A structural diagram of a network path selection device based on Ethereum;

[0037] Figure 6 A structural diagram of a computer device provided by the embodiment of the present application. Detailed implementation manners

[0038] To make the objectives, technical solutions, and advantages of the present application clearer and more understandable, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present application. Without conflict, the embodiments in the present application and the features in the embodiments may be combined with each other arbitrarily. And although the logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in a different order than here. In addition, in the technical solutions of the present application, the collection, dissemination, use, etc. of data all comply with the requirements of relevant national laws and regulations.

[0039] First, some terms in the present application are explained.

[0040] (1) Betweenness centrality. Generally speaking, if a member is located on multiple shortest paths of other members, then this member is a core member and has a relatively large betweenness centrality. Therefore, in a network, the betweenness centrality of a node is usually represented by the ratio of the number of shortest paths passing through a certain node to the total number of shortest paths in the network.

[0041] Currently, the existing path selection algorithms mainly include the SPF algorithm and the CSPF algorithm. These two algorithms can calculate the shortest path based on relevant constraint conditions such as network bandwidth. However, when using these two algorithms to select paths, it is inevitable that the traffic tends to the shortest path, resulting in the concentration of tunnel paths and the inability to add new tunnel paths. Furthermore, the availability of network paths is relatively low. In addition, when there are more and more services in the network topology, the selected paths will tend to be the same, resulting in traffic imbalance.

[0042] Based on this, in the embodiments of the present application, a network path selection method is designed. In this method, after calculating the value corresponding to the betweenness centrality of the paths passing through any node pair in the network topology, a candidate path set including multiple candidate paths determined from the network topology can be determined according to the value corresponding to the betweenness centrality. Furthermore, according to the maximum utilization rate of each candidate path in the candidate path set, an optimal path can be selected from the candidate path set. It can be seen that in the embodiments of the present application, since the candidate path set is first determined based on the value corresponding to the betweenness centrality, it is possible to avoid the problems of difficult path solving and low calculation efficiency caused by adding constraint conditions to calculate paths at one time in the prior art. In addition, since the maximum utilization rate of the candidate paths is also used to select the optimal path from the candidate path set, while maximizing the availability of the network path, the problem of tunnel path concentration can also be solved.

[0043] The technical solution of the embodiments of the present application can be applied to any possible network path selection scenario. For example Figure 1 As shown, it is a schematic diagram of an application scenario provided by the embodiments of the present application. This application scenario of network path selection may include a user terminal 10 and a network path selection device 11.

[0044] The user terminal 10 may be a device capable of receiving user input operations (for example, inputting the bandwidth of the path to be scheduled), such as a personal computer (PC), a laptop computer, etc.

[0045] The network path selection device 11 may be a server that provides data storage and data calculation for the network path selection process. It may be an independent physical server, or a database cluster or distributed system composed of multiple physical servers. It may also be a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms, but is not limited thereto. The network path selection device 11 may include one or more processors 101, a memory 102, and an I / O interface 103 for interacting with other devices, etc. In addition, the network path selection device 11 may also be configured with a database 104, and the database 104 may be used to store data corresponding to the betweenness centrality, candidate path set, optimal path, etc. involved in the solution provided by the embodiments of the present application. Among them, the program instructions of the network path selection method provided by the embodiments of the present application may be stored in the memory 102 of the network path selection device 11. When these program instructions are executed by the processor 101, they can be used to implement the steps of the network path selection method provided by the embodiments of the present application, so as to solve the problem of tunnel path concentration while improving the availability of the network path.

[0046] In a possible implementation, when the network path selection device 11 detects an input operation by a user on the user terminal 10 through the I / O interface 103, the processor 101 of the network path selection device 11 will run the program instructions of the network path selection method stored in the memory 102, thereby, while improving the availability of the network path, solving the problem of tunnel path concentration. And the corresponding data such as betweenness centrality, candidate path set, and optimal path involved in the execution process of the program instructions will be stored in the database 104.

[0047] Of course, the method provided in the embodiments of the present application is not limited to Figure 1 the application scenarios shown, and can also be used in other possible application scenarios, which are not limited in the embodiments of the present application. For Figure 1 the functions that can be realized by each device in the application scenarios shown will be described together in the subsequent method embodiments, and will not be elaborated here too much. Next, the method of the embodiments of the present application will be introduced with reference to the drawings.

[0048] As Figure 2 shown, it is a schematic flowchart of a network path selection method provided by the embodiments of the present application. This method can be executed by Figure 1 the network path selection device 11 in, which is not limited in the embodiments of the present application. The process of this method is introduced as follows.

[0049] Step 201: Calculate the value corresponding to the betweenness centrality of the paths passing through any node pair in the network topology.

[0050] In the embodiments of the present application, the network topology can be a software-defined network (SDN) based on segment routing / segment routing IPv6 (SR / SRv6). Assume that any node pair is S=(x,y), where x and y are the specific corresponding nodes of any node pair, the starting node of the network path is s, and the terminating node is t. Then, the value corresponding to the betweenness centrality of the path passing through the node pair S=(x,y) can be calculated by the following formula (1):

[0051]

[0052] wherein, the starting node s to the terminating node t both belong to the node set V, and this node set V contains all the nodes in the network topology. The starting node s is not equal to the terminating node t, and σ s,t is the number of all the shortest paths between the starting node s and the terminating node t, Denotes the number of shortest paths passing through the node pair S=(x, y) simultaneously. Since the number of shortest paths σ s,t (v) passing through node v from the starting node s to the ending node t can be calculated by the following formula (2):

[0053]

[0054] where d(s, t) is the distance between s and t, that is, the shortest path passing through node v from the starting node s to the ending node t is composed of the shortest path from the starting node s to node v and the shortest path from node v to the ending node t. Therefore, the number of shortest paths σ s,t (v) can be obtained by multiplying the number of shortest paths between the starting node s and node v by the number of shortest paths between node v and the ending node t.

[0055] Furthermore, based on the above formula (2), the above formula (1) can be transformed into the following formula (3):

[0056]

[0057] where σ s,x is the number of all shortest paths from the starting node s to node x, and σ x,y is the number of all shortest paths from node x to node y, and σ y,t is the number of all shortest paths from node y to the ending node t.

[0058] Furthermore, based on the above formula (3), the value corresponding to the betweenness centrality of the path passing through any node pair S=(x, y) can be determined .

[0059] Step 202: Determine the candidate path set according to the value corresponding to the betweenness centrality.

[0060] In the embodiment of the present application, the candidate path set may include multiple candidate paths determined from the network topology.

[0061] In practical applications, since the larger the value corresponding to the betweenness centrality of the paths passing through any node pair S=(x, y) at the same time, the greater the probability that the link segment between the nodes x and y corresponding to the node pair S=(x, y) is the core link, that is, the greater the probability of being the shortest path. Based on this, and to avoid the problem of difficult path solving and low calculation efficiency caused by adding constraint conditions to calculate paths at one time in the prior art, when determining the shortest path according to the values corresponding to the betweenness centrality of each node, a candidate path set containing multiple candidate paths can be appropriately determined from the network topology. Furthermore, the optimal path can be determined from this candidate path set according to the constraint conditions for data transmission for the user, and the optimal path is the shortest path that satisfies the constraint conditions.

[0062] Step 203: Select the optimal path from the candidate path set according to the maximum utilization rate of each candidate path in the candidate path set.

[0063] In the embodiment of the present application, the utilization rate can be used to indicate the efficiency of data reception and transmission per second of the path.

[0064] In practical applications, since the calculation of the entire tunnel path is essentially similar to the multi-commodity flow (the network flow problem of multiple items or goods flowing from different source points to different sink points in the network) problem, therefore, in the embodiment of the present application, the selection of the optimal path can be simplified with reference to the multi-commodity flow algorithm, and the multi-commodity flow facing the "network flow problem of different source-sink points" in the network is simplified to the "network flow problem of fixed source-sink points". Furthermore, in order to achieve high availability of the network (able to carry more tunnel bandwidth requirements), then for path calculation, a constraint condition needs to be added to ensure that the currently calculated path has the lowest maximum utilization rate for the network, that is, to ensure that the newly added path will not waste too much network bandwidth while meeting the requirements. Therefore, finally, the constraint of the measurement standard "maximum availability" can be transformed into the constraint of "minimizing the maximum utilization rate". Furthermore, based on this constraint condition of "minimizing the maximum utilization rate", the maximum utilization rate of each candidate path in the candidate path set can be calculated first, and then the candidate path with the minimum maximum utilization rate can be selected from these candidate paths as the optimal path. Since the optimal path is not calculated and determined by using SPF and CSPF in the prior art, the problem of tunnel path concentration can be solved while maximizing the availability of the network path.

[0065] In a possible implementation manner, as Figure 3 shown, it is a schematic flowchart of a process for determining a candidate path set provided by an embodiment of the present application. This determination process can be passed through Figure 1It is executed by the intermediate network path selection device 11, and the embodiments of the present application do not limit this. The specific introduction of this process is as follows.

[0066] Step 301: Sort the values corresponding to the betweenness centrality of all node pairs in the network topology in descending order, and determine the node pairs of the core link for the node pairs with the top N values of the betweenness centrality after sorting.

[0067] In the embodiments of the present application, since the larger the value corresponding to the betweenness centrality of the paths passing through any node pair S=(x,y) at the same time, the greater the probability that the link segment between node x and node y corresponding to the node pair S=(x,y) is the core link. Therefore, after determining the values corresponding to the betweenness centrality of all node pairs, the values corresponding to the betweenness centrality of all node pairs in the network topology can be sorted in descending order. Furthermore, the node pairs with the top N values of the betweenness centrality after sorting can be determined as the node pairs of the core link. Among them, the value of N can be set by the user according to their own needs, or set according to empirical values.

[0068] Step 302: Select all candidate paths passing through the node pairs of the core link from all paths in the network topology.

[0069] In the embodiments of the present application, all paths between the start node and the end node in the SDN based on SR / SRv6 can be obtained through ordinary graph algorithms. Furthermore, from all these paths, all candidate paths passing through the node pairs of the core link are selected. Among them, there may be more than one candidate path passing through the same node pair.

[0070] Step 303: Determine the candidate path set according to all candidate paths.

[0071] In the embodiments of the present application, after selecting all candidate paths passing through the node pairs of the core link, these all candidate paths can be formed into a set, which is the candidate path set.

[0072] In a possible implementation manner, after determining the candidate path set, the optimal path can be determined by constraining each candidate path in the candidate path set. In the embodiments of the present application, assume that a directed graph G=(V,E) of an SDN network based on SR / SRv6 is given, as Figure 4 shown, which is a schematic diagram of the directed graph of the SDN network provided by the embodiments of the present application. Among them, V represents the node set composed of all network nodes in the SDN network. Assume that the direct link from node s to node t is (s,t). For the convenience of subsequent description, here the direct link (s,t) is simply referred to as link e, and the link capacity (bandwidth) of this link e is c e .

[0073] In the embodiments of the present application, specifically, when data is forwarded for the to-be-scheduled path according to different forwarding methods, the constraint condition for the bandwidth of the to-be-scheduled path allocated to the bandwidth of each candidate path is shown in the following formula (4):

[0074]

[0075] Among them, f is the to-be-scheduled path of the user, F is the set composed of all to-be-scheduled paths, size f is the bandwidth size of the to-be-scheduled path f, is the partial bandwidth size of the to-be-scheduled path f allocated on the candidate path p, where, P f is the candidate path set of the to-be-scheduled path f.

[0076] To ensure that the required bandwidth of the to-be-scheduled path can be called and at the same time no redundant bandwidth is wasted. Therefore, the sum of the bandwidths of the to-be-scheduled path allocated to each candidate path needs to be equal to the required bandwidth of the to-be-scheduled path, as shown in the following formula (5):

[0077]

[0078] The bandwidth of each candidate path is constrained, as shown in the following formula (6):

[0079]

[0080] Among them, b z is the value of the z-th row element in the column vector B. The column vector B is an m-row and one-column column vector composed of the available bandwidths of all links. Assuming that the direct link from node s to node t is (s, t), for the convenience of subsequent narration, here the direct link (s, t) is simply referred to as link e, c e is the total bandwidth of link e, E represents the set of all links in the SDN network, u e is the used bandwidth of link e, and θ is the maximum link utilization rate of link e.

[0081] The to-be-scheduled path and each candidate path are constrained, as shown in the following formula (7):

[0082] A T X ≤ B (7)

[0083] Among them, the matrix A represents the P f of all to-be-scheduled paths in the to-be-scheduled path set F T forming a matrix with m columns, and A T is the transpose matrix of the matrix A; for each to-be-scheduled path f in the to-be-scheduled path set F, the candidate path set of the to-be-scheduled path f can be successively used with Pf For each p corresponding to in form K(P f ) one-dimensional array with one row and one column, that is, column vector X f , furthermore, for each X of all the paths to be scheduled in the path set F to be scheduled f form ∑ f∈F K(P f ) column vector X with one row and one column.

[0084] Constrain the bandwidth utilization rate and utilization rate of all paths, as shown in the following formula (8):

[0085]

[0086] The formulas (4)-(8) corresponding to the basic constraints of the above SDN tunnel path calculation are all the basic constraint conditions of this technical solution. On this basis, in order to maximize the network availability and to solve the problem of tunnel path concentration, the network measurement criterion "maximum available degree conversion" can be converted into the constraint of "minimum maximum utilization rate", and furthermore, the optimization objective for obtaining the optimal path can be as shown in the following formula (9):

[0087] The maximum utilization rate of the optimal path = minθ(9)

[0088] That is to say, the maximum utilization rate of the optimal path is the minimum value among the maximum utilization rates of all candidate paths, that is, the candidate path with the smallest maximum utilization rate is the optimal path.

[0089] In the embodiment of the present application, the preset constraint condition of the utilization rate of each candidate path can be determined by transforming formula (8). Specifically, the preset constraint condition can be "for any candidate path, the utilization rate of any candidate path is not less than the maximum first ratio corresponding to any candidate path; where the first ratio is equal to the used bandwidth of any candidate path divided by the total bandwidth of any candidate path", and furthermore, according to this preset constraint condition, the maximum utilization rate of each candidate path in the candidate path set can be determined, and thus, according to the maximum utilization rates of each candidate path, the optimal path of the corresponding network topology can be determined.

[0090] In summary, in the embodiment of the present application, since the candidate path set is determined based on the values corresponding to the betweenness centrality first, the problems of difficult path solving and low calculation efficiency caused by adding constraint conditions to calculate the path at one time in the prior art can be avoided, and since the maximum utilization rate of the candidate path is also used to select the optimal path from the candidate path set, while maximizing the network path availability, the problem of tunnel path concentration can also be solved.

[0091] In addition, this technical solution is not only applicable to the field of communication technologies, but also applicable to path planning between two nodes in similar networks, such as traffic flow planning between two places, to ensure that the maximum traffic flow is carried.

[0092] As Figure 5 shown, based on the same inventive concept, an embodiment of the present application provides a network path selection device, and the device 50 includes:

[0093] A betweenness centrality calculation unit 501, configured to calculate the value corresponding to the betweenness centrality of the paths passing through any node pair in the network topology;

[0094] A candidate path set determination unit 502, configured to determine a candidate path set according to the value corresponding to the betweenness centrality; wherein, the candidate path set includes multiple candidate paths determined from the network topology;

[0095] An optimal path selection unit 503, configured to select an optimal path from the candidate path set according to the maximum utilization rate of each candidate path in the candidate path set; wherein, the utilization rate is used to indicate the efficiency of data transmission and reception per second of the path.

[0096] In a possible implementation manner, the candidate path set determination unit 502 is specifically configured to:

[0097] Sort the values corresponding to the betweenness centrality of all node pairs in the network topology in descending order, and determine the node pairs of the core links as the node pairs of the top N values corresponding to the betweenness centrality;

[0098] Select all candidate paths passing through the node pairs of the core links from all paths in the network topology;

[0099] Determine the candidate path set according to all candidate paths.

[0100] In a possible implementation manner, the device 50 further includes a utilization rate determination unit 504, wherein the utilization rate determination unit 504 is configured to:

[0101] Determine the maximum utilization rate of each candidate path in the candidate path set according to a preset constraint condition; wherein, the preset constraint condition is used to constrain the relationship between the used bandwidth of any candidate path and the total bandwidth of any candidate path.

[0102] In a possible implementation manner, the preset constraint condition includes:

[0103] For any candidate path, the utilization rate of any candidate path is not less than the maximum first ratio corresponding to any candidate path; wherein, the first ratio is equal to the ratio of the used bandwidth of any candidate path to the total bandwidth of any candidate path.

[0104] This device can be used to execute Figures 2 to 4 the method described in the illustrated embodiment. Therefore, for the functions that can be achieved by each functional unit of this device, reference can be made to Figures 2 to 4 the description of the illustrated embodiment, which will not be elaborated here. It should be noted that Figure 5 the functional units shown in the dashed boxes in

[0105] Please refer to Figure 6 , based on the same technical concept, an embodiment of the present application also provides a computer device 60, which may include a memory 601 and a processor 602.

[0106] The memory 601 is used to store the computer program executed by the processor 602. The memory 601 may mainly include a program storage area and a data storage area. Among them, the program storage area may store an operating system, application programs required for at least one function, etc.; the data storage area may store data created according to the use of the computer device, etc. The processor 602 may be a central processing unit (CPU), or a digital processing unit, etc. In the embodiments of the present application, the specific connection medium between the above-mentioned memory 601 and the processor 602 is not limited. In the embodiments of the present application Figure 6 it is shown that the memory 601 and the processor 602 are connected through a bus 603, and the bus 603 is shown as a thick line in Figure 6 For the connection manners between other components, only schematic illustrations are provided and are not to be construed as limitations. The bus 603 may be divided into an address bus, a data bus, a control bus, etc. For the sake of convenience of representation, Figure 6 only a thick line is shown in

[0107] but it does not mean that there is only one bus or one type of bus.

[0108] The processor 602, when calling the computer program stored in the memory 601, executes asFigures 2 to 4 The method performed by the device in the illustrated embodiment.

[0109] In some possible implementation manners, various aspects of the method provided in this application can also be implemented in the form of a program product, which includes program code. When the program product runs on a computer device, the program code is used to cause the computer device to execute the steps in the method according to various exemplary implementation manners of this application described above in this specification. For example, the computer device can execute the method described in the Figures 2 to 4 illustrated embodiment.

[0110] Those of ordinary skill in the art can understand that all or part of the steps to implement the above method embodiments can be completed by hardware related to program instructions. The foregoing program can be stored in a computer-readable storage medium. When the program is executed, it performs the steps including the above method embodiments; and the foregoing storage medium includes: removable storage devices, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks and other various media that can store program code. Or, if the above integrated unit of the present invention is implemented in the form of a software functional module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the embodiments of the present invention, in essence, or the part that contributes to the prior art can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the methods described in various embodiments of the present invention. And the foregoing storage medium includes: removable storage devices, ROM, RAM, magnetic disks, or optical disks and other various media that can store program code.

[0111] Although the preferred embodiments of this application have been described, those skilled in the art can make additional changes and modifications once they learn the basic creative concept. Therefore, the appended claims are intended to be construed to include the preferred embodiments and all changes and modifications falling within the scope of this application.

[0112] Obviously, those skilled in the art can make various changes and modifications to this application without departing from the spirit and scope of this application. Thus, if these modifications and variations of this application fall within the scope of the claims of this application and their equivalent technologies, this application is also intended to include these changes and modifications.

Claims

1. A network path selection method, characterized in that, the method includes: calculating the value corresponding to the betweenness centrality of the paths passing through any node pair in the network topology. Wherein, the larger the value corresponding to the betweenness centrality of the paths passing through any node pair, the greater the probability that the link segment between the two nodes corresponding to any node pair is the shortest path; determining a candidate path set according to the value corresponding to the betweenness centrality; wherein, the candidate path set includes multiple candidate paths determined from the network topology; selecting an optimal path from the candidate path set according to the maximum utilization rate of each candidate path in the candidate path set; wherein, the utilization rate is used to indicate the efficiency of data transmission and reception per second of the path, and the optimal path is the candidate path with the smallest maximum utilization rate selected from the candidate path set; wherein, the determining the candidate path set according to the value corresponding to the betweenness centrality includes: sorting the values corresponding to the betweenness centrality of all node pairs in the network topology in descending order, and determining the node pairs of the core links as the node pairs with the top N values corresponding to the betweenness centrality; selecting all candidate paths passing through the node pairs of the core links from all paths in the network topology; determining the candidate path set according to all the candidate paths.

2. The method according to claim 1, characterized in that, before selecting the optimal path from the candidate path set according to the maximum utilization rate of each candidate path in the candidate path set, the method further includes: determining the maximum utilization rate of each candidate path in the candidate path set according to a preset constraint condition; wherein, the preset constraint condition is used to constrain the relationship between the used bandwidth of any candidate path and the total bandwidth of any candidate path.

3. The method according to claim 2, characterized in that, the preset constraint condition includes: for any candidate path, the utilization rate of any candidate path is not less than the maximum first ratio corresponding to any candidate path; wherein, the first ratio is equal to the ratio of the used bandwidth of any candidate path to the total bandwidth of any candidate path.

4. A network path selection device, characterized in that, the device includes: a betweenness centrality calculation unit, configured to calculate the value corresponding to the betweenness centrality of the paths passing through any node pair in the network topology. Wherein, the larger the value corresponding to the betweenness centrality of the paths passing through any node pair, the greater the probability that the link segment between the two nodes corresponding to any node pair is the shortest path; a candidate path set determination unit, configured to determine a candidate path set according to the value corresponding to the betweenness centrality; wherein, the candidate path set includes multiple candidate paths determined from the network topology; An optimal path selection unit, configured to select an optimal path from the candidate path set according to the maximum utilization rate of each candidate path in the candidate path set; wherein, the utilization rate is used to indicate the data transmission and reception efficiency of the path per second, and the optimal path is the candidate path with the smallest maximum utilization rate selected from the candidate path set; Wherein, the candidate path set determination unit is specifically configured to: Sort the values corresponding to the betweenness centrality of all node pairs in the network topology in descending order, and determine the node pairs of the core links as the node pairs with the top N values of betweenness centrality; Select all candidate paths passing through the node pairs of the core links from all paths in the network topology; Determine the candidate path set according to all the candidate paths.

5. The apparatus according to claim 4, characterized in that the apparatus further includes a utilization rate determination unit, wherein the utilization rate determination unit is configured to: Determine the maximum utilization rate of each candidate path in the candidate path set according to a preset constraint condition; wherein, the preset constraint condition is used to constrain the relationship between the used bandwidth of any candidate path and the total bandwidth of any candidate path.

6. The apparatus according to claim 5, characterized in that the preset constraint condition includes: For any candidate path, the utilization rate of any candidate path is not less than the maximum first ratio corresponding to any candidate path; wherein, the first ratio is equal to the ratio of the used bandwidth of any candidate path to the total bandwidth of any candidate path.

7. A computer device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that when the processor executes the computer program, the steps of the method according to any one of claims 1-3 are implemented.

8. A computer storage medium, on which computer program instructions are stored, characterized in that when the computer program instructions are executed by the processor, the steps of the method according to any one of claims 1-3 are implemented.

Images