CN114513423B - Bandwidth adjustment method, device, equipment and storage medium - Google Patents

Bandwidth adjustment method, device, equipment and storage medium Download PDF

Info

Publication number
CN114513423B
CN114513423B CN202011148655.5A CN202011148655A CN114513423B CN 114513423 B CN114513423 B CN 114513423B CN 202011148655 A CN202011148655 A CN 202011148655A CN 114513423 B CN114513423 B CN 114513423B
Authority
CN
China
Prior art keywords
bandwidth
value
node
target
upper limit
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
Application number
CN202011148655.5A
Other languages
Chinese (zh)
Other versions
CN114513423A (en
Inventor
胡雯涛
张建伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Mobile Communications Group Co Ltd
China Mobile Suzhou Software Technology Co Ltd
Original Assignee
China Mobile Communications Group Co Ltd
China Mobile Suzhou Software Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China Mobile Communications Group Co Ltd, China Mobile Suzhou Software Technology Co Ltd filed Critical China Mobile Communications Group Co Ltd
Priority to CN202011148655.5A priority Critical patent/CN114513423B/en
Publication of CN114513423A publication Critical patent/CN114513423A/en
Application granted granted Critical
Publication of CN114513423B publication Critical patent/CN114513423B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/147—Network analysis or design for predicting network behaviour
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876—Network utilisation, e.g. volume of load or congestion level

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The application discloses a bandwidth adjusting method, which comprises the following steps: detecting the increasing speed of the current data flow of a target node and the load condition of the target node; wherein, the target node has an association relation with the target bandwidth packet; if the growth speed is greater than or equal to a preset speed threshold value and the load condition of the target node is full load, acquiring an idle bandwidth value; the bandwidth of the target node is expanded by the idle bandwidth value, so that the dynamic adjustment of the bandwidth of the node according to the service peak value of the node is realized, the response time of bandwidth adjustment in a sudden high-traffic scene is shortened, and the utilization rate of bandwidth data packets is effectively improved. The application also provides a bandwidth adjusting device, equipment and a storage medium.

Description

Bandwidth adjustment method, device, equipment and storage medium
Technical Field
The present application relates to the field of cloud network convergence technologies, and in particular, to a method, an apparatus, a device, and a storage medium for bandwidth adjustment.
Background
With the rapid development of internet technology and the continuous improvement of the use requirements of users, the cloud network integration technology is widely applied. At present, in the cloud network integration process, the implementation can be realized by providing a customer premise equipment (Customer Premise Equipment, CPE) for an enterprise, namely, after the CPE belongs to an integral framework of the whole cloud network, public cloud can provide outlet equipment at the enterprise side, access points (Point Of Presence, POP) accessed to various metropolitan areas, global backbone networks and virtual private clouds (Virtual Private Cloud, VPC) distributed to the global areas and the cloud through the global backbone networks. In the process of realizing network communication by connecting all nodes of the cloud network fusion product of the public cloud at present, the cloud network fusion product at present at least comprises the following configuration schemes: the scheme I is that a single-shared bandwidth is opened for each node, the bandwidth is shared, and bandwidth values among the nodes are mutually independent; and secondly, purchasing a bandwidth packet, wherein the bandwidth in the bandwidth packet is manually distributed to each node by a user, and after the distribution scheme is determined, the bandwidth value enjoyed by each node is fixed before the next manual triggering of the bandwidth adjustment by the user.
However, in both the above schemes, even if the user subscribes to bandwidth packets for a plurality of nodes, the node bandwidth cannot be dynamically adjusted along with the traffic peak of each node, and there is a problem that the bandwidth packets subscribed by the user cannot be shared more efficiently, resulting in lower utilization of the bandwidth packets.
Content of the application
In order to solve the technical problems, the application is expected to provide a bandwidth adjusting method, a device, equipment and a storage medium, which solve the problem that the bandwidth of a node cannot be dynamically adjusted according to the service peak value of the node, realize the dynamic adjustment of the bandwidth of the node according to the service peak value of the node, shorten the response time of bandwidth adjustment in a sudden high-traffic scene and effectively improve the utilization rate of bandwidth data packets.
The technical scheme of the application is realized as follows:
in a first aspect, a method of bandwidth adjustment, the method comprising:
detecting the increasing speed of the current data flow of a target node and the load condition of the target node; wherein, the target node has an association relation with the target bandwidth packet;
if the growth speed is greater than or equal to a preset speed threshold value and the load condition of the target node is full load, acquiring an idle bandwidth value;
And expanding the bandwidth of the target node by the idle bandwidth value.
Optionally, if the growth speed is greater than or equal to a preset speed threshold and the load condition of the target node is full, obtaining the idle bandwidth value includes:
if the growth speed is greater than or equal to a preset speed threshold, and the target node belongs to a corresponding unique full-load node in the target bandwidth packet, determining a first reference node; wherein the first reference node is a node other than the target node within the target bandwidth packet;
determining a lowest bandwidth value of the first reference node;
adjusting the bandwidth of the first reference node from a first current bandwidth value of the first reference node to the corresponding lowest bandwidth value;
and calculating the first current bandwidth value of the first reference node and the corresponding minimum bandwidth value to obtain the idle bandwidth value.
Optionally, the determining the lowest bandwidth value of the first reference node includes:
acquiring the bandwidth upper limit value of the first reference node;
acquiring a minimum bandwidth proportion corresponding to the bandwidth upper limit value of the first reference node;
acquiring a system bandwidth value set for the first reference node;
Calculating the product of the bandwidth upper limit value and the minimum bandwidth proportion to obtain a reference bandwidth value;
and determining the maximum value of the reference bandwidth value and the system bandwidth value to obtain the minimum bandwidth value.
Optionally, the calculating the first current bandwidth value and the lowest bandwidth value of the first reference node to obtain the idle bandwidth value includes:
calculating a first difference value between the first current bandwidth value and the lowest bandwidth value of each node in the first reference nodes;
and calculating a first sum value of the first difference values of all nodes included in the first reference node to obtain the idle bandwidth value.
Optionally, if the growth speed is greater than or equal to a preset speed threshold, and the load condition of the target node is full, acquiring an idle bandwidth value, further including:
if the growth speed is greater than or equal to a preset speed threshold, and the load condition of the target node is full, and the load condition of a second reference node except the target node is also full, calculating a second sum of a second current bandwidth value and a bandwidth stepping value of the target node; wherein the second reference node comprises at least one node; wherein the second reference node comprises at least one node;
And determining the idle bandwidth value based on the second sum value and the bandwidth upper limit value of the target node.
Optionally, the determining the idle bandwidth value based on the second sum value and the bandwidth upper limit value of the target node includes:
if the second sum value is greater than or equal to the bandwidth upper limit value of the target node, calculating a second difference value between the bandwidth upper limit value of the target node and the second current bandwidth value;
determining a first capacity-shrinking bandwidth value corresponding to each node included by the second reference node based on a preset idle bandwidth value allocation proportion and the second difference value;
and shrinking the first shrinking bandwidth value corresponding to the third current bandwidth value of each node included by the second reference node to obtain the idle bandwidth value with the second difference value.
Optionally, the determining the idle bandwidth value based on the second sum value and the bandwidth upper limit value of the target node further includes:
if the second sum value is smaller than the bandwidth upper limit value, determining a second capacity-shrinking bandwidth value corresponding to each node included by the second reference node based on a preset idle bandwidth value allocation proportion and the bandwidth step value;
And shrinking the second shrinking bandwidth value corresponding to the third current bandwidth value of each node included by the second reference node to obtain the idle bandwidth value with the size being the bandwidth stepping value.
Optionally, after the expanding the bandwidth of the target node by the idle bandwidth value, the method further includes:
if the load condition of the target node is detected to be still full, and the sum of the fourth current bandwidth value and the bandwidth step value after the capacity expansion of the target node is larger than or equal to the bandwidth upper limit value of the target node, calculating a third difference value between the bandwidth upper limit value of the target node and the fourth current bandwidth value;
determining a third capacitance bandwidth value corresponding to each node included by the second reference node based on the idle bandwidth value allocation proportion and the third difference value;
and shrinking the third shrinking bandwidth value corresponding to the fifth current bandwidth value of each node included by the second reference node.
Optionally, after the expanding the bandwidth of the target node by the idle bandwidth value, the method further includes:
if the load condition of the target node is detected to be still full, and the sum of the fourth current bandwidth value and the bandwidth step value after the capacity expansion of the target node is smaller than the bandwidth upper limit value of the target node, determining a fourth capacity-shrinking bandwidth value corresponding to each node included in the second reference node based on the idle bandwidth value allocation proportion and the bandwidth step value;
Shrinking the fourth shrinking bandwidth value corresponding to the sixth current bandwidth value of each node included by the second reference node;
and expanding the bandwidth stepping value of the target node until the load condition of the target node is not fully loaded or the load condition of the target node is still fully loaded, and expanding the bandwidth stepping value to the bandwidth upper limit value of the target node.
Optionally, the method further comprises:
if the growth speed is greater than or equal to a preset speed threshold, and the target node is a node with the last load condition being full load in the target bandwidth, determining a bandwidth upper limit value of each node in the target bandwidth;
and recovering the current bandwidth of each node in the target bandwidth as the corresponding bandwidth upper limit value.
Optionally, the method further comprises:
acquiring historical data of each node corresponding to the target bandwidth packet;
predicting the bandwidth upper limit value of each node based on the target model and the historical data to obtain the bandwidth prediction upper limit value of each node;
displaying the bandwidth prediction upper limit value; the bandwidth prediction upper limit value is used for a user to select and set as the bandwidth upper limit value of the corresponding node.
Optionally, the historical data includes adjusting a time period, a peak bandwidth value, a peak duration, a valley bandwidth value, and a historical bandwidth upper limit value, and predicting the bandwidth upper limit value of each node based on the target model and the historical data to obtain a bandwidth prediction upper limit value of each node includes:
based on the historical data, a formula is adoptedDetermining the bandwidth gap value of each node, and calculating the sum value of the bandwidth gap values of each node in the target bandwidth to obtain the total gap bandwidth value of the corresponding node in the target bandwidth; wherein N is i A bandwidth gap value, t, for the ith node i For the peak duration of the ith node, T is the adjustment time period of the ith node, C pi C for the peak bandwidth value of the ith node i A historical bandwidth upper limit value for the ith node;
calculating a difference value between the historical bandwidth upper limit value of each node in the target bandwidth and the corresponding valley bandwidth value based on the historical data, determining a redundant bandwidth value of each node, and calculating a sum value of the redundant bandwidth values of each node in the target bandwidth to obtain a total redundant bandwidth value of the corresponding node in the target bandwidth;
Using a target modelCalculating to obtain a bandwidth reference upper limit value corresponding to the ith node; wherein N is t For the total notch bandwidth value, R t For the total redundant bandwidth value, R i For the redundant bandwidth value of the ith node, E 0 And E is 1 Is a weight value;
and predicting the bandwidth reference upper limit value by adopting a decision tree model, and taking the bandwidth reference upper limit value as a bandwidth prediction upper limit value if the prediction result indicates that the bandwidth reference upper limit value is recommended.
In a second aspect, a bandwidth adjusting apparatus, the apparatus comprising: the device comprises a detection unit, a first acquisition unit and a capacity expansion unit; wherein:
the detecting unit is used for detecting the increasing speed of the current data flow of the target node and the load condition of the target node; wherein, the target node has an association relation with the target bandwidth packet;
the first obtaining unit is configured to obtain an idle bandwidth value if the growth speed is greater than or equal to a preset speed threshold and the load condition of the target node is full;
the capacity expansion unit is used for expanding the bandwidth of the target node by the idle bandwidth value.
In a third aspect, a bandwidth adjustment device includes a memory, a processor, and a communication bus; wherein:
The memory is used for storing executable instructions;
the communication bus is used for realizing communication connection between the processor and the memory;
the processor is configured to execute a bandwidth adjustment program stored in the memory, and implement the steps of the bandwidth adjustment method according to any one of the above claims.
In a fourth aspect, a storage medium has stored thereon a bandwidth adjustment program, which when executed by a processor, implements the steps of the bandwidth adjustment method according to any of the preceding claims.
The embodiment of the application provides a bandwidth adjusting method, a device, equipment and a storage medium. Therefore, when the growth speed of the target node is greater than or equal to the preset speed threshold and the load condition of the target node is full load, the idle bandwidth value is obtained, and the bandwidth of the target node is expanded by the idle bandwidth value, so that the problem that the bandwidth of the node cannot be dynamically adjusted according to the service peak value of the node is solved, the bandwidth of the node is dynamically adjusted according to the service peak value of the node, the response time of bandwidth adjustment in a sudden high-traffic scene is shortened, and the utilization rate of bandwidth data packets is effectively improved.
Drawings
Fig. 1 is a schematic flow chart of a bandwidth adjustment method according to an embodiment of the present application;
fig. 2 is a second schematic flow chart of a bandwidth adjustment method according to an embodiment of the present application;
fig. 3 is a flowchart illustrating a bandwidth adjustment method according to an embodiment of the present application;
fig. 4 is a flow chart diagram of a bandwidth adjustment method according to an embodiment of the present application;
fig. 5 is a flowchart of a bandwidth adjustment method according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a bandwidth adjusting device according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of another bandwidth adjusting apparatus according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of a bandwidth adjusting device according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application.
An embodiment of the present application provides a bandwidth adjustment method, referring to fig. 1, the method being applied to a bandwidth adjustment device, the method including the steps of:
step 101, detecting the growth speed of the current data traffic of the target node and the load condition of the target node.
The target node and the target bandwidth packet have an association relation.
In the embodiment of the application, once the cloud network fusion is determined, the nodes forming the cloud network fusion are determined, the cloud network fusion comprises at least two nodes, and the functions realized by the at least two nodes can be the same or different. A target bandwidth packet may be distributed to multiple nodes in a cloud network convergence. The target node is a node which is currently transmitting data to the next node in cloud network fusion, and the increasing speed of the current data flow of the target node refers to the data transmitted by the target node within a preset time period, for example, 1 second. The load condition of the target node refers to the condition that the size of data transmitted by the target node occupies the bandwidth of the target node.
Step 102, if the growth speed is greater than or equal to the preset speed threshold, and the load condition of the target node is full, acquiring an idle bandwidth value.
In the embodiment of the application, the preset speed threshold is an empirical value obtained according to a large number of experiments or actual conditions, and can be changed according to the actual conditions, and can be corrected and modified continuously along with the increase of the number of samples. If the growth speed is greater than or equal to the preset speed threshold, the data transmitted by the target node is indicated to transmit a larger growth in a short time. The load condition of the target node is full load, that is, the size of the transmission data of the target node is the bandwidth value of the target node, and the bandwidth value of the target node is assumed to be 3 megameters (M), and the size of the transmission data packet of the corresponding target node is 3M when the load condition of the target node is full load. The idle bandwidth value may be an idle bandwidth acquired from allocation of a target bandwidth packet corresponding to the target node to other nodes except the target node.
And 103, expanding the bandwidth of the target node by an idle bandwidth value.
In the embodiment of the application, assuming that the bandwidth value currently allocated by the target node is A1 and the corresponding acquired idle bandwidth value is A2, after the bandwidth of the target node is expanded by the idle bandwidth value, the bandwidth of the target node is the sum of A1 and A2.
The embodiment of the application provides a bandwidth adjusting method, which is characterized in that the increasing speed of the current data flow of a target node and the load condition of the target node are detected, if the increasing speed is greater than or equal to a preset speed threshold value and the load condition of the target node is full load, an idle bandwidth value is obtained, and the bandwidth of the target node is expanded by the idle bandwidth value. Therefore, when the growth speed of the target node is greater than or equal to the preset speed threshold and the load condition of the target node is full load, the idle bandwidth value is obtained, and the bandwidth of the target node is expanded by the idle bandwidth value, so that the problem that the bandwidth of the node cannot be dynamically adjusted according to the service peak value of the node is solved, the bandwidth of the node is dynamically adjusted according to the service peak value of the node, the response time of bandwidth adjustment in a sudden high-traffic scene is shortened, and the utilization rate of bandwidth data packets is effectively improved.
Based on the foregoing embodiments, an embodiment of the present application provides a bandwidth adjustment method, and referring to fig. 2, the method is applied to a bandwidth adjustment device, and includes the steps of:
step 201, detecting the growth speed of the current data traffic of the target node and the load condition of the target node.
The target node and the target bandwidth packet have an association relation.
In the embodiment of the application, when a user is in a service scene and a plurality of local internet data centers (Internet Data Center, IDC) and Virtual cloud (VPC) on the cloud are simultaneously accessed to cloud network service, and the mutual access of access nodes is realized, the user can subscribe a bandwidth packet, namely a target bandwidth packet. And configuring the bandwidth values of the access and the exit for each accessed node based on the target bandwidth packet, wherein the sum of the bandwidth values allocated for each node is smaller than or equal to the bandwidth value of the target bandwidth packet. Real-time traffic of each node access router can be reported to an upper controller or an arrangement layer of the bandwidth adjusting device in a second level through a network telemetry (telemetry) protocol. In this way, an upper controller or orchestration layer of the bandwidth regulating device may be used to detect received or output data traffic of a node.
The specific process that the upper layer controller or the orchestration layer can be used for detecting the received or output data traffic of the node can be that polling is actively initiated through the service of the telemet, and the flow of the service of the training is approximately: 1) The namespaces represented by the polters contained under the scan specified namespaces, e.g., the statement ceilometer-agent-computer, are: the statement ceilometer-agent-central represents a namespace of: the term ceilometer.poll.central, the name space represented by the statement ceilometer-agent-ipmi is: the politer under each namespace can be seen by the statement setup.cfg; 2) Each polister has an default_discover, each discover's definition can be found under the ceilometer_discover namespace of the statement setup.cfg, which is responsible for specifying the resources that politers are to poll. For example, default_discover of the ceilometer-agent-computer is local_instances; 3) The collected data is put into a specified pipeline according to the meter_name, the converter of the pipeline is responsible for converting the data, and the publicher is responsible for distributing the converted data to a message queue, so that the detection of the data flow of the node is completed based on a test protocol.
Step 202, if the growth speed is greater than or equal to the preset speed threshold, and the target node belongs to a corresponding unique full-load node in the target bandwidth packet, determining a first reference node.
Wherein the first reference node is a node other than the target node within the target bandwidth packet.
In the embodiment of the present application, if the upper controller or the orchestration layer detects that the growth speed of the received or output data traffic of the target node is greater than or equal to the preset speed threshold, it may be determined that the received or output data traffic of the target node increases sharply. And when the growth speed of the target node is greater than or equal to a preset speed threshold value and the target node belongs to a corresponding only full-load node in the target bandwidth packet, determining other corresponding nodes except the target node in the target bandwidth packet to obtain a first reference node.
Step 203, determining the lowest bandwidth value of the first reference node.
In the embodiment of the application, each node in the cloud network fusion is provided with the lowest bandwidth value and the bandwidth upper limit value, namely, the bandwidth value of each node in the cloud network fusion can be continuously adjusted between the corresponding lowest bandwidth value and the bandwidth upper limit value according to the actual bandwidth use condition of each node, so that the adjusted bandwidth value meets the bandwidth use requirement of each node.
In other embodiments of the present application, step 203 may be implemented by steps a 11-a 15:
step a11, obtaining the bandwidth upper limit value of the first reference node.
In the embodiment of the present application, the bandwidth upper limit value of the first reference node includes the bandwidth upper limit value of the target node, which may be preset, for example, may be set by the user according to the experience or the requirement of the user, or may be set by the user based on the bandwidth upper limit value recommended by the machine learning method in steps 217 to 219.
Step a12, obtaining a minimum bandwidth proportion corresponding to the bandwidth upper limit value of the first reference node.
In the embodiment of the application, the minimum bandwidth proportion corresponding to the bandwidth upper limit value of the first reference node is preset, and similarly, the target node also has the minimum bandwidth proportion corresponding to the bandwidth upper limit value of the target node, which is also preset.
Step a13, acquiring a system bandwidth value set for a first reference node.
In the embodiment of the application, the system bandwidth value is the lowest bandwidth value preset in the bandwidth adjusting device and used for guaranteeing that the node can transmit data.
And a14, calculating the product of the bandwidth upper limit value and the minimum bandwidth proportion to obtain a reference bandwidth value.
And a15, determining the maximum value of the reference bandwidth value and the system bandwidth value to obtain the lowest bandwidth value.
In the embodiment of the application, the reference bandwidth value obtained by calculating the product of the bandwidth upper limit value and the minimum bandwidth proportion is compared with the system bandwidth value, and the maximum one of the two values is determined as the minimum bandwidth value. That is, if the reference bandwidth value is greater than the system bandwidth value, the lowest bandwidth value is the reference bandwidth value, if the reference bandwidth value is less than the system bandwidth value, the lowest bandwidth value is the system bandwidth value, and if the reference bandwidth value is equal to the system bandwidth value, the lowest bandwidth value is the reference bandwidth value or the system bandwidth value.
It should be noted that the preset bandwidth upper limit values of different nodes may be the same or different, and similarly, the corresponding minimum bandwidth ratios may be the same or different, and the system bandwidth values may be the same or different.
Step 204, adjusting the bandwidth of the first reference node from the first current bandwidth value of the first reference node to the corresponding lowest bandwidth value.
In the embodiment of the application, since only one node of the corresponding nodes in the target bandwidth is full, which indicates that the first reference node has idle bandwidth, the bandwidth of the first reference node can be adjusted from the current first current bandwidth value to the determined corresponding lowest bandwidth value.
Step 205, calculating a first current bandwidth value of the first reference node and a corresponding minimum bandwidth value to obtain an idle bandwidth value.
In the embodiment of the application, the first current bandwidth value and the corresponding minimum bandwidth value of each node in the first reference nodes are calculated to obtain the idle bandwidth value which can be allocated to the target node.
In other embodiments of the present application, step 205 may be implemented by steps b 11-b 12:
step b11, calculating a first difference value between the first current bandwidth value of each node in the first reference nodes and the corresponding lowest bandwidth value.
And b12, calculating a first sum value of first difference values of all nodes included in the first reference node to obtain an idle bandwidth value.
Step 206, if the growth speed is greater than or equal to the preset speed threshold, and the load condition of the target node is full, and the load condition of the second reference node except the target node is full, calculating a second sum of the second current bandwidth value and the bandwidth step value of the target node.
Wherein the second reference node comprises at least one node.
In the embodiment of the present application, the bandwidth step value is a preset step value for performing expansion during each expansion, and may be an empirical value obtained according to a large number of implementations. If the growth speed is greater than or equal to a preset speed threshold, and at least two nodes are arranged in the nodes corresponding to the target bandwidth packet, and one node is the sum of the current second current bandwidth value and the bandwidth stepping value of the target node when the target node is full, and the second sum is obtained.
Step 207, determining an idle bandwidth value based on the second sum value and the bandwidth upper limit value of the target node.
In the embodiment of the application, the second sum value and the bandwidth upper limit value of the target node are analyzed to determine the idle bandwidth value.
In other embodiments of the present application, step 207 may be implemented by steps c 11-c 13 or steps d 11-d 13:
and c11, if the second sum value is greater than or equal to the bandwidth upper limit value of the target node, calculating a second difference value between the bandwidth upper limit value of the target node and the second current bandwidth value.
Step c12, determining a first capacity-reduction bandwidth value corresponding to each node included in the second reference node based on a preset idle bandwidth value allocation proportion and a second difference value.
In the embodiment of the application, the preset bandwidth limiting value allocation proportion is a preset allocation proportion of shared idle bandwidth which needs to be met by competing idle bandwidth among each node. In this way, product calculation is performed by adopting the preset bandwidth limiting value allocation proportion and the second difference value, and a first capacity-shrinking bandwidth value corresponding to each node included in the second reference node is obtained. For example, assume that the corresponding nodes in the target bandwidth packet are c1, c2, and c3, where the preset bandwidth limit value allocation ratio is c1: c2: c3 =i1: i2: and I3, if c1 is the target node, the first capacitance bandwidth value of the corresponding node c2 is the product of I2/(I2+I3) and the second difference, and the first capacitance bandwidth value of the corresponding node c3 is the product of I3/(I2+I3) and the second difference.
And step c13, shrinking the first shrinking bandwidth value corresponding to the third current bandwidth value of each node included in the second reference node to obtain an idle bandwidth value with the second difference value.
In the embodiment of the present application, since the bandwidth value of the target bandwidth packet is fixed, the bandwidth value of each node included in the second reference node needs to be scaled by the corresponding first scaled bandwidth value, thereby obtaining the bandwidth value limited for scaling to the target node.
And d11, if the second sum value is smaller than the bandwidth upper limit value, determining a bandwidth stepping value.
In the embodiment of the application, the bandwidth step value is a preset experience value.
Step d12, determining a second capacity-reduction bandwidth value corresponding to each node included in the second reference node based on the preset idle bandwidth value allocation proportion and the bandwidth stepping value.
In the embodiment of the present application, it is assumed that the corresponding nodes in the target bandwidth packet are c1, c2, and c3, where the preset bandwidth limiting value allocation ratio is c1: c2: c3 =i1: i2: and I3, if c1 is the target node, the second capacitance bandwidth value of the corresponding node c2 is the product of I2/(I2+I3) and the bandwidth step value, and the first capacitance bandwidth value of the corresponding node c3 is the product of I3/(I2+I3) and the bandwidth step value.
Step d13, shrinking the second shrinking bandwidth value corresponding to the third current bandwidth value of each node included in the second reference node to obtain an idle bandwidth value with the size being the bandwidth stepping value.
Step 208, the bandwidth of the target node is expanded by the idle bandwidth value.
In other embodiments of the present application, referring to fig. 3, after the bandwidth adjusting apparatus performs step 208, the bandwidth adjusting apparatus is further configured to perform steps 209 to 211, or steps 212 to 214:
step 209, if it is detected that the load condition of the target node is still full, and the sum of the fourth current bandwidth value and the bandwidth step value after the capacity expansion of the target node is greater than or equal to the bandwidth upper limit value of the target node, calculating a third difference value between the bandwidth upper limit value of the target node and the fourth current bandwidth value.
In the embodiment of the application, after the target node is expanded based on the bandwidth step value, if the load condition of the target node is detected to be still full, continuing to expand the bandwidth of the target node, wherein the specific operation of the expansion comprises judging the size relation between the sum of the fourth current bandwidth value and the bandwidth step value after the expansion of the target node and the bandwidth upper limit value of the target node.
Step 210, determining a third capacitance bandwidth value corresponding to each node included in the second reference node based on the idle bandwidth value allocation proportion and the third difference value.
Step 211, the fifth current bandwidth value of each node included in the second reference node is scaled by the corresponding third scaled bandwidth value.
Step 212, if it is detected that the load condition of the target node is still full, and the sum of the fourth current bandwidth value and the bandwidth step value after the capacity expansion of the target node is smaller than the bandwidth upper limit value of the target node, determining a fourth capacity-reduction bandwidth value corresponding to each node included in the second reference node based on the idle bandwidth value allocation proportion and the bandwidth step value.
Step 213, the sixth current bandwidth value of each node included in the second reference node is scaled by the corresponding fourth scaled bandwidth value.
Step 214, expanding the bandwidth step value of the target node until the load condition of the target node is not full load or the load condition of the target node is still full load, until the bandwidth is expanded to the bandwidth upper limit value of the target node.
In other embodiments of the present application, referring to fig. 4, after the bandwidth adjusting apparatus performs step 201, the bandwidth adjusting apparatus may further be configured to perform steps 215 to 216:
step 215, if the growth speed is greater than or equal to the preset speed threshold, and the target node is the node with the last load condition being full load in the target bandwidth, determining the bandwidth upper limit value of each node in the target bandwidth.
In the embodiment of the application, the target node is a node with the last load condition being full in the target bandwidth, which means that all nodes corresponding to the target bandwidth packet are full.
And step 216, recovering the current bandwidth of each node in the target bandwidth as the corresponding bandwidth upper limit value.
In other embodiments of the present application, referring to fig. 5, before the bandwidth adjusting apparatus performs step 201, the bandwidth adjusting apparatus may be further configured to perform steps 217 to 219:
step 217, obtain the historical data of each node corresponding to the target bandwidth packet.
And step 218, predicting the bandwidth upper limit value of each node based on the target model and the historical data to obtain the bandwidth prediction upper limit value of each node.
In other embodiments of the present application, when the historical data includes the adjustment time period, the peak bandwidth value, the peak duration, the valley bandwidth value, and the historical bandwidth upper limit, the corresponding step 218 may be implemented by steps e11 to e 14:
step e11, based on the history data, adopting a formulaAnd determining the bandwidth gap value of each node, and calculating the sum value of the bandwidth gap values of each node in the target bandwidth to obtain the total gap bandwidth value of the corresponding node in the target bandwidth.
Wherein N is i A bandwidth gap value, t, for the ith node i For the peak duration of the ith node, T is the adjustment time period of the ith node, C pi Peak bandwidth value for the ith node, C i Is the historical bandwidth upper limit of the ith node.
In the embodiment of the application, the total gap bandwidth value of the corresponding node in the target bandwidth can be recorded as N t Wherein, the method comprises the steps of, wherein,j represents the total number of nodes included in the target bandwidth, i is an integer greater than or equal to 1 and less than or equal to j.
And e12, calculating the difference value between the historical bandwidth upper limit value of each node in the target bandwidth and the corresponding valley bandwidth value based on the historical data, determining the redundant bandwidth value of each node, and calculating the sum value of the redundant bandwidth values of each node in the target bandwidth to obtain the total redundant bandwidth value of the corresponding node in the target bandwidth.
In the embodiment of the application, the redundant bandwidth value R of each node i The method can be calculated by adopting the following formula: r is R i ＝C i -C vi Wherein C vi Representing the valley bandwidth value of the i-th node. Total redundant bandwidth value R for corresponding nodes within a target bandwidth t Can be calculated by the following formula:
step e13, adopting a target modelAnd calculating to obtain the bandwidth reference upper limit value corresponding to the ith node.
Wherein N is t For the total notch bandwidth value, R t R is the total redundant bandwidth value i Redundant Bandwidth value for the ith node, E 0 And E is 1 Is a weight value.
In the embodiment of the application, gamma in the target model i Is the upper limit of the historical bandwidth in the historical data, thus, based on the historical data, the E can be determined by adopting a mathematical analysis method such as linear regression analysis 0 And E is 1 Thus, the bandwidth reference upper limit value corresponding to the ith node can be calculated.
And e14, predicting the bandwidth reference upper limit value by adopting a decision tree model, and taking the bandwidth reference upper limit value as the bandwidth prediction upper limit value if the prediction result shows the recommended bandwidth reference upper limit value.
In the embodiment of the application, the adopted decision tree model is preset, the bandwidth reference upper limit value is predicted, and the output prediction result comprises the recommended bandwidth reference upper limit value or the non-recommended bandwidth reference upper limit value. If the prediction result indicates that the bandwidth reference upper limit value is not recommended, the subsequent operation is not performed.
Step 219, displaying the bandwidth prediction upper limit value.
The bandwidth prediction upper limit value is used for a user to select and set as the bandwidth upper limit value of the corresponding node.
It should be noted that, in this embodiment, the descriptions of the same steps and the same content as those in other embodiments may refer to the descriptions in other embodiments, and are not repeated here.
The embodiment of the application provides a bandwidth adjusting method, which is characterized in that the increasing speed of the current data flow of a target node and the load condition of the target node are detected, if the increasing speed is greater than or equal to a preset speed threshold value and the load condition of the target node is full load, an idle bandwidth value is obtained, and the bandwidth of the target node is expanded by the idle bandwidth value. Therefore, when the growth speed of the target node is greater than or equal to the preset speed threshold and the load condition of the target node is full load, the idle bandwidth value is obtained, and the bandwidth of the target node is expanded by the idle bandwidth value, so that the problem that the bandwidth of the node cannot be dynamically adjusted according to the service peak value of the node is solved, the bandwidth of the node is dynamically adjusted according to the service peak value of the node, the response time of bandwidth adjustment in a sudden high-traffic scene is shortened, and the utilization rate of bandwidth data packets is effectively improved.
Based on the foregoing embodiments, the embodiments of the present application provide a bandwidth adjusting apparatus, which may be applied to the bandwidth adjusting methods provided in the corresponding embodiments of fig. 1 to 5, and referring to fig. 6, the bandwidth adjusting apparatus 3 may include: a detection unit 31, a first acquisition unit 32 and a capacity expansion unit 33, wherein:
A detecting unit 31, configured to detect a rate of increase of a current data traffic of the target node and a load condition of the target node; wherein, the target node has an association relation with the target bandwidth packet;
a first obtaining unit 32, configured to obtain an idle bandwidth value if the growth speed is greater than or equal to a preset speed threshold and the load condition of the target node is full;
and the expansion unit 33 is configured to expand the bandwidth of the target node by an idle bandwidth value.
In other embodiments of the present application, the first acquisition unit includes: the device comprises a first determining module, a second determining module, an adjusting module and a first calculating module; wherein:
the first determining module is used for determining a first reference node if the growth speed is greater than or equal to a preset speed threshold value and the target node belongs to a corresponding unique full-load node in the target bandwidth packet; wherein the first reference node is a node other than the target node within the target bandwidth packet;
a second determining module, configured to determine a lowest bandwidth value of the first reference node;
the adjusting module is used for adjusting the bandwidth of the first reference node from the first current bandwidth value of the first reference node to the corresponding lowest bandwidth value;
and the calculation module is used for calculating the first current bandwidth value of the first reference node and the corresponding lowest bandwidth value to obtain an idle bandwidth value.
In other embodiments of the present application, the second determining module is specifically configured to:
acquiring a bandwidth upper limit value of a first reference node;
obtaining a minimum bandwidth proportion corresponding to the bandwidth upper limit value of the first reference node;
acquiring a system bandwidth value set for a first reference node;
calculating the product of the bandwidth upper limit value and the minimum bandwidth proportion to obtain a reference bandwidth value;
and determining the maximum value of the reference bandwidth value and the system bandwidth value to obtain the lowest bandwidth value.
In other embodiments of the present application, the computing module is further configured to:
calculating a first difference value between a first current bandwidth value and a lowest bandwidth value of each node in the first reference nodes;
and calculating a first sum value of first difference values of all nodes included in the first reference node to obtain an idle bandwidth value.
In other embodiments of the present application, the first acquisition unit further includes: a second calculation module and a third determination module; wherein:
the second calculating module is used for calculating a second sum of a second current bandwidth value and a bandwidth stepping value of the target node if the growth speed is greater than or equal to a preset speed threshold value, the load condition of the target node is full load, and the load condition of a second reference node except the target node is full load; wherein the second reference node comprises at least one node;
And the third determining module is used for determining an idle bandwidth value based on the second sum value and the bandwidth upper limit value of the target node.
In other embodiments of the present application, the third determining module is specifically configured to:
if the second sum value is greater than or equal to the bandwidth upper limit value of the target node, calculating a second difference value between the bandwidth upper limit value of the target node and a second current bandwidth value;
determining a first capacity-shrinking bandwidth value corresponding to each node included by a second reference node based on a preset idle bandwidth value allocation proportion and a second difference value;
and shrinking the first shrinking bandwidth value corresponding to the third current bandwidth value of each node included in the second reference node to obtain an idle bandwidth value with the second difference value.
In other embodiments of the present application, the third determining module is further specifically configured to:
if the second sum value is smaller than the bandwidth upper limit value, determining a bandwidth step value;
determining a second capacity-shrinking bandwidth value corresponding to each node included by a second reference node based on a preset idle bandwidth value allocation proportion and a bandwidth stepping value;
and shrinking the second shrinking bandwidth value corresponding to the third current bandwidth value of each node included in the second reference node to obtain an idle bandwidth value with the size of the bandwidth stepping value.
In other embodiments of the present application, referring to fig. 7, after the capacity expansion unit 33, the bandwidth adjusting apparatus further includes: a calculation unit 34, a first determination unit 35, and a capacity reduction unit 36; wherein:
the calculating unit 34 is configured to calculate a third difference value between the bandwidth upper limit value of the target node and the fourth current bandwidth value if it is detected that the load condition of the target node is still full and the sum of the fourth current bandwidth value and the bandwidth step value of the target node after capacity expansion is greater than or equal to the bandwidth upper limit value of the target node;
a first determining unit 35, configured to determine a third capacitance bandwidth value corresponding to each node included in the second reference node based on the idle bandwidth value allocation proportion and the third difference value;
the capacity shrinking unit 36 is configured to shrink the third capacity-shrinking bandwidth value corresponding to the fifth current bandwidth value of each node included in the second reference node.
In other embodiments of the present application, after the capacity expansion unit performs the capacity expansion of the bandwidth of the target node by the idle bandwidth value:
the first determining unit 35 is further configured to determine, if it is detected that the load condition of the target node is still full, and a sum of the fourth current bandwidth value and the bandwidth step value after capacity expansion of the target node is smaller than the bandwidth upper limit value of the target node, a fourth capacity-shrinking bandwidth value corresponding to each node included in the second reference node based on the idle bandwidth value allocation proportion and the bandwidth step value;
The capacity shrinking unit 36 is further configured to shrink a fourth capacity-shrinking bandwidth value corresponding to the sixth current bandwidth value of each node included in the second reference node;
the capacity expansion unit 33 is further configured to expand the capacity of the target node by a bandwidth step value until the load condition of the target node is not fully loaded or until the capacity is expanded to the bandwidth upper limit value of the target node when the load condition of the target node is still fully loaded.
In other embodiments of the present application, referring to fig. 7, the bandwidth adjusting apparatus further includes: a second determination unit 37 and a recovery unit 38; wherein:
a second determining unit 37, configured to determine a bandwidth upper limit value of each node in the target bandwidth if the growth speed is greater than or equal to the preset speed threshold, and the target node is a node in which the last load condition in the target bandwidth is full;
and a restoring unit 38, configured to restore the current bandwidth of each node within the target bandwidth to be the corresponding bandwidth upper limit value.
In other embodiments of the present application, referring to fig. 7, before the detecting unit, the bandwidth adjusting apparatus further includes: a second acquisition unit 39, a prediction unit 310, and a display unit 311; wherein:
a second obtaining unit 39, configured to obtain history data of each node corresponding to the target bandwidth packet;
A prediction unit 310, configured to predict an upper bandwidth limit value of each node based on the target model and the history data, so as to obtain an upper bandwidth prediction limit value of each node;
a display unit 311 for displaying the bandwidth prediction upper limit value; the bandwidth prediction upper limit value is used for a user to select and set as the bandwidth upper limit value of the corresponding node.
In other embodiments of the present application, the historical data includes an adjustment time period, a peak bandwidth value, a peak duration, a valley bandwidth value, and a historical bandwidth upper limit, and the prediction unit includes: the system comprises a first processing module, a third computing module and a second processing module; wherein:
the processing module is used for adopting a formula based on the historical dataDetermining the bandwidth gap value of each node, and calculating the sum value of the bandwidth gap values of each node in the target bandwidth to obtain the total gap bandwidth value of the corresponding node in the target bandwidth; wherein N is i A bandwidth gap value, t, for the ith node i For the peak duration of the ith node, T is the adjustment time period of the ith node, C pi Peak bandwidth value for the ith node, C i The historical bandwidth upper limit value of the ith node;
the processing module is further used for calculating the difference value between the historical bandwidth upper limit value of each node in the target bandwidth and the corresponding valley bandwidth value based on the historical data, determining the redundant bandwidth value of each node, calculating the sum value of the redundant bandwidth values of each node in the target bandwidth and obtaining the total redundant bandwidth value of the corresponding node in the target bandwidth;
A third calculation module for adopting the target modelCalculating to obtain a bandwidth reference upper limit value corresponding to the ith node; wherein N is t For the total notch bandwidth value, R t R is the total redundant bandwidth value i Redundant Bandwidth value for the ith node, E 0 And E is 1 Is a weight value;
and the second processing module is used for predicting the bandwidth reference upper limit value by adopting the decision tree model, and taking the bandwidth reference upper limit value as the bandwidth prediction upper limit value if the prediction result represents the recommended bandwidth reference upper limit value.
It should be noted that, in the specific implementation process of the steps executed by the bandwidth adjusting device in this embodiment, reference may be made to the implementation process in the bandwidth adjusting method provided in the embodiment corresponding to fig. 1 to 5, which is not described herein again.
The embodiment of the application provides a bandwidth adjusting device, which is used for detecting the increasing speed of the current data flow of a target node and the load condition of the target node, if the increasing speed is greater than or equal to a preset speed threshold value and the load condition of the target node is full load, acquiring an idle bandwidth value, and expanding the bandwidth of the target node by the idle bandwidth value. Therefore, when the growth speed of the target node is greater than or equal to the preset speed threshold and the load condition of the target node is full load, the idle bandwidth value is obtained, and the bandwidth of the target node is expanded by the idle bandwidth value, so that the problem that the bandwidth of the node cannot be dynamically adjusted according to the service peak value of the node is solved, the bandwidth of the node is dynamically adjusted according to the service peak value of the node, the response time of bandwidth adjustment in a sudden high-traffic scene is shortened, and the utilization rate of bandwidth data packets is effectively improved.
Based on the foregoing embodiments, embodiments of the present application provide a bandwidth adjusting apparatus that may be applied to the bandwidth adjusting methods provided in the corresponding embodiments of fig. 1 to 5, and referring to fig. 8, the bandwidth adjusting apparatus 4 may include: a processor 41, a memory 42 and a communication bus 43, wherein:
a communication bus 43 for enabling a communication connection between the processor 41 and the memory 42;
the processor 41 is configured to execute the bandwidth adjustment program stored in the memory 42 to implement the implementation procedure in the bandwidth adjustment method provided in the embodiment corresponding to fig. 1 to 5, which is not described herein.
Based on the foregoing embodiments, embodiments of the present application provide a computer-readable storage medium, simply referred to as a storage medium, which stores one or more programs that may be executed by one or more processors to implement the implementation procedure in the bandwidth adjustment method provided by the embodiments corresponding to fig. 1 to 5, which will not be described herein.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, magnetic disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can 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.
The foregoing description is only of the preferred embodiments of the present application, and is not intended to limit the scope of the present application.

Claims (14)

1. A method of bandwidth adjustment, the method comprising:
detecting the increasing speed of the current data flow of a target node and the load condition of the target node; wherein, the target node has an association relation with the target bandwidth packet;
if the growth speed is greater than or equal to a preset speed threshold value and the load condition of the target node is full load, acquiring an idle bandwidth value;
expanding the bandwidth of the target node by the idle bandwidth value;
and if the growth speed is greater than or equal to a preset speed threshold and the load condition of the target node is full load, acquiring an idle bandwidth value comprises:
If the growth speed is greater than or equal to a preset speed threshold, and the target node belongs to a corresponding unique full-load node in the target bandwidth packet, determining a first reference node; wherein the first reference node is a node other than the target node within the target bandwidth packet;
determining a lowest bandwidth value of the first reference node;
adjusting the bandwidth of the first reference node from a first current bandwidth value of the first reference node to the corresponding lowest bandwidth value;
and calculating the first current bandwidth value of the first reference node and the corresponding minimum bandwidth value to obtain the idle bandwidth value.
2. The method of claim 1, wherein the determining the lowest bandwidth value of the first reference node comprises:
acquiring the bandwidth upper limit value of the first reference node;
acquiring a minimum bandwidth proportion corresponding to the bandwidth upper limit value of the first reference node;
acquiring a system bandwidth value set for the first reference node;
calculating the product of the bandwidth upper limit value and the minimum bandwidth proportion to obtain a reference bandwidth value;
and determining the maximum value of the reference bandwidth value and the system bandwidth value to obtain the minimum bandwidth value.
3. The method of claim 1, wherein the calculating the first current bandwidth value and the lowest bandwidth value of the first reference node to obtain the idle bandwidth value comprises:
calculating a first difference value between the first current bandwidth value and the lowest bandwidth value of each node in the first reference nodes;
and calculating a first sum value of the first difference values of all nodes included in the first reference node to obtain the idle bandwidth value.
4. The method of claim 1, wherein if the growth rate is greater than or equal to a preset rate threshold and the load condition of the target node is full, obtaining an idle bandwidth value, further comprising:
if the growth speed is greater than or equal to a preset speed threshold, and the load condition of the target node is full, and the load condition of a second reference node except the target node is also full, calculating a second sum of a second current bandwidth value and a bandwidth stepping value of the target node; wherein the second reference node comprises at least one node; wherein the second reference node comprises at least one node;
And determining the idle bandwidth value based on the second sum value and the bandwidth upper limit value of the target node.
5. The method of claim 4, wherein the determining the idle bandwidth value based on the second sum value and a bandwidth upper limit of the target node comprises:
if the second sum value is greater than or equal to the bandwidth upper limit value of the target node, calculating a second difference value between the bandwidth upper limit value of the target node and the second current bandwidth value;
determining a first capacity-shrinking bandwidth value corresponding to each node included by the second reference node based on a preset idle bandwidth value allocation proportion and the second difference value;
and shrinking the first shrinking bandwidth value corresponding to the third current bandwidth value of each node included by the second reference node to obtain the idle bandwidth value with the second difference value.
6. The method of claim 4, wherein the determining the idle bandwidth value based on the second sum value and a bandwidth upper limit of the target node further comprises:
if the second sum value is smaller than the bandwidth upper limit value, determining a second capacity-shrinking bandwidth value corresponding to each node included by the second reference node based on a preset idle bandwidth value allocation proportion and the bandwidth step value;
And shrinking the second shrinking bandwidth value corresponding to the third current bandwidth value of each node included by the second reference node to obtain the idle bandwidth value with the size being the bandwidth stepping value.
7. The method of claim 6, wherein after said expanding the bandwidth of the target node by the idle bandwidth value, the method further comprises:
if the load condition of the target node is detected to be still full, and the sum of the fourth current bandwidth value and the bandwidth step value after the capacity expansion of the target node is larger than or equal to the bandwidth upper limit value of the target node, calculating a third difference value between the bandwidth upper limit value of the target node and the fourth current bandwidth value;
determining a third capacitance bandwidth value corresponding to each node included by the second reference node based on the idle bandwidth value allocation proportion and the third difference value;
and shrinking the third shrinking bandwidth value corresponding to the fifth current bandwidth value of each node included by the second reference node.
8. The method of claim 6, wherein after said expanding the bandwidth of the target node by the idle bandwidth value, the method further comprises:
If the load condition of the target node is detected to be still full, and the sum of the fourth current bandwidth value and the bandwidth step value after the capacity expansion of the target node is smaller than the bandwidth upper limit value of the target node, determining a fourth capacity-shrinking bandwidth value corresponding to each node included in the second reference node based on the idle bandwidth value allocation proportion and the bandwidth step value;
shrinking the fourth shrinking bandwidth value corresponding to the sixth current bandwidth value of each node included by the second reference node;
and expanding the bandwidth stepping value of the target node until the load condition of the target node is not fully loaded or the load condition of the target node is still fully loaded, and expanding the bandwidth stepping value to the bandwidth upper limit value of the target node.
9. The method according to claim 1, wherein the method further comprises:
if the growth speed is greater than or equal to a preset speed threshold, and the target node is a node with the last load condition being full load in the target bandwidth, determining a bandwidth upper limit value of each node in the target bandwidth;
and recovering the current bandwidth of each node in the target bandwidth as the corresponding bandwidth upper limit value.
10. The method according to claim 1, wherein the method further comprises:
acquiring historical data of each node corresponding to the target bandwidth packet;
predicting the bandwidth upper limit value of each node based on a target model and the historical data to obtain the bandwidth prediction upper limit value of each node;
displaying the bandwidth prediction upper limit value; the bandwidth prediction upper limit value is used for a user to select and set as the bandwidth upper limit value of the corresponding node.
11. The method of claim 10, wherein the historical data includes adjustment time periods, peak bandwidth values, peak durations, valley bandwidth values, and historical bandwidth upper limits, wherein the predicting the bandwidth upper limit for each node based on the target model and the historical data, resulting in the bandwidth prediction upper limit for each node, comprises:
based on the historical data, a formula is adoptedDetermining the bandwidth gap value of each node, and calculating the sum value of the bandwidth gap values of each node in the target bandwidth to obtain the total gap bandwidth value of the corresponding node in the target bandwidth; wherein N is i A bandwidth gap value, t, for the ith node i For the peak duration of the ith node, T is the adjustment time period of the ith node, C pi C for the peak bandwidth value of the ith node i A historical bandwidth upper limit value for the ith node;
calculating a difference value between the historical bandwidth upper limit value of each node in the target bandwidth and the corresponding valley bandwidth value based on the historical data, determining a redundant bandwidth value of each node, and calculating a sum value of the redundant bandwidth values of each node in the target bandwidth to obtain a total redundant bandwidth value of the corresponding node in the target bandwidth;
using a target modelCalculating to obtain a bandwidth reference upper limit value corresponding to the ith node; wherein N is t For the total notch bandwidth value, R t For the total redundant bandwidth value, R i For the redundant bandwidth value of the ith node, E 0 And E is 1 Is a weight value;
and predicting the bandwidth reference upper limit value by adopting a decision tree model, and taking the bandwidth reference upper limit value as a bandwidth prediction upper limit value if the prediction result indicates that the bandwidth reference upper limit value is recommended.
12. A bandwidth adjustment device, the device comprising: the device comprises a detection unit, a first acquisition unit and a capacity expansion unit; wherein:
The detecting unit is used for detecting the increasing speed of the current data flow of the target node and the load condition of the target node; wherein, the target node has an association relation with the target bandwidth packet;
the first obtaining unit is configured to obtain an idle bandwidth value if the growth speed is greater than or equal to a preset speed threshold and the load condition of the target node is full;
the capacity expansion unit is used for expanding the bandwidth of the target node by the idle bandwidth value;
the first acquisition unit includes: the device comprises a first determining module, a second determining module, an adjusting module and a first calculating module; wherein:
the first determining module is configured to determine a first reference node if the growth speed is greater than or equal to a preset speed threshold, and the target node belongs to a corresponding unique full-load node in the target bandwidth packet; wherein the first reference node is a node other than the target node within the target bandwidth packet;
the second determining module is used for determining the lowest bandwidth value of the first reference node;
the adjusting module is used for adjusting the bandwidth of the first reference node from a first current bandwidth value of the first reference node to the corresponding lowest bandwidth value;
The calculation module is configured to calculate the first current bandwidth value of the first reference node and the corresponding minimum bandwidth value, so as to obtain the idle bandwidth value.
13. A bandwidth adjustment device, the device comprising a memory, a processor, and a communication bus; wherein:
the memory is used for storing executable instructions;
the communication bus is used for realizing communication connection between the processor and the memory;
the processor configured to execute a bandwidth adjustment program stored in the memory, and implement the steps of the bandwidth adjustment method according to any one of claims 1 to 11.
14. A storage medium having stored thereon a bandwidth adjustment program which, when executed by a processor, implements the steps of the bandwidth adjustment method according to any of claims 1 to 11.
CN202011148655.5A 2020-10-23 2020-10-23 Bandwidth adjustment method, device, equipment and storage medium Active CN114513423B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011148655.5A CN114513423B (en) 2020-10-23 2020-10-23 Bandwidth adjustment method, device, equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011148655.5A CN114513423B (en) 2020-10-23 2020-10-23 Bandwidth adjustment method, device, equipment and storage medium

Publications (2)

Publication Number Publication Date
CN114513423A CN114513423A (en) 2022-05-17
CN114513423B true CN114513423B (en) 2023-11-03

Family

ID=81546104

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011148655.5A Active CN114513423B (en) 2020-10-23 2020-10-23 Bandwidth adjustment method, device, equipment and storage medium

Country Status (1)

Country Link
CN (1) CN114513423B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115086244B (en) * 2022-06-16 2024-06-18 平安付科技服务有限公司 Bandwidth allocation method, device, computer equipment and storage medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106549782A (en) * 2015-09-18 2017-03-29 中兴通讯股份有限公司 The bandwidth scheduling method and device of association stream in a kind of data center
CN107733676A (en) * 2016-08-12 2018-02-23 中国移动通信集团浙江有限公司 A kind of method and system of flexible scheduling resource
CN107888428A (en) * 2017-12-04 2018-04-06 郑州云海信息技术有限公司 A kind of bandwidth adjusting method, device, equipment and readable storage medium storing program for executing
CN109766182A (en) * 2018-12-18 2019-05-17 平安科技（深圳）有限公司 The scalable appearance method, apparatus of system resource dynamic, computer equipment and storage medium
CN110493047A (en) * 2018-02-27 2019-11-22 贵州白山云科技股份有限公司 A kind of method and system distributing CDN network interior joint server bandwidth
CN111082952A (en) * 2018-10-18 2020-04-28 中国电信股份有限公司 Network optimization method, software defined network controller and network system

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106412628B (en) * 2015-07-30 2020-07-24 华为技术有限公司 Bandwidth adjusting method and related equipment
US10958592B2 (en) * 2019-04-12 2021-03-23 Wangsu Science & Technology Co., Ltd. Domain name bandwidth adjustment method and apparatus

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106549782A (en) * 2015-09-18 2017-03-29 中兴通讯股份有限公司 The bandwidth scheduling method and device of association stream in a kind of data center
CN107733676A (en) * 2016-08-12 2018-02-23 中国移动通信集团浙江有限公司 A kind of method and system of flexible scheduling resource
CN107888428A (en) * 2017-12-04 2018-04-06 郑州云海信息技术有限公司 A kind of bandwidth adjusting method, device, equipment and readable storage medium storing program for executing
CN110493047A (en) * 2018-02-27 2019-11-22 贵州白山云科技股份有限公司 A kind of method and system distributing CDN network interior joint server bandwidth
CN111082952A (en) * 2018-10-18 2020-04-28 中国电信股份有限公司 Network optimization method, software defined network controller and network system
CN109766182A (en) * 2018-12-18 2019-05-17 平安科技（深圳）有限公司 The scalable appearance method, apparatus of system resource dynamic, computer equipment and storage medium

Also Published As

Publication number Publication date
CN114513423A (en) 2022-05-17

Similar Documents

Publication Publication Date Title
CN109857546B (en) Multi-server mobile edge computing unloading method and device based on Lyapunov optimization
CN109819057B (en) Load balancing method and system
US20170142177A1 (en) Method and system for network dispatching
EP3451727B1 (en) Access scheduling method and device for terminal, and computer storage medium
CN112261120B (en) Cloud-side cooperative task unloading method and device for power distribution internet of things
CN104038392A (en) Method for evaluating service quality of cloud computing resources
CN110311812B (en) Network analysis method, device and storage medium
CN115134368A (en) Load balancing method, device, equipment and storage medium
CN115934333A (en) Historical data perception-based cloud computing resource scheduling method and system
CN114513423B (en) Bandwidth adjustment method, device, equipment and storage medium
Tang et al. Nanily: A qos-aware scheduling for dnn inference workload in clouds
CN115604278A (en) Dynamic load balancing method and system
CN111901134B (en) Method and device for predicting network quality based on recurrent neural network model (RNN)
CN113543160B (en) 5G slice resource allocation method, device, computing equipment and computer storage medium
CN103532759B (en) The acceptance controlling method of the aggregated flow of cloud service-oriented
CN114726860B (en) Load balancing system and load balancing method for streaming media transmission
CN116302404A (en) Resource decoupling data center-oriented server non-perception calculation scheduling method
CN115858155A (en) Dynamic capacity expansion and contraction method and device for application resources of computing power network platform
CN114785692A (en) Virtual power plant aggregation regulation and control communication network flow balancing method and device
CN115543582A (en) Method, system and equipment for unified scheduling of super computing power network
CN112866358B (en) Method, system and device for rescheduling service of Internet of things
CN113973092B (en) Link resource scheduling method, device, computing equipment and computer storage medium
CN114936089A (en) Resource scheduling method, system, device and storage medium
Zhu et al. Load balancing algorithm for web server based on weighted minimal connections
CN112714037A (en) Method, device and equipment for evaluating guarantee performance of online service quality

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