CN114298431A - Network path selection method, device, equipment and storage medium - Google Patents
Network path selection method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN114298431A CN114298431A CN202111669834.8A CN202111669834A CN114298431A CN 114298431 A CN114298431 A CN 114298431A CN 202111669834 A CN202111669834 A CN 202111669834A CN 114298431 A CN114298431 A CN 114298431A
- Authority
- CN
- China
- Prior art keywords
- path
- candidate
- candidate path
- paths
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Abstract
The application provides a network path selection method, a device, equipment and a storage medium, relates to the technical field of communication, and is used for solving the problem of tunnel path concentration while improving the availability of network paths. The method comprises the following steps: calculating a value corresponding to betweenness centrality of paths passing through any node pair simultaneously in the network topology; determining a candidate path set according to the value corresponding to the betweenness centrality; wherein, the candidate path set comprises a plurality of 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 for indicating the efficiency of transceiving data per second of the path.
Description
Technical Field
The application relates to the technical field of communication, and provides a network path selection method, a device, equipment and a storage medium.
Background
At present, existing Path selection algorithms mainly include a Shortest Path First (SPF) algorithm and a Constrained Shortest Path First (CSPF) algorithm based on constraints, and these two algorithms can calculate the Shortest Path based on relevant constraint conditions such as network bandwidth, but when the two algorithms are used to select the Path, it is unavoidable that the traffic tends to be the Shortest Path, so that the tunnel paths are concentrated, and a new tunnel Path cannot be added, and further, the availability of the network Path is low. Furthermore, as more and more traffic is moved through the network topology, the selected paths may tend to be consistent, resulting in traffic imbalance.
Disclosure of Invention
Embodiments of the present application provide a method, an apparatus, a device, and a storage medium for selecting a network path, which are used to solve the problem of tunnel path concentration while improving the availability of the network path.
In one aspect, a method for network path selection is provided, where the method includes:
calculating a value corresponding to betweenness centrality of paths passing through any node pair simultaneously in the network topology;
determining a candidate path set according to the value corresponding to the betweenness centrality; wherein, the candidate path set comprises a plurality of 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 for indicating the efficiency of transceiving data per second of the path.
It can be seen that, in the embodiment of the present application, since the candidate path set is determined based on the value corresponding to the betweenness centrality, the problems of difficult path solution and low calculation efficiency caused by adding a constraint condition to calculate a path at one time in the prior art can be avoided.
In a possible implementation manner, the determining a 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 a descending order, and determining the node pairs which are sorted into the values corresponding to the top N betweenness centrality as the node pairs of the core link;
selecting all candidate paths of node pairs passing through the core link from all paths of the network topology;
and determining the candidate path set according to all the candidate paths.
In a possible implementation manner, before selecting an optimal path from the candidate path set according to the maximum utilization 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 for constraining the relation between the used bandwidth of any one candidate path and the total bandwidth of any one candidate path.
In a possible embodiment, the preset constraint includes:
for any candidate path, the utilization rate of the any candidate path is not less than the maximum first ratio corresponding to the any candidate path; wherein the first ratio is equal to a ratio of the used bandwidth of the any one candidate path to a total bandwidth of the any one candidate path.
In one aspect, an apparatus for network path selection is provided, the apparatus comprising:
the betweenness centrality calculating unit is used for calculating a value corresponding to betweenness centrality of a path passing through any node pair simultaneously in the network topology;
a candidate path set determining unit, configured to determine a candidate path set according to the value corresponding to the betweenness centrality; wherein, the candidate path set comprises a plurality of candidate paths determined from the network topology;
the optimal path selection unit is used for 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 for indicating the efficiency of transceiving data per second of the path.
In a possible implementation manner, the candidate path set determining unit is specifically configured to:
sorting the values corresponding to the betweenness centrality of all node pairs in the network topology in a descending order, and determining the node pairs of the core link by the node pairs which are sorted into the first N values corresponding to the betweenness centrality;
selecting all candidate paths of node pairs passing through the core link from all paths of the network topology;
and determining the candidate path set according to all the candidate paths.
In a possible implementation, the apparatus further includes a utilization rate determining unit, where the utilization rate determining unit is configured to:
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 for constraining the relation between the used bandwidth of any one candidate path and the total bandwidth of any one candidate path.
In a possible embodiment, the preset constraint includes:
for any candidate path, the utilization rate of the any candidate path is not less than the maximum first ratio corresponding to the any candidate path; wherein the first ratio is equal to a ratio of the used bandwidth of the any one candidate path to a total bandwidth of the any one candidate path.
In one aspect, a computer device is provided, comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the method of the above aspect when executing the computer program.
In one aspect, a computer storage medium is provided having computer program instructions stored thereon that, when executed by a processor, implement the steps of the method of the above aspect.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments or related technologies, the drawings needed to be used in the description of the embodiments or related technologies are briefly introduced below, it is obvious that the drawings in the following description are only the embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a schematic view of an application scenario provided in an embodiment of the present application;
fig. 2 is a schematic flowchart of a network path selection method according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of determining a candidate path set according to an embodiment of the present application;
fig. 4 is a schematic diagram of an SDN network directed graph provided in an embodiment of the present application;
FIG. 5 is a schematic diagram of an Ethernet-based network routing apparatus;
fig. 6 is a schematic structural diagram of a computer device according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions in the embodiments of the present application will be described clearly and completely with reference to the accompanying drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application. In the present application, the embodiments and features of the embodiments may be arbitrarily combined with each other without conflict. Also, while a logical order is shown in the flow diagrams, in some cases, the steps shown or described may be performed in an order different than here. In addition, in the technical scheme of the application, the data acquisition, transmission, use and the like all meet the requirements of relevant national laws and regulations.
First, some terms in the present application will be explained.
(1) The betweenness centrality generally means that if a member is located on the shortest paths of other members, the member is the core member, and has larger betweenness centrality. Therefore, the node betweenness centrality is usually expressed in the network by the ratio of the shortest path number passing through a certain node to all the shortest path numbers in the network.
At present, existing path selection algorithms mainly include an SPF algorithm and a CSPF algorithm, which can calculate the shortest path based on the relevant constraint conditions such as network bandwidth, but when the two algorithms are used to select paths, it is inevitable that the traffic tends to the shortest path, which results in tunnel path concentration and failure to add a new tunnel path, and thus, the network path availability is low. Furthermore, as more and more traffic is moved through the network topology, the selected paths may tend to be consistent, resulting in traffic imbalance.
Based on this, in the method, after calculating a value corresponding to the betweenness centrality of a path passing through any node pair in the network topology at the same time, a candidate path set including a plurality of candidate paths determined from the network topology may be determined according to the value corresponding to the betweenness centrality, and then, an optimal path may be selected from the candidate path set according to the maximum utilization rate of each candidate path in the candidate path set. It can be seen that, in the embodiment of the present application, since the candidate path set is determined based on the value corresponding to the betweenness centrality, the problems of difficult path solution and low calculation efficiency caused by adding a constraint condition to calculate a path at one time in the prior art can be avoided.
The technical scheme of the embodiment of the application can be applied to any possible network path selection scene. Fig. 1 is a schematic view of an application scenario provided in the embodiment of the present application. The application scenario of network path selection may include the user terminal 10 and the network path selection device 11.
The user terminal 10 may be a device capable of receiving a user input operation (e.g., inputting a bandwidth of a path to be scheduled), and may be, for example, a Personal Computer (PC), a notebook computer, or the like.
The network path selection device 11 may be a server that provides data storage and data computation for the network path selection process, may be an independent physical server, may also be a database cluster or a distributed system formed by a plurality of physical servers, and may also be a cloud server that provides basic cloud computing services such as cloud service, cloud database, cloud computation, cloud function, cloud storage, network service, cloud communication, middleware service, domain name service, security service, CDN, and big data and artificial intelligence platform, but is not limited thereto. The network routing device 11 may include one or more processors 101, memory 102, and I/O interfaces 103 to interact with other devices, etc. In addition, the network path selection device 11 may further configure a database 104, and the database 104 may be configured to store data corresponding to betweenness centrality, a candidate path set, an optimal path, and the like, which are involved in the scheme provided in the embodiment of the present application. The memory 102 of the network path selection device 11 may store program instructions of the network path selection method provided in the embodiment of the present application, and when the program instructions are executed by the processor 101, the program instructions can be used to implement the steps of the network path selection method provided in the embodiment of the present application, so that the problem of tunnel path convergence is solved while the availability of the network path is improved.
In one possible embodiment, when the network path selection device 11 detects an input operation performed by a user on the user terminal 10 through the I/O interface 103, the processor 101 of the network path selection device 11 executes the program instructions of the network path selection method stored in the memory 102, thereby solving the problem of tunnel path convergence while improving the availability of network paths. And the data corresponding to the betweenness centrality, the candidate path set, and the optimal path involved in the execution of the program instructions are stored in the database 104.
Of course, the method provided in the embodiment of the present application is not limited to be used in the application scenario shown in fig. 1, and may also be used in other possible application scenarios, and the embodiment of the present application is not limited. The functions that can be implemented by each device in the application scenario shown in fig. 1 will be described in the following method embodiments, and will not be described in detail herein. Hereinafter, the method of the embodiment of the present application will be described with reference to the drawings.
As shown in fig. 2, a schematic flow chart of a network path selection method provided in this embodiment of the present application is provided, where the method may be executed by the network path selection device 11 in fig. 1, which is not limited in this embodiment of the present application, and a flow of the method is described as follows.
Step 201: and calculating the value corresponding to the betweenness centrality of the paths passing through any node pair simultaneously in the network topology.
In this embodiment of the present application, the Network topology may be a Software Defined Network (SDN) based on Segment Routing/Segment Routing IPv6(Segment Routing/Segment Routing IPv6, SR/SRv6), where if any node pair is S ═ x, y, where x and y are nodes specifically corresponding to any node pair, the start node of the Network path is S, and the end node is t, then the value corresponding to the betweenness centrality of the path passing through the node pair S ═ x, y is assumed to be (x, y)
The calculation can be performed by the following formula (1):
wherein, the starting node s to the ending node t all belong to a node set V, the node set V comprises all nodes in the network topology, the starting node s is not equal to the ending node t, sigmas,tThe number of all shortest paths between the start node s to the end node t,
indicating the number of shortest paths that simultaneously traverse the node pair S ═ x, y. Due to the shortest path from the start node s to the end node t via the node vThe number of diameters sigmas,t(v) The calculation can be made by the following equation (2):
where d (s, t) is the distance between s and t, i.e., the shortest path from the start node s to the end node t through the node v is composed of the shortest path from the start node s to the node v and the shortest path from the node v to the end node t, and therefore, the number σ of the shortest paths from the start node s to the end node t through the node v is the numbers,t(v) May be obtained by multiplying the shortest path number between the starting node s and the node v by the shortest path number between the node v and the terminating node t.
Further, based on the above formula (2), the above formula (1) can be converted into the following formula (3):
wherein σs,xIs the number of all shortest paths, σ, between the starting node s to the node xx,yFor the number of all shortest paths between node x to node y, σy,tThe number of all shortest paths between node y to the terminating node t.
Further, based on the above equation (3), it is possible to specify a value corresponding to the betweenness centrality of the path passing through any pair of nodes S ═ x, y
It is used.
Step 202: and determining a candidate path set according to the value corresponding to the betweenness centrality.
In the embodiment of the present application, the candidate path set may include a plurality of candidate paths determined from the network topology.
In practical application, the larger the value corresponding to the betweenness centrality of the path passing through any node pair S ═ x, y at the same time, the more the probability that the link between the node x and the node y corresponding to the node pair S ═ x, y is the core link, namely, the probability of the shortest path is larger, and based on this, in order to avoid the problems of difficult path solution and low calculation efficiency caused by adding constraint conditions to the path calculation at one time in the prior art, when determining the shortest path according to the value corresponding to the betweenness centrality of each node pair, a candidate path set including a plurality of candidate paths can be determined from the network topology, furthermore, an optimal path can be determined from the candidate path set according to the constraint condition to perform data transmission for the user, and the optimal path is the shortest path meeting the constraint condition.
Step 203: and selecting an optimal path from the candidate path set according to the maximum utilization rate of each candidate path in the candidate path set.
In the embodiment of the present application, the utilization rate may be used to indicate the efficiency of transceiving data per second for the path.
In practical applications, since the calculation of the entire tunnel path is substantially close to the problem of multi-commodity flow (network flow problem that multiple articles or goods flow from different sources to different sinks in the network), in the embodiment of the present application, the selection of the optimal path may be simplified by referring to a multi-commodity flow algorithm, and the multi-commodity flow is directed to "network flow problem of different sources and sinks" of goods in the network, which is simplified to "network flow problem of fixed sources and sinks". Furthermore, in order to achieve high availability of the network (capable of carrying more tunnel bandwidth demands), a constraint condition needs to be added for path calculation to ensure that the currently calculated path has the lowest maximum utilization of the network, i.e., it is ensured that the newly added path does not occupy the network bandwidth excessively to cause waste when guaranteeing the demands, so that the constraint of the metric "maximum availability" can be finally converted into the constraint of "maximum utilization minimization", and further, based on the constraint condition of "maximum utilization minimization", the maximum utilization of each candidate path in the candidate path set can be calculated first, and then the candidate path with the minimum maximum utilization is selected from the candidate paths as the optimal path. Because the optimal path is not calculated and determined by adopting SPF and CSPF in the prior art, the problem of tunnel path concentration can be solved while the availability of the network path is maximized.
In a possible implementation manner, as shown in fig. 3, a schematic flowchart of a process for determining a candidate path set provided in this embodiment of the present application is provided, where the determining process may be performed by the network path selecting device 11 in fig. 1, and this is not limited in this embodiment of the present application, and the process is specifically described as follows.
Step 301: and sorting the values corresponding to the betweenness centrality of all node pairs in the network topology in a descending order, and determining the node pairs of the core link by the node pairs which are sorted into the values corresponding to the top N betweenness centrality.
In the embodiment of the present application, the larger the value corresponding to the betweenness centrality of the path passing through any node pair S ═ x, y at the same time, the higher the probability that the link between the node x and the node y corresponding to the node pair S ═ x, y is taken as the core link, so after the values corresponding to the betweenness centrality of all node pairs are determined, the values corresponding to the betweenness centrality of all node pairs in the network topology may be sorted in a descending order, and further, the node pairs sorted into the values corresponding to the first N betweenness centrality may be determined as the node pairs of the core link. The value of N may be set by a user according to a requirement of the user, or may be set according to an empirical value.
Step 302: from all paths of the network topology, all candidate paths of node pairs passing through the core link are selected.
In the embodiment of the present application, all paths between the start node and the end node in the SR/SRv 6-based SDN can be obtained through a common graph algorithm, and then, from these all paths, all candidate paths of node pairs passing through the core link are selected. Wherein there may be more than one candidate path that passes through the same node pair at the same time.
Step 303: and determining a candidate path set according to all the candidate paths.
In the embodiment of the present application, after all candidate paths of node pairs passing through a core link are selected, all candidate paths may be grouped into one set, that is, a candidate path set.
In one possible implementation, after the candidate path set is determined, the optimal path may be determined by constraining each candidate path in the candidate path set. In this embodiment of the present application, assuming that a directed graph G of an SDN network based on SR/SRv6 is given as (V, E), as shown in fig. 4, a schematic diagram of the SDN network directed graph provided in this embodiment of the present application is provided, where V denotes that all network nodes in the SDN network constitute a node set, and a direct link from a node s to a node t is assumed as (s, t), and for convenience of description, the direct link (s, t) is referred to as a link E, and a link capacity (bandwidth) of the link E is ce。
In this embodiment, specifically, when data forwarding is performed on a path to be scheduled according to different forwarding manners, a constraint condition that a bandwidth required by the path to be scheduled is allocated to a bandwidth on each candidate path is as shown in the following formula (4):
wherein F is the path to be scheduled of the user, F is the set formed by all the paths to be scheduled, and sizefTo schedule the bandwidth size of the path f,
to allocate the part of the bandwidth of the path f to be scheduled, which is split over the candidate path p, wherein,
Pfa candidate path set of path f is to be scheduled.
To ensure that the required bandwidth of the path to be scheduled can be called and at the same time, the unnecessary bandwidth is not wasted, so that the required bandwidth of the path to be scheduled is shared by the bandwidths of the candidate paths, and is equal to the required bandwidth of the path to be scheduled, as shown in the following formula (5):
the bandwidth of each candidate path is constrained as shown in the following equation (6):
bz＝θce-ue,
z is the number of e (6)
Wherein, bzAssuming that a direct link from a node s to a node t is (s, t), for convenience of description, the direct link (s, t) is referred to as link e, c for shorteThe total bandwidth of a link E, E represents a link set composed of all links in the SDN network, ueθ is the maximum link utilization for link e, which is the used bandwidth of link e.
And (3) constraining the paths to be scheduled and each candidate path, as shown in the following formula (7):
ATX≤B (7)
wherein, the matrix A represents P of all paths to be scheduled in the path set F to be scheduledfForm a matrix with m columns, ATIs a transposed matrix of the matrix A; for each path F to be scheduled in the path set F to be scheduled, the candidate paths of the path F to be scheduled can be sequentially set as PfEach p in (1) corresponds to
Composition K (P)f) One-dimensional arrays of rows and columns, i.e. column vectors XfFurthermore, the X of each path to be scheduled in the path set F to be scheduledfForm Σf∈FK(Pf) A column vector X of rows and columns.
The bandwidth utilization and utilization of all paths are constrained, as shown in the following equation (8):
on this basis, in order to maximize the network availability and solve the problem of tunnel path convergence, the network metric "maximum availability conversion" may be converted into the constraint of "maximum utilization minimization", and then the optimization target for obtaining the optimal path may be shown in the following formula (9):
maximum utilization of optimal path min θ (9)
That is, the maximum utilization of the optimal path is the minimum of the respective maximum utilizations of all candidate paths, that is, the candidate path having the smallest maximum utilization is the optimal path.
In this embodiment of the present application, a preset constraint condition of the utilization rate of each candidate path may be determined by transforming formula (8), and specifically, the preset constraint condition may be that "for any candidate path, the utilization rate of any candidate path is not less than the maximum first ratio corresponding to any candidate path; the first ratio is equal to the ratio of the used bandwidth of any candidate path to the total bandwidth of any candidate path ", and then the maximum utilization rate of each candidate path in the candidate path set can be determined according to the preset constraint condition, so that the optimal path of the corresponding network topology can be determined according to the maximum utilization rate of each candidate path.
In summary, in the embodiment of the present application, since the candidate path set is determined based on the value corresponding to the betweenness centrality, the problems of difficult path solution and low calculation efficiency caused by adding the constraint condition to calculate the path at one time in the prior art can be avoided, and the optimal path is selected from the candidate path set by using the maximum utilization rate of the candidate path, so that the usability of the network path is maximized, and the problem of tunnel path concentration can be solved.
In addition, the technical scheme is not only suitable for the technical field of communication, but also suitable for path planning of two nodes of a similar network and the like, such as traffic flow planning between two places, and ensures that the maximum traffic flow is borne.
As shown in fig. 5, based on the same inventive concept, an embodiment of the present application provides a network path selecting apparatus, where the apparatus 50 includes:
an betweenness centrality calculation unit 501, configured to calculate a value corresponding to betweenness centrality of paths that simultaneously pass through any node pair in the network topology;
a candidate path set determining unit 502, configured to determine a candidate path set according to a value corresponding to the betweenness centrality; the candidate path set comprises a plurality of candidate paths determined from the network topology;
an optimal path selecting unit 503, configured to select an optimal path from the candidate path set according to a maximum utilization rate of each candidate path in the candidate path set; wherein the utilization rate is used to indicate the efficiency of the path in transceiving data per second.
In a possible implementation manner, the candidate path set determining unit 502 is specifically configured to:
sorting the values corresponding to the betweenness centrality of all node pairs in the network topology in a descending order, and determining the node pairs which are sorted into the values corresponding to the top N betweenness centrality as the node pairs of the core link;
selecting all candidate paths of node pairs passing through a core link from all paths of the network topology;
and determining a candidate path set according to all the candidate paths.
In a possible implementation, the apparatus 50 further includes a utilization determining unit 504, where the utilization determining unit 504 is configured to:
determining the maximum utilization rate of each candidate path in the candidate path set according to a preset constraint condition; the preset constraint condition is used for constraining the relation between the used bandwidth of any candidate path and the total bandwidth of any candidate path.
In one possible embodiment, the preset constraints include:
aiming at 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 a ratio of the used bandwidth of any of the candidate paths to a total bandwidth of any of the candidate paths.
The apparatus may be configured to execute the method in the embodiment shown in fig. 2 to fig. 4, and therefore, for functions and the like that can be realized by each functional unit of the apparatus, reference may be made to the description of the embodiment shown in fig. 2 to fig. 4, which is not repeated here. It should be noted that the functional units shown by the dashed boxes in fig. 5 are unnecessary functional units of the apparatus.
Referring to fig. 6, based on the same technical concept, the embodiment of the present application further provides a computer device 60, which may include a memory 601 and a processor 602.
The memory 601 is used for storing computer programs executed by the processor 602. The memory 601 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function, and the like; the storage data area may store data created according to use of the computer device, and the like. The processor 602 may be a Central Processing Unit (CPU), a digital processing unit, or the like. The specific connection medium between the memory 601 and the processor 602 is not limited in the embodiments of the present application. In the embodiment of the present application, the memory 601 and the processor 602 are connected by a bus 603 in fig. 6, the bus 603 is represented by a thick line in fig. 6, and the connection manner between other components is merely for illustrative purposes and is not limited thereto. The bus 603 may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 6, but this is not intended to represent only one bus or type of bus.
The memory 601 may be a volatile memory (volatile memory), such as a random-access memory (RAM); the memory 601 may also be a non-volatile memory (non-volatile memory) such as, but not limited to, a read-only memory (rom), a flash memory (flash memory), a Hard Disk Drive (HDD) or a solid-state drive (SSD), or any other medium which can be used to carry or store desired program code in the form of instructions or data structures and which can be accessed by a computer. The memory 601 may be a combination of the above memories.
A processor 602, configured to execute the method performed by the apparatus in the embodiments shown in fig. 2 to fig. 4 when calling the computer program stored in the memory 601.
In some possible embodiments, various aspects of the methods provided herein may also be implemented in the form of a program product including program code for causing a computer device to perform the steps of the methods according to various exemplary embodiments of the present application described above in this specification when the program product is run on the computer device, for example, the computer device may perform the methods as described in the embodiments shown in fig. 2-4.
Those of ordinary skill in the art will understand that: all or part of the steps for implementing the method embodiments may be implemented by hardware related to program instructions, and the program may be stored in a computer readable storage medium, and when executed, the program performs the steps including the method embodiments; and the aforementioned storage medium includes: a mobile storage device, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes. Alternatively, the integrated unit of the present invention may be stored in a computer-readable storage medium if it is implemented in the form of a software functional module and sold or used as a separate product. Based on such understanding, the technical solutions of the embodiments of the present invention may be essentially implemented or a part contributing to the prior art may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the methods described in the embodiments of the present invention. And the aforementioned storage medium includes: a removable storage device, a ROM, a RAM, a magnetic or optical disk, or various other media that can store program code.
While the preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.
Claims (10)
1. A method for network path selection, the method comprising:
calculating a value corresponding to betweenness centrality of paths passing through any node pair simultaneously in the network topology;
determining a candidate path set according to the value corresponding to the betweenness centrality; wherein, the candidate path set comprises a plurality of 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 for indicating the efficiency of transceiving data per second of the path.
2. The method of claim 1, wherein determining a set of candidate paths based on the value to which the betweenness centrality corresponds comprises:
sorting the values corresponding to the betweenness centrality of all node pairs in the network topology in a descending order, and determining the node pairs which are sorted into the values corresponding to the top N betweenness centrality as the node pairs of the core link;
selecting all candidate paths of node pairs passing through the core link from all paths of the network topology;
and determining the candidate path set according to all the candidate paths.
3. The method of claim 1, wherein prior to selecting an optimal path from the set of candidate paths based on a maximum utilization of each candidate path in the set of candidate paths, the method further comprises:
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 for constraining the relation between the used bandwidth of any one candidate path and the total bandwidth of any one candidate path.
4. The method of claim 3, wherein the preset constraints comprise:
for any candidate path, the utilization rate of the any candidate path is not less than the maximum first ratio corresponding to the any candidate path; wherein the first ratio is equal to a ratio of the used bandwidth of the any one candidate path to a total bandwidth of the any one candidate path.
5. A network routing apparatus, the apparatus comprising:
the betweenness centrality calculating unit is used for calculating a value corresponding to betweenness centrality of a path passing through any node pair simultaneously in the network topology;
a candidate path set determining unit, configured to determine a candidate path set according to the value corresponding to the betweenness centrality; wherein, the candidate path set comprises a plurality of candidate paths determined from the network topology;
the optimal path selection unit is used for 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 for indicating the efficiency of transceiving data per second of the path.
6. The apparatus of claim 5, wherein the candidate path set determining unit is specifically configured to:
sorting the values corresponding to the betweenness centrality of all node pairs in the network topology in a descending order, and determining the node pairs which are sorted into the values corresponding to the top N betweenness centrality as the node pairs of the core link;
selecting all candidate paths of node pairs passing through the core link from all paths of the network topology;
and determining the candidate path set according to all the candidate paths.
7. The apparatus of claim 5, wherein the apparatus further comprises a utilization determination unit, wherein the utilization determination unit is to:
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 for constraining the relation between the used bandwidth of any one candidate path and the total bandwidth of any one candidate path.
8. The apparatus of claim 7, wherein the preset constraints comprise:
for any candidate path, the utilization rate of the any candidate path is not less than the maximum first ratio corresponding to the any candidate path; wherein the first ratio is equal to a ratio of the used bandwidth of the any one candidate path to a total bandwidth of the any one candidate path.
9. A computer device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor,
the processor, when executing the computer program, realizes the steps of the method of any of claims 1-4.
10. A computer storage medium having computer program instructions stored thereon, wherein,
the computer program instructions, when executed by a processor, implement the steps of the method of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111669834.8A CN114298431A (en) | 2021-12-31 | 2021-12-31 | Network path selection method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111669834.8A CN114298431A (en) | 2021-12-31 | 2021-12-31 | Network path selection method, device, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114298431A true CN114298431A (en) | 2022-04-08 |
Family
ID=80973455
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111669834.8A Pending CN114298431A (en) | 2021-12-31 | 2021-12-31 | Network path selection method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114298431A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115086230A (en) * | 2022-06-15 | 2022-09-20 | 中国联合网络通信集团有限公司 | Method, device, equipment and storage medium for determining routing of computing network |
-
2021
- 2021-12-31 CN CN202111669834.8A patent/CN114298431A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115086230A (en) * | 2022-06-15 | 2022-09-20 | 中国联合网络通信集团有限公司 | Method, device, equipment and storage medium for determining routing of computing network |
| CN115086230B (en) * | 2022-06-15 | 2023-06-30 | 中国联合网络通信集团有限公司 | Method, device, equipment and storage medium for determining computing network route |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9317336B2 (en) | Method and apparatus for assignment of virtual resources within a cloud environment | |
| CN113315700A (en) | Computing resource scheduling method, device and storage medium | |
| JP6275263B2 (en) | Traffic engineering for large data center networks | |
| JP2012048424A (en) | Method and program for allocating identifier | |
| CN105515977B (en) | Method, device and system for acquiring transmission path in network | |
| Chen et al. | NFV middlebox placement with balanced set-up cost and bandwidth consumption | |
| WO2021003422A1 (en) | Network and method for servicing a computation request | |
| CN111182037A (en) | Mapping method and device of virtual network | |
| Tessier et al. | Topology-aware data aggregation for intensive I/O on large-scale supercomputers | |
| CN113472671B (en) | Method, device and computer readable storage medium for determining multicast route | |
| US10216593B2 (en) | Distributed processing system for use in application migration | |
| Lin et al. | Column generation based service function chaining embedding in multi-domain networks | |
| CN108347377B (en) | Data forwarding method and device | |
| CN114298431A (en) | Network path selection method, device, equipment and storage medium | |
| CN116723143B (en) | Network target range resource allocation method and system based on traffic affinity | |
| JP7180424B2 (en) | Parallel processing device, data transfer destination determination method and data transfer destination determination program | |
| Di et al. | Cost efficient virtual infrastructure mapping using subgraph isomorphism | |
| US20160006617A1 (en) | Cloud application bandwidth modeling | |
| CN114237985B (en) | Method for repairing failed memory block in erasure code memory system and related device | |
| Nishanbayev et al. | Evaluating the effectiveness of a software-defined cloud data center with a distributed structure | |
| WO2017197481A1 (en) | Methods and systems for failure recovery in a virtual network environment | |
| CN115361332A (en) | Processing method and device for fault-tolerant routing, processor and electronic equipment | |
| WO2018130307A1 (en) | An architecture and coordination mechanism to distribute and parallelize any mcf solver | |
| Peres | Concurrent self-adjusting distributed tree networks | |
| Horimoto et al. | Backup resource allocation model with probabilistic protection considering service delay |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |