CN114978915B

CN114978915B - CDN node bandwidth planning method and device, electronic equipment and storage medium

Info

Publication number: CN114978915B
Application number: CN202110213087.0A
Authority: CN
Inventors: 蔡爽
Original assignee: Beijing Kingsoft Cloud Network Technology Co Ltd
Current assignee: Beijing Kingsoft Cloud Network Technology Co Ltd
Priority date: 2021-02-24
Filing date: 2021-02-24
Publication date: 2024-01-19
Anticipated expiration: 2041-02-24
Also published as: CN114978915A

Abstract

The embodiment of the invention relates to a CDN node bandwidth planning method, a CDN node bandwidth planning device, electronic equipment and a storage medium, which comprise the following steps: performing iterative processing until a preset first iteration stop condition is met by the following steps: determining the first planning bandwidth of each flow charging node in the iteration at this time based on the first planning bandwidth of each flow charging node in the appointed CDN in the last iteration and a preset bandwidth adjustment algorithm; determining a second planning bandwidth of each 95 charging node current iteration based on the first planning bandwidth of each flow charging node current iteration; determining the total estimated net charge of the current iteration of the specified CDN network based on the first planning bandwidth of the current iteration of each flow charging node and the second planning bandwidth of the current iteration of each 95 charging node; and after the iteration is finished, determining the target planning bandwidth of each 95 charging node from the second planning bandwidth of each iteration of each 95 charging node according to the total estimated net charge of each iteration. Thus, the intelligent determination of the planned bandwidth of 95 nodes in the CDN network can be realized.

Description

CDN node bandwidth planning method and device, electronic equipment and storage medium

Technical Field

The embodiment of the invention relates to the technical field of Internet, in particular to a CDN node bandwidth planning method, a CDN node bandwidth planning device, electronic equipment and a storage medium.

Background

The CDN (Content Delivery Network ) is a distributed network at least comprising a central node server and edge node server clusters distributed in different areas, and the distributed network distributes user content to edge nodes (also called CDN nodes), so that the congestion condition of the Internet network can be effectively solved, and the response speed of a user to access a website and the usability of the website are improved.

When the used bandwidth of the CDN node exceeds the planned bandwidth, peak elimination processing is needed to be carried out on the CDN node, so that the used bandwidth of the CDN node does not exceed the planned bandwidth as much as possible. Currently, the CDN manufacturer sets the planning bandwidth of the CDN node by a manual operation manner, which requires operation and maintenance personnel to perform judgment, estimation and operation manually in combination with the existing experience.

However, the existing setting of the planning bandwidth of the CDN node by the manual operation requires a relatively large amount of labor cost, and extremely depends on experience and energy of operation and maintenance personnel, so that timeliness and accuracy of setting the planning bandwidth of the CDN node are difficult to be guaranteed, and in practical application, each operation and maintenance personnel only consider a local area in charge of the operation and maintenance personnel, and the CDN system is relatively complex and all parts are mutually affected, so that setting the planning bandwidth of the CDN node by the manual operation may cause a global overall result to be not ideal.

Disclosure of Invention

In view of this, in order to solve the above-mentioned technical problems that the planned bandwidth efficiency of the CDN node set by the manual operation manner is low and the accuracy cannot be guaranteed, the embodiments of the present invention provide a method, an apparatus, an electronic device, and a storage medium for planning the bandwidth of the CDN node.

In a first aspect, an embodiment of the present invention provides a CDN node bandwidth planning method, including:

performing iterative processing until a preset first iteration stop condition is met by the following steps:

determining a first planning bandwidth of each flow charging node in the iteration at this time based on a first planning bandwidth of each flow charging node in a specified CDN network, wherein the specified CDN network comprises a plurality of CDN nodes, and the CDN nodes at least comprise 95 charging nodes and flow charging nodes;

determining a second planning bandwidth of each 95 charging nodes in the specified CDN based on the first planning bandwidth of each flow charging node current iteration;

determining the total estimated net charge of the current iteration of the specified CDN network based on the first planning bandwidth of the current iteration of each flow charging node and the second planning bandwidth of the current iteration of each 95 charging node;

and after the iteration is finished, determining the target planning bandwidth of each 95 charging node from the second planning bandwidth of each iteration of each 95 charging node according to the total estimated net charge of each iteration of the specified CDN network.

In one possible implementation manner, the first planning bandwidth of the first iteration of each flow charging node is the uplink bandwidth of the flow charging node;

the determining the first planning bandwidth of the current iteration of each flow charging node based on the first planning bandwidth of the last iteration of each flow charging node in the specified CDN network includes:

and calculating the first planning bandwidth of the last iteration of the flow charging node by using a preset bandwidth adjustment algorithm aiming at each flow charging node to obtain the first planning bandwidth of the current iteration of the flow charging node.

In one possible embodiment, the first iteration stop condition includes:

the charging bandwidth of the flow charging node is smaller than the guaranteed bandwidth of the flow charging node; or,

the first planning bandwidth of the current iteration of the flow charging node is smaller than a set bandwidth threshold.

In one possible implementation, the CDN nodes further include packet port charging nodes, and the method further includes:

and determining the charging bandwidth of each flow charging node current iteration based on the first planning bandwidth of each flow charging node current iteration, the second planning bandwidth of each 95 charging node current iteration and the fixed planning bandwidth of each packet port charging node.

In one possible implementation manner, the determining, based on the first planned bandwidth of the current iteration of each flow charging node, the second planned bandwidth of the current iteration of each 95 charging nodes in the specified CDN network includes:

determining an initial second planning bandwidth of each 95 charging nodes in the specified CDN network according to the first planning bandwidth of each flow charging node current iteration; taking the initial second planning bandwidth of each 95 charging node current iteration as the current second planning bandwidth of each 95 charging node current iteration, and executing the following steps:

step a1, selecting N first 95 charging nodes from the 95 charging nodes, and selecting M second 95 charging nodes from the 95 charging nodes, wherein N and M are natural numbers larger than 1;

step a2, adjusting the current second planning bandwidth of the current iteration of the first 95 charging node based on a preset rule, and adjusting the current second planning bandwidth of the current iteration of the second 95 charging node;

step a3, determining whether the adjusted current second planning bandwidth of each 95 charging node is feasible or not based on the sum of the current first planning bandwidth of each current iteration of the flow charging node and the adjusted current second planning bandwidth of each 95 charging node;

Step a4, if yes, taking the adjusted current second planning bandwidth of the current iteration of each 95 charging node as a new current second planning bandwidth;

and a5, if not, maintaining the current second planning bandwidth of the current iteration of each 95 charging node before adjustment.

In one possible implementation manner, the determining, based on the first planned bandwidth of the current iteration of each flow charging node, the initial second planned bandwidth of the current iteration of each 95 charging nodes in the specified CDN network includes:

determining the sum of preset second planning bandwidths of the 95 charging nodes;

determining whether the preset second planning bandwidth of each 95 charging node is feasible or not based on the sum of the first planning bandwidth of each flow charging node current iteration and the preset second planning bandwidth;

if yes, determining the preset second planning bandwidth of each 95 charging node as the initial second planning bandwidth of each 95 charging node in the iteration;

if not, the preset second planning bandwidth of at least one 95 charging node is adjusted by using a preset bandwidth adjustment algorithm, and the initial second planning bandwidth of each 95 charging node in the current iteration is obtained.

In one possible implementation manner, the adjusting, by using a preset bandwidth adjustment algorithm, the preset second planned bandwidth of at least one of the 95 charging nodes to obtain an initial second planned bandwidth of the current iteration of each of the 95 charging nodes includes:

ordering the 95 charging nodes according to the order of low cost coefficients;

according to the sequence, taking the first 95 charging nodes which are not adjusted to the corresponding uplink bandwidths as current nodes;

determining a target bandwidth corresponding to the current node based on a preset second planning bandwidth and an uplink bandwidth of the current node;

adjusting the current second planning bandwidth of the current node to the target bandwidth;

determining whether the current second planning bandwidth of each 95 charging node is feasible or not based on the sum of the current first planning bandwidth of each 95 charging node and the current second planning bandwidth of each 95 charging node;

if yes, determining the current second planning bandwidth of each 95 charging node as the initial second planning bandwidth of each 95 charging node in the iteration, and ending the flow;

if not, re-determining the target bandwidth corresponding to the current node based on the uplink bandwidth of the current node and the current target bandwidth, and returning to execute the step of adjusting the current second planning bandwidth of the current node to the target bandwidth until the current second planning bandwidth of the current node is adjusted to the corresponding uplink bandwidth;

When the current second planning bandwidth of the current node is adjusted to the corresponding uplink bandwidth, determining whether the current second planning bandwidth of each 95 charging node is feasible or not based on the sum of the current first planning bandwidth of each flow charging node and the current second planning bandwidth of each 95 charging node;

if yes, ending the flow; and if not, returning to execute the step of taking the first 95 charging node which is not adjusted to the corresponding uplink bandwidth as the current node according to the sequence.

In one possible implementation manner, the selecting N first 95 charging nodes from the 95 charging nodes includes:

determining the ratio of the peak eliminating space corresponding to each 95 charging node to the cost coefficient;

the following steps are circularly executed until the execution times reach N:

and randomly selecting two 95 charging nodes from the 95 charging nodes, and determining the 95 charging node with the largest corresponding ratio of the two 95 charging nodes as the first 95 charging node.

In one possible implementation manner, the selecting M second 95 charging nodes from the 95 charging nodes includes:

determining the ratio of the cost coefficient corresponding to each 95 charging node to the peak elimination space;

The following steps are circularly executed until the execution times reach M:

and randomly selecting two 95 charging nodes from the 95 charging nodes, and determining the 95 charging node with the largest corresponding ratio of the two 95 charging nodes as the second 95 charging node.

In one possible implementation manner, the taking the adjusted current second planned bandwidth of the current iteration of each 95 charging node as a new current second planned bandwidth includes:

determining whether to update the current second planning bandwidth of the current iteration of each 95 charging node based on a simulated annealing algorithm;

and if so, taking the adjusted current second planning bandwidth of the current iteration of each 95 charging node as a new current second planning bandwidth.

In one possible embodiment, the method further comprises:

and circularly executing the steps a1 to a5 until the execution times reach a preset time threshold.

In one possible implementation manner, the determining the total estimated net charge of the specific CDN network current iteration based on the first planned bandwidth of each flow charging node current iteration and the second planned bandwidth of each 95 charging node current iteration includes:

determining the sum of second planning bandwidths of the current iteration of each 95 charging node and determining the sum of charging bandwidths of the current iteration of each flow charging node;

Multiplying the sum of the charging bandwidths with a preset flow charging unit cost to obtain a first estimated network charge of the flow charging node, and multiplying the sum of the second planning bandwidths with a preset 95 charging unit cost to obtain a second estimated network charge of the 95 charging node;

and determining the sum value of the first estimated net charge and the second estimated net charge as the total estimated net charge of the current iteration of the appointed CDN network.

In one possible implementation manner, the determining, according to the total estimated net charge of each iteration of the specified CDN network, the target planned bandwidth of each 95 charging node from the second planned bandwidth of each iteration of each 95 charging node includes:

determining a minimum value from the total estimated net charge of each iteration of the specified CDN;

and determining the second planning bandwidth of each 95 charging node in the iterative process corresponding to the minimum value as the target planning bandwidth of each 95 charging node.

In a second aspect, an embodiment of the present invention provides a CDN node bandwidth planning apparatus, including:

the first determining module is configured to determine a first planned bandwidth of each current iteration of the traffic charging nodes based on a first planned bandwidth of a last iteration of each traffic charging node in a specified CDN network, where the specified CDN network includes a plurality of CDN nodes, and the CDN nodes include at least 95 charging nodes and traffic charging nodes;

The second determining module is configured to determine a second planned bandwidth of the current iteration of each 95 charging node in the specified CDN network based on the first planned bandwidth of the current iteration of each flow charging node;

a third determining module, configured to determine a total estimated net charge of the current iteration of the specified CDN network based on the first planned bandwidth of the current iteration of each flow charging node and the second planned bandwidth of the current iteration of each 95 charging node;

a fourth determining module, configured to determine, according to the total estimated net charge of each iteration of the specified CDN network, a target planned bandwidth of each 95 charging node from the second planned bandwidths of each iteration of each 95 charging node;

and the iteration module is used for carrying out iteration processing by utilizing the first to fourth determination modules until a preset first iteration stop condition is met.

the first determining module is specifically configured to:

In one possible embodiment, the first iteration stop condition includes:

In one possible implementation manner, the CDN node further includes a packet port charging node, and the apparatus further includes:

and a fifth determining module, configured to determine a charging bandwidth of each current iteration of the flow charging node based on a first planning bandwidth of each current iteration of the flow charging node, a second planning bandwidth of each current iteration of the 95 charging nodes, and a fixed planning bandwidth of each packet port charging node.

In one possible implementation manner, the second determining module is specifically configured to:

In one possible embodiment, the second determining module includes:

a sum value determination submodule, configured to determine a sum of preset second planned bandwidths of the 95 charging nodes;

a first feasibility analysis sub-module, configured to determine whether a preset second planned bandwidth of each 95 charging node is feasible based on a sum of the first planned bandwidth and the preset second planned bandwidth of each current iteration of the traffic charging node;

A first determining submodule, configured to determine, if the preset second planned bandwidth of each 95 charging node is feasible, the preset second planned bandwidth of each 95 charging node as an initial second planned bandwidth of each 95 charging node in the current iteration;

and the first adjustment sub-module is used for adjusting the preset second planning bandwidth of at least one 95 charging node by using a preset bandwidth adjustment algorithm if the preset second planning bandwidth of each 95 charging node is not feasible, so as to obtain the initial second planning bandwidth of each 95 charging node in the current iteration.

In one possible embodiment, the second determining module includes:

the sequencing sub-module is used for sequencing the 95 charging nodes according to the sequence of the cost coefficients from low to high;

the second adjustment sub-module is used for taking the first 95 charging nodes which are not adjusted to the corresponding uplink bandwidths as current nodes according to the sequence; determining a target bandwidth corresponding to the current node based on a preset second planning bandwidth and an uplink bandwidth of the current node; adjusting the current second planning bandwidth of the current node to the target bandwidth;

a second feasibility analysis sub-module, configured to determine whether the current second planned bandwidth of each 95 charging node is feasible based on a sum of the current first planned bandwidth of each 95 charging node and the current first planned bandwidth of each current iteration of the traffic charging node;

A second determining sub-module, configured to determine, if the current second planned bandwidth of each 95 charging node is feasible, the current second planned bandwidth of each 95 charging node as the initial second planned bandwidth of each 95 charging node in the current iteration, and end the flow;

a third determining submodule, configured to, if the current second planned bandwidth of each 95 charging node is not feasible, redetermine a target bandwidth corresponding to the current node based on the uplink bandwidth of the current node and the current target bandwidth, and return to executing the step of adjusting the current second planned bandwidth of the current node to the target bandwidth performed by the second adjusting submodule until the current second planned bandwidth of the current node is adjusted to the corresponding uplink bandwidth;

a third feasibility analysis sub-module, configured to determine, when the current second planned bandwidth of the current node is adjusted to a corresponding uplink bandwidth, whether the current second planned bandwidth of each 95 charging node is feasible based on a sum of the current first planned bandwidth of each flow charging node and the current second planned bandwidth of each 95 charging node; if yes, ending the flow; and if not, returning to the step of executing the 95 charging nodes which are not regulated to the corresponding uplink bandwidth according to the sequence executed by the second regulation sub-module as the current node.

In one possible embodiment, the second determining module includes:

a first ratio determining submodule, configured to determine a ratio of a peak-canceling space corresponding to each of the 95 charging nodes to a cost coefficient;

the first circulation processing sub-module is used for circularly executing the following steps until the execution times reach N:

In one possible embodiment, the second determining module includes:

a second ratio determining submodule, configured to determine a ratio of a cost coefficient corresponding to each of the 95 charging nodes to a peak elimination space;

the second circulation processing sub-module is used for circularly executing the following steps until the execution times reach M:

In one possible embodiment, the second determining module includes:

a fourth determining submodule, configured to determine whether to update the current second planned bandwidth of the current iteration of each of the 95 charging nodes based on a simulated annealing algorithm;

And a fifth determining sub-module, configured to, if it is determined to update the current second planned bandwidth of the current iteration of each of the 95 charging nodes, take the adjusted current second planned bandwidth of the current iteration of each of the 95 charging nodes as a new current second planned bandwidth.

In one possible embodiment, the second determining module is further configured to:

In one possible implementation manner, the third determining module is specifically configured to:

determining the sum of second planning bandwidths of the current iteration of each 95 charging node and determining the sum of charging bandwidths of the current iteration of each flow charging node; multiplying the sum of the charging bandwidths with a preset flow charging unit cost to obtain a first estimated network charge of the flow charging node, and multiplying the sum of the second planning bandwidths with a preset 95 charging unit cost to obtain a second estimated network charge of the 95 charging node; and determining the sum value of the first estimated net charge and the second estimated net charge as the total estimated net charge of the current iteration of the appointed CDN network.

In one possible implementation manner, the fourth determining module is specifically configured to:

Determining a minimum value from the total estimated net charge of each iteration of the specified CDN; and determining the second planning bandwidth of each 95 charging node in the iterative process corresponding to the minimum value as the target planning bandwidth of each 95 charging node.

In a third aspect, an embodiment of the present invention provides an electronic device, including: the system comprises a processor and a memory, wherein the processor is used for executing a CDN node bandwidth planning program stored in the memory so as to realize the CDN node bandwidth planning method in any one of the first aspect.

In a fourth aspect, an embodiment of the present invention provides a storage medium, where the storage medium stores one or more programs, where the one or more programs are executable by one or more processors to implement the CDN node bandwidth planning method according to any one of the first aspects.

According to the technical scheme provided by the embodiment of the invention, iteration processing is performed by utilizing the following steps until a preset first iteration stop condition is met: determining the first planning bandwidth of each flow charging node in the iteration at this time based on the first planning bandwidth of each flow charging node in the appointed CDN in the last iteration and a preset bandwidth adjustment algorithm; determining a second planning bandwidth of each 95 charging node current iteration based on the first planning bandwidth of each flow charging node current iteration; determining the total estimated net charge of the current iteration of the specified CDN network based on the first planning bandwidth of the current iteration of each flow charging node and the second planning bandwidth of the current iteration of each 95 charging node; after the iteration is finished, determining the target planning bandwidth of each 95 charging node from the second planning bandwidth of each iteration of each 95 charging node according to the total estimated net charge of each iteration of the appointed CDN, and intelligently determining the planning bandwidth of the 95 nodes in the CDN can be realized, so that compared with the planning bandwidth of the CDN node set in the prior art in a manual operation mode, the labor cost can be saved, and the efficiency of bandwidth planning of the CDN network can be improved.

Furthermore, since the bandwidth planning is performed from the global view of the CDN network, compared with the prior art in which the operation and maintenance personnel consider the local area in charge of themselves, the accuracy of bandwidth planning for the CDN network can be improved, and the user requirements can be satisfied.

Still further, by determining the bandwidth usage rate of the flow charging node, planning the bandwidth of the 95 charging node on the premise of the bandwidth usage rate of the given flow node, and adjusting the bandwidth usage rate of the flow charging node for multiple times, the total network cost of the CDN network under the bandwidth usage rate of different flow nodes can be obtained, and then determining the final target planning bandwidth of each 95 charging node according to different total network cost, the planning of the bandwidth of each 95 charging node in combination with the network cost is realized, and further the target planning bandwidth under the optimal network cost can be obtained.

Drawings

Fig. 1 is a flowchart of an embodiment of a CDN node bandwidth planning method according to an embodiment of the present invention;

fig. 2 is a flowchart of an embodiment of another CDN network bandwidth planning method according to an embodiment of the present invention;

fig. 3 is a flowchart illustrating an implementation of step 201 according to an embodiment of the present invention;

FIG. 4 is a flowchart illustrating an implementation of step 304 according to an embodiment of the present invention;

fig. 5 is a block diagram of an embodiment of a CDN node bandwidth planning apparatus according to an embodiment of the present invention;

fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.

Detailed Description

For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.

The following describes the CDN node bandwidth planning method according to the present invention in a specific embodiment with reference to the accompanying drawings, and the embodiment does not limit the embodiment of the present invention.

Referring to fig. 1, a flowchart of an embodiment of a CDN node bandwidth planning method is provided in an embodiment of the present invention. As an embodiment, the method can be applied to a dispatching system, in practice, the dispatching system can be composed of a single or multiple pieces of electronic equipment, the method for planning and dispatching the bandwidth of the CDN node can be applied to achieve planning and dispatching of the CDN node, and all current network requests of the customer domain name can be guided to a proper target machine room through various mechanisms, so that flow control, quality control, cost control and fault handling are achieved. As shown in fig. 1, the process may include the steps of:

Step 101, determining a first planning bandwidth of the current iteration of each flow charging node based on the first planning bandwidth of the last iteration of each flow charging node in the specified CDN.

The specified CDN network refers to a CDN network to be bandwidth-planned. In application, the CDN network may include a plurality of CDN nodes, and further, according to different charging types, the CDN nodes may be divided into a packet port charging node, a traffic charging node, and a 95 charging node. In the embodiment of the invention, the CDN node comprising the three charging types is specified in the CDN network.

As an embodiment, for each flow charging node in the foregoing specified CDN network, the initial planned bandwidth of each flow charging node is set to be the uplink bandwidth, in other words, the planned bandwidth of each flow charging node for the first iteration (for convenience of description, hereinafter referred to as the first planned bandwidth) is the uplink bandwidth of the flow charging node.

As can be seen from the description in step 101, in the embodiment of the present invention, starting from the second iteration process, the first planned bandwidth of the current iteration of each flow charging node is determined based on the first planned bandwidth of the last iteration of each flow charging node and a preset bandwidth adjustment algorithm.

As an embodiment, determining the first planned bandwidth of the current iteration of each flow charging node based on the first planned bandwidth of the last iteration of each flow charging node and a preset bandwidth adjustment algorithm includes: and calculating the first planning bandwidth of the last iteration of the flow charging node by utilizing a preset bandwidth adjustment algorithm aiming at each flow charging node to obtain the first planning bandwidth of the current iteration of the flow charging node.

Wherein, as an alternative implementation manner, the bandwidth adjustment algorithm is as shown in the following formula (one):

B1 _i ＝B1 _i-1 * Alpha formula 1

In the above formula (one), B1 _i The first planning bandwidth of the ith iteration of the flow charging node is represented, i is more than or equal to 2, B1 _i-1 A first planning bandwidth representing the i-1 th iteration of the flow charging node, alpha represents an adjustment coefficient, and alpha<1, for example 0.9.

Therefore, in different iterative processes, the bandwidth utilization rate of each flow charging node is different, and the bandwidth utilization rate of each flow charging node is gradually adjusted down.

Step 102, judging whether a preset first iteration stop condition is met, if yes, executing step 105; if not, step 103 is performed.

As an embodiment, the first iteration stop condition includes: the charging bandwidth of the flow charging node is smaller than the guaranteed bandwidth of the flow charging node. It can be seen that, after the bandwidth adjustment algorithm illustrated in the formula (one) is used to calculate the first planned bandwidth of the last iteration of the flow charging node to obtain the first planned bandwidth of the current iteration, the charging bandwidth of the current iteration of each flow charging node can be determined based on the first planned bandwidth of the current iteration of each flow charging node, the second planned bandwidth of the current iteration of each 95 charging nodes, and the fixed planned bandwidth of each packet port charging node, if the obtained charging bandwidth is smaller than the guaranteed bandwidth, it means that the first planned bandwidth of the current iteration cannot meet the user requirement, so that the iteration is ended, and step 105 is executed; otherwise, if the obtained charging bandwidth is greater than or equal to the guaranteed bandwidth, it means that the first planning bandwidth of the current iteration can meet the user requirement, so step 103 is executed, and iteration is continued.

As another embodiment, the first iteration stop condition includes: the first planning bandwidth of the current iteration of the flow charging node is smaller than or equal to a set bandwidth threshold. Based on this, in the application, if the obtained first planned bandwidth of the current iteration of the flow charging node is smaller than the set bandwidth threshold, it means that the first planned bandwidth of the current iteration cannot meet the user requirement, so the iteration is ended, and step 105 is executed; if the obtained first planning bandwidth of the current iteration of the flow charging node is greater than or equal to the set bandwidth threshold, the first planning bandwidth of the current iteration can meet the user requirement, so step 103 is executed, and iteration is continued.

The following describes how to determine the charging bandwidth of each flow charging node in this iteration:

first, bandwidth data of one month in the future is predicted according to bandwidth data of one month in the history, and as an example, when bandwidth data of one month in the future is predicted, 30×24×12 predicted bandwidth data in total can be obtained at intervals of 5 minutes, wherein 30 is a default day of one month in the future, 24 represents 24 hours a day, and 12 represents 12 5 minutes a day.

Then, the bandwidth usage S of the flow charging node on the ith day of the next month is calculated by the following formula (one) in terms of days _i ：

In the above formula (one), b _j Represents the j-th predicted bandwidth data in one day, T represents the total planned bandwidth of all 95 charging nodes and packet port nodes, and T' represents the total planned bandwidth of all 95 charging nodes, packet port nodes, and traffic charging nodes.

Finally, the charging bandwidth of the current iteration of the flow charging node can be calculated through the following formula (II):

step 103, determining a second planning bandwidth of each 95 charging nodes in the specified CDN network according to the first planning bandwidth of each flow charging node.

As can be seen from the description in step 102, in each iteration process, on the premise of the bandwidth utilization of the given flowmeter Fei Jiedian, the planned bandwidth (hereinafter referred to as the second planned bandwidth for convenience of description) of this iteration of each 95 charging node in the specified CDN network is determined. Further, since the bandwidth utilization ratio of each flow charging node is different in different iteration processes, different second planning bandwidths can be obtained in different iteration processes.

As to how to determine the second planned bandwidth of the current iteration of each 95 charging node in the CDN network based on the first planned bandwidth of the current iteration of each traffic charging node in each iteration process, the description of the second planned bandwidth of the current iteration of each 95 charging node in the CDN network is described below by the flow shown in fig. 2, which is not described in detail herein.

Step 104, determining the total estimated net charge of the current iteration of the specified CDN network based on the first planning bandwidth of the current iteration of each flow charging node and the second planning bandwidth of the current iteration of each 95 charging node.

Firstly, since the network cost of the packet port charging node is not affected by the flow charging node and the 95 charging node and is a constant value, the total estimated network time of the specified CDN network is determined in each iteration process, and the network cost of the packet port charging node can be ignored, so that the calculation process can be simplified, and the execution result of step 105 is not affected.

Based on this, this step 104 can be implemented by the following procedure:

determining the sum of the second planning bandwidths of the current iteration of each 95 charging node and the sum of the charging bandwidths of the current iteration of each flow charging node; multiplying the sum of the charging bandwidths by a preset flow charging unit cost to obtain an estimated net charge of the flow charging node (hereinafter referred to as a first estimated net charge for convenience of description), multiplying the sum of the second planning bandwidths by a preset 95 charging unit cost to obtain an estimated net charge of the 95 charging node (hereinafter referred to as a second estimated net charge for convenience of description), and determining the sum of the first estimated net charge and the second estimated net charge as a total estimated net charge of the iteration of the specified CDN network.

The above process can be described as the following equation (two):

total estimated net charge = first estimated net charge + second estimated net charge;

first estimated net charge = sum of charging bandwidths of each flow charging node;

second estimated net charge = sum of second planning bandwidths of this iteration of each 95 charging nodes 95 charging unit cost. Formula II

Step 105, determining a target planning bandwidth of each 95 charging node from the second planning bandwidth of each iteration of each 95 charging node according to the total estimated net charge of each iteration of the specified CDN.

As one embodiment, a minimum value may be determined from the total estimated net charge of each iteration of the specified CDN network, and then the second planned bandwidth of each 95 charging node in the iteration process corresponding to the minimum value is determined as the target planned bandwidth of each 95 charging node. In application, the planned bandwidth of each 95 charging nodes in the CDN network may be set to a corresponding target planned bandwidth at the beginning of the month.

Referring to fig. 2, a flowchart of an embodiment of another CDN network bandwidth planning method provided by the embodiment of the present invention is shown, where the flowchart shown in fig. 2 describes how to determine, based on a first planned bandwidth of a current iteration of each flow charging node, a second planned bandwidth of a current iteration of each 95 charging nodes in a specified CDN network, and includes the following steps:

Step 201, determining an initial second planned bandwidth of each 95 charging nodes in the specified CDN network according to the first planned bandwidth of each current iteration of the flow charging nodes.

For a detailed description of this step 201, refer to the following description of the flow shown in fig. 3, which will not be described in detail here.

Step 202, taking the initial second planning bandwidth of the current iteration of each 95 charging node as the current second planning bandwidth of the current iteration of each 95 charging node, and executing the following steps:

step a1, selecting N first 95 charging nodes and M second 95 charging nodes from the 95 charging nodes.

Step a2, adjusting the current second planning bandwidth of the current iteration of the first 95 charging node based on a preset rule, and adjusting the current second planning bandwidth of the current iteration of the second 95 charging node.

The following will collectively explain the steps a1 and a 2:

first, N and M are natural numbers greater than 1 and are predetermined values.

As an embodiment, in application, when the cost of the 95 charging node is lower and the planning bandwidth is higher, the final total cost is smaller, and meanwhile, when the peak eliminating space of the 95 charging node is too large, peak eliminating is not easy to use, so that the 95 charging node with low cost and large peak eliminating space can be preferentially selected to increase the planning bandwidth, and the low cost and large peak eliminating space mean that the ratio of the peak eliminating space to the cost coefficient is larger.

Based on this, in step a1, N first 95 charging nodes may be selected from the 95 charging nodes by: and determining the ratio of the peak eliminating space corresponding to each 95 charging node to the cost coefficient, in the process of selecting the first 95 charging node each time, firstly randomly selecting two 95 charging nodes from the 95 charging nodes, and then determining the 95 charging node with the largest corresponding ratio of the two 95 charging nodes as the first 95 charging node until N first 95 charging nodes are selected.

Further, in step a2, adjusting the current second planned bandwidth of the current iteration of the first 95 charging node based on the preset rule includes: and lifting the current second planning bandwidth of the current iteration of the first 95 charging node by a set bandwidth, such as 1G.

Similarly, in the application, when the cost of the 95 charging node is higher and the planning bandwidth is lower, the final total cost is smaller, and meanwhile, when the peak eliminating space of the 95 charging node is too small, peak eliminating is not easy to use, so that the 95 charging node with high cost and smaller peak eliminating space can be preferentially selected to reduce the planning bandwidth, and the high cost and small peak eliminating space mean that the ratio of the cost coefficient to the peak eliminating space is larger.

Based on this, in step a1, M second 95 charging nodes may be selected from the 95 charging nodes by: and determining the ratio of the cost coefficient corresponding to each 95 charging node to the peak elimination space, in the process of selecting the first 95 charging node each time, firstly randomly selecting two 95 charging nodes from the 95 charging nodes, and then determining the 95 charging node with the largest corresponding ratio of the two 95 charging nodes as the second 95 charging node until M first 95 charging nodes are selected.

Further, in step a2, adjusting the current second planned bandwidth of the current iteration of the second 95 charging node based on the preset rule includes: the current second planned bandwidth of the current iteration of the second 95 charging node is reduced by a set bandwidth, such as 1G.

It should be noted that the above two set bandwidths are merely examples, and in application, the above two set bandwidths may be the same or different, which is not limited by the present invention.

Step a3, determining whether the adjusted current second planning bandwidth of each 95 charging node is feasible or not based on the sum of the current iteration first planning bandwidth of each flow charging node and the adjusted current second planning bandwidth of each 95 charging node, and if so, executing step a4; if not, step a5 is performed.

As an embodiment, the consumption scheduling may be performed based on the sum of the first planned bandwidth of the current iteration of each flow charging node and the adjusted current second planned bandwidth of each 95 charging node, if a feasible scheduling plan can be obtained, this means that the adjusted current second planned bandwidth of each 95 charging node is feasible, otherwise, if a feasible scheduling plan cannot be obtained, this means that the adjusted current second planned bandwidth of each 95 charging node is not feasible.

Further, in the step a3, if a result that the adjusted current second planning bandwidth of each 95 charging node is feasible is obtained, it means that the current second planning bandwidth is adopted for each 95 charging node to meet the user requirement, so the step a4 can be executed; otherwise, step a5 is performed.

Step a4, taking the adjusted current second planning bandwidth of each 95 charging node in the current iteration as a new current second planning bandwidth; step 203 is performed.

As an embodiment, the adjusted current second planning bandwidth of the current iteration of each 95 charging node may be directly used as the new current second planning bandwidth.

As another embodiment, it may be determined whether to update the current second planned bandwidth of the current iteration of each 95 charging node based on the simulated annealing algorithm, and if so, the adjusted current second planned bandwidth of the current iteration of each 95 charging node is used as the new current second planned bandwidth. This process avoids trapping in the locally optimal solution.

Step a5, maintaining the current second planning bandwidth of the current iteration of each 95 charging nodes before adjustment.

Step 203, judging whether the execution times of the steps a1 to a5 reach a preset time threshold, if so, ending the flow; if not, returning to the execution of the step a1.

As can be seen from the description in step 203, in the embodiment of the present invention, the optimal second planning bandwidth is obtained by solving multiple times.

The flow shown in fig. 3 is described below:

referring to fig. 3, a process for implementing step 201 is provided in an embodiment of the present invention. As shown in fig. 3, the process may include the steps of:

step 301, determining a sum of preset second planning bandwidths of all 95 charging nodes.

As an embodiment, the preset second planned bandwidth is a guaranteed bandwidth.

Step 302, determining whether the preset second planning bandwidth of each 95 charging node is feasible or not based on the sum of the first planning bandwidth and the preset second planning bandwidth of each flow charging node in the current iteration; if so, then step 303 is performed; if not, step 304 is performed.

Step 303, determining the preset second planning bandwidth of each 95 charging node as the initial second planning bandwidth of each 95 charging node in the current iteration.

And 304, adjusting the preset second planning bandwidth of at least one 95 charging node by using a preset bandwidth adjustment algorithm to obtain the initial second planning bandwidth of each 95 charging node in the current iteration.

As an embodiment, referring to fig. 4, a process for implementing step 304 is provided in an embodiment of the present invention. As shown in fig. 4, the process may include the steps of:

step 401, sorting the 95 charging nodes according to the order of the cost coefficients from low to high.

Step 402, taking the first 95 charging nodes which are not adjusted to the corresponding uplink bandwidth as the current nodes according to the sequence.

Step 403, the current second planning bandwidth of the current node is adjusted to the uplink bandwidth.

Step 404, determining whether the current second planning bandwidth of each 95 charging node is feasible or not based on the sum of the current first planning bandwidth of each flow charging node and the current second planning bandwidth of each 95 charging node; if yes, go to step 405; if not, step 407 is performed.

Step 405, determining a target bandwidth corresponding to the current node based on the guaranteed bandwidth of the current node and the current second planning bandwidth.

Step 406, adjusting the current second planning bandwidth of the current node to the target bandwidth; execution returns to step 404.

Step 407, judging whether the second planning bandwidth of the current node is the uplink bandwidth, if yes, returning to execute step 402; if not, step 408 is performed.

Step 408, the second planning bandwidth of the current node is restored to the previous second planning bandwidth.

The following collectively describes steps 401 to 408:

first, in the initial case, the first 95 charging node that is not adjusted to the corresponding uplink bandwidth is the 95 charging node with the lowest cost coefficient, so when step 402 is executed for the first time, the first 95 charging node in the ordering result is used as the current node. Next, as described in step 403, the second planned bandwidth of the current node is adjusted from the preset second planned bandwidth to the uplink bandwidth. Then, as described in step 404, based on the sum of the first planned bandwidth of the current iteration of each flow charging node and the current second planned bandwidth of each 95 charging node, it is determined whether the current second planned bandwidth of each 95 charging node, that is, the second planned bandwidth is set to be feasible, and as can be known from the description in step 404, if feasible, the second planned bandwidth of the current node is continuously adjusted instead of directly adopting the uplink bandwidth.

Specifically, in step 405, an average value of the guaranteed bandwidth of the current node and the current second planned bandwidth, that is, the uplink bandwidth, is determined, and the average value is determined as the target bandwidth corresponding to the current node, further, in step 406, the current second planned bandwidth of the current node is adjusted to the target bandwidth, and step 404 is executed back.

If step 404 is performed again to obtain a result that the current second planning bandwidth of each 95 charging node is feasible, step 405 is performed continuously until step 404 is performed again to obtain a result that the current second planning bandwidth of each 95 charging node is not feasible, step 405 is not performed continuously, and step 407 is performed.

In step 407, it is determined whether the second planned bandwidth of the current node is the uplink bandwidth, if yes, it means that the second planned bandwidth of the current node is set to be the uplink bandwidth and still cannot meet the user requirement, at this time, step 402 is executed again, and when step 402 is executed for the second time, 95 charging nodes ranked at the second position in the ranking result are used as the current node, and the flow shown in fig. 4 is continuously executed; if not, the second planning bandwidth of the current node is set to be the current target bandwidth, and the second planning bandwidth of the current node is set to be the previous target bandwidth, so that the second planning bandwidth of the current node can be restored to the previous second planning bandwidth.

So far, the initial second planning bandwidth of each 95 charging nodes in the current iteration is obtained.

By the flow shown in fig. 3, the initial second planning bandwidth of the current iteration of each 95 charging node is obtained.

Referring to fig. 5, a block diagram of an embodiment of a CDN node bandwidth planning apparatus according to an embodiment of the present invention is provided.

As shown in fig. 5, the apparatus includes:

the first determining module 51 is configured to determine a first planned bandwidth of each current iteration of the traffic charging nodes based on a first planned bandwidth of a last iteration of each traffic charging node in a specified CDN network, where the specified CDN network includes a plurality of CDN nodes, and the CDN nodes include at least 95 charging nodes and traffic charging nodes;

a second determining module 52, configured to determine a second planned bandwidth of each 95 charging nodes in the specified CDN network according to the first planned bandwidth of each current iteration of the traffic charging nodes;

a third determining module 53, configured to determine a total estimated net charge of the current iteration of the specified CDN network based on the first planned bandwidth of the current iteration of each of the traffic charging nodes and the second planned bandwidth of the current iteration of each of the 95 charging nodes;

a fourth determining module 54, configured to determine, according to the total estimated net charge of each iteration of the specified CDN network, a target planned bandwidth of each 95 charging node from the second planned bandwidths of each iteration of each 95 charging node;

The iteration module 55 is configured to perform an iteration process by using the first determining module 51 to the fourth determining module 54 until a preset first iteration stop condition is satisfied.

the first determining module 51 is specifically configured to:

In one possible embodiment, the first iteration stop condition includes:

In a possible implementation manner, the CDN nodes further include a packet port charging node, and the apparatus further includes (not shown in the figure):

In one possible implementation, the second determining module 52 is specifically configured to:

In one possible implementation, the second determining module 52 includes (not shown in the figure):

In one possible implementation, the second determining module 52 is further configured to:

In one possible implementation manner, the third determining module 53 is specifically configured to:

In one possible implementation, the fourth determining module 54 is specifically configured to:

Fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present invention, and an electronic device 600 shown in fig. 6 includes: at least one processor 601, memory 602, at least one network interface 604, and other user interfaces 603. The various components in the electronic device 600 are coupled together by a bus system 605. It is understood that the bus system 605 is used to enable connected communications between these components. The bus system 605 includes a power bus, a control bus, and a status signal bus in addition to a data bus. But for clarity of illustration the various buses are labeled as bus system 605 in fig. 6.

The user interface 603 may include, among other things, a display, a keyboard, or a pointing device (e.g., a mouse, a trackball, a touch pad, or a touch screen, etc.).

It is to be appreciated that the memory 602 in embodiments of the invention may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The non-volatile memory may be a Read-only memory (ROM), a programmable Read-only memory (ProgrammableROM, PROM), an erasable programmable Read-only memory (ErasablePROM, EPROM), an electrically erasable programmable Read-only memory (ElectricallyEPROM, EEPROM), or a flash memory, among others. The volatile memory may be a random access memory (RandomAccessMemory, RAM) that acts as an external cache. By way of example, and not limitation, many forms of RAM are available, such as Static RAM (SRAM), dynamic random access memory (DynamicRAM, DRAM), synchronous dynamic random access memory (SynchronousDRAM, SDRAM), double data rate synchronous dynamic random access memory (ddr SDRAM), enhanced Synchronous Dynamic Random Access Memory (ESDRAM), synchronous link dynamic random access memory (SynchlinkDRAM, SLDRAM), and direct memory bus random access memory (DirectRambusRAM, DRRAM). The memory 602 described herein is intended to comprise, without being limited to, these and any other suitable types of memory.

In some implementations, the memory 602 stores the following elements, executable units or data structures, or a subset thereof, or an extended set thereof: an operating system 6021 and application programs 6022.

The operating system 6021 includes various system programs, such as a framework layer, a core library layer, a driver layer, and the like, for implementing various basic services and processing hardware-based tasks. The application 6022 includes various application programs such as a media player (MediaPlayer), a Browser (Browser), and the like for realizing various application services. The program for implementing the method of the embodiment of the present invention may be included in the application 6022.

In the embodiment of the present invention, the processor 601 is configured to execute the method steps provided by the method embodiments by calling a program or an instruction stored in the memory 602, specifically, a program or an instruction stored in the application 6022, for example, including:

determining a first planning bandwidth of each flow charging node in the iteration at this time based on a first planning bandwidth of each flow charging node in a specified CDN network and a preset bandwidth adjustment algorithm, wherein the specified CDN network comprises a plurality of CDN nodes, and the CDN nodes at least comprise 95 charging nodes and flow charging nodes;

and after the iteration is finished, charging from each 95 according to the total estimated net charge of each iteration of the appointed CDN.

The method disclosed in the above embodiment of the present invention may be applied to the processor 601 or implemented by the processor 601. The processor 601 may be an integrated circuit chip with signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in the processor 601 or instructions in the form of software. The processor 601 may be a general purpose processor, a digital signal processor (DigitalSignalProcessor, DSP), an application specific integrated circuit (application specific IntegratedCircuit, ASIC), an off-the-shelf programmable gate array (FieldProgrammableGateArray, FPGA) or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component. The disclosed methods, steps, and logic blocks in the embodiments of the present invention may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present invention may be embodied directly in the execution of a hardware decoding processor, or in the execution of a combination of hardware and software elements in a decoding processor. The software elements may be located in a random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in a memory 602, and the processor 601 reads information in the memory 602 and performs the steps of the above method in combination with its hardware.

It is to be understood that the embodiments described herein may be implemented in hardware, software, firmware, middleware, microcode, or a combination thereof. For a hardware implementation, the processing units may be implemented within one or more application specific integrated circuits (ApplicationSpecificIntegratedCircuits, ASIC), digital signal processors (DigitalSignalProcessing, DSP), digital signal processing devices (dspev), programmable logic devices (ProgrammableLogicDevice, PLD), field programmable gate arrays (Field-ProgrammableGateArray, FPGA), general purpose processors, controllers, micro-controllers, microprocessors, other electronic units configured to perform the functions described herein, or a combination thereof.

For a software implementation, the techniques described herein may be implemented by means of units that perform the functions described herein. The software codes may be stored in a memory and executed by a processor. The memory may be implemented within the processor or external to the processor.

The electronic device provided in this embodiment may be an electronic device as shown in fig. 6, and may perform all steps of the CDN node bandwidth planning method shown in fig. 1 to 4, so as to achieve the technical effects of the CDN node bandwidth planning method shown in fig. 1 to 4, and specific reference is made to the related description of fig. 1 to 4, which is not repeated herein for brevity.

The embodiment of the invention also provides a storage medium (computer readable storage medium). The storage medium here stores one or more programs. Wherein the storage medium may comprise volatile memory, such as random access memory; the memory may also include non-volatile memory, such as read-only memory, flash memory, hard disk, or solid state disk; the memory may also comprise a combination of the above types of memories.

When one or more programs in the storage medium are executable by one or more processors, the CDN node bandwidth planning method executed on the electronic device side is implemented.

The processor is configured to execute a CDN node bandwidth planning program stored in the memory, so as to implement the following steps of a CDN node bandwidth planning method executed on the electronic device side:

Those of skill would further appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative elements and steps are described above generally in terms of function in order to clearly illustrate the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.

The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied in hardware, in a software module executed by a processor, or in a combination of the two. The software modules may be disposed in Random Access Memory (RAM), memory, read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.

The foregoing description of the embodiments has been provided for the purpose of illustrating the general principles of the invention, and is not meant to limit the scope of the invention, but to limit the invention to the particular embodiments, and any modifications, equivalents, improvements, etc. that fall within the spirit and principles of the invention are intended to be included within the scope of the invention.

Claims

1. The CDN node bandwidth planning method is characterized by comprising the following steps of:

Determining a second planning bandwidth of each 95 charging node current iteration in the specified CDN based on the first planning bandwidth of each flow charging node current iteration, wherein a feasible scheduling plan can be obtained by performing consumption scheduling based on the sum of the first planning bandwidth of each flow charging node current iteration and the second planning bandwidth of each 95 charging node current iteration;

2. The method of claim 1, wherein the first planned bandwidth of each of the first iterations of the flow charging nodes is an upstream bandwidth of the flow charging node;

3. The method of claim 1, wherein the first iteration stop condition comprises:

4. The method of claim 3, wherein the CDN nodes further comprise packet port billing nodes, the method further comprising:

5. The method of claim 1, wherein determining the second planned bandwidth for each 95 charging nodes present iteration in the specified CDN network based on the first planned bandwidth for each of the traffic charging nodes present iteration comprises:

Determining an initial second planning bandwidth of each 95 charging nodes in the specified CDN network according to the first planning bandwidth of each flow charging node current iteration;

taking the initial second planning bandwidth of each 95 charging node current iteration as the current second planning bandwidth of each 95 charging node current iteration, and executing the following steps:

6. The method of claim 5, wherein determining an initial second planned bandwidth for each 95 charging node present iteration in the specified CDN network based on the first planned bandwidth for each of the traffic charging nodes present iteration comprises:

7. The method of claim 6, wherein adjusting the preset second planned bandwidth of at least one of the 95 charging nodes using a preset bandwidth adjustment algorithm results in an initial second planned bandwidth of each of the 95 charging nodes in the current iteration, comprising:

Ordering the 95 charging nodes according to the order of low cost coefficients;

if yes, ending the flow;

and if not, returning to execute the step of taking the first 95 charging node which is not adjusted to the corresponding uplink bandwidth as the current node according to the sequence.

8. The method of claim 5, wherein said selecting N first 95 charging nodes from among the 95 charging nodes comprises:

the following steps are circularly executed until the execution times reach N:

9. The method of claim 5, wherein selecting M second 95 charging nodes from among the 95 charging nodes comprises:

the following steps are circularly executed until the execution times reach M:

10. The method of claim 5, wherein said taking the adjusted current second planned bandwidth of the current iteration of each of the 95 charging nodes as the new current second planned bandwidth comprises:

11. The method as recited in claim 5, further comprising:

12. The method of claim 4, wherein the determining the total estimated net charge for the given CDN network current iteration based on the first planned bandwidth for each of the traffic charging nodes current iteration and the second planned bandwidth for each of the 95 charging nodes current iteration comprises:

13. The method of claim 1, wherein said determining the target planned bandwidth for each of the 95 billing nodes from the second planned bandwidth for each iteration for each of the 95 billing nodes based on the total estimated net charge for each iteration of the given CDN network comprises:

14. A CDN node bandwidth planning apparatus, comprising:

the second determining module is configured to determine a second planned bandwidth of each 95 charging nodes in the specified CDN network according to the first planned bandwidth of each current iteration of the traffic charging nodes, where the consumption scheduling is performed according to a sum of the first planned bandwidth of each current iteration of the traffic charging nodes and the second planned bandwidth of each 95 charging nodes, so as to obtain a feasible scheduling plan;

15. An electronic device, comprising: a processor and a memory, the processor being configured to execute the CDN node bandwidth planning program stored in the memory, to implement the CDN node bandwidth planning method of any one of claims 1 to 13.

16. A storage medium storing one or more programs executable by one or more processors to implement the CDN node bandwidth planning method of any one of claims 1 to 13.