CN114640622B - Method and device for determining data transmission path and software-defined network controller - Google Patents
Method and device for determining data transmission path and software-defined network controller Download PDFInfo
- Publication number
- CN114640622B CN114640622B CN202210281980.1A CN202210281980A CN114640622B CN 114640622 B CN114640622 B CN 114640622B CN 202210281980 A CN202210281980 A CN 202210281980A CN 114640622 B CN114640622 B CN 114640622B
- Authority
- CN
- China
- Prior art keywords
- weight
- load
- path
- data transmission
- node
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
Abstract
The disclosure provides a method and a device for determining a data transmission path and a software defined network controller, and relates to the field of data transmission, wherein the method comprises the following steps: acquiring network topology information, wherein the network topology information comprises a plurality of paths between a first node and a second node, and each path comprises at least one link; determining a second weight of each path, wherein the second weight is the sum of the first weights of each link on the path, and under the condition that the load of any one link is greater than or equal to a preset load, the first weight of any one link has a monotonic change relation with the load, and the preset load is greater than 0; under the condition that the monotonic change relation is a positive correlation relation, selecting a first path with a second weight smaller than a first preset value from a plurality of paths as a data transmission path between nodes; or in the case that the monotonically changing relationship is a negative correlation, selecting a second path having a second weight greater than a second preset value from the plurality of paths as a data transmission path between the nodes.
Description
Technical Field
The present disclosure relates to the field of data transmission, and in particular, to a method and an apparatus for determining a data transmission path, and a Software Defined Network (SDN) controller.
Background
In data transmission through a computing network, it is necessary to select an optimal data transmission path for a user.
In the related art, a data transmission path is selected using a shortest path algorithm.
Disclosure of Invention
The inventors have noted that a certain path may be frequently selected as a data transmission path in the related art manner, resulting in overload.
Through analysis, the inventors found that the weight of each link is fixed in the shortest path algorithm. In the case of fixed link weights, the weight of each path is also fixed, so that the shortest path algorithm is used to select the same path (i.e., the path with the smallest weight), which causes the path to be repeatedly selected and thus causes overload on the path.
In order to solve the above-described problems, the embodiments of the present disclosure propose the following solutions.
According to an aspect of the embodiments of the present disclosure, there is provided a method for determining a data transmission path, including: acquiring network topology information, wherein the network topology information comprises a plurality of paths between a first node and a second node, and each path comprises at least one link; determining a second weight of each path, wherein the second weight is the sum of first weights of each link on the path, and when the load of any one link is greater than or equal to a preset load, the first weight of any one link has a monotonic change relation with the load, and the preset load is greater than 0; selecting a first path with the second weight smaller than a first preset value from the paths as a data transmission path between the first node and the second node under the condition that the monotonic change relation is a positive correlation relation; or selecting a second path with the second weight greater than a second preset value from the plurality of paths as a data transmission path between the first node and the second node in the case that the monotonic variation relationship is a negative correlation relationship.
In some embodiments, the first weight is a fixed value if the load is less than the preset load; in the case where the load is equal to the preset load, the first weight is not equal to the fixed value.
In some embodiments, the greater the load, the greater the value of the change in the first weight with the unit increase in the load.
In some embodiments, the positive correlation is an exponential function, the first weight is a dependent variable of the exponential function, and the load is an independent variable of the exponential function.
In some embodiments, the exponential function relationship is: c=c 0 ×B m×(u-t)+n Wherein C represents the first weight, u represents the load, t represents the preset load, C 0 Each of B, m and n is constant, and B is greater than 1, m is greater than 0, and n is greater than or equal to 1.
In some embodimentsThe first weight is a fixed value under the condition that the load is smaller than the preset load; in the case where the load is equal to the preset load, the first weight is not equal to the fixed value, C 0 Equal to the fixed value.
In some embodiments, B is greater the total number of links on the plurality of paths.
In some embodiments, the first path is the one of the plurality of paths with the smallest weight of the second path; the second path is one path with the largest second weight in the paths.
According to another aspect of the embodiments of the present disclosure, there is provided a data transmission path determining apparatus including: an acquisition module configured to acquire network topology information, the network topology information including a plurality of paths between a first node and a second node, each path including at least one link; the determining module is configured to determine a second weight of each path, wherein the second weight is a sum of first weights of each link on the path, and when the load of any one link is greater than or equal to a preset load, the first weight of any one link has a monotonic change relation with the load, and the preset load is greater than 0; a selecting module configured to select, from the plurality of paths, a first path having the second weight smaller than a first preset value as a data transmission path between the first node and the second node, in a case where the monotonically changing relationship is a positive correlation relationship; or selecting a second path with the second weight greater than a second preset value from the plurality of paths as a data transmission path between the first node and the second node in the case that the monotonic variation relationship is a negative correlation relationship.
According to still another aspect of the embodiments of the present disclosure, there is provided a data transmission path determining apparatus including: a memory; and a processor coupled to the memory and configured to perform the method of any of the embodiments described above based on instructions stored in the memory.
According to still another aspect of the disclosed embodiments, a software defined network controller is provided, which includes the determining device of the data transmission path according to any one of the foregoing embodiments.
According to a further aspect of the disclosed embodiments, a computer readable storage medium is provided, comprising computer program instructions, wherein the computer program instructions, when executed by a processor, implement the method according to any of the above embodiments.
According to a further aspect of the disclosed embodiments, there is provided a computer program product comprising a computer program, wherein the computer program, when executed by a processor, implements the method according to any of the above embodiments.
In the embodiment of the disclosure, the first weight of each link is dynamically adjusted by the load on each link, so as to adjust the second weight of each path. Selecting the data transmission paths according to such second weights may be such that the load of each path is not excessive, thereby achieving load balancing of the multiple paths.
The technical scheme of the present disclosure is described in further detail below through the accompanying drawings and examples.
Drawings
In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present disclosure, and other drawings may be obtained according to these drawings without inventive effort to a person of ordinary skill in the art.
Fig. 1 is a flow diagram of a method of determining a data transmission path according to some embodiments of the present disclosure;
FIG. 2 is a schematic diagram of a data transmission path according to one particular embodiment of the present disclosure;
fig. 3 is a schematic structural view of a determination device of a data transmission path according to some embodiments of the present disclosure;
fig. 4 is a schematic structural view of a data transmission path determining apparatus according to other embodiments of the present disclosure.
Detailed Description
The following description of the technical solutions in the embodiments of the present disclosure will be made clearly and completely with reference to the accompanying drawings in the embodiments of the present disclosure, and it is apparent that the described embodiments are only some embodiments of the present disclosure, not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments in this disclosure without inventive faculty, are intended to fall within the scope of this disclosure.
The relative arrangement of the components and steps, numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless it is specifically stated otherwise.
Meanwhile, it should be understood that the sizes of the respective parts shown in the drawings are not drawn in actual scale for convenience of description.
Techniques, methods, and apparatus known to one of ordinary skill in the relevant art may not be discussed in detail, but should be considered part of the specification where appropriate.
In all examples shown and discussed herein, any specific values should be construed as merely illustrative, and not a limitation. Thus, other examples of the exemplary embodiments may have different values.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further discussion thereof is necessary in subsequent figures.
In addition, in the description of the present disclosure, the terms "first," "second," "third," etc. are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or order. Similarly, although operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In some cases, multitasking and parallel processing may be advantageous.
Fig. 1 is a flow diagram of a method of determining a data transmission path according to some embodiments of the present disclosure. In some embodiments, an SDN controller performs a method of determining a data transmission path.
In step 102, network topology information is obtained. Here, the network topology information includes a plurality of paths between the first node and the second node, each path including at least one link.
At step 104, a second weight for each path is determined, the second weight being the sum of the first weights for each link on the path.
And under the condition that the load of any one link is greater than or equal to a preset load, the first weight of any one link has a monotonic change relation with the load. Here, the preset load is greater than 0. The load may also be referred to as the utilization of the link.
It should be understood that the value of the preset load may be set according to actual needs. For example, in the case where the desired path is shortest and the demand for load balancing is relatively low, the preset load may be increased; and in case load balancing is desired and the requirements on path length are relatively low, the preset load can be reduced.
The monotonically varying relationship may be a positive correlation or a negative correlation. In the case where the monotonically changing relationship is a positive correlation, the first weight increases with an increase in load, and step 106 is performed subsequently. In the case where the monotonic change relationship is a negative correlation, the first weight decreases with increasing load, and step 108 is performed subsequently.
In step 106, a first path having a second weight less than a first preset value is selected from the plurality of paths as a data transmission path between the first node and the second node.
For example, the first preset value may be a fixed value; for another example, the first preset value may be a second weight of a certain link.
In some embodiments, in a case where the monotonically changing relationship is a positive correlation, one of the paths with the smallest second weight is selected as the data transmission path. In this case, the first preset value may be regarded as a next-smallest value of the second weights of the plurality of links.
In step 108, a second path having a second weight greater than a second preset value is selected from the plurality of paths as a data transmission path between the first node and the second node.
Similarly, the second preset value may be a fixed value, for example; for another example, the second preset value may be a second weight of a certain link.
In some embodiments, in a case where the monotonically changing relationship is a negative correlation, one path with the largest second weight is selected from the plurality of paths as the data transmission path. In this case, the second preset value may be regarded as a next-largest value of the second weights of the plurality of links.
In the above embodiment, the first weight of each link is dynamically adjusted by the load on each link, and thus the second weight of each path is adjusted. Selecting the data transmission paths according to such second weights may be such that the load of each path is not excessive, thereby achieving load balancing of the multiple paths.
In some embodiments, the first weight is a fixed value if the load is less than a preset load; in case the load is equal to the preset load, the first weight is not equal to a fixed value. For example, the fixed value is 1, the preset load is 0.2, and then in the case that the load is 0.1, the first weight of the link is 1; and in case of a load of 0.2, the first weight of the link may be 10.
In the above embodiment, the first weights of the links with each load smaller than the preset load are all the same fixed value, so that the influence of the first weights of the links with the load smaller than the preset load on the second weights of the paths to which the links belong is the same, thereby more effectively realizing the load balancing of the multiple paths.
The monotonic changing relationship between the first weight of the link and the load is described below in connection with some embodiments.
In some embodiments, the larger the load, the greater the value of the change in the first weight with the unit increase in the load. For example, every 1% increase in load, the increase value of the first weight is 2, 5, 7, 9, etc. in order; for another example, each time the load is reduced by 1%, the reduction value of the first weight is sequentially 2, 5, 7, 9, or the like. Therefore, the change value of the second weight of the path to which the link with larger load belongs is larger, so that the path to which the link with larger load belongs is less easy to select as the data transmission path, and the load balance of a plurality of paths is more effectively realized.
It should be appreciated that the first weight may have a different functional relationship with the load, as long as the larger the load, the larger the value of the change in the first weight with the unit increase in the load. Some implementations of positive correlation are described below.
In some embodiments, the positive correlation may be an exponential function, the first weight is a dependent variable of the exponential function, and the load is an independent variable of the exponential function. The exponential function relationship may achieve a greater variation in the dependent variable with increasing units of the independent variable. Therefore, the change value of the second weight of the path to which the link with larger load belongs is larger, so that the path to which the link with larger load belongs is less easy to select as the data transmission path, and the load balance of a plurality of paths is more effectively realized.
As some implementations, the exponential function relationship may be: c=c 0 ×B m×(u-t)+n Wherein C represents a first weight, u represents a load, and t represents a preset load; c (C) 0 Each of B, m and n is constant, and B is greater than 1, m is greater than 0, and n is greater than or equal to 1.
In this case, the base of the exponential function is greater than 1 and the exponent is greater than or equal to 1. Therefore, the first weight is larger along with the increase of the load, and the change value of the second weight of the path to which the link with larger load belongs is larger, so that the path to which the link with larger load belongs is less easy to select as the data transmission path, and the load balance of a plurality of paths is more effectively realized.
The inventors have noted that by adjusting C 0 The values of B and m can more effectively realize the load balancing of multiple paths.
In some embodiments, C 0 May be equal to the fixed value described above. In this way, it is ensured that when the load is greater than the preset negativeCarrier (u)>t) the first weight C is greater than a fixed value C 0 Thereby ensuring that load balancing of multiple paths can be achieved more efficiently.
In some embodiments, B is greater the total number of links on the multiple paths.
It should be understood that the larger B is, the larger the variation value of the first weight is. Therefore, under the condition that the total number of links is more, B can be increased, and then the change value of the second weight of the path to which the link with larger load belongs is larger, so that the path to which the link with larger load belongs is less easy to select as the data transmission path, and the load balance of a plurality of paths is more effectively realized.
In some embodiments, m is 5 or greater, e.g., m=10. Therefore, the first weight is larger along with the increase of the load, and the change value of the second weight of the path to which the link with larger load belongs is larger, so that the path to which the link with larger load belongs is less easy to select as the data transmission path, and the load balance of a plurality of paths is more effectively realized.
One specific embodiment of the determination method of the data transmission path of the present disclosure will be described below with reference to fig. 2.
Fig. 2 is a schematic diagram of a data transmission path according to one embodiment of the present disclosure.
In fig. 2, h1 to h8 denote hosts, and s1 to s10 denote switches. The first node may be any one of hosts h1 to h4, and the second node may be any one of hosts h5 to h 8.
The plurality of paths between the first node and the second node includes paths s1-s2-s5-s8, paths s1-s3-s8, paths s1-s4-s6-s7-s8, and paths s1-s9-s10-s8. The paths s1-s3-s8 include two links s1-s3 and s3-s8, and the relationship of the other paths to their links and so on.
In fig. 2, the bandwidth of each link is 10mbps, t=0.1, b=3, c 0 ＝1，m＝10，n＝1。
When no data stream is transmitted in each link, the first weight of each link is equal to 1. The second weight of paths s1-s2-s5-s8 is 3, the second weight of paths s1-s3-s8 is 2, the second weight of paths s1-s4-s6-s7-s8 is 4, and the second weight of paths s1-s9-s10-s8 is 3.
When a first data stream with the size of 2Mbps needs to be transmitted, a path s1-s3-s8 with the smallest second weight is selected as a data transmission path of the data stream according to a shortest path algorithm. In the process of transmitting the data stream, the bandwidth utilization of links s1-s3 and links s3-s8 is 0.2. According to c=c 0 ×B m×(u-t)+n It can be derived that the first weights of links s1-s3 and links s3-s8 are each equal to 9, and the second weights of paths s1-s3-s8 change from 2 to 18.
When the second data stream needs to be transmitted, the second weight of the path s1-s2-s5-s8 is 3, the second weight of the path s1-s3-s8 is 18, the second weight of the path s1-s4-s6-s7-s8 is 4, and the second weight of the path s1-s9-s10-s8 is 3. Based on the calculated second weight, the path with the smallest second weight is selected, i.e. a new path s1-s2-s5-s8 or s1-s9-s10-s8 may be selected.
Therefore, the scheme of the embodiment of the disclosure can avoid that a certain path is frequently and repeatedly selected, and realizes the load balancing of a plurality of paths.
In this specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different manner from other embodiments, so that the same or similar parts between the embodiments are mutually referred to. For the device embodiments, since they basically correspond to the method embodiments, the description is relatively simple, and the relevant points are referred to in the description of the method embodiments.
Fig. 3 is a schematic structural view of a determination device of a data transmission path according to some embodiments of the present disclosure.
As shown in fig. 3, the determining device of the data transmission path includes: an acquisition module 301, a determination module 302 and a selection module 303.
The acquisition module 301 is configured to acquire network topology information comprising a plurality of paths between a first node and a second node, each path comprising at least one link.
The determining module 302 is configured to determine a second weight of each path, where the second weight is a sum of the first weights of each link on the path, and when a load of any one link is greater than or equal to a preset load, the first weight of any one link has a monotonically changing relationship with the load, and the preset load is greater than 0.
The selecting module 303 is configured to select, from the plurality of paths, a first path having a second weight smaller than a first preset value as a data transmission path between the first node and the second node, in a case where the monotonically changing relationship is a positive correlation relationship; or in the case that the monotonically changing relationship is a negative correlation, selecting a second path having a second weight greater than a second preset value from the plurality of paths as a data transmission path between the first node and the second node.
In the above embodiment, the first weight of each link is dynamically adjusted by the load on each link, and thus the second weight of each path is adjusted. Selecting the data transmission paths according to such second weights may be such that the load of each path is not excessive, thereby achieving load balancing of the multiple paths.
It should be understood that the data transmission path determining apparatus may further include other modules to perform the data transmission path determining method of any of the above embodiments.
Fig. 4 is a schematic structural view of a data transmission path determining apparatus according to other embodiments of the present disclosure.
As shown in fig. 4, the data transmission path determining apparatus 400 includes a memory 401 and a processor 402 coupled to the memory 401, the processor 402 being configured to perform the method of any of the foregoing embodiments based on instructions stored in the memory 401.
Memory 401 may include, for example, system memory, fixed nonvolatile storage media, and the like. The system memory may store, for example, an operating system, application programs, boot Loader (Boot Loader), and other programs.
The data transmission path determining apparatus 400 may further include an input-output interface 403, a network interface 404, a storage interface 405, and the like. These interfaces 403, 404, 405, and between the memory 401 and the processor 402 may be connected by a bus 406, for example. The input/output interface 403 provides a connection interface for input/output devices such as a display, mouse, keyboard, touch screen, etc. Network interface 404 provides a connection interface for various networking devices. The storage interface 405 provides a connection interface for external storage devices such as SD cards, U discs, and the like.
The embodiment of the disclosure also provides an SDN controller, which comprises the determining device of the data transmission path in any one of the embodiments.
The disclosed embodiments also provide a computer readable storage medium comprising computer program instructions which, when executed by a processor, implement the method of any of the above embodiments.
The disclosed embodiments also provide a computer program product comprising a computer program which, when executed by a processor, implements the method of any of the above embodiments.
Thus, various embodiments of the present disclosure have been described in detail. In order to avoid obscuring the concepts of the present disclosure, some details known in the art are not described. How to implement the solutions disclosed herein will be fully apparent to those skilled in the art from the above description.
It will be appreciated by those skilled in the art that embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable non-transitory storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It will be understood that functions specified in one or more of the flowcharts and/or one or more of the blocks in the block diagrams may be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Although some specific embodiments of the present disclosure have been described in detail by way of example, it should be understood by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the present disclosure. It will be understood by those skilled in the art that the foregoing embodiments may be modified and equivalents substituted for elements thereof without departing from the scope and spirit of the disclosure. The scope of the present disclosure is defined by the appended claims.
Claims (12)
1. A method of determining a data transmission path, comprising:
acquiring network topology information, wherein the network topology information comprises a plurality of paths between a first node and a second node, and each path comprises at least one link;
determining a second weight of each path, wherein the second weight is the sum of first weights of each link on the path, and when the load of any one link is greater than or equal to a preset load, the first weight of any one link has a monotonic change relation with the load, and the preset load is greater than 0;
selecting a first path with the second weight smaller than a first preset value from the paths as a data transmission path between the first node and the second node under the condition that the monotonic change relation is a positive correlation relation; or (b)
And selecting a second path with the second weight greater than a second preset value from the plurality of paths as a data transmission path between the first node and the second node in the case that the monotonic change relation is a negative correlation relation.
2. The method according to claim 1, wherein:
under the condition that the load is smaller than the preset load, the first weight is a fixed value;
in the case where the load is equal to the preset load, the first weight is not equal to the fixed value.
3. The method of claim 1, wherein the greater the load, the greater the change in the first weight with the unit increase in the load.
4. A method according to claim 3, wherein the positive correlation is an exponential function, the first weight is a dependent variable of the exponential function, and the load is an independent variable of the exponential function.
5. The method of claim 4, wherein the exponential function relationship is:
C＝C 0 ×B m×(u-t)+n
wherein C represents the first weight, u represents the load, t represents the preset load, C 0 B, m andn is constant, and B is greater than 1, m is greater than 0, and n is greater than or equal to 1.
6. The method according to claim 5, wherein:
under the condition that the load is smaller than the preset load, the first weight is a fixed value;
in the case where the load is equal to the preset load, the first weight is not equal to the fixed value, C 0 Equal to the fixed value.
7. The method of claim 5, wherein B is greater the total number of links on the plurality of paths.
8. The method of any one of claims 1-7, wherein:
the first path is one path with the minimum second weight in the paths;
the second path is one path with the largest second weight in the paths.
9. A data transmission path determining apparatus, comprising:
an acquisition module configured to acquire network topology information, the network topology information including a plurality of paths between a first node and a second node, each path including at least one link;
the determining module is configured to determine a second weight of each path, wherein the second weight is a sum of first weights of each link on the path, and when the load of any one link is greater than or equal to a preset load, the first weight of any one link has a monotonic change relation with the load, and the preset load is greater than 0;
a selecting module configured to select, from the plurality of paths, a first path having the second weight smaller than a first preset value as a data transmission path between the first node and the second node, in a case where the monotonically changing relationship is a positive correlation relationship; or selecting a second path with the second weight greater than a second preset value from the plurality of paths as a data transmission path between the first node and the second node in the case that the monotonic variation relationship is a negative correlation relationship.
10. A data transmission path determining apparatus, comprising:
a memory; and
a processor coupled to the memory and configured to perform the method of any of claims 1-8 based on instructions stored in the memory.
11. A software defined network controller comprising the data transmission path determining means of claim 9 or 10.
12. A computer readable storage medium comprising computer program instructions, wherein the computer program instructions, when executed by a processor, implement the method of any of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210281980.1A CN114640622B (en) | 2022-03-22 | 2022-03-22 | Method and device for determining data transmission path and software-defined network controller |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210281980.1A CN114640622B (en) | 2022-03-22 | 2022-03-22 | Method and device for determining data transmission path and software-defined network controller |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114640622A CN114640622A (en) | 2022-06-17 |
| CN114640622B true CN114640622B (en) | 2023-07-18 |
Family
ID=81949017
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210281980.1A Active CN114640622B (en) | 2022-03-22 | 2022-03-22 | Method and device for determining data transmission path and software-defined network controller |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114640622B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109257287A (en) * | 2017-07-13 | 2019-01-22 | 华为技术有限公司 | A kind of shortest path determines method and controller |
| WO2020063549A1 (en) * | 2018-09-29 | 2020-04-02 | 中兴通讯股份有限公司 | Routing path calculation method, system and device, and computer-readable storage medium |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7395351B1 (en) * | 2003-01-28 | 2008-07-01 | Sprint Spectrum L.P. | Method for assigning link weights in a communications network |
| WO2017142516A1 (en) * | 2016-02-16 | 2017-08-24 | Hewlett Packard Enterprise Development Lp | Software defined networking for hybrid networks |
| CN106411733B (en) * | 2016-09-08 | 2019-05-31 | 重庆邮电大学 | A kind of SDN dynamic load leveling dispatching method based on link real time load |
| CN107579922B (en) * | 2017-09-08 | 2020-03-24 | 北京信息科技大学 | Network load balancing device and method |
| CN114124799B (en) * | 2021-11-18 | 2023-04-18 | 北京京航计算通讯研究所 | Safe transmission system for dynamically adjusting forwarding path |
-
2022
- 2022-03-22 CN CN202210281980.1A patent/CN114640622B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109257287A (en) * | 2017-07-13 | 2019-01-22 | 华为技术有限公司 | A kind of shortest path determines method and controller |
| WO2020063549A1 (en) * | 2018-09-29 | 2020-04-02 | 中兴通讯股份有限公司 | Routing path calculation method, system and device, and computer-readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114640622A (en) | 2022-06-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6224244B2 (en) | Power balancing to increase working density and improve energy efficiency | |
| CN109981744B (en) | Data distribution method and device, storage medium and electronic equipment | |
| JPH11275112A (en) | Cell transmission scheduling device in atm network | |
| WO2018166249A1 (en) | Network service transmission method and system | |
| CN111078391A (en) | Service request processing method, device and equipment | |
| CN113114504A (en) | Method, apparatus, device, medium and product for allocating resources | |
| CN114640622B (en) | Method and device for determining data transmission path and software-defined network controller | |
| US20170091630A1 (en) | Information processing device, analysis method, and program recording medium | |
| US9692667B2 (en) | Stream processing method, apparatus, and system | |
| CN112637286B (en) | Network architecture adjusting method, device, system and computer readable storage medium | |
| EP3885910A1 (en) | Dynamic quality of service management for deep learning training communication | |
| CN112118314A (en) | Load balancing method and device | |
| CN111694648B (en) | Task scheduling method and device and electronic equipment | |
| CN110113269B (en) | Flow control method based on middleware and related device | |
| CN115048179A (en) | Migration optimization method, source end device and virtual machine migration management system | |
| CN110995856A (en) | Method, device and equipment for server expansion and storage medium | |
| CN112948104B (en) | Load balancing data acquisition method and device | |
| CN113765979B (en) | Information transmission method, system and device | |
| CN114879832A (en) | Power consumption control method, device, chip, apparatus, and medium for arithmetic device | |
| JP2019117536A (en) | Data transmitting program, data transmitting device, and data transmitting method | |
| US20230004787A1 (en) | Distributed Deep Learning System | |
| CN115729704A (en) | Computing power resource allocation method, device and computer readable storage medium | |
| WO2020049334A1 (en) | A decentralized load-balancing method for resource/traffic distribution | |
| CN113778610B (en) | Method and device for determining resources | |
| CN103399789A (en) | Dynamic overload control method capable of being constructed in distributed-type stream computing system |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |