CN114448810A - Bandwidth traction method and device and electronic equipment - Google Patents
Bandwidth traction method and device and electronic equipment Download PDFInfo
- Publication number
- CN114448810A CN114448810A CN202111608405.XA CN202111608405A CN114448810A CN 114448810 A CN114448810 A CN 114448810A CN 202111608405 A CN202111608405 A CN 202111608405A CN 114448810 A CN114448810 A CN 114448810A
- Authority
- CN
- China
- Prior art keywords
- unit
- server group
- bandwidth
- unit individual
- migrated
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 72
- 230000005012 migration Effects 0.000 claims abstract description 46
- 238000013508 migration Methods 0.000 claims abstract description 46
- 238000012216 screening Methods 0.000 claims abstract description 19
- 238000004891 communication Methods 0.000 claims description 15
- 230000009467 reduction Effects 0.000 claims description 12
- 238000004590 computer program Methods 0.000 claims description 9
- 238000012545 processing Methods 0.000 abstract description 9
- 238000004422 calculation algorithm Methods 0.000 description 12
- 230000008569 process Effects 0.000 description 8
- 238000004364 calculation method Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 238000013138 pruning Methods 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000010276 construction Methods 0.000 description 2
- 238000013507 mapping Methods 0.000 description 2
- 230000015556 catabolic process Effects 0.000 description 1
- 238000013499 data model Methods 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 238000011038 discontinuous diafiltration by volume reduction Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000013139 quantization Methods 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Images
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/142—Network analysis or design using statistical or mathematical methods
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Algebra (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Pure & Applied Mathematics (AREA)
- Hardware Redundancy (AREA)
Abstract
The embodiment of the invention relates to a bandwidth traction method, a bandwidth traction device and electronic equipment, wherein the method comprises the following steps: determining a server group to be migrated, a first bandwidth amount used by each unit of bandwidth used in the server group to be migrated, and a second bandwidth amount to be migrated of the server group to be migrated; selecting at least one unit individual from all unit individuals to form a unit individual combination according to the first bandwidth amount and the second bandwidth amount; screening candidate server groups respectively corresponding to each unit individual in the unit individual combination, and determining the redundant bandwidth amount of each candidate server group; constructing an integer programming model according to the candidate server group, the redundant bandwidth amount, each unit individual in the unit individual combination and the first bandwidth amount corresponding to each unit individual in the unit individual combination; and solving the integer programming model to generate a migration scheme of the unit individual combination. Compared with the prior art, the method has higher processing speed.
Description
Technical Field
The embodiment of the invention relates to the technical field of computers, in particular to a bandwidth traction method and device and electronic equipment.
Background
A Content Delivery Network (CDN) is a Network that allows a user to obtain needed Content nearby by setting up nodes between a service provider and a consumer, so as to relieve Network congestion and improve the response speed of the user when accessing a website.
Generally, a group of servers is used for providing CDN services, and since the servers themselves have an upper capacity limit, in an online actual operation process, if a group of servers exceeding the upper capacity limit still provides services continuously, a machine load is often high, which results in packet loss or other situations that affect the quality of services. At this time, the customers of the service on the group need to be migrated to other groups, and normal operation of the service is guaranteed in a reduced volume manner. When online operation encounters such problems, operation and maintenance personnel or programs generally perform exhaustive search to perform volume reduction processing, and at present, the two types of methods have the following problems:
1. because the reduced migration involves a large amount of data calculation, manual adjustment often only can process some simple scenes (for example, the situations that the number of clients served on a server group is small, the number of groups that can be accepted is large, and the redundancy is sufficient), and manual bandwidth migration cannot be performed on complex scenes;
2. the migration amount is calculated by adopting a computer program, and the existing mode generally adopts an exhaustive search mode to solve. Since the number of clients served on the server group may be large, the number of combinations involved in performing the derating migration is huge, and a multi-level derating process may be required, it is often impossible to perform the solution in a limited time.
Disclosure of Invention
The application provides a bandwidth traction method, a bandwidth traction device and electronic equipment, and aims to solve the problems in the prior art.
In a first aspect, the present application provides a method of bandwidth pulling, the method comprising:
determining a server group to be migrated, a first bandwidth amount used by each unit of bandwidth used in the server group to be migrated, and a second bandwidth amount to be migrated of the server group to be migrated;
selecting at least one unit from unit individuals using the bandwidth in the server group to be migrated according to the first bandwidth amount and the second bandwidth amount to form a unit individual combination to be migrated;
screening candidate server groups respectively corresponding to each unit individual in the unit individual combination from the server groups except the server group to be migrated, and determining the redundant bandwidth amount of each candidate server group;
constructing an integer programming model according to the candidate server group, the redundant bandwidth amount of the candidate server group, each unit individual in the unit individual combination and the first bandwidth amount corresponding to each unit individual in the unit individual combination;
and solving the integer programming model to generate a migration scheme of the unit individual combination.
In a second aspect, the present application provides a bandwidth pulling apparatus, the apparatus comprising:
the determining module is used for determining a server group to be migrated, a first bandwidth amount used by each unit of bandwidth used in the server group to be migrated, and a second bandwidth amount to be migrated of the server group to be migrated;
the selection module is used for selecting at least one unit individual from the unit individuals using the bandwidth in the server group to be migrated according to the first bandwidth amount and the second bandwidth amount to form a unit individual combination to be migrated;
the screening module is used for screening candidate server groups respectively corresponding to each unit individual in the unit individual combination from the server groups except the server group to be migrated, and determining the redundant bandwidth amount of each candidate server group;
the construction module is used for constructing an integer programming model according to the candidate server group, the redundant bandwidth amount of the candidate server group, each unit individual in the unit individual combination and the first bandwidth amount corresponding to each unit individual in the unit individual combination;
and the generating module is used for solving the integer programming model and generating a migration scheme of the unit individual combination.
In a third aspect, an electronic device is provided, which includes a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory complete communication with each other through the communication bus;
a memory for storing a computer program;
a processor configured to implement the steps of the bandwidth pulling method according to any one of the embodiments of the first aspect when executing the program stored in the memory.
In a fourth aspect, a computer-readable storage medium is provided, on which a computer program is stored, which computer program, when being executed by a processor, carries out the steps of the bandwidth pulling method according to any one of the embodiments of the first aspect.
Compared with the prior art, the technical scheme provided by the embodiment of the application has the following advantages:
the method provided by the embodiment of the application determines a server group to be migrated, a first bandwidth amount used by each unit of bandwidth used in the server group to be migrated, and a second bandwidth amount to be migrated of the server group to be migrated. Then, according to the first bandwidth amount and the second bandwidth amount, at least one unit individual is extracted from unit individuals using bandwidth in a server group to be migrated to form a unit individual combination to be migrated, a candidate server group corresponding to each unit individual in the unit individual combination is screened from the server groups except the server group to be migrated, then an integer programming model is constructed according to the candidate server group, the redundant bandwidth amount of the candidate server group, the unit individual combination and the first bandwidth amount corresponding to each unit individual in the unit individual combination, the integer programming model is solved, and finally a migration scheme of the unit individual combination is generated. In the method, a bandwidth migration problem is converted into a solution problem of an integer model, and a migration scheme is obtained through a mathematical algorithm. Compared with a scheme of manually adjusting bandwidth migration, the method provided by the embodiment of the application can more conveniently and quickly cope with a complex scene. In addition, the method obtains a better bandwidth migration scheme through a certain algorithm solving way, has higher processing speed compared with an exhaustion way in the prior art, and can solve in a limited time.
Drawings
Fig. 1 is a schematic flow chart of a bandwidth traction method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a multi-bandwidth traction structure of a specific application example of a bandwidth traction method provided by the present invention;
FIG. 3 is a schematic structural diagram of a bandwidth pulling apparatus according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
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.
For the convenience of understanding of the embodiments of the present invention, the following description will be further explained with reference to specific embodiments, which are not to be construed as limiting the embodiments of the present invention.
To solve the technical problems mentioned in the background art, an embodiment of the present application provides a bandwidth pulling method, specifically referring to fig. 1, where fig. 1 is a schematic flow diagram of a bandwidth pulling method provided by an embodiment of the present invention, and the method includes:
Specifically, the unit individual may be understood as a combination of identification information of client + region granularity of bandwidth usage in the server group, so as to refer to bandwidth of a certain user under a certain operator name used in a certain region. The first amount of bandwidth, i.e. the amount of bandwidth that is currently counted and that the user has used.
When a user accesses a domain name, a server in the server group records an access request in a log system, wherein the request comprises the user IP, the position of a machine executing the access request, the content of an operator corresponding to the used bandwidth, and the like. The client refers to the user IP, and the area includes the operator and the specific location (e.g., province, region, etc.) where the machine is located. The method of the embodiment of the application can be executed by a terminal device, the terminal device can acquire the real-time bandwidth of each server group in real time, and the acquisition channel comprises the acquisition of log information, or the terminal device is directly connected with the servers in the server groups, so that the real-time bandwidth on the server is acquired in real time.
After the terminal device acquires the real-time bandwidth of each server, the current total bandwidth amount of each server group can be obtained. When the total bandwidth amount exceeds a preset threshold, for example, after the total bandwidth amount exceeds the rated bandwidth of the server group by a certain proportion, in order to avoid the occurrence of a situation that the server group continues to provide services, the machine load is too high, packet loss or even other situations that affect the service quality occur, the server group needs to be added into the to-be-migrated queue, and the server group is also reduced (part of unit individuals are migrated to other server groups). The server group with the current bandwidth usage amount exceeding the rated bandwidth by a certain proportion is the server group to be migrated, and the first bandwidth amount of each unit individual in each server group and the second bandwidth amount to be migrated of the server group to be migrated are obtained.
Further optionally, in consideration that the terminal device acquires the user IP, the area where the machine is located, and the operator, and these pieces of information cannot be directly used by the scheduling system in the terminal device, it is also necessary to map currently acquired unit individual information. Mapping the client domain name to a dispatching system in a CNAME mode, and converting the client domain name into a dispatching domain name. And defining the scheduling domain name as an analysis group, wherein the information obtained after the client + region granularity mapping is the analysis group + region granularity.
And step 120, selecting at least one unit from the unit individuals using the bandwidth in the server group to be migrated according to the first bandwidth amount and the second bandwidth amount to form a unit individual combination to be migrated.
In particular, in an actual application environment, the unit of bandwidth used in any server group usually includes a plurality of units. Then, which units perform the migration work, a certain choice needs to be made.
In the specific implementation, at least one unit is selected from the plurality of units according to the first bandwidth amount and the second bandwidth amount to form a unit combination.
For example, the second bandwidth amount is 5G, the unit individuals in the server group include a, the bandwidth amount is 1G, B is 2G, C is 3G, D is 1G, and E is 2G. Then, the combination of unit individuals may include A + B + E, or, A + C + D, or, B + D + E, and so forth.
Specifically, when the sum of the first bandwidth amounts corresponding to at least one unit in the unit individuals using the bandwidth in the group of servers to be migrated is greater than or equal to the second bandwidth amount, it can be determined that the unit individual combination is formed by at least one unit.
While in the specific implementation, one of the combinations is randomly selected, and the following operations are performed.
Step 130, screening candidate server groups respectively corresponding to each unit individual in the unit individual combination from the server groups except the server group to be migrated, and determining the redundant bandwidth amount of each candidate server group.
Optionally, in order to find a candidate server group corresponding to each unit individual in the unit individual combination from other server groups, the following method may be adopted, specifically refer to the following:
and screening the server groups except the server group to be migrated according to the redundant bearing capacity and/or the preconfigured constraint limiting condition of each server group except the server group to be migrated and the first bandwidth amount corresponding to each unit individual in the unit individual combination to obtain candidate server groups respectively corresponding to each unit individual in the unit individual combination.
That is, it is first determined whether the redundancy capability of the server group in the remaining server groups except the server group to be migrated can support a certain unit. If the connection can be carried out, the connection is used as a candidate server group corresponding to the unit individual. If the connection cannot be made, the connection is eliminated.
And/or, when the server group further comprises some constraints, some resources can be used only in partial regions, and the resources cannot be used as the candidate server group of the unit individual, and the resources need to be excluded.
Through the method, the candidate server groups respectively corresponding to each unit individual in the unit individual combination are screened out.
In one possible implementation, although only one candidate server group can be selected for each unit, in some special cases, it is possible that the same candidate server group simultaneously satisfies the conditions of serving as candidate servers for a plurality of unit.
Optionally, before performing the method step of step 140, the method may further include: and randomly transferring at least one unit individual in the unit individual combination to a corresponding candidate server group in at least one candidate server group, and refreshing the redundancy information of the candidate server group.
Specifically, since there may be a lot of analysis group + regions carried on the server group, in order to reduce the calculation amount of the subsequent integer programming problem, and there may exist many feasible solutions to the bandwidth migration problem itself, before step 140 is executed, a part of the analysis group + regions may be randomly selected and randomly allocated to the candidate server group by the las vegas algorithm (the las vegas algorithm is a randomized algorithm that always gives a correct solution, and the las vegas algorithm does not get an incorrect solution.
Of course, as described above, this operation is not necessarily performed to reduce the amount of subsequent calculation, and it is fully feasible if the skilled person does not perform this operation, but directly performs the operation of step 140, and only the amount of calculation is increased.
After the operation is finished, an integer programming model is constructed by using the candidate server group, the redundant bandwidth amount of the candidate server group, each unit individual in the unit individual combination and the first bandwidth amount corresponding to each unit individual in the unit individual combination.
Specifically, the idea of this step is to migrate the resolved group + zone on the server group to the candidate server group, which is essentially a resource allocation problem, i.e. in case the amount of each available resource is limited, the resources are carefully allocated to maximize the benefit. In addition, because the migration of the analytic group + region does not meet the separability, the problem can be qualitatively defined as a binary integer programming problem, and the model is established as follows:
1. the objective function of the problem is designed by introducing a binary variable (or a 0-1 variable) as:
max Z＝A1x11+A2x12+…+Anxnm
wherein A isiAmount of bandwidth, x, for the ith parse group + regionijFor the ith parse group + zone to migrate to the jth candidate server group,
z represents the sum of the bandwidth amounts of the analysis group + regions that can be migrated, and max Z represents the ability to maximize Z by the correlation algorithm.
Further optionally, after the data model is constructed, the method may further include: and generating a constraint condition corresponding to the integer programming model according to the candidate server group, the redundant bandwidth amount of the candidate server group, each unit individual in the unit individual combination and the first bandwidth amount corresponding to each unit individual in the unit individual combination.
Specifically, the same analysis group + region needs to be satisfied and can only be migrated to a certain candidate server group, that is, satisfied
In addition, one candidate server group can only carry the resolution group + zone band which does not exceed the self redundancy capabilityThe broad amount, i.e.:
therefore, the execution conditions described above may also be configured when building the integer programming model.
And 150, solving the integral planning model to generate a migration scheme of the unit individual combination.
Specifically, when the solving process is specifically executed, the bandwidth migration problem may be solved by using a branch-and-bound algorithm.
The method specifically comprises the following steps:
1) initialization: is provided with Z*And (2) setting the optimal solution of the objective function to be infinitesimal, and then solving the original problem by adopting a delimiting and pruning method.
2) Delimitation: for each sub-problem, the boundary values of the linear relaxation problem for the sub-problem are first calculated using the simplex method, and then the Z values are rounded down.
3) Pruning: for each sub-problem, pruning is performed in the following three ways;
1. if the boundary value of the subproblem is less than or equal to Z*Then the sub-problem can be pruned;
2. if the linear relaxation problem of a sub-problem does not contain a feasible solution, then the sub-problem can be pruned;
3. if the optimal solution of the linear relaxation problem of the subproblem is an integer and is better than the original optimal feasible solution, the solution of the subproblem is the current optimal feasible solution.
The specific solving process is realized by the prior art, so that redundant description is omitted here.
When all the resolution group + regions are allocated, it represents that the current solution is a feasible solution to the original problem. The migration of the unit individuals in the unit individual combination can be directly completed according to the current migration mode.
Optionally, it is considered that, as described above, there may exist a situation that the candidate server groups corresponding to different unit individuals are the same candidate server group, however, the current redundancy of the same candidate server group cannot simultaneously carry multiple unit individuals, or the redundancy in the candidate server group changes suddenly, so that after the binary integer programming model is solved in the above manner, the parsing group + region is still not allocated. At this time, the method may further include:
executing multi-step reduction operation on the unit individuals with the migration failure;
and finishing when determining that all the unit individuals in the unit individual combination are successfully migrated or the iteration times of executing the multi-step reduction amount exceed a preset time threshold.
Specifically, the performing the multi-step reduction operation may include the following steps:
1. the hierarchical depth, i.e., the recursive search depth, is initialized.
2. And (3) calculating a secondary server group needing to be reduced (assuming that the operation is the first-order migration of the server group to be migrated, and the operation is the second-order (secondary-order) migration), extracting candidate server groups of the unallocated analysis group + region, and pruning (namely, eliminating the server groups appearing on recursive links in all orders before the current order).
3. A candidate server group is randomly selected and all the above operation steps except the multi-step reduction operation are performed.
And ending until all unit individuals in the unit individual combination are determined to be successfully migrated or the iteration number of executing the multi-step reduction amount (executing the multi-step migration) exceeds a preset number threshold.
When the number of iterations of executing the multi-level degradation reaches a certain threshold, it indicates that the migration scheme of the unit individual combination does not have a proper solution. One or more of the unit combination schemes may be changed to repeat some or all of the above operations again as desired.
If no appropriate solution is found after all unit combinations are subjected to the above operation, it indicates that, in terms of a certain probability, the original problem may not have a feasible solution, that is, bandwidth pulling is performed on the server group, a candidate server group list which can be accepted may not be found, and solution needs to be performed in a resource replanning manner. Conversely, if a suitable output scheme can be found, then an optimal solution is indicated.
In a specific application example, assuming that there is a certain server group g0 that needs to be down by 10MB, a set of dv (resolution group + zone) lists to be migrated is generated by calculation. The dv to be migrated in g0 is shown in Table 1, and the redundancy capability of the candidate server group g1-g3 is shown in Table 2.
TABLE 1
| dv1 | dv2 | dv3 | dv4 | |
| g0 | 2MB | 2MB | 3MB | 3MB |
TABLE 2
| Server group | Redundancy capability |
| g1 | 1MB |
| g2 | 3MB |
| g3 | 3MB |
At specific execution, a partial parsing group + region is randomly assigned: dv4 is assigned to g3, for example, in a random manner.
Solving by adopting an integer programming formula subproblem: since the amount of redundancy of the candidate server groups g1 and g2 cannot fully accommodate the amount of dv1, dv2, and dv3, recursive de-quantization processing of g1 is required.
Assuming that g1 is processed by the recursive decrement such that the redundancy of g1 becomes 4MB, the server group redundancy becomes large at this time, as shown in table 3:
TABLE 3
| Server group | Redundancy capability |
| g1 | 4MB |
| g2 | 3MB |
| g3 | 0MB |
At this point, integer programming is used to solve:
max Z＝2x11+2x12+2x21+2x22+3x31+3x32
s.t.x11+x12≤1
x21+x22≤1
x31+x32≤1
2x11+2x21+2x31≤4
2x12+2x22+2x32≤3
x11，x12，x13，x21，x22，x23∈{0，1}
as shown in table 4, the final feasible solution of the original problem is:
TABLE 4
| dv1 | dv2 | dv3 | dv4 | |
| g1 | 1 | 1 | 0 | 0 |
| g2 | 0 | 0 | 1 | 0 |
| g3 | 0 | 0 | 0 | 1 |
Where dv1 is assigned to g1, dv2 to g1, dv3 to g2, dv4 to g3, and server group g0 achieves the goal of bandwidth pulling 10 MB.
Referring specifically to fig. 2, fig. 2 illustrates a migration flow diagram of dv except dv4 in the group g0 after performing the multi-level reduction processing, and the redundant bandwidth amount in each candidate server in the candidate server group. Where s represents the remaining dv combinations, including dv1, dv2, and dv 3. The amount of bandwidth of dv1 is 2M, the amount of bandwidth of dv2 is 2M, and the amount of bandwidth of dv3 is 3M. dv1 migrates into g1, dv2 migrates into g1, dv3 migrates into g2, and the result t is finally output.
The bandwidth pulling method provided by the embodiment of the invention determines the server group to be migrated, the first bandwidth amount used by each unit of the used bandwidth in the server group to be migrated, and the second bandwidth amount to be migrated of the server group to be migrated. Then, according to the first bandwidth amount and the second bandwidth amount, at least one unit individual is extracted from unit individuals using bandwidth in a server group to be migrated to form a unit individual combination to be migrated, a candidate server group corresponding to each unit individual in the unit individual combination is screened from the server groups except the server group to be migrated, then an integer programming model is constructed according to the candidate server group, the redundant bandwidth amount of the candidate server group, the unit individual combination and the first bandwidth amount corresponding to each unit individual in the unit individual combination, the integer programming model is solved, and finally a migration scheme of the unit individual combination is generated. In the method, a bandwidth migration problem is converted into a solution problem of an integer model, and a migration scheme is obtained through a mathematical algorithm. Compared with a scheme of manually adjusting bandwidth migration, the method provided by the embodiment of the application can more conveniently and quickly cope with a complex scene. In addition, the method obtains a better bandwidth migration scheme through a certain algorithm solving way, has higher processing speed compared with an exhaustion way in the prior art, and can solve in a limited time.
In the above, for several embodiments of the bandwidth pulling method provided by the present application, other embodiments of the bandwidth pulling method provided by the present application are described below, and specifically refer to the following.
Fig. 3 is a bandwidth traction apparatus provided in an embodiment of the present invention, where the apparatus includes: a determination module 301, a selection module 302, a screening module 303, a construction module 304, and a generation module 305.
A determining module 301, configured to determine a server group to be migrated, a first bandwidth amount used by each unit individual of a bandwidth used in the server group to be migrated, and a second bandwidth amount to be migrated of the server group to be migrated;
a selecting module 302, configured to select at least one unit from the unit individuals using the bandwidth in the to-be-migrated server group according to the first bandwidth amount and the second bandwidth amount, so as to form a unit individual combination to be migrated;
a screening module 303, configured to screen candidate server groups respectively corresponding to each unit individual in the unit individual combination from server groups other than the server group to be migrated, and determine a redundant bandwidth amount of each candidate server group;
a building module 304, configured to build an integer programming model according to the candidate server group, the redundant bandwidth amount of the candidate server group, each unit individual in the unit individual combination, and the first bandwidth amount corresponding to each unit individual in the unit individual combination;
and a generating module 305, configured to solve the integer programming model to generate a migration scheme of the unit individual combination.
Optionally, the selecting module 302 is specifically configured to determine that at least one unit individual constitutes a unit individual combination when a sum of first bandwidth amounts corresponding to at least one unit individual in the unit individuals using the bandwidth in the to-be-migrated server group is greater than or equal to a second bandwidth amount.
Optionally, the screening module 303 is specifically configured to screen the server groups other than the server group to be migrated according to the redundant bearer capability and/or the preconfigured constraint limiting condition of each of the server groups other than the server group to be migrated and the first bandwidth amount corresponding to each unit individual in the unit individual combination, so as to obtain candidate server groups corresponding to each unit individual in the unit individual combination.
Optionally, the apparatus further comprises: and the processing module is used for randomly transferring at least one unit in the unit combination to a corresponding candidate server group in at least one candidate server group and refreshing the redundancy information of the candidate server group.
Optionally, the processing module is further configured to, when the solution result of the integral planning model is at least one unit individual migration failure in the unit individual combination, perform a multi-step reduction operation on the unit individual migration failure;
and finishing when determining that all unit individuals in the unit individual combination are successfully migrated or the iteration number of executing the multi-step reduction quantity exceeds a preset number threshold.
Optionally, the building module 304 is further configured to generate a constraint condition corresponding to the integer programming model according to the candidate server group, the redundant bandwidth amount of the candidate server group, each unit individual in the unit individual combination, and the first bandwidth amount corresponding to each unit individual in the unit individual combination.
Optionally, the number of the unit individual combinations to be migrated includes a plurality; the screening module 303 is further configured to, when screening of candidate server groups respectively corresponding to each of the unit individuals in the current unit individual combination from the server groups other than the server group to be migrated fails, reselect a new unit individual combination, and perform screening of candidate server groups respectively corresponding to each of the unit individuals in the new unit combination from the server groups other than the server group to be migrated.
The functions executed by each component in the bandwidth pulling apparatus provided by the embodiment of the present invention have been described in detail in any of the above method embodiments, and therefore, are not described herein again.
The bandwidth traction device provided by the embodiment of the invention determines a server group to be migrated, a first bandwidth amount used by each unit of bandwidth used in the server group to be migrated, and a second bandwidth amount to be migrated of the server group to be migrated. Then, according to the first bandwidth amount and the second bandwidth amount, at least one unit individual is extracted from unit individuals using bandwidth in a server group to be migrated to form a unit individual combination to be migrated, a candidate server group corresponding to each unit individual in the unit individual combination is screened from the server groups except the server group to be migrated, then an integer programming model is constructed according to the candidate server group, the redundant bandwidth amount of the candidate server group, the unit individual combination and the first bandwidth amount corresponding to each unit individual in the unit individual combination, the integer programming model is solved, and finally a migration scheme of the unit individual combination is generated. In the method, a bandwidth migration problem is converted into a solution problem of an integer model, and a migration scheme is obtained through a mathematical algorithm. Compared with a scheme of manually adjusting bandwidth migration, the method provided by the embodiment of the application can more conveniently and quickly cope with a complex scene. In addition, the method obtains a better bandwidth migration scheme through a certain algorithm solving way, has higher processing speed compared with an exhaustion way in the prior art, and can solve in a limited time.
As shown in fig. 4, an electronic device according to an embodiment of the present application includes a processor 111, a communication interface 112, a memory 113, and a communication bus 114, where the processor 111, the communication interface 112, and the memory 113 complete communication with each other through the communication bus 114.
A memory 113 for storing a computer program;
in an embodiment of the present application, the processor 111, when configured to execute the program stored in the memory 113, implements the bandwidth pulling method provided in any one of the foregoing method embodiments, including:
determining a server group to be migrated, a first bandwidth amount used by each unit of bandwidth used in the server group to be migrated, and a second bandwidth amount to be migrated of the server group to be migrated;
selecting at least one unit from unit individuals using the bandwidth in the server group to be migrated according to the first bandwidth amount and the second bandwidth amount to form a unit individual combination to be migrated;
screening candidate server groups respectively corresponding to each unit individual in the unit individual combination from the server groups except the server group to be migrated, and determining the redundant bandwidth amount of each candidate server group;
constructing an integer programming model according to the candidate server group, the redundant bandwidth amount of the candidate server group, each unit individual in the unit individual combination and the first bandwidth amount corresponding to each unit individual in the unit individual combination;
and solving the integer programming model to generate a migration scheme of the unit individual combination.
Optionally, when the sum of the first bandwidth amounts corresponding to at least one unit individual in the unit individuals using the bandwidth in the to-be-migrated server group is greater than or equal to the second bandwidth amount, it is determined that at least one unit individual constitutes a unit individual combination.
Optionally, the server groups except the server group to be migrated are screened according to the redundant carrying capacity and/or the preconfigured constraint limiting condition of each server group except the server group to be migrated and the first bandwidth amount corresponding to each unit individual in the unit individual combination, so as to obtain candidate server groups respectively corresponding to each unit individual in the unit individual combination.
Optionally, before generating the migration scheme of the unit individual combination according to the candidate server group, the unit individual combination, and the first bandwidth amount corresponding to each unit individual in the unit individual combination, the method further includes:
and randomly transferring at least one unit individual in the unit individual combination to a corresponding candidate server group in at least one candidate server group, and refreshing the redundancy information of the candidate server group.
Optionally, when the solution result of the integral planning model is at least one unit individual migration failure in the unit individual combination, the method further includes:
executing multi-step reduction operation on the unit individuals with the migration failure;
and finishing when determining that all unit individuals in the unit individual combination are successfully migrated or the iteration number of executing the multi-step reduction quantity exceeds a preset number threshold.
Optionally, after the integer programming model is constructed according to the candidate server group, the redundant bandwidth amount of the candidate server group, each unit individual in the unit individual combination, and the first bandwidth amount corresponding to each unit individual in the unit individual combination, the method further includes:
and generating a constraint condition corresponding to the integer programming model according to the candidate server group, the redundant bandwidth amount of the candidate server group, each unit individual in the unit individual combination and the first bandwidth amount corresponding to each unit individual in the unit individual combination.
Optionally, the number of the unit individual combinations to be migrated includes a plurality; when the screening of the candidate server groups respectively corresponding to each of the unit individuals in the current unit individual combination from the server groups other than the server group to be migrated fails, a new unit individual combination is reselected, and the screening of the candidate server groups respectively corresponding to each of the unit individuals in the new individual combination from the server groups other than the server group to be migrated is performed.
Embodiments of the present application further provide a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps of the bandwidth pulling method provided in any of the foregoing method embodiments.
It is noted that, in this document, relational terms such as "first" and "second," and the like, may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The foregoing are merely exemplary embodiments of the present invention, which enable those skilled in the art to understand or practice the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A method of bandwidth traction, the method comprising:
determining a server group to be migrated, wherein a first bandwidth amount used by each unit of bandwidth used in the server group to be migrated and a second bandwidth amount to be migrated of the server group to be migrated are determined;
selecting at least one unit from unit individuals using the bandwidth in the server group to be migrated according to the first bandwidth amount and the second bandwidth amount to form a unit individual combination to be migrated;
screening candidate server groups respectively corresponding to each unit individual in the unit individual combination from the server groups except the server group to be migrated, and determining the redundant bandwidth amount of each candidate server group;
constructing an integer programming model according to the candidate server group, the redundant bandwidth amount of the candidate server group, each unit individual in the unit individual combination and the first bandwidth amount corresponding to each unit individual in the unit individual combination;
and solving the integer programming model to generate the migration scheme of the unit individual combination.
2. The method according to claim 1, wherein selecting at least one unit from the unit individuals using the bandwidth in the group of servers to be migrated according to the first bandwidth amount and the second bandwidth amount to form a combination of the unit individuals to be migrated, specifically includes:
and when the sum of the first bandwidth amount corresponding to at least one unit individual in the unit individuals using the bandwidth in the server group to be migrated is greater than or equal to the second bandwidth amount, determining that at least one unit individual forms the unit individual combination.
3. The method according to claim 1, wherein the screening, from the server groups except the server group to be migrated, candidate server groups respectively corresponding to each unit individual in the unit individual combination, and determining the redundant bandwidth amount of each candidate server group specifically comprises:
and screening the server groups except the server group to be migrated according to the redundant bearing capacity and/or preconfigured constraint limiting conditions of each server group except the server group to be migrated and the first bandwidth amount corresponding to each unit individual in the unit individual combination, and acquiring candidate server groups respectively corresponding to each unit individual in the unit individual combination.
4. The method of claim 1, wherein before generating the migration plan for a group of unit individuals according to the candidate server group, the group of unit individuals, and the first bandwidth amount corresponding to each of the unit individuals, the method further comprises:
and randomly migrating at least one unit individual in the unit individual combination to a corresponding candidate server group in at least one candidate server group, and refreshing the redundancy information of the candidate server group.
5. The method of claim 4, wherein when solving the integer programming model results in a failure to migrate at least one of the combinations of units, the method further comprises:
executing multi-step reduction operation on the unit individuals with the migration failure;
and finishing when determining that all the unit individuals in the unit individual combination are successfully migrated or the iteration number of executing the multi-step reduction quantity exceeds a preset number threshold.
6. The method according to any one of claims 1-5, wherein after constructing an integer programming model according to the candidate server group, the redundant bandwidth amount of the candidate server group, each of the units in the unit-individual combination, and the first bandwidth amount corresponding to each of the units in the unit-individual combination, the method further comprises:
and generating a constraint condition corresponding to the integer programming model according to the candidate server group, the redundant bandwidth amount of the candidate server group, each unit individual in the unit individual combination and the first bandwidth amount corresponding to each unit individual in the unit individual combination.
7. The method according to any one of claims 1 to 5, wherein the number of the unit individual combinations to be migrated includes plural; when the candidate server groups respectively corresponding to each unit individual in the current unit individual combination fail to be screened from the server groups except the server group to be migrated, a new unit individual combination is reselected, and the candidate server groups respectively corresponding to each unit individual in the new individual combination are screened from the server groups except the server group to be migrated.
8. A bandwidth traction device, the device comprising:
the system comprises a determining module, a determining module and a transferring module, wherein the determining module is used for determining a server group to be transferred, a first bandwidth amount used by each unit individual of the used bandwidth in the server group to be transferred, and a second bandwidth amount to be transferred of the server group to be transferred;
a selecting module, configured to select at least one unit from the unit individuals using the bandwidth in the to-be-migrated server group according to the first bandwidth amount and the second bandwidth amount, so as to form a unit individual combination to be migrated;
a screening module, configured to screen candidate server groups corresponding to each unit individual in the unit individual combination from server groups other than the server group to be migrated, and determine a redundant bandwidth amount of each candidate server group;
a building module, configured to build an integer programming model according to the candidate server group, the redundant bandwidth amount of the candidate server group, each unit individual in the unit individual combination, and the first bandwidth amount corresponding to each unit individual in the unit individual combination;
and the generating module is used for solving the integer programming model and generating the migration scheme of the unit individual combination.
9. An electronic device is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor and the communication interface are used for realizing mutual communication by the memory through the communication bus;
a memory for storing a computer program;
a processor for implementing the steps of the bandwidth pulling method of any one of claims 1 to 7 when executing a program stored in the memory.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the bandwidth pulling method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111608405.XA CN114448810B (en) | 2021-12-24 | 2021-12-24 | Bandwidth traction method and device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111608405.XA CN114448810B (en) | 2021-12-24 | 2021-12-24 | Bandwidth traction method and device and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114448810A true CN114448810A (en) | 2022-05-06 |
| CN114448810B CN114448810B (en) | 2024-07-05 |
Family
ID=81362968
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111608405.XA Active CN114448810B (en) | 2021-12-24 | 2021-12-24 | Bandwidth traction method and device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114448810B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115208766A (en) * | 2022-07-29 | 2022-10-18 | 天翼云科技有限公司 | CDN bandwidth scheduling method and related device |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001010082A2 (en) * | 1999-07-30 | 2001-02-08 | Accenture Llp | A system, method and article of manufacture for network performance modeling |
| US20120127857A1 (en) * | 2010-11-19 | 2012-05-24 | Cisco Technology, Inc. | Dynamic Queuing and Pinning to Improve Quality of Service on Uplinks in a Virtualized Environment |
| CN103078906A (en) * | 2012-12-26 | 2013-05-01 | 爱迪科特(北京)科技有限公司 | Document transparent moving method |
| US20130124674A1 (en) * | 2011-11-15 | 2013-05-16 | Hitachi, Ltd. | Computer system and data migration method |
| US20150007178A1 (en) * | 2013-06-28 | 2015-01-01 | Kabushiki Kaisha Toshiba | Virtual machines management apparatus, virtual machines management method, and computer readable storage medium |
| US20160088080A1 (en) * | 2014-09-23 | 2016-03-24 | Netapp, Inc. | Data migration preserving storage efficiency |
| CN105577834A (en) * | 2016-02-06 | 2016-05-11 | 清华大学 | Cloud data center two-level bandwidth allocation method and system with predictable performance |
| CN110262845A (en) * | 2019-04-30 | 2019-09-20 | 北京邮电大学 | The enabled distributed computing task discharging method of block chain and system |
| CN110413392A (en) * | 2019-07-25 | 2019-11-05 | 北京工业大学 | The method of single task migration strategy is formulated under a kind of mobile edge calculations scene |
| CN112737854A (en) * | 2020-12-30 | 2021-04-30 | 国网河南省电力公司信息通信公司 | Service chain migration method and device based on energy consumption and service quality |
-
2021
- 2021-12-24 CN CN202111608405.XA patent/CN114448810B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001010082A2 (en) * | 1999-07-30 | 2001-02-08 | Accenture Llp | A system, method and article of manufacture for network performance modeling |
| US20120127857A1 (en) * | 2010-11-19 | 2012-05-24 | Cisco Technology, Inc. | Dynamic Queuing and Pinning to Improve Quality of Service on Uplinks in a Virtualized Environment |
| US20130124674A1 (en) * | 2011-11-15 | 2013-05-16 | Hitachi, Ltd. | Computer system and data migration method |
| CN103078906A (en) * | 2012-12-26 | 2013-05-01 | 爱迪科特(北京)科技有限公司 | Document transparent moving method |
| US20150007178A1 (en) * | 2013-06-28 | 2015-01-01 | Kabushiki Kaisha Toshiba | Virtual machines management apparatus, virtual machines management method, and computer readable storage medium |
| US20160088080A1 (en) * | 2014-09-23 | 2016-03-24 | Netapp, Inc. | Data migration preserving storage efficiency |
| CN105577834A (en) * | 2016-02-06 | 2016-05-11 | 清华大学 | Cloud data center two-level bandwidth allocation method and system with predictable performance |
| CN110262845A (en) * | 2019-04-30 | 2019-09-20 | 北京邮电大学 | The enabled distributed computing task discharging method of block chain and system |
| CN110413392A (en) * | 2019-07-25 | 2019-11-05 | 北京工业大学 | The method of single task migration strategy is formulated under a kind of mobile edge calculations scene |
| CN112737854A (en) * | 2020-12-30 | 2021-04-30 | 国网河南省电力公司信息通信公司 | Service chain migration method and device based on energy consumption and service quality |
Non-Patent Citations (2)
| Title |
|---|
| LIUDONG ZUO;MICHELLE M.ZHU: "Minimize Cost of Data Transfers Using Bandwidth Reservation on FPVB Paths of Dynamic HPNs", 2020 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS, 30 March 2020 (2020-03-30) * |
| 李松远: "QoS感知的服务资源调度与优化研究", 中国优秀硕士学位论文数据库, 16 December 2021 (2021-12-16) * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115208766A (en) * | 2022-07-29 | 2022-10-18 | 天翼云科技有限公司 | CDN bandwidth scheduling method and related device |
| CN115208766B (en) * | 2022-07-29 | 2023-11-03 | 天翼云科技有限公司 | CDN bandwidth scheduling method and related device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114448810B (en) | 2024-07-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9633311B2 (en) | Decision tree learning | |
| CN109413175B (en) | Information processing method and device and electronic equipment | |
| CN109787915B (en) | Flow control method and device for network access, electronic equipment and storage medium | |
| US8825895B2 (en) | Access point capacity management | |
| CN112566196A (en) | Heterogeneous network access selection method based on smart power grid and related equipment | |
| CN107707378B (en) | A kind of CDN covering scheme generation method and device | |
| CN111752706B (en) | Resource allocation method, device and storage medium | |
| US20190236474A1 (en) | Load balancing for distributed processing of deterministically assigned data using statistical analysis of block data | |
| CN111369084A (en) | Resource quality scoring method in content network | |
| US11381635B2 (en) | Method of operating a server apparatus for delivering website content, server apparatus and device in communication with server apparatus | |
| CN114448810A (en) | Bandwidth traction method and device and electronic equipment | |
| CN107203623B (en) | Load balancing and adjusting method of web crawler system | |
| CN113222326A (en) | Method and device for evaluating maturity of scientific and technological resource service platform | |
| US7840695B2 (en) | Capacity management | |
| CN111598457A (en) | Method and device for determining quality of power wireless network | |
| CN108259532B (en) | Scheduling method and device of cloud resources | |
| CN107291860B (en) | Seed user determination method | |
| CN107123032A (en) | A kind of item recommendation method and device | |
| CN104992060A (en) | User age estimation method and apparatus | |
| CN109245948B (en) | Security-aware virtual network mapping method and device | |
| CN116976739A (en) | Cloud computing product demand priority ordering method and system | |
| CN106682441A (en) | Index weight quantification method and system based on analytic hierarchy process | |
| CN113194107B (en) | Internet-based regional characteristic addressing method and device | |
| Simhon et al. | On the impact of information disclosure on advance reservations: A game-theoretic view | |
| Marianov et al. | Optimal location of multi-server congestible facilities operating as M/E r/m/N queues |
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 |