CDN coverage resource dynamic adjustment method and apparatus, and electronic device

By automatically sorting and selecting coverage information, the time-consuming and labor-intensive problem of manual bandwidth planning in the prior art is solved, and rapid and optimized bandwidth adjustment and cost control are achieved.

WO2024244409A1PCT designated stage expired Publication Date: 2024-12-05CHINA TELECOM CLOUD TECH CO LTD

Patent Information

Application Number
PCT/CN2023/139659
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-05-29
Filing Date
2023-12-18
Publication Date
2024-12-05

AI Technical Summary

Technical Problem

When optimizing bandwidth costs, existing CDNs need to manually plan the node bandwidth, which makes it time-consuming and labor-intensive and unable to achieve optimal resource scheduling, cost control is not fast enough, and resource coverage and scheduling strategies are complex and cannot be effectively adjusted.

Method used

By determining the coverage information and decreasing bandwidth of the node to be reduced, dividing the reduction bandwidth range and setting the judgment priority, automatically sorting and selecting the coverage information to reduce the amount until the accumulated reduction bandwidth meets the target reduction bandwidth, realizing the node bandwidth to achieve the node bandwidth Quick adjustments.

Benefits of technology

On the premise of ensuring quality, automatically and quickly adjust coverage, optimize node bandwidth, save operating time and energy, achieve cost optimization, and avoid quality problems or cost increase in other nodes.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2023139659_05122024_PF_FP_ABST
    Figure CN2023139659_05122024_PF_FP_ABST
Patent Text Reader

Abstract

Disclosed in the present invention are a CDN coverage resource dynamic adjustment method and apparatus, and an electronic device. The method comprises: determining each piece of coverage information corresponding to a node to be subjected to reduction at the current moment, and determining each reducible bandwidth corresponding to each piece of coverage information; determining a target reduction bandwidth of said node, setting at least two reduction bandwidth ranges on the basis of the target reduction bandwidth, and setting a determination priority of each reduction bandwidth range; and sorting the reducible bandwidths according to the determination priorities, and according to a sorting order, sequentially selecting the coverage information for reduction until a cumulative reduction bandwidth of said node satisfies the target reduction bandwidth. By means of the present invention, the optimal coverage planning is performed on an overall perspective, such that the time and effort for operation are greatly saved on, moreover, rapid reduction is performed on a node bandwidth, thereby achieving the aim of cost optimization.
Need to check novelty before this filing date? Find Prior Art

Description

Method, device and electronic device for dynamically adjusting CDN coverage resources Technical Field

[0001] The present application relates to the field of wireless communication technology, and in particular to a method, device and electronic device for dynamically adjusting CDN coverage resources. Background Art

[0002] Content Delivery Network (CDN) is a new type of network content service system built on IP network, which provides content distribution and services based on the efficiency requirements, quality requirements and content order of content access and application.

[0003] A node is the smallest unit of bandwidth billing between CDN vendors and carriers. CDN costs include data center operating costs and bandwidth costs, with bandwidth costs accounting for a significant portion.

[0004] Currently, optimizing bandwidth costs while ensuring node service quality requires manual planning of existing resources based on node bandwidth usage and customer resource requirements, or temporary adjustments through the scheduling system. This requires high manual planning requirements and is time-consuming and labor-intensive. Triggering temporary adjustments in the scheduling system can lead to certain bandwidth fluctuations. Furthermore, resource coverage and scheduling strategies are complex and subject to frequent changes, making it impossible to provide an optimal solution for overall resources and inefficient cost control.

[0005] Summary of the Invention

[0006] In order to solve the above problems, embodiments of the present application provide a method, device and electronic device for dynamically adjusting CDN coverage resources.

[0007] In a first aspect, an embodiment of the present application provides a method for dynamically adjusting CDN coverage resources, the method comprising:

[0008] Determine each coverage information corresponding to the node to be reduced at the current moment, and determine each bandwidth that can be reduced corresponding to each coverage information, wherein the coverage information includes at least one IP information;

[0009] Determining a target bandwidth reduction for the node to be reduced, dividing the bandwidth reduction range into at least two bandwidth reduction ranges based on a maximum bandwidth range corresponding to the target bandwidth reduction, and setting a judgment priority for each bandwidth reduction range, such that a bandwidth reduction range closer to the target bandwidth reduction has a higher judgment priority, and that, among the bandwidth reduction ranges at the same distance from the target bandwidth reduction, a bandwidth reduction range with a higher maximum value has a higher judgment priority;

[0010] The bandwidths that can be reduced are sorted according to the judgment priority, and the coverage information is selected in sequence for reduction in the sorted order until the cumulative bandwidth reduction of the node to be reduced meets the target bandwidth reduction.

[0011] In a second aspect, an embodiment of the present application provides a device for dynamically adjusting CDN coverage resources, the device comprising:

[0012] A determination module is used to determine the coverage information corresponding to the node to be reduced at the current moment, and determine the bandwidth that can be reduced corresponding to the coverage information, wherein the coverage information is IP information;

[0013] a setting module, configured to determine a target bandwidth reduction of the node to be reduced, divide the bandwidth reduction range into at least two bandwidth reduction ranges based on a maximum bandwidth range corresponding to the target bandwidth reduction, and set a judgment priority for each bandwidth reduction range, so that a bandwidth reduction range closer to the target bandwidth reduction has a higher judgment priority, and, among the bandwidth reduction ranges at the same distance from the target bandwidth reduction, a bandwidth reduction range with a higher maximum value has a higher judgment priority;

[0014] The sorting module is configured to sort the bandwidths that can be reduced according to the judgment priority, and sequentially select the coverage information for reduction in the sorted order until the accumulated bandwidth reduction of the nodes to be reduced meets the target bandwidth reduction.

[0015] In a third aspect, an embodiment of the present application provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and runnable on the processor, wherein when the processor executes the computer program, the steps of the method provided in the first aspect or any possible implementation of the first aspect are implemented.

[0016] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method provided in the first aspect or any possible implementation of the first aspect.

[0017] The beneficial effects of the present invention are: when the node is reduced in volume, the coverage can be automatically and quickly adjusted under the premise of ensuring quality. At the same time, the process of taking over the bandwidth of the node to be reduced is not likely to cause quality problems or cost increases in other nodes. From an overall perspective, the optimal coverage planning is carried out, which greatly saves operation time and energy, and at the same time quickly reduces the node bandwidth, achieving the purpose of cost optimization. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following briefly introduces the drawings required for use in the embodiments. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0019] FIG1 is a flow chart of a method for dynamically adjusting CDN coverage resources provided in an embodiment of the present application;

[0020] FIG2 is a schematic structural diagram of a device for dynamically adjusting CDN coverage resources provided in an embodiment of the present application;

[0021] FIG3 is a schematic structural diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0022] The technical solutions in the embodiments of the present application will be described clearly and completely below in conjunction with the drawings in the embodiments of the present application.

[0023] In the following description, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance. The following description provides multiple embodiments of the present application. Different embodiments can be replaced or combined, so this application can also be considered to include all possible combinations of the same and / or different embodiments described. Therefore, if one embodiment includes features A, B, and C, and another embodiment includes features B and D, then this application should also be considered to include embodiments containing one or more of all other possible combinations of A, B, C, and D, even though such embodiments may not be explicitly described in the following text.

[0024] The following description provides examples and does not limit the scope, applicability, or examples set forth in the claims. Changes may be made to the function and arrangement of the elements described without departing from the scope of the present application. Various examples may appropriately omit, replace, or add various processes or components. For example, the described method may be performed in an order different from the order described, and various steps may be added, omitted, or combined. In addition, features described in some examples may be combined in other examples.

[0025] Referring to Figure 1, Figure 1 is a flow chart of a method for dynamically adjusting CDN coverage resources provided in an embodiment of the present application. In an embodiment of the present application, the method includes:

[0026] S101: Determine each piece of coverage information corresponding to a node to be reduced in capacity at a current moment, and determine each piece of reduced bandwidth corresponding to each piece of coverage information, wherein the coverage information includes at least one piece of IP information.

[0027] The execution entity of this application can be a cloud server.

[0028] In one embodiment of the present application, the nodes to be derated that need to be derated at the current moment are manually determined based on the node bandwidth usage and customer resource requirements. A node may correspond to multiple coverage information, and a coverage information may also correspond to multiple nodes, and each node may have one or more IPs. After determining the coverage information corresponding to the node to be derated, the derated bandwidth of each coverage information will be determined, and the derated bandwidth of each coverage information can be directly determined from the coverage information. The coverage information may be user information represented in the form of resolution group-region, and the coverage information may include at least one IP information represented in the form of resolution group-region-host group-IP. Among them, the resolution group is a set of domain names that require similar acceleration services; the region is the user's geographical location plus the operator-granularity planning; the host group is a cluster of several machines in the node computer room; and the IP is the external service IP.

[0029] For example, assuming that the node to be reduced in volume is node A, node A can correspond to coverage A and coverage B. Coverage A is Byte Beijing, and coverage B is Douyin Shanghai. In addition to node A, coverage A can also have node B and node C. Each node can have at least one IP information, and the same applies to coverage B.

[0030] S102. Determine a target bandwidth reduction for the node to be reduced, divide the bandwidth reduction range into at least two bandwidth reduction ranges based on a maximum bandwidth range corresponding to the target bandwidth reduction, and set a judgment priority for each bandwidth reduction range, so that a bandwidth reduction range closer to the target bandwidth reduction has a higher judgment priority, and among the bandwidth reduction ranges at the same distance from the target bandwidth reduction, a bandwidth reduction range with a higher maximum value has a higher judgment priority.

[0031] In one embodiment of the present application, when a node is set as a node to be reduced in size according to the corresponding customer resource demand, a target reduction bandwidth will be manually set for it according to the actual situation, that is, the bandwidth of the node is expected to be reduced. For example, the bandwidth of the node is 2500M, and after it is reduced by 1000M, its bandwidth is 1500M, of which 1000M is the target reduction bandwidth. When setting the target reduction bandwidth of each node to be reduced, the maximum bandwidth range corresponding to the target reduction bandwidth will also be manually set according to the actual bandwidth variability of the node to be reduced. Next, the present application will adopt the method of closest segment sorting to divide multiple reduction bandwidth ranges according to the target reduction bandwidth and the maximum bandwidth range, and set a judgment priority for each reduction bandwidth range, so that in the subsequent steps, the corresponding coverage information can be selected for reduction processing according to the level of judgment priority. To quickly optimize coverage planning for nodes, bandwidth reduction ranges closer to the target bandwidth are prioritized. This minimizes complex scheduling decisions and improves scheduling efficiency. Prioritizing bandwidth reduction ranges closer to the target bandwidth also reduces bandwidth fluctuations, avoids quality issues, and achieves optimal coverage planning overall. Furthermore, to ensure that bandwidth reduction is completed in the fewest possible times, bandwidth reduction ranges with higher maximum values ​​within the same distance from the target bandwidth are prioritized.

[0032] For example, assuming that the target bandwidth reduction is x, the maximum bandwidth range is (min, max), and there are four bandwidth reduction ranges, the order of priority from high to low can be: [x, (1+0.2)x], [(1-0.2)x, x), ((1+0.2)x, max), (min, (1-0.2)x), where 0.2 is the range parameter selected when setting the bandwidth reduction range size, and its specific value can be adjusted according to actual conditions. [x, (1+0.2)x] and [(1-0.2)x, x) are the same distance from x, so [x, (1+0.2)x] with a higher maximum value has a higher priority. Furthermore, if x is 1000M and the maximum bandwidth range is (0, 2500), the corresponding four ranges are: [1000, 1200], [800, 1000], (1200, 2500), and (0, 800). In the process of dividing the maximum bandwidth range, the range boundary value can fall within any adjacent range, that is, the range can be [1000, 1200], [800, 1000), or (1000, 1200], [800, 1000]. In the above example, the divided range is symmetrical around the point x. In actual practice, the divided range can also be asymmetric, and this application does not limit this.

[0033] In one possible implementation manner, after determining the target bandwidth reduction of the node to be reduced, the method further includes:

[0034] Determining peak bandwidths corresponding to the coverage information;

[0035] The coverage information meeting a preset filtering condition is filtered out, where the preset filtering condition is that the peak bandwidth is less than a first preset value, or the ratio of the peak bandwidth to the target reduced bandwidth is less than a second preset value.

[0036] In one embodiment of the present application, the peak bandwidth corresponding to each coverage information is determined. The peak bandwidth is the maximum bandwidth of the coverage information in a day when the CDN is accelerated. To quickly optimize the bandwidth reduction schedule for the nodes to be reduced, coverage information with too small a peak bandwidth or a ratio of peak bandwidth to target bandwidth is too small will be filtered out. These filtered coverage information will not be considered in subsequent steps.

[0037] S103: Sort the bandwidths that can be reduced according to the judgment priority, and select the coverage information in sequence for reduction in the sorted order until the cumulative bandwidth reduction of the node to be reduced meets the target bandwidth reduction.

[0038] In one embodiment of the present application, after setting the judgment priority of each bandwidth reduction range, the bandwidth that can be reduced can be sorted according to the bandwidth reduction range in which the bandwidth can be reduced, thereby realizing the sorting of each coverage information. Due to its own business needs and other reasons, the coverage information may not be able to meet all the reduction requirements of the node to be reduced in a single reduction. Therefore, the coverage information will be selected in sequence according to the sorting order for reduction processing, so that the nodes to be reduced are reduced in turn through each coverage information until the cumulative bandwidth reduction of the node to be reduced meets the target bandwidth reduction, and the reduction process of the node to be reduced is completed.

[0039] In one possible implementation, sorting the reducible bandwidths according to the judgment priority includes:

[0040] The bandwidth reduction ranges corresponding to the bandwidth reduction ranges are determined, and the bandwidth reduction ranges are sorted according to the judgment priorities corresponding to the bandwidth reduction ranges.

[0041] In one embodiment of the present application, after setting each bandwidth reduction range, the bandwidth reduction range within which each bandwidth reduction is possible can be determined. Then, based on the priority level corresponding to each bandwidth reduction range, the bandwidth reductions can be sorted. For bandwidth reductions within the same bandwidth reduction range, the closer the bandwidth reduction is to the target bandwidth, the higher its priority.

[0042] In one embodiment, the method further comprises:

[0043] Acquire a coverage type of each coverage information relative to the node to be reduced, where the coverage type includes local and non-local;

[0044] The sorting of the bandwidths that can be reduced according to the judgment priorities corresponding to the bandwidth reduction ranges includes:

[0045] The reducible bandwidths are sorted according to the judgment priorities corresponding to the bandwidth reduction ranges, and the corresponding sorting of the non-local reducible bandwidths is always higher than the corresponding sorting of the local reducible bandwidths.

[0046] In one embodiment of the present application, the coverage type of each piece of coverage information relative to the node to be derated is determined to determine whether it is local or non-local. When sorting, non-local coverage information is prioritized, followed by local coverage information, meaning that non-local coverage information always has a higher sorting priority than local coverage information. Specifically, assuming the node to be derated is in Beijing, then coverage in Beijing is local, and coverage elsewhere is non-local.

[0047] For example, assume that four bandwidth reduction ranges are defined in the preceding steps and are sorted from high to low priority as [1000, 1200], [800, 1000], (1200, 2500), and (0, 800). Furthermore, assume that a node's bandwidth is reduced by 1000 Mbps, and there are coverages 1 to 5. Coverage 1 is local and can provide 900 Mbps of bandwidth. Coverages 2 to 5 are non-local. Coverage 2 can provide 1500 Mbps of bandwidth, Coverage 3 can provide 1200 Mbps of bandwidth, Coverage 4 can provide 900 Mbps of bandwidth, and Coverage 5 can provide 1100 Mbps of bandwidth. The final processing order obtained by the sorting method is Coverage 5, Coverage 3, Coverage 4, Coverage 2, and Coverage 1.

[0048] In one embodiment, the method further comprises:

[0049] Determine respectively the cost line bandwidth and the scheduling upper limit bandwidth of each coverage node corresponding to the coverage information, wherein the cost line bandwidth is less than the scheduling upper limit bandwidth;

[0050] The step of selecting the coverage information in order of sorting to reduce the amount of coverage information includes:

[0051] Selecting the coverage information in a sorted order;

[0052] Selecting a first coverage node from the coverage information to transfer the target bandwidth reduction of the node to be reduced to the first coverage node, wherein the first coverage node is a coverage node whose total bandwidth does not exceed the cost line bandwidth after transferring the target bandwidth reduction;

[0053] When the first coverage node does not exist, a second coverage node is added to the coverage information to transfer the target bandwidth reduction of the node to be reduced to the second coverage node, and the second coverage node is a coverage node whose total bandwidth does not exceed the cost line bandwidth after taking over the target bandwidth reduction;

[0054] When the second coverage node does not exist, selecting a third coverage node from the coverage information to transfer the target bandwidth reduction of the node to be reduced to the third coverage node, wherein the third coverage node is a coverage node whose total bandwidth does not exceed the scheduling upper limit bandwidth after taking over the target bandwidth reduction;

[0055] When the third coverage node does not exist, a fourth coverage node is added to the coverage information to transfer the target bandwidth reduction of the node to be reduced to the fourth coverage node, and the fourth coverage node is a coverage node whose total bandwidth does not exceed the scheduling upper limit bandwidth after taking over the target bandwidth reduction;

[0056] When the fourth coverage node does not exist, the coverage information is continuously selected in the sorted order.

[0057] The coverage node is a node under the coverage information, and each coverage node is provided with at least one IP information.

[0058] The scheduling upper limit bandwidth is the stress test bandwidth of the node. If the node bandwidth is higher than the upper limit, it is considered that the node cannot provide normal or complete services, which will affect the customer's accelerated service quality and should be avoided.

[0059] The cost line bandwidth is the cost bandwidth of the node. Taking a 95-point billing node as an example, the cost bandwidth is the maximum value of the remaining bandwidth after deducting 5% of the maximum used bandwidth each month. Therefore, making the remaining bandwidth after deducting 5% of the maximum bandwidth as close to the cost bandwidth as possible can improve the utilization of the cache node and save costs.

[0060] In one embodiment of the present application, in order to save costs, priority will be given to scheduling coverage nodes whose total bandwidth does not exceed the cost line bandwidth after carrying the bandwidth. Specifically, it will be considered whether there is a first coverage node in the selected coverage information. If it exists, the IP bandwidth of the node to be reduced will be subtracted (i.e., the target reduction bandwidth will be subtracted), and it will be added to the first coverage node. If there is no first coverage node that does not exceed the cost line bandwidth after taking over, a second coverage node will be considered, and the second coverage node will be used to take over the target reduction bandwidth. If none of the second coverage nodes that can be added can fall below the cost line bandwidth after taking over the target reduction bandwidth, a third coverage node will be considered. If there is no third coverage node that does not exceed the scheduling upper limit bandwidth after taking over, a fourth coverage node will be considered, and the fourth coverage node will be used to take over the target reduction bandwidth. If the fourth coverage node is still not found, the next coverage information will be selected according to the order of judgment priority, and the above judgment and selection process for the coverage node will be repeated in the next coverage information. Among them, the first coverage node and the third coverage node can be the same or different, and the second coverage node and the fourth coverage node can be the same or different. The cost line bandwidth and scheduling upper limit bandwidth of each node are manually pre-set based on the bandwidth usage plan for that month.

[0061] For example, Coverage 1 includes Node A, Node B, and Node C. Node A is the node to be de-capped, and its target bandwidth for de-capacity is 80M. Coverage 1 can provide 90M, but Node B and Node C can only provide 60M if they do not want to exceed the cost line bandwidth. In this case, an additional Node D will be considered to carry it. If it is found that Node D can only provide 70M if it does not want to exceed the cost line bandwidth, the node selection will be considered based on the scheduling upper limit bandwidth. If Node B can carry 80M without exceeding the scheduling upper limit bandwidth, the corresponding IP will eventually be subtracted from Node A and added to Node B to complete the target bandwidth reduction.

[0062] In one embodiment, the node to be reduced includes at least one IP to be reduced, each of the IP to be reduced corresponds to an IP reduction bandwidth, and the target reduction bandwidth is composed of at least one IP reduction bandwidth;

[0063] The step of selecting the coverage information in order of sorting to reduce the amount of coverage information includes:

[0064] Selecting the coverage information in a sorted order;

[0065] Selecting a first coverage node from the coverage information to transfer the IP reduction bandwidth to the first coverage node, wherein the first coverage node is a coverage node whose total bandwidth does not exceed the cost line bandwidth after transferring the IP reduction bandwidth;

[0066] When the first coverage node does not exist, a second coverage node is added to the coverage information to transfer the IP reduction bandwidth to the second coverage node, where the second coverage node is a coverage node whose total bandwidth does not exceed the cost line bandwidth after transferring the IP reduction bandwidth;

[0067] When the second coverage node does not exist, selecting a third coverage node from the coverage information to transfer the IP reduction bandwidth to the third coverage node, wherein the third coverage node is a coverage node whose total bandwidth does not exceed the scheduling upper limit bandwidth after transferring the IP reduction bandwidth;

[0068] When the third coverage node does not exist, a fourth coverage node is added to the coverage information to transfer the IP reduction bandwidth to the fourth coverage node, and the fourth coverage node is a coverage node whose total bandwidth does not exceed the scheduling upper limit bandwidth after taking over the IP reduction bandwidth;

[0069] When the fourth coverage node does not exist, the coverage information is continuously selected in the sorted order.

[0070] In one embodiment of the present application, the previous embodiment considers the case where there is only one IP under each node. In that case, the node needs to be able to carry the target reduction bandwidth at one time. But in addition to this, there is also a case where there are multiple IPs under the node. For example, node A is the node to be reduced, and there are IP1, IP2 and IP3 under it. The target reduction bandwidth is 30M, but the IP reduction bandwidth of each IP is 10M, that is, the reduction is achieved by reducing the bandwidth of the three IPs by 10M respectively, rather than reducing the bandwidth by 30M at one time. Then, in the process of reduction processing, as long as there is a node B that takes over the bandwidth of one of the IPs, that is, after taking over 10M, it will not exceed the cost line bandwidth, then the reduction processing process can be carried out through node B.

[0071] In one embodiment, the method further comprises:

[0072] When, after all of the coverage information has been reduced in bandwidth, the cumulative bandwidth reduction of the node to be reduced still does not meet the target bandwidth reduction, the coverage information is selected in sorted order, and at least one fifth coverage node is added to the coverage information, so that the fifth coverage node and the node to be reduced evenly share the remaining bandwidth reduction. The fifth coverage node is a coverage node whose total bandwidth does not exceed the cost line bandwidth after evenly sharing the remaining bandwidth reduction.

[0073] When the fifth coverage node does not exist, at least one sixth coverage node is added to the coverage information, so that the sixth coverage node and the node to be reduced in bandwidth evenly share the remaining reduced bandwidth, and the sixth coverage node is a coverage node whose total bandwidth does not exceed the scheduling upper limit bandwidth after evenly sharing the remaining reduced bandwidth;

[0074] When the sixth coverage node does not exist, failure information is generated to indicate that the node reduction has failed.

[0075] In one embodiment of the present application, in some cases, all coverage information has been processed through the reduction process, but the nodes to be reduced still have residual bandwidth that has not been reduced. At this time, the strategy of evenly dividing the bandwidth will be considered, that is, adding nodes in the coverage to evenly divide the bandwidth with the nodes to be reduced. Although this method cannot make the cumulative bandwidth reduction of the nodes to be reduced reach the target bandwidth reduction, it can make the cumulative bandwidth reduction as close to the target bandwidth reduction as possible. In addition, this strategy can add as many nodes as possible within the scope allowed by the plan to achieve as much equal distribution of the bandwidth of the nodes to be reduced as possible.

[0076] For example, the remaining bandwidth of node A to be reduced is 20M. A new node B can be added to evenly distribute the bandwidth through node B, so that node B only needs to take on 10M bandwidth instead of 20M bandwidth, which makes it easier to meet the conditions of not exceeding the cost line bandwidth or the scheduling upper limit bandwidth.

[0077] The following will describe in detail the device for dynamically adjusting CDN coverage resources provided by an embodiment of the present application in conjunction with FIG2 . It should be noted that the device for dynamically adjusting CDN coverage resources shown in FIG2 is used to execute the method of the embodiment shown in FIG1 of the present application. For ease of explanation, only the portion relevant to the embodiment of the present application is shown. For specific technical details not disclosed, please refer to the embodiment shown in FIG1 of the present application.

[0078] Please refer to Figure 2, which is a schematic diagram of the structure of a device for dynamically adjusting CDN coverage resources provided by an embodiment of the present application. As shown in Figure 2, the device includes:

[0079] The determination module 201 is used to determine the coverage information corresponding to the node to be reduced at the current moment, and determine the bandwidth that can be reduced corresponding to the coverage information, where the coverage information is IP information;

[0080] A setting module 202 is configured to determine a target bandwidth reduction for the node to be reduced, divide the bandwidth reduction range into at least two bandwidth reduction ranges based on a maximum bandwidth range corresponding to the target bandwidth reduction, and set a judgment priority for each bandwidth reduction range, so that a bandwidth reduction range closer to the target bandwidth reduction has a higher judgment priority, and that, among the bandwidth reduction ranges at the same distance from the target bandwidth reduction, a bandwidth reduction range with a higher maximum value has a higher judgment priority;

[0081] The sorting module 203 is configured to sort the bandwidths that can be reduced according to the judgment priority, and sequentially select the coverage information for reduction in the sorted order until the cumulative bandwidth reduction of the nodes to be reduced meets the target bandwidth reduction.

[0082] In one embodiment, the setting module 202 further includes:

[0083] A first determining unit, configured to determine each peak bandwidth corresponding to each coverage information;

[0084] The filtering unit is configured to filter out the coverage information that meets a preset filtering condition, wherein the preset filtering condition is that the peak bandwidth is less than a first preset value, or the ratio of the peak bandwidth to the target reduction bandwidth is less than a second preset value.

[0085] In one embodiment, the sorting module 203 includes:

[0086] The second determining unit is configured to determine the bandwidth reduction ranges corresponding to the bandwidth reduction ranges, and sort the bandwidth reduction ranges according to the judgment priorities corresponding to the bandwidth reduction ranges.

[0087] In one embodiment, the device further comprises:

[0088] An acquisition module, configured to acquire a coverage type of each coverage information relative to the node to be reduced, where the coverage type includes local and non-local;

[0089] The second determining unit includes:

[0090] The sorting component is configured to sort the reducible bandwidths according to the judgment priorities corresponding to the bandwidth reduction ranges, and to ensure that the sorting of the non-local reducible bandwidths is always higher than the sorting of the local reducible bandwidths.

[0091] In one embodiment, the device further comprises:

[0092] a bandwidth determination module, configured to respectively determine a cost line bandwidth and a scheduling upper limit bandwidth of each coverage node corresponding to the coverage information, wherein the cost line bandwidth is smaller than the scheduling upper limit bandwidth;

[0093] The sorting module 203 further includes:

[0094] A first selection unit, configured to select the coverage information in a sorted order;

[0095] a second selection unit, configured to select a first coverage node from the coverage information, to transfer the target bandwidth reduction of the node to be reduced to the first coverage node, wherein the first coverage node is a coverage node whose total bandwidth does not exceed the cost line bandwidth after taking over the target bandwidth reduction;

[0096] a first determining unit configured to, when the first coverage node does not exist, add a second coverage node to the coverage information, so as to transfer the target bandwidth reduction of the node to be reduced to the second coverage node, wherein the second coverage node is a coverage node whose total bandwidth does not exceed the cost line bandwidth after taking over the target bandwidth reduction;

[0097] a second judgment unit, configured to, when the second coverage node does not exist, select a third coverage node from the coverage information, to transfer the target bandwidth reduction of the node to be reduced to the third coverage node, wherein the third coverage node is a coverage node whose total bandwidth does not exceed the scheduling upper limit bandwidth after taking over the target bandwidth reduction;

[0098] a third judgment unit, configured to, when the third coverage node does not exist, add a fourth coverage node to the coverage information, so as to transfer the target bandwidth reduction of the node to be reduced to the fourth coverage node, wherein the fourth coverage node is a coverage node whose total bandwidth does not exceed the scheduling upper limit bandwidth after taking over the target bandwidth reduction;

[0099] The fourth judgment unit is configured to continue selecting the coverage information in a sorted order when the fourth coverage node does not exist.

[0100] In one embodiment, the node to be reduced includes at least one IP to be reduced, each of the IP to be reduced corresponds to an IP reduction bandwidth, and the target reduction bandwidth is composed of at least one IP reduction bandwidth;

[0101] The sorting module 203 further includes:

[0102] A third selection unit, configured to select the coverage information in a sorted order;

[0103] a fourth selection unit, configured to select a first coverage node from the coverage information, to transfer the IP reduction bandwidth to the first coverage node, wherein the first coverage node is a coverage node whose total bandwidth does not exceed the cost line bandwidth after transferring the IP reduction bandwidth;

[0104] a fifth determining unit configured to, when the first coverage node does not exist, add a second coverage node to the coverage information, so as to transfer the IP reduction bandwidth to the second coverage node, wherein the second coverage node is a coverage node whose total bandwidth does not exceed the cost line bandwidth after transferring the IP reduction bandwidth;

[0105] a sixth determining unit, configured to, when the second coverage node does not exist, select a third coverage node from the coverage information to transfer the IP reduced bandwidth to the third coverage node, wherein the third coverage node is a coverage node whose total bandwidth does not exceed the scheduling upper limit bandwidth after transferring the IP reduced bandwidth;

[0106] a seventh judgment unit, configured to, when the third coverage node does not exist, add a fourth coverage node to the coverage information, so as to transfer the IP reduction bandwidth to the fourth coverage node, wherein the fourth coverage node is a coverage node whose total bandwidth does not exceed the scheduling upper limit bandwidth after transferring the IP reduction bandwidth;

[0107] An eighth judgment unit is configured to continue selecting the coverage information in a sorted order when the fourth coverage node does not exist.

[0108] In one embodiment, the device further comprises:

[0109] a first processing module configured to, when all of the coverage information has been subjected to the capacity reduction processing and the cumulative capacity reduction bandwidth of the node to be reduced still does not meet the target capacity reduction bandwidth, select the coverage information in sorted order and add at least one fifth coverage node to the coverage information so that the fifth coverage node and the node to be reduced evenly share the remaining capacity reduction bandwidth, the fifth coverage node being a coverage node whose total bandwidth does not exceed the cost line bandwidth after evenly sharing the remaining capacity reduction bandwidth;

[0110] a second processing module, configured to, when the fifth coverage node does not exist, add at least one sixth coverage node to the coverage information, so that the sixth coverage node and the node to be reduced in bandwidth evenly share the remaining reduced bandwidth, the sixth coverage node being a coverage node for which the total bandwidth does not exceed the scheduling upper limit bandwidth after evenly sharing the remaining reduced bandwidth;

[0111] The third processing module is configured to generate failure information when the sixth coverage node does not exist, to indicate that the node reduction has failed.

[0112] Those skilled in the art will clearly understand that the technical solutions of the embodiments of the present application can be implemented with the help of software and / or hardware. "Unit" and "module" in this specification refer to software and / or hardware that can independently perform or cooperate with other components to perform specific functions, where the hardware can be, for example, a field programmable gate array (FPGA), an integrated circuit (IC), etc.

[0113] Each processing unit and / or module in the embodiments of the present application may be implemented by an analog circuit that implements the functions described in the embodiments of the present application, or may be implemented by software that executes the functions described in the embodiments of the present application.

[0114] Referring to Figure 3, which shows a schematic diagram of the structure of an electronic device involved in an embodiment of the present application, the electronic device can be used to implement the method in the embodiment shown in Figure 1. As shown in Figure 3, the electronic device 300 may include: at least one central processing unit 301, at least one network interface 304, a user interface 303, a memory 305, and at least one communication bus 302.

[0115] The communication bus 302 is used to implement the connection and communication between these components.

[0116] The user interface 303 may include a display screen (Display) and a camera (Camera). Optionally, the user interface 303 may also include a standard wired interface and a wireless interface.

[0117] The network interface 304 may optionally include a standard wired interface or a wireless interface (such as a WI-FI interface).

[0118] The central processing unit 301 may include one or more processing cores. The central processing unit 301 utilizes various interfaces and circuits to connect various components within the entire electronic device 300. It executes instructions, programs, code sets, or instruction sets stored in the memory 305, and accesses data stored in the memory 305 to perform various functions and process data for the terminal 300. Optionally, the central processing unit 301 may be implemented using at least one hardware form factor selected from the group consisting of a digital signal processing (DSP), a field-programmable gate array (FPGA), and a programmable logic array (PLA). The central processing unit 301 may integrate one or a combination of a central processing unit (CPU), a graphics processing unit (GPU), and a modem. The CPU primarily processes the operating system, user interface, and application programs; the GPU is responsible for rendering and drawing the content displayed on the display; and the modem handles wireless communications. It is understood that the modem may not be integrated into the central processing unit 301 and may be implemented as a separate chip.

[0119] Among them, the memory 305 may include a random access memory (RAM) or a read-only memory (ROM). Optionally, the memory 305 includes a non-transitory computer-readable storage medium. The memory 305 can be used to store instructions, programs, codes, code sets or instruction sets. The memory 305 may include a program storage area and a data storage area, wherein the program storage area may store instructions for implementing an operating system, instructions for at least one function (such as a touch function, a sound playback function, an image playback function, etc.), instructions for implementing the above-mentioned various method embodiments, etc.; the data storage area may store data involved in the above-mentioned various method embodiments, etc. The memory 305 may also be at least one storage device located away from the aforementioned central processing unit 301. As shown in Figure 3, the memory 305 as a computer storage medium may include an operating system, a network communication module, a user interface module and program instructions.

[0120] In the electronic device 300 shown in FIG3 , the user interface 303 is mainly used to provide an input interface for the user and obtain user input data; and the central processing unit 301 can be used to call the CDN coverage resource dynamic adjustment application stored in the memory 305 and specifically perform the following operations:

[0121] Determine each coverage information corresponding to the node to be reduced at the current moment, and determine each bandwidth that can be reduced corresponding to each coverage information, wherein the coverage information includes at least one IP information;

[0122] Determining a target bandwidth reduction for the node to be reduced, dividing the bandwidth reduction range into at least two bandwidth reduction ranges based on a maximum bandwidth range corresponding to the target bandwidth reduction, and setting a judgment priority for each bandwidth reduction range, such that a bandwidth reduction range closer to the target bandwidth reduction has a higher judgment priority, and that, among the bandwidth reduction ranges at the same distance from the target bandwidth reduction, a bandwidth reduction range with a higher maximum value has a higher judgment priority;

[0123] The bandwidths that can be reduced are sorted according to the judgment priority, and the coverage information is selected in sequence for reduction in the sorted order until the cumulative bandwidth reduction of the node to be reduced meets the target bandwidth reduction.

[0124] The present application also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the above method. The computer-readable storage medium may include, but is not limited to, any type of disk, including a floppy disk, an optical disk, a DVD, a CD-ROM, a microdrive, a magneto-optical disk, a ROM, a RAM, an EPROM, an EEPROM, a DRAM, a VRAM, a flash memory device, a magnetic card or an optical card, a nanosystem (including a molecular memory IC), or any type of medium or device suitable for storing instructions and / or data.

[0125] It should be noted that for the aforementioned method embodiments, for the sake of simplicity, they are all expressed as a series of action combinations, but those skilled in the art should be aware that this application is not limited by the order of the actions described, because according to this application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by this application.

[0126] In the above embodiments, the description of each embodiment has its own focus. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0127] In the several embodiments provided in this application, it should be understood that the disclosed devices can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some service interface, and the indirect coupling or communication connection of the device or unit can be electrical or other forms.

[0128] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0129] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0130] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable memory. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a memory, including a number of instructions for enabling a computer device (which can be a personal computer, server or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned memory includes: various media that can store program codes, such as a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk.

[0131] Those skilled in the art will appreciate that all or part of the steps in the various methods of the above embodiments can be completed by instructing related hardware through a program, and the program can be stored in a computer-readable memory, which may include: a flash drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.

[0132] The above description is merely an exemplary embodiment of the present disclosure and is not intended to limit the scope of the present disclosure. That is, any equivalent changes and modifications made in accordance with the teachings of the present disclosure are still within the scope of the present disclosure. After considering the specification and practicing the disclosure herein, those skilled in the art will easily come up with the implementation scheme of the present disclosure. This application is intended to cover any variations, uses or adaptations of the present disclosure, which follow the general principles of the present disclosure and include common knowledge or customary technical means in the art that are not described in the present disclosure. The description and examples are to be regarded as exemplary only, and the scope and spirit of the present disclosure are defined by the claims.

Claims

1. A method for dynamically adjusting CDN coverage resources, characterized in that: The method comprises: Determine each coverage information corresponding to the node to be reduced at the current moment, and determine each bandwidth that can be reduced corresponding to each coverage information, wherein the coverage information includes at least one IP information; Determine a target bandwidth reduction of the node to be reduced, divide at least two bandwidth reduction ranges based on a maximum bandwidth range corresponding to the target bandwidth reduction, and set a judgment priority of each bandwidth reduction range, so that a bandwidth reduction range closer to the target bandwidth reduction has a higher judgment priority, and in the bandwidth reduction range with the same distance to the target bandwidth reduction, a bandwidth reduction range with a higher maximum value has a higher judgment priority; The bandwidths that can be reduced are sorted according to the judgment priority, and the coverage information is selected in sequence for reduction in the sorted order until the accumulated reduced bandwidth of the node to be reduced meets the target reduced bandwidth.

2. The method according to claim 1, characterized in that: After determining the target bandwidth reduction of the node to be reduced, the method further includes: Determine each peak bandwidth corresponding to each coverage information; The coverage information satisfying a preset filtering condition is filtered out, where the preset filtering condition is that the peak bandwidth is less than a first preset value, or the ratio of the peak bandwidth to the target reduced bandwidth is less than a second preset value.

3. The method according to claim 1, characterized in that The step of sorting the reducible bandwidths according to the judgment priority level includes: The bandwidth reduction ranges corresponding to the bandwidth reduction ranges are determined, and the bandwidth reduction ranges are sorted according to the judgment priorities corresponding to the bandwidth reduction ranges.

4. The method according to claim 3, characterized in that The method further comprises: Acquire a coverage type of each of the coverage information relative to the node to be reduced, where the coverage type includes local and non-local; The step of sorting the bandwidths that can be reduced according to the judgment priorities corresponding to the bandwidth reduction ranges includes: The reducible bandwidths are sorted according to the judgment priorities corresponding to the reducible bandwidth ranges, and the corresponding sorting of the non-local reducible bandwidths is always higher than the corresponding sorting of the local reducible bandwidths.

5. The method according to claim 1, characterized in that The method further comprises: Respectively determine the cost line bandwidth and the scheduling upper limit bandwidth of each coverage node corresponding to the coverage information, wherein the cost line bandwidth is less than the scheduling upper limit bandwidth; The selecting the coverage information in sequence according to the sorting order to reduce the amount includes: Selecting the coverage information according to the sorting order; A first coverage node is selected from the coverage information to transfer the target bandwidth reduction of the node to be reduced to the first coverage node, and the first coverage node has a total bandwidth that does not exceed the cost after taking over the target bandwidth reduction. Line bandwidth coverage nodes; When the first coverage node does not exist, a second coverage node is added to the coverage information to transfer the target bandwidth reduction of the node to be reduced to the second coverage node, and the second coverage node is a coverage node whose total bandwidth does not exceed the cost line bandwidth after taking over the target bandwidth reduction; When the second coverage node does not exist, a third coverage node is selected from the coverage information to transfer the target bandwidth reduction of the node to be reduced to the third coverage node, and the third coverage node is a coverage node whose total bandwidth does not exceed the scheduling upper limit bandwidth after taking over the target bandwidth reduction; When the third coverage node does not exist, a fourth coverage node is added to the coverage information to transfer the target bandwidth reduction of the node to be reduced to the fourth coverage node, and the fourth coverage node is a coverage node whose total bandwidth does not exceed the scheduling upper limit bandwidth after taking over the target bandwidth reduction; When the fourth coverage node does not exist, the coverage information continues to be selected in the sorted order.

6. The method according to claim 5, characterized in that The node to be reduced includes at least one IP to be reduced, each of the IP to be reduced corresponds to an IP reduction bandwidth, and the target reduction bandwidth is composed of at least one IP reduction bandwidth; The selecting the coverage information in sequence according to the sorting order to reduce the amount includes: Selecting the coverage information according to the sorting order; Selecting a first coverage node from the coverage information to transfer the IP reduction bandwidth to the first coverage node, wherein the first coverage node is a coverage node whose total bandwidth does not exceed the cost line bandwidth after transferring the IP reduction bandwidth; When the first coverage node does not exist, a second coverage node is added to the coverage information to transfer the IP reduction bandwidth to the second coverage node, and the second coverage node is a coverage node whose total bandwidth does not exceed the cost line bandwidth after transferring the IP reduction bandwidth; When the second coverage node does not exist, a third coverage node is selected from the coverage information to transfer the IP reduction bandwidth to the third coverage node, and the third coverage node is a coverage node whose total bandwidth does not exceed the scheduling upper limit bandwidth after taking over the IP reduction bandwidth; When the third coverage node does not exist, a fourth coverage node is added to the coverage information to transfer the IP reduction bandwidth to the fourth coverage node, and the fourth coverage node is a coverage node whose total bandwidth does not exceed the scheduling upper limit bandwidth after taking over the IP reduction bandwidth; When the fourth coverage node does not exist, the coverage information continues to be selected in the sorted order.

7. The method according to claim 5, characterized in that The method further comprises: When the accumulated bandwidth reduction of the node to be reduced still does not meet the target bandwidth reduction after all the coverage information has been reduced, the coverage information is selected in a sorted order, and at least one fifth coverage node is added to the coverage information, so that the fifth coverage node and the node to be reduced evenly share the remaining bandwidth reduction, and the fifth coverage node is a coverage node whose total bandwidth does not exceed the bandwidth of the cost line after evenly sharing the remaining bandwidth reduction; When the fifth coverage node does not exist, at least one sixth coverage node is added to the coverage information, so that the sixth coverage node and the node to be reduced in bandwidth evenly share the remaining reduced bandwidth, and the sixth coverage node is a coverage node whose total bandwidth does not exceed the scheduling upper limit bandwidth after evenly sharing the remaining reduced bandwidth; When the sixth coverage node does not exist, failure information is generated to indicate that the node reduction has failed.

8. A device for dynamically adjusting CDN coverage resources, characterized in that: The device comprises: A determination module, used to determine each coverage information corresponding to the node to be reduced at the current moment, and determine the bandwidth that can be reduced corresponding to the coverage information, wherein the coverage information is IP information; a setting module, configured to determine a target bandwidth reduction of the node to be reduced, divide at least two bandwidth reduction ranges based on a maximum bandwidth range corresponding to the target bandwidth reduction, and set a judgment priority of each bandwidth reduction range, so that a bandwidth reduction range closer to the target bandwidth reduction has a higher judgment priority, and in the bandwidth reduction range with the same distance to the target bandwidth reduction, a bandwidth reduction range with a higher maximum value has a higher judgment priority; The sorting module is used to sort the bandwidths that can be reduced according to the judgment priority, and select the coverage information in sequence for reduction in the sorting order until the accumulated reduced bandwidth of the node to be reduced meets the target reduced bandwidth.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

Citation Information

Patent Citations

  • Method, device and equipment for adjusting CDN coverage scheme

    CN112910698A

  • Power distribution Internet of Things service multi-priority data communication bandwidth prediction method

    CN115378828A

  • CDN (Content Delivery Network) coverage resource dynamic adjustment method and device and electronic equipment

    CN116347528A

  • Bandwidth management across logical groupings of access points in a shared access broadband network

    US20160072691A1

Cited By

  • Bandwidth planning method and device based on edge calculation, equipment and medium

    CN120602341A