CN114500364A - Service flow transmission method and device, electronic equipment and storage medium - Google Patents
Service flow transmission method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN114500364A CN114500364A CN202111616043.9A CN202111616043A CN114500364A CN 114500364 A CN114500364 A CN 114500364A CN 202111616043 A CN202111616043 A CN 202111616043A CN 114500364 A CN114500364 A CN 114500364A
- Authority
- CN
- China
- Prior art keywords
- path
- link
- candidate
- target
- paths
- 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
- 238000000034 method Methods 0.000 title claims abstract description 68
- 230000005540 biological transmission Effects 0.000 title claims abstract description 52
- 230000015654 memory Effects 0.000 claims description 29
- 230000006870 function Effects 0.000 claims description 26
- 238000012545 processing Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 9
- 238000004891 communication Methods 0.000 description 8
- 238000012886 linear function Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000012888 cubic function Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000012887 quadratic function Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Images
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/24—Multipath
-
- 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
-
- 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/125—Shortest path evaluation based on throughput or bandwidth
-
- 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/30—Routing of multiclass traffic
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a service stream transmission method, a service stream transmission device, electronic equipment and a storage medium, and relates to the field of network stream transmission. The method comprises the following steps: acquiring a target service flow to be transmitted and at least two selectable paths corresponding to the target service flow; calculating the path cost increment corresponding to each selectable path according to the link utilization rate of at least one link corresponding to each selectable path; determining a target path from the selectable paths according to the cost increment of each path; and transmitting the target service flow by using the target path. By adopting the method, the path cost increment of the selected target path is smaller. Then, the target path is used for transmitting the target service flow, so that reasonable distribution of link resources can be realized, the aim of reducing the link utilization rate is fulfilled, the link utilization rate of the target path can be ensured to be low, and overlarge data transmission quantity of the target path and overlarge pressure of the target path cannot be caused.
Description
Technical Field
The present invention relates to the field of network stream transmission, and in particular, to a method and an apparatus for transmitting a service stream, an electronic device, and a storage medium.
Background
Each link in the network has a certain capacity, that is, the amount of data transmitted in a certain time is limited, and if the amount of data transmitted is too large, network congestion, network delay increase, or even packet loss will be caused. With the development of 5G technology and data centers, the network size is larger and larger, and the amount of data transmitted in the network is larger and larger, which results in that the pressure of network links is also larger and larger, so that it becomes more and more important to perform route optimization.
By adjusting the routing of the network flow and sending the network flow to the link with relatively low link utilization rate, the reasonable distribution of link resources can be realized, so as to achieve the purpose of reducing the link utilization rate.
In a traditional network, a switch can only process and forward a data packet according to a fixed protocol rule, so that the network lacks flexible routing control capability, and the purpose of reducing the link utilization rate cannot be achieved.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for transmitting a service stream, an electronic device, and a storage medium, which are used to solve the problem that the link utilization cannot be reduced.
According to a first aspect, an embodiment of the present invention provides a method for transmitting a service stream, where the method includes:
acquiring a target service flow to be transmitted and at least two selectable paths corresponding to the target service flow;
calculating the path cost increment corresponding to each selectable path according to the link utilization rate of at least one link corresponding to each selectable path;
determining a target path from the selectable paths according to the cost increment of each path;
and transmitting the target service flow by using the target path.
The service flow transmission method provided by the embodiment of the application acquires a target service flow to be transmitted and at least two selectable paths corresponding to the target service flow; then calculating the path cost increment corresponding to each selectable path according to the link utilization rate of at least one link corresponding to each selectable path; and determining a target path from the selectable paths according to the cost increment of each path. Thereby making the path cost increase of the selected target path smaller. Then, the target path is used for transmitting the target service flow, so that reasonable distribution of link resources can be realized, the aim of reducing the link utilization rate is fulfilled, the link utilization rate of the target path can be ensured to be low, and overlarge data transmission quantity of the target path and overlarge pressure of the target path cannot be caused.
With reference to the first aspect, in a first implementation manner of the first aspect, calculating a path cost increment corresponding to each optional path according to a link utilization rate of at least one link corresponding to each optional path includes:
obtaining a link cost function, wherein the link cost function is related to the link utilization rate of a link;
calculating a link cost increment corresponding to each link in each selectable path according to the link cost function;
and adding the link cost increment corresponding to each link in the selectable paths aiming at each selectable path to obtain the path cost increment corresponding to each selectable path.
According to the service flow transmission method provided by the embodiment of the application, the link cost increment corresponding to each link in each selectable path is calculated according to the link cost function, and the link cost increments corresponding to each link in the selectable paths are added to obtain the path cost increment corresponding to each selectable path. Therefore, the path cost increment corresponding to the target service flow transmitted by using each selectable path can be accurately determined, the target path can be selected from the selectable paths according to the path cost increment corresponding to each selectable path, and the accuracy of the selected target path is ensured. Therefore, reasonable distribution of link resources is achieved, the purpose of reducing the link utilization rate is achieved, the link utilization rate of the target path can be ensured to be low, and overlarge data transmission quantity of the target path and overlarge pressure of the target path cannot be caused.
With reference to the first aspect, in a second implementation manner of the first aspect, determining a target path from the selectable paths according to the cost increment of each path includes:
selecting a candidate path with the minimum path cost increment from the selectable paths according to the path cost increment;
and if the number of the candidate paths is 1, determining the candidate paths as the target paths.
According to the service flow transmission method provided by the embodiment of the application, the candidate path with the minimum path cost increment is selected from the selectable paths according to the path cost increments, and when the number of the candidate paths is 1, the candidate path is determined as the target path, so that the accuracy of the target path obtained by selection is ensured. And then realize the rational distribution to the link resource, has reached the purpose to reduce the link utilization rate, and can guarantee that the link utilization rate of the target route is lower, can not lead to the data transmission volume of the target route too big, lead to the target route to press too much.
With reference to the second embodiment of the first aspect, in a third embodiment of the first aspect, the method further includes:
if the number of the candidate paths is multiple, acquiring the residual capacity corresponding to each link in each candidate path;
and determining a target path from the candidate paths according to the residual capacity corresponding to each link in each candidate path.
According to the service flow transmission method provided by the embodiment of the application, when the number of the candidate paths is multiple, the residual capacity corresponding to each link in each candidate path is obtained. And then, determining a target path from the candidate paths according to the residual capacity corresponding to each link in each candidate path. Therefore, the method can ensure that the residual capacity of the selected target path is large and the target service flow is transmitted sufficiently, thereby ensuring the accuracy of the selected target path. And then realize the rational distribution to the link resource, has reached the purpose to reduce the link utilization rate, and can guarantee that the link utilization rate of the target route is lower, can not lead to the data transmission volume of the target route too big, lead to the target route to press too much.
With reference to the third implementation manner of the first aspect, in the fourth implementation manner of the first aspect, determining a target path from candidate paths according to a remaining capacity corresponding to each link in each candidate path includes:
determining a first residual capacity from each candidate path, wherein the first residual capacity is the minimum residual capacity corresponding to each link in each candidate path;
comparing the first residual capacity corresponding to each candidate path;
and determining the candidate path with the maximum first residual capacity as a target path according to the comparison result.
In the service flow transmission method provided by the embodiment of the application, a first residual capacity is determined from each candidate path, wherein the first residual capacity is a minimum residual capacity corresponding to each link in each candidate path; comparing the first residual capacity corresponding to each candidate path; and determining the candidate path with the maximum first residual capacity as a target path according to the comparison result. The minimum residual quantity of the target path determined from the candidate paths is larger, so that the target service flow is transmitted sufficiently, and the accuracy of the selected target path is ensured. The method avoids network congestion, network delay increase and even packet loss caused by too large transmitted data quantity due to the fact that the target service flow is transmitted by using the first candidate path with smaller residual capacity. Therefore, the method can realize reasonable distribution of link resources, achieves the aim of reducing the link utilization rate, can ensure that the residual capacity of the target path is larger, and can not cause overlarge data transmission quantity of the target path and overlarge pressure of the target path.
With reference to the fourth embodiment of the first aspect, in the fifth embodiment of the first aspect, the method further includes:
if at least two candidate paths with the same first residual capacity exist, determining a second residual capacity from the at least two candidate paths, wherein the second residual capacity is a second small residual capacity corresponding to each link in each candidate path;
comparing the second residual capacity corresponding to each candidate path;
determining the candidate path with the maximum second residual capacity as a target path according to the comparison result;
and the like until the target candidate path is determined from the candidate paths.
In the service flow transmission method provided by the embodiment of the application, when at least two candidate paths with equal first residual capacity exist, second residual capacity is determined from the at least two candidate paths, and the second residual capacity is a second small residual capacity corresponding to each link in each candidate path; comparing the second residual capacity corresponding to each candidate path; determining the candidate path with the maximum second residual capacity as a target path according to the comparison result; and the like until the target candidate path is determined from the candidate paths. The second residual capacity of the target path determined from the candidate paths is larger, and the target service flow is transmitted sufficiently, so that the accuracy of the selected target path is ensured. The method avoids network congestion, network delay increase and even packet loss caused by too large transmitted data volume due to the fact that the target service flow is transmitted by using the candidate path with smaller residual capacity. Therefore, the method can realize reasonable distribution of link resources, achieves the aim of reducing the link utilization rate, can ensure that the residual capacity of the target path is larger, and can not cause overlarge data transmission quantity of the target path and overlarge pressure of the target path.
With reference to the fifth embodiment of the first aspect, in the sixth embodiment of the first aspect, the method further includes:
and if the residual capacity of each link corresponding to at least two candidate paths is the same, determining the candidate path with the least number of links as the target path.
According to the service flow transmission method provided by the embodiment of the application, when the residual capacities of the links corresponding to at least two candidate paths are the same, the candidate path with the least number of links is determined as the target path. The target service flow is transmitted by using the least number of links on the target path, so that the target service flow can be ensured to be transmitted quickly, and less link resources are occupied.
According to a second aspect, an embodiment of the present invention further provides a service flow transmission apparatus, including:
the acquisition module is used for acquiring the target service flow to be transmitted and at least two optional paths corresponding to the target service flow.
And the calculating module is used for calculating the path cost increment corresponding to each selectable path according to the link utilization rate of at least one link corresponding to each selectable path.
And the determining module is used for determining the target path from the selectable paths according to the cost increment of each path.
And the transmission module is used for transmitting the target service flow by using the target path.
The service flow transmission device provided by the embodiment of the invention obtains a target service flow to be transmitted and at least two selectable paths corresponding to the target service flow; then calculating the path cost increment corresponding to each selectable path according to the link utilization rate of at least one link corresponding to each selectable path; and determining a target path from the selectable paths according to the cost increment of each path. Thereby making the selected target path cost increase smaller. Then, the target path is used for transmitting the target service flow, so that reasonable distribution of link resources can be realized, the aim of reducing the link utilization rate is fulfilled, the link utilization rate of the target path can be ensured to be low, and overlarge data transmission quantity of the target path and overlarge pressure of the target path cannot be caused.
According to a third aspect, an embodiment of the present invention provides an electronic device, which includes a memory and a processor, where the memory and the processor are communicatively connected to each other, and the memory stores computer instructions, and the processor executes the computer instructions, so as to execute the traffic flow transmission method in the first aspect or any one of the implementation manners of the first aspect.
According to a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, which stores computer instructions for causing a computer to execute the traffic flow transmission method in the first aspect or any one implementation manner of the first aspect.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a flowchart of a service flow transmission method provided by an embodiment of the present invention;
fig. 2 is a flowchart of a service flow transmission method provided by another embodiment of the present invention;
fig. 3 is a schematic diagram of a link cost function in a service flow transmission method provided by an embodiment of the present invention;
fig. 4 is a flowchart of a service flow transmission method provided by another embodiment of the present invention;
fig. 5 is a schematic diagram illustrating a comparison of path cost increment amounts in a traffic flow transmission method according to another embodiment of the present invention;
fig. 6 is a schematic diagram of a comparison of link remaining capacities in a traffic flow transmission method provided by another embodiment of the present invention;
fig. 7 is a functional block diagram of a service flow transmission apparatus provided by an embodiment of the present invention;
fig. 8 is a schematic diagram of a hardware structure of an electronic device to which an embodiment of the present invention is applied.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. 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 invention.
It should be noted that, in the method for transmitting a service flow provided in this embodiment of the present application, an execution main body of the method may be a device for transmitting a service flow, and the device for transmitting a service flow may be implemented as part or all of an electronic device in a software, hardware, or a combination of software and hardware, where the electronic device may be a server or a terminal, where the server in this embodiment of the present application may be one server or a server cluster composed of multiple servers, and the terminal in this embodiment of the present application may be another intelligent hardware device such as a smart phone, a personal computer, a tablet computer, a wearable device, and an intelligent robot. In the following method embodiments, the execution subject is an electronic device as an example.
In an embodiment of the present application, as shown in fig. 1, a service flow transmission method is provided, which is described by taking an application of the method and an electronic device as an example, and includes the following steps:
and S11, acquiring the target service flow to be transmitted and at least two optional paths corresponding to the target service flow.
In an optional implementation manner, the electronic device may receive a target service flow to be transmitted and at least two optional paths corresponding to the target service flow, which are sent by other devices.
In an optional implementation manner, the electronic device may further generate a target service stream to be transmitted, and obtain at least two optional paths corresponding to the target service stream according to a receiving device corresponding to the target service stream to be transmitted.
In an optional implementation manner, a network flow to be transmitted, which is sent by another device, may also be received, where the network flow to be transmitted may include 1 service flow and an optional path corresponding to the service flow, and may also include at least two service flows and an optional path corresponding to each service flow. The electronic device may obtain a target service flow and at least two selectable paths corresponding to the target service flow from the network flow to be transmitted. The number of service flows included in a network flow is not specifically limited in the embodiments of the present application.
The embodiment of the application does not specifically describe the manner in which the electronic device acquires the target service stream to be transmitted and the at least two selectable paths corresponding to the target service stream.
In an optional implementation manner, if the network flow to be transmitted includes at least two service flows, the electronic device may obtain the size of each service flow and an optional path corresponding to each service flow. And if the service flow only has one optional path, the optional path corresponding to the service flow is used for matching the service flow to the link corresponding to the optional path, and the load of each link in the whole network is updated.
And respectively selecting a target path from the selectable paths for each service flow according to the sequence of the flow values from large to small for the rest service flows. The target service flow may be one of the remaining service flows, and the electronic device determines a target path corresponding to the target service flow from at least two selectable paths corresponding to the target service flow.
In an optional embodiment of the present application, when a target service flow to be transmitted corresponds to only one optional path, the target service flow is allocated to a link corresponding to the optional path by using the optional path corresponding to the target service flow, and a load of each link in the entire network is updated.
And S12, calculating the path cost increment corresponding to each selectable path according to the link utilization rate of at least one link corresponding to each selectable path.
Specifically, the electronic device may obtain the capacity and the load of each link in each selectable path, calculate the link utilization rate of each link corresponding to each selectable path according to the capacity and the load of each link, and calculate the path cost increment corresponding to each selectable path according to the link utilization rate of each link corresponding to each selectable path.
A detailed description of this step will be described below.
And S13, determining a target path from the selectable paths according to the cost increment of each path.
Specifically, the electronic device may rank the selectable paths according to the calculated cost increment of each path, select a candidate path from the selectable paths, and determine the target path according to the candidate path.
Optionally, the electronic device may select, from the selectable paths, the selectable path with the smallest increase in path cost as a candidate path, and then determine the target path according to the candidate path.
A detailed description of this step will be described below.
And S14, transmitting the target service flow by using the target path.
Specifically, after determining the target path from the selectable paths, the electronic device may allocate the target traffic flow to a link corresponding to the target path at a time, so as to transmit the target traffic flow by using the target path.
The service flow transmission method provided by the embodiment of the application acquires a target service flow to be transmitted and at least two selectable paths corresponding to the target service flow; then calculating the path cost increment corresponding to each selectable path according to the link utilization rate of at least one link corresponding to each selectable path; and determining a target path from the selectable paths according to the cost increment of each path. Thereby making the selected target path cost increase smaller. Then, the target path is used for transmitting the target service flow, so that reasonable distribution of link resources can be realized, the aim of reducing the link utilization rate is fulfilled, the link utilization rate of the target path can be ensured to be low, and overlarge data transmission quantity of the target path and overlarge pressure of the target path cannot be caused.
In an optional embodiment of the present application, as shown in fig. 2, the "calculating a path cost increment corresponding to each optional path according to a link utilization rate of at least one link corresponding to each optional path" in S12 may include the following steps:
and S21, obtaining a link cost function.
Wherein the link cost function is related to the link utilization of the link.
In an optional implementation manner of the present application, the electronic device may generate a link cost function according to a relationship between a link utilization rate and a link cost, where the link cost function may be a linear function, a quadratic function, or a cubic function, and the link cost function is not specifically limited in the embodiment of the present application.
In an alternative embodiment of the present application, the relationship between the link utilization and the link cost is different due to the difference of the link utilization.
Therefore, the electronic device may generate a continuous piecewise linear function related to the link utilization according to the relationship between the link utilization and the link cost, divide the link utilization into a plurality of continuous intervals, and increase the slope of the link cost in each interval. Wherein the formula may be as follows:
where u ═ l/c denotes link utilization, i.e. the ratio of link load to link capacity, kiIs the slope of the ith link utilization interval, and ki<ki+1，βiAs division points of respective intervals, αiIntercept, a, for making the cost function continuous1And betaiMay be set based on actual network performance and experience.
For example, as shown in fig. 3, the electronic device may divide the link utilization rate of each link into several intervals of [0,1/3), [1/3,2/3), [2/3,9/10), [9/10,1), [1, ∞) according to the relationship between the link utilization rate and the link cost, where the slope of the increase of the link cost is 1, 5, 30, 100, 1000, respectively, and then the expression of the link cost function is as follows:
where u represents the link utilization.
And S22, calculating the link cost increment corresponding to each link in each selectable path according to the link cost function.
Specifically, the electronic device may first obtain the capacity and the current load of each link in each selectable path, calculate a link utilization rate of each link corresponding to each selectable path according to the capacity and the current load of each link, and then calculate a link cost of each link before transmitting the target service flow according to the link utilization rate of each link and the link cost function.
Then, according to the size of the target service flow, the electronic device calculates the link utilization rate of each link corresponding to each selectable path when the target service flow is transmitted, and then calculates the link cost of each link when the target service flow is transmitted according to the link utilization rate of each link when the target service flow is transmitted and the link cost function.
And the electronic equipment subtracts the link cost before the target service flow is transmitted from the link cost when the target service flow is transmitted corresponding to each link, and calculates to obtain the link cost increment corresponding to each link in each optional path.
For example, assume that there are two alternative paths a-C-D and a-B-D in the target traffic flow. In the A-C-D optional path, the capacity of an A-C link is 100, the current load is 20, and the current link utilization rate of the A-C link is 0.2; the capacity of the C-D link is 100, and the current load is 50, then the current link utilization of the C-D link is 0.5. In the A-B-D optional path, the capacity of the A-B link is 100, the current load is 50, and the current link utilization rate of the A-B link is 0.5; the capacity of the B-D link is 100 and the current load is 50, then the current link utilization of the B-D link is 0.5.
Assuming that the target traffic flow is 10, the calculation is performed using the following link cost function:
and obtaining that the link cost increment corresponding to the A-C link is 0.1 and the link cost increment corresponding to the C-D link is 0.5 in the A-C-D selectable path. And the link cost increment corresponding to the A-B link in the A-B-D optional path is 0.5, and the link cost increment corresponding to the B-D link is 0.5.
And S23, adding the link cost increment corresponding to each link in the selectable paths aiming at each selectable path to obtain the path cost increment corresponding to each selectable path.
Specifically, for each selectable path, the electronic device adds the link cost increase corresponding to each link in the selectable path to obtain the path cost increase corresponding to each selectable path. The electronic device may select the target path from the selectable paths according to the calculated path cost increment corresponding to each selectable path.
Illustratively, the path cost increment corresponding to the a-C-D alternative path is 0.6, and the path cost increment corresponding to the a-B-D alternative path is 1.
According to the service flow transmission method provided by the embodiment of the application, the link cost increment corresponding to each link in each selectable path is calculated according to the link cost function, and the link cost increments corresponding to each link in the selectable paths are added to obtain the path cost increment corresponding to each selectable path. Therefore, the path cost increment corresponding to the target service flow transmitted by using each selectable path can be accurately determined, the target path can be selected from the selectable paths according to the path cost increment corresponding to each selectable path, and the accuracy of the selected target path is ensured. Therefore, reasonable distribution of link resources is achieved, the purpose of reducing the link utilization rate is achieved, the link utilization rate of the target path can be ensured to be low, and overlarge data transmission quantity of the target path and overlarge pressure of the target path cannot be caused.
In an alternative embodiment of the present application, as shown in fig. 4, the "determining a target path from the selectable paths according to the cost increment of each path" in S13 may include the following steps:
and S31, selecting a candidate path with the smallest path cost increment from the selectable paths according to the path cost increments.
Specifically, the electronic device may rank the selectable paths according to the calculated path cost increment, and then select the selectable path with the smallest path cost increment from the selectable paths as the candidate path.
And S32, if the number of the candidate paths is 1, determining the candidate paths as the target paths.
Specifically, when the number of candidate paths is 1, the electronic device determines the candidate paths as the target paths.
Illustratively, as shown in the diagram (a) in fig. 5, where the numbers (c, l) on the links represent the capacity of the links and the load on the current link, respectively, the size of the target traffic streams a-D in this example is 10. The method comprises the following steps that two paths A-C-D and A-B-D are provided, wherein in the A-C-D selectable path, the capacity of an A-C link is 100, the current load is 20, and the current link utilization rate of the A-C link is 0.2; the capacity of the C-D link is 100, and the current load is 50, then the current link utilization of the C-D link is 0.5. In the A-B-D optional path, the capacity of the A-B link is 100, the current load is 50, and the current link utilization rate of the A-B link is 0.5; the capacity of the B-D link is 100 and the current load is 50, then the current link utilization of the B-D link is 0.5. By using the link cost function in the above embodiment, the path cost increment corresponding to the a-C-D alternative path is calculated to be 0.6, and the path cost increment corresponding to the a-B-D alternative path is calculated to be 1. Therefore, the electronic equipment selects the A-C-D alternative path from the A-C-D alternative path and the A-B-D alternative path as a candidate path, and the electronic equipment determines the A-C-D candidate path as the target path because only one A-C-D alternative path exists.
Illustratively, as shown in fig. 5 (b), where the numbers (c, l) on the link represent the capacity of the link and the load on the current link, respectively, the size of the target traffic streams a-D in this example is 10. The method comprises the following steps that two paths A-C-D and A-B-D are provided, wherein in the A-C-D selectable path, the capacity of an A-C link is 100, the current load is 20, and the current link utilization rate of the A-C link is 0.2; the capacity of the C-D link is 100, the current load is 90, and the current link utilization rate of the C-D link is 0.9. In the A-B-D optional path, the capacity of the A-B link is 100, the current load is 50, and the current link utilization rate of the A-B link is 0.5; the capacity of the B-D link is 100 and the current load is 50, then the current link utilization of the B-D link is 0.5. By using the link cost function in the above embodiment, the path cost increment corresponding to the a-C-D alternative path is calculated to be 10.1, and the path cost increment corresponding to the a-B-D alternative path is calculated to be 1. Therefore, the electronic equipment selects the A-B-D selectable path from the A-C-D selectable path and the A-B-D selectable path as a candidate path, and the electronic equipment determines the A-B-D candidate path as the target path because only one A-B-D candidate path exists.
And S33, if the number of the candidate paths is multiple, acquiring the residual capacity corresponding to each link in each candidate path.
Specifically, when the number of the candidate paths is multiple, that is, the path cost increment corresponding to the multiple candidate paths is the same, the electronic device needs to acquire the remaining capacity corresponding to each link in each candidate path.
Illustratively, as shown in (c) diagram in fig. 5, where the numbers (c, l) on the links represent the capacity of the links and the load on the current link, respectively, the size of the target traffic streams a-D in this example is 10. The method comprises the following steps that two paths A-C-D and A-B-D are provided, wherein in the A-C-D selectable path, the capacity of an A-C link is 100, the current load is 20, and the current link utilization rate of the A-C link is 0.2; the capacity of the C-D link is 100, and the current load is 50, then the current link utilization of the C-D link is 0.5. In the A-B-D optional path, the capacity of the A-B link is 100, the current load is 10, and the current link utilization rate of the A-B link is 0.1; the capacity of the B-D link is 100 and the current load is 50, then the current link utilization of the B-D link is 0.5. By using the link cost function in the above embodiment, the path cost increment corresponding to the a-C-D alternative path is calculated to be 0.6, and the path cost increment corresponding to the a-B-D alternative path is calculated to be 0.6. Thus, the electronic device determines that the A-C-D alternate path and the A-B-D alternate path are both candidate paths. And then respectively obtaining the residual capacity corresponding to each link in each A-C-D candidate path and each A-B-D candidate path.
And S34, determining the target path from the candidate paths according to the residual capacity corresponding to each link in each candidate path.
Specifically, the electronic device may determine, according to the remaining capacity corresponding to each link in each candidate path, a candidate path with the largest remaining amount as the target path.
A detailed description of this step will be described below.
According to the service flow transmission method provided by the embodiment of the application, the candidate path with the minimum path cost increment is selected from the selectable paths according to the path cost increments, and when the number of the candidate paths is 1, the candidate path is determined as the target path, so that the accuracy of the target path obtained by selection is ensured. And when the number of the candidate paths is multiple, acquiring the residual capacity corresponding to each link in each candidate path. And then, determining a target path from the candidate paths according to the residual capacity corresponding to each link in each candidate path. Therefore, the method can ensure that the residual capacity of the selected target path is large and the target service flow is transmitted sufficiently, thereby ensuring the accuracy of the selected target path. And then realize the rational distribution to the link resource, has reached the purpose to reduce the link utilization rate, and can guarantee that the link utilization rate of the target route is lower, can not lead to the data transmission volume of the target route too big, lead to the target route to press too much.
In an optional embodiment of the present application, the step of "determining a target path from candidate paths according to the remaining capacity corresponding to each link in each candidate path" in S34 may include the following steps:
in one of the cases: (1) a first remaining capacity is determined from each of the candidate routes.
And the first residual capacity is the minimum residual capacity corresponding to each link in each candidate path.
(2) And comparing the first residual capacity corresponding to each candidate path.
(3) And determining the candidate route with the maximum first residual capacity as the target route according to the comparison result.
Specifically, after obtaining the remaining capacity corresponding to each link in each candidate path, the electronic device may determine a first remaining capacity from each candidate path, where the first remaining capacity is a minimum remaining capacity corresponding to each link in each candidate path.
For example, assuming that a candidate path includes 3 links, and the remaining capacities of the 3 links are 50, 30, and 60, respectively, the first remaining capacity corresponding to the candidate path is 30.
Then, the electronic device compares the first remaining capacities corresponding to the candidate routes, and determines the candidate route with the largest first remaining capacity as the target route according to the comparison result.
Illustratively, as shown in (a) of fig. 6, where the numbers (c, l) on the link represent the capacity of the link and the load on the current link, respectively. The method comprises the following steps that two candidate paths A-C-D and A-B-C-D exist, wherein in the A-C-D candidate paths, the capacity of an A-C link is 100, the current load is 70, and the residual capacity of the A-C link is 30; the capacity of the C-D link is 90 and the current load is 50, then the remaining capacity of the C-D link is 40. Then the first remaining capacity of the a-C-D candidate path is 30.
In the A-B-C-D candidate path, the capacity of the A-B link is 100, the current load is 50, and the residual capacity of the A-B link is 50; the capacity of the B-C link is 120, the current load is 40, and the residual capacity of the B-C link is 80; the capacity of the C-D link is 90 and the current load is 50, then the remaining capacity of the C-D link is 40. Then a remaining capacity of the a-B-C-D candidate path is 40.
The first remaining capacity of the a-B-C-D candidate path is greater than the first remaining capacity of the a-C-D candidate path, and therefore the electronic device determines the a-B-C-D candidate path as the target path.
In another case: (1) and if at least two candidate paths with the same first residual capacity exist, determining a second residual capacity from the at least two candidate paths.
And the second residual capacity is the second small residual capacity corresponding to each link in each candidate path.
(2) Comparing the second residual capacity corresponding to each candidate path;
(3) determining the candidate path with the maximum second residual capacity as a target path according to the comparison result;
(3) and the like until the target candidate path is determined from the candidate paths.
Specifically, after comparing the first remaining capacities corresponding to the candidate paths, the electronic device determines that the first remaining capacities corresponding to at least two candidate paths are equal, and then the electronic device leaves at least two candidate paths with the equal first remaining capacities, and then determines the second remaining capacity from the at least two candidate paths.
And then comparing the second residual capacities corresponding to the candidate routes, and determining the candidate route with the largest second residual capacity as the target route according to the comparison result.
Illustratively, as shown in (b) of fig. 6, where the numbers (c, l) on the link represent the capacity of the link and the load on the current link, respectively. The method comprises the following steps that two candidate paths A-C-D and A-B-C-D exist, wherein in the A-C-D candidate paths, the capacity of an A-C link is 100, the current load is 30, and the residual capacity of the A-C link is 70; the capacity of the C-D link is 90 and the current load is 50, then the remaining capacity of the C-D link is 40. Then the first remaining capacity of the a-C-D candidate path is 40 and the second remaining capacity is 70.
In the A-B-C-D candidate path, the capacity of the A-B link is 100, the current load is 50, and the residual capacity of the A-B link is 50; the capacity of the B-C link is 120, the current load is 40, and the residual capacity of the B-C link is 80; the capacity of the C-D link is 90 and the current load is 50, then the remaining capacity of the C-D link is 40. Then the first remaining capacity of the a-B-C-D candidate path is 40 and the second remaining capacity is 50.
The first remaining capacity of the a-B-C-D candidate path is equal to the first remaining capacity of the a-C-D candidate path, and therefore, the electronic device compares the a-B-C-D candidate path with the second remaining capacity of the a-C-D candidate path, the electronic device determines that the second remaining capacity of the a-C-D candidate path is greater than the second remaining capacity of the a-B-C-D candidate path, and the electronic device determines the a-C-D candidate path as the target candidate path.
If at least two candidate paths with the same second residual capacity still exist, determining a third residual capacity from the at least two candidate paths, wherein the third residual capacity is a third small residual capacity in each candidate path; comparing the third residual capacity corresponding to each candidate path;
determining the candidate path with the maximum third residual capacity as a target path according to the comparison result; and the like until the target candidate path is determined from the candidate paths.
In another case: and if the residual capacity of each link corresponding to at least two candidate paths is the same, determining the candidate path with the least number of links as the target path.
Specifically, if the remaining capacity of each link corresponding to at least two candidate paths is the same, the electronic device obtains the number of links corresponding to each candidate path, and determines the candidate path with the smallest number of links as the target path.
Illustratively, as shown in (c) diagram in fig. 6, where the numbers (c, l) on the link represent the capacity of the link and the load on the current link, respectively. The method comprises the following steps that two candidate paths A-C-D and A-B-C-D are provided, wherein in the A-C-D candidate paths, the capacity of an A-C link is 100, the current load is 50, and the residual capacity of the A-C link is 50; the capacity of the C-D link is 90 and the current load is 50, then the remaining capacity of the C-D link is 40. Then the first remaining capacity of the a-C-D candidate path is 40 and the second remaining capacity is 50.
In the A-B-C-D candidate path, the capacity of the A-B link is 100, and the current load is 50, so that the residual capacity of the A-B link is 50; the capacity of the B-C link is 120, the current load is 40, and the residual capacity of the B-C link is 80; the capacity of the C-D link is 90 and the current load is 50, then the remaining capacity of the C-D link is 40. Then the first remaining capacity of the a-B-C-D candidate path is 40 and the second remaining capacity is 50.
The first remaining capacity of the a-B-C-D candidate path is equal to the first remaining capacity of the a-C-D candidate path, and therefore the electronic device compares the a-B-C-D candidate path with the second remaining capacity of the a-C-D candidate path, and the electronic device determines that the second remaining capacity of the a-C-D candidate path is also equal to the second remaining capacity of the a-B-C-D candidate path.
The electronic equipment acquires the number of links of the A-B-C-D candidate path and the A-C-D candidate path, the number of links of the A-C-D candidate path is 2, and the number of links of the A-B-C-D candidate path is 3, so that the electronic equipment determines the A-C-D candidate path as a target path.
In the service flow transmission method provided by the embodiment of the application, a first residual capacity is determined from each candidate path, wherein the first residual capacity is a minimum residual capacity corresponding to each link in each candidate path; comparing the first residual capacity corresponding to each candidate path; and determining the candidate path with the maximum first residual capacity as a target path according to the comparison result. When at least two candidate paths with the same first residual capacity exist, determining a second residual capacity from the at least two candidate paths, wherein the second residual capacity is a second small residual capacity corresponding to each link in each candidate path; comparing the second residual capacity corresponding to each candidate path; determining the candidate path with the maximum second residual capacity as a target path according to the comparison result; and the like until the target candidate path is determined from the candidate paths. The minimum residual quantity of the target path determined from the candidate paths is larger, so that the target service flow is transmitted sufficiently, and the accuracy of the selected target path is ensured. The method avoids network congestion, network delay increase and even packet loss caused by too large transmitted data quantity due to the fact that the target service flow is transmitted by using the first candidate path with smaller residual capacity.
In addition, when the residual capacities of the links corresponding to at least two candidate paths are the same, the candidate path with the smallest number of links is determined as the target path. The target service flow is transmitted by using the least number of links on the target path, so that the target service flow can be ensured to be transmitted quickly, and less link resources are occupied.
Therefore, the method can realize reasonable distribution of link resources, achieves the aim of reducing the link utilization rate, can ensure that the residual capacity of the target path is larger, and can not cause overlarge data transmission quantity of the target path and overlarge pressure of the target path.
It should be understood that although the steps in the flowcharts of fig. 1, 2 and 4 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 1, 2, and 4 may include multiple steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, which are not necessarily performed in sequence, but may be performed alternately or alternately with other steps or at least some of the other steps.
As shown in fig. 7, the present embodiment provides a service flow transmission apparatus, including:
an obtaining module 41, configured to obtain a target service flow to be transmitted and at least two selectable paths corresponding to the target service flow;
a calculating module 42, configured to calculate, according to a link utilization rate of at least one link corresponding to each selectable path, a path cost increment corresponding to each selectable path;
a determining module 43, configured to determine a target path from the selectable paths according to the cost increment of each path;
and a transmission module 44, configured to transmit the target traffic stream using the target path.
In an embodiment of the present application, the calculating module 42 is specifically configured to obtain a link cost function, where the link cost function is related to a link utilization rate of a link; calculating a link cost increment corresponding to each link in each optional path according to the link cost function; and adding the link cost increment corresponding to each link in the selectable paths aiming at each selectable path to obtain the path cost increment corresponding to each selectable path.
In an embodiment of the present application, the determining module 43 is specifically configured to select, according to the cost increment of each path, a candidate path with the smallest path cost increment from the selectable paths; and if the number of the candidate paths is 1, determining the candidate paths as the target paths.
In an embodiment of the present application, the determining module 43 is specifically configured to, if the number of the candidate paths is multiple, obtain a remaining capacity corresponding to each link in each candidate path; and determining a target path from the candidate paths according to the residual capacity corresponding to each link in each candidate path.
In an embodiment of the present application, the determining module 43 is specifically configured to determine a first remaining capacity from each candidate path, where the first remaining capacity is a minimum remaining capacity corresponding to each link in each candidate path; comparing the first residual capacity corresponding to each candidate path; and determining the candidate path with the maximum first residual capacity as a target path according to the comparison result.
In an embodiment of the present application, the determining module 43 is specifically configured to determine, if there are at least two candidate paths with equal first remaining capacity, a second remaining capacity from the at least two candidate paths, where the second remaining capacity is a second small remaining capacity corresponding to each link in each candidate path; comparing the second residual capacity corresponding to each candidate path; determining the candidate path with the maximum second residual capacity as a target path according to the comparison result; and the like until the target candidate path is determined from the candidate paths.
In an embodiment of the present application, the determining module 43 is specifically configured to determine, as the target path, the candidate path with the smallest number of links if the remaining capacities of the links corresponding to at least two candidate paths are the same.
For specific limitations and beneficial effects of the service stream transmission apparatus, reference may be made to the above limitations on the service stream transmission method, which is not described herein again. The modules in the traffic stream transmission apparatus may be implemented in whole or in part by software, hardware, and a combination thereof. The modules can be embedded in a hardware form or independent of a processor in the electronic device, or can be stored in a memory in the electronic device in a software form, so that the processor can call and execute operations corresponding to the modules.
An embodiment of the present invention further provides an electronic device, which includes the service flow transmission apparatus shown in fig. 7.
As shown in fig. 8, fig. 8 is a schematic structural diagram of an electronic device according to an alternative embodiment of the present invention, and as shown in fig. 8, the electronic device may include: at least one processor 51, such as a CPU (Central Processing Unit), at least one communication interface 53, memory 54, at least one communication bus 52. Wherein a communication bus 52 is used to enable the connection communication between these components. The communication interface 53 may include a Display (Display) and a Keyboard (Keyboard), and the optional communication interface 53 may also include a standard wired interface and a standard wireless interface. The Memory 54 may be a high-speed RAM Memory (volatile Random Access Memory) or a non-volatile Memory (non-volatile Memory), such as at least one disk Memory. The memory 54 may alternatively be at least one memory device located remotely from the processor 51. Wherein the processor 51 may be in connection with the apparatus described in fig. 7, the memory 54 stores an application program, and the processor 51 calls the program code stored in the memory 54 for performing any of the above-mentioned method steps.
The communication bus 52 may be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus. The communication bus 52 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown in FIG. 8, but this is not intended to represent only one bus or type of bus.
The memory 54 may include a volatile memory (RAM), such as a random-access memory (RAM); the memory may also include a non-volatile memory (english: non-volatile memory), such as a flash memory (english: flash memory), a hard disk (english: hard disk drive, abbreviated: HDD) or a solid-state drive (english: SSD); the memory 54 may also comprise a combination of the above types of memories.
The processor 51 may be a Central Processing Unit (CPU), a Network Processor (NP), or a combination of a CPU and an NP.
The processor 51 may further include a hardware chip. The hardware chip may be an application-specific integrated circuit (ASIC), a Programmable Logic Device (PLD), or a combination thereof. The PLD may be a Complex Programmable Logic Device (CPLD), a field-programmable gate array (FPGA), a General Array Logic (GAL), or any combination thereof.
Optionally, the memory 54 is also used to store program instructions. The processor 51 may call program instructions to implement the traffic streaming method as shown in the embodiments of the present application.
An embodiment of the present invention further provides a non-transitory computer storage medium, where the computer storage medium stores computer-executable instructions, and the computer-executable instructions may execute the service stream transmission method in any method embodiment described above. The storage medium may be a magnetic Disk, an optical Disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a Flash Memory (Flash Memory), a Hard Disk (Hard Disk Drive, abbreviated as HDD), a Solid State Drive (SSD), or the like; the storage medium may also comprise a combination of memories of the kind described above.
Although the embodiments of the present invention have been described in conjunction with the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the invention, and such modifications and variations fall within the scope defined by the appended claims.
Claims (10)
1. A method for transmitting a traffic stream, the method comprising:
acquiring a target service flow to be transmitted and at least two selectable paths corresponding to the target service flow;
calculating a path cost increment corresponding to each selectable path according to the link utilization rate of at least one link corresponding to each selectable path;
determining a target path from the selectable paths according to each path cost increment;
and transmitting the target service flow by using the target path.
2. The method according to claim 1, wherein the calculating a path cost increment corresponding to each of the selectable paths according to a link utilization of at least one link corresponding to each of the selectable paths includes:
obtaining a link cost function, wherein the link cost function is related to the link utilization rate of a link;
calculating a link cost increment corresponding to each link in each selectable path according to the link cost function;
and adding the link cost increment corresponding to each link in the selectable paths to obtain the path cost increment corresponding to each selectable path.
3. The method of claim 1, wherein determining a target path from the alternative paths based on each of the path cost increments comprises:
selecting a candidate path with the minimum path cost increment from the selectable paths according to each path cost increment;
and if the number of the candidate paths is 1, determining the candidate paths as the target paths.
4. The method of claim 3, further comprising:
if the number of the candidate paths is multiple, acquiring the residual capacity corresponding to each link in each candidate path;
and determining the target path from the candidate paths according to the residual capacity corresponding to each link in each candidate path.
5. The method of claim 4, wherein the determining the target path from the candidate paths according to the remaining capacity corresponding to each link in each candidate path comprises:
determining a first remaining capacity from each of the candidate paths, wherein the first remaining capacity is a minimum remaining capacity corresponding to each of the links in each of the candidate paths;
comparing the first residual capacity corresponding to each candidate path;
and determining the candidate path with the maximum first residual capacity as the target path according to the comparison result.
6. The method of claim 5, further comprising:
if at least two candidate paths with the same first residual capacity exist, determining a second residual capacity from the at least two candidate paths, wherein the second residual capacity is a second small residual capacity corresponding to each link in each candidate path;
comparing the second residual capacity corresponding to each candidate path;
determining the candidate path with the maximum second residual capacity as the target path according to the comparison result;
and the like until the target candidate path is determined from the candidate paths.
7. The method of claim 6, further comprising:
and if the residual capacity of each link corresponding to at least two candidate paths is the same, determining the candidate path with the least number of links as the target path.
8. A method for transmitting a service stream, the method comprising:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring a target service flow to be transmitted and at least two selectable paths corresponding to the target service flow;
a calculating module, configured to calculate, according to a link utilization rate of at least one link corresponding to each selectable path, a path cost increment corresponding to each selectable path;
a determining module, configured to determine a target path from the selectable paths according to each of the path cost increments;
and the transmission module is used for transmitting the target service flow by utilizing the target path.
9. An electronic device, comprising a memory having computer instructions stored therein and a processor that, upon execution of the computer instructions, performs the traffic flow transmission method of any of claims 1-7.
10. A computer-readable storage medium storing computer instructions for causing a computer to perform the traffic flow transmission method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111616043.9A CN114500364A (en) | 2021-12-27 | 2021-12-27 | Service flow transmission method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111616043.9A CN114500364A (en) | 2021-12-27 | 2021-12-27 | Service flow transmission method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114500364A true CN114500364A (en) | 2022-05-13 |
Family
ID=81495761
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111616043.9A Pending CN114500364A (en) | 2021-12-27 | 2021-12-27 | Service flow transmission method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114500364A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103249086A (en) * | 2012-02-06 | 2013-08-14 | 宗鹏 | Link cost increment-based constellation routing algorithm |
| CN107294852A (en) * | 2017-07-01 | 2017-10-24 | 台州学院 | A kind of network route method using the scattered short path collection of topology |
| CN109787913A (en) * | 2019-03-15 | 2019-05-21 | 北京工业大学 | A kind of data center network dynamic load balancing method based on SDN |
| CN112565082A (en) * | 2020-12-25 | 2021-03-26 | 鹏城实验室 | Service chain mapping method based on hybrid network, intelligent terminal and storage medium |
| CN113271253A (en) * | 2020-02-14 | 2021-08-17 | 华为技术有限公司 | Path determining method and related equipment thereof |
-
2021
- 2021-12-27 CN CN202111616043.9A patent/CN114500364A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103249086A (en) * | 2012-02-06 | 2013-08-14 | 宗鹏 | Link cost increment-based constellation routing algorithm |
| CN107294852A (en) * | 2017-07-01 | 2017-10-24 | 台州学院 | A kind of network route method using the scattered short path collection of topology |
| CN109787913A (en) * | 2019-03-15 | 2019-05-21 | 北京工业大学 | A kind of data center network dynamic load balancing method based on SDN |
| CN113271253A (en) * | 2020-02-14 | 2021-08-17 | 华为技术有限公司 | Path determining method and related equipment thereof |
| CN112565082A (en) * | 2020-12-25 | 2021-03-26 | 鹏城实验室 | Service chain mapping method based on hybrid network, intelligent terminal and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 邓祺: "软件定义网络精细化测量技术研究", 《CNKI中国知网》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110166280B (en) | Network capacity expansion method and device | |
| CN109981744B (en) | Data distribution method and device, storage medium and electronic equipment | |
| CN109802997B (en) | Node equipment selection method and related equipment thereof | |
| CN109617810B (en) | Data transmission method and device | |
| CN114040467A (en) | Transmission path determining method, device, server and storage medium | |
| CN111263402A (en) | Data transmission method and device and electronic equipment | |
| Moscholios et al. | QoS guarantee in a batched poisson multirate loss model supporting elastic and adaptive traffic | |
| CN115794407A (en) | Computing resource allocation method and device, electronic equipment and nonvolatile storage medium | |
| CN111181873A (en) | Data transmission method, data transmission device, storage medium and electronic equipment | |
| CN111669787A (en) | Resource allocation method and device based on time delay sensitive network slice | |
| CN111538572A (en) | Task processing method, device, scheduling server and medium | |
| US11456959B2 (en) | Sampling node and a method performed thereby for handling flows through a SDN between client(s) and origin server(s) of a communication network | |
| CN113556285B (en) | Data transmission method and device | |
| CN107239407B (en) | Wireless access method and device for memory | |
| CN114500364A (en) | Service flow transmission method and device, electronic equipment and storage medium | |
| CN110113269B (en) | Flow control method based on middleware and related device | |
| CN112488563A (en) | Determination method and device for force calculation parameters | |
| CN113746763A (en) | Data processing method, device and equipment | |
| CN113472591B (en) | Method and device for determining service performance | |
| CN114422438B (en) | Link adjustment method and device for power communication network | |
| JP6996341B2 (en) | Estimating device and estimation method | |
| CN113453285B (en) | Resource adjusting method, device and storage medium | |
| CN108810543A (en) | The compensation method of Video coding and device | |
| CN113890847A (en) | Flow forwarding method and device | |
| CN113438678A (en) | Method and device for distributing cloud resources for network slices |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20220513 |
|
| RJ01 | Rejection of invention patent application after publication |