Node resource planning method and device, electronic equipment and readable storage medium

Abstract

The present disclosure relates to the technical field of content distribution network, and proposes a node resource planning method and device, electronic equipment and readable storage medium. The method comprises: obtaining historical reference information of a target large area containing a plurality of target nodes, the historical reference information comprising a sum of target node upper limits, a sum of target node minimum planning lines, and a bandwidth peak sum of target nodes located in a user area; determining a bandwidth over-planning point number based on the sum of target node upper limits and the bandwidth peak sum; determining a planning value total sum of the target large area from the bandwidth peak sum according to the bandwidth over-planning point number; and determining a target planning line of the target node based on a comparison result of the planning value total sum and a preset condition, the preset condition comprising a node upper limit condition and a node minimum planning line condition. The technical scheme provided by one or more embodiments of the present disclosure can quickly and accurately calculate the node planning line, thereby guaranteeing the quality of node service while reducing bandwidth cost.

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the technical field of content delivery network, in particular to a node resource planning method and device, electronic equipment and readable storage medium. BACKGROUND

[0002] A content delivery network (CDN) is a new type of network content service system. The CDN is constructed based on an IP network and provides distribution and service of content based on efficiency requirements, quality requirements and content order of content access and application.

[0003] A node is the smallest unit of bandwidth billing settlement between a CDN vendor and an operator. Due to different network construction architectures of different operators in different provinces, there are many types of bandwidth billing modes of the node. In order to control the bandwidth cost of the node, concepts such as a node upper limit, a node billing line, a node minimum planning line and a node planning line are usually involved. The node upper limit is a bandwidth line that the node can normally provide services. The node billing line is a bandwidth line that the CDN vendor actually settles with the operator. The node bottom line is a bottom billing bandwidth line signed by the CDN vendor and the operator. The node planning line can represent a bandwidth line that is scheduled in advance, can be referenced, and is used for cost control according to past customer resource demand and future customer resource demand.

[0004] The operating cost of the CDN generally includes a machine room operating cost, a bandwidth cost and the like, and the bandwidth cost usually accounts for a large proportion. Therefore, in the technical field of content delivery network, the planning and control of the node bandwidth cost is particularly important. SUMMARY

[0005] Therefore, one or more embodiments of the present disclosure provide a node resource planning method and device, electronic equipment and readable storage medium, which can quickly and accurately calculate the node planning line, ensure the quality of node services and reduce the bandwidth cost.

[0006] In one aspect, the disclosure provides a node resource planning method, which comprises: obtaining historical reference information of a target large area containing a plurality of target nodes, the historical reference information comprising a sum of target node upper limits of each of the target nodes, a sum of target node minimum planning lines of each of the target nodes, and a bandwidth peak sum of the target nodes located in a user area, the bandwidth peak sum being a data group divided according to a preset time granularity, the target node minimum planning line being determined based on a target node bottom line, a target node billing line and a target node upper limit; determining a bandwidth over-planning point number based on the sum of target node upper limits and the bandwidth peak sum; determining a planning value sum of the target large area from the bandwidth peak sum according to the bandwidth over-planning point number; determining a target planning line of the target node based on a comparison result of the planning value sum and a preset condition, the preset condition comprising a node upper limit condition and a node minimum planning line condition.

[0007] In another aspect, the disclosure also provides a node resource planning device, which comprises: an information obtaining unit configured to obtain historical reference information of a target large area containing a plurality of target nodes, the historical reference information comprising a sum of target node upper limits of each of the target nodes, a sum of target node minimum planning lines of each of the target nodes, and a bandwidth peak sum of the target nodes located in a user area, the bandwidth peak sum being a data group divided according to a preset time granularity, the target node minimum planning line being determined based on a target node bottom line, a target node billing line and a target node upper limit; a first planning unit configured to determine a bandwidth over-planning point number based on the sum of target node upper limits and the bandwidth peak sum; a second planning unit configured to determine a planning value sum of the target large area from the bandwidth peak sum according to the bandwidth over-planning point number; and a third planning unit configured to determine a target planning line of the target node based on a comparison result of the planning value sum and a preset condition, the preset condition comprising a node upper limit condition and a node minimum planning line condition.

[0008] In another aspect, the disclosure also provides an electronic device comprising a memory and a processor, the memory being configured to store a computer program, the computer program being configured to implement the node resource planning method when executed by the processor.

[0009] In another aspect, the disclosure also provides a computer readable storage medium configured to store a computer program, the computer program being configured to implement the node resource planning method when executed by a processor.

[0010] The technical scheme provided by one or more embodiments of the present disclosure can acquire historical reference information of a target area, learn the performance characteristics and charging characteristics of each target node in the area, and the bandwidth usage characteristics of the user area. By using specific algorithm rules, the number of bandwidth over-planning points can be determined, and then the sum of suitable bandwidth planning values can be determined. According to the comparison result of the sum of planning values and the preset condition, the planning line of each target node can be quickly given.

[0011] The technical scheme provided by one or more embodiments of the present disclosure can quickly give a node planning line adjustment scheme that is beneficial to bandwidth cost control under the premise of ensuring quality, and can give an optimal node resource planning in a timely manner when needed. BRIEF DESCRIPTION OF DRAWINGS

[0012] The features and advantages of the embodiments of the present disclosure will be more clearly understood through reference to the accompanying drawings, which are schematic and should not be understood as any limitation to the present disclosure. In the drawings:

[0013] Figure 1 A step schematic diagram of a node resource planning method in one embodiment of the present disclosure is shown;

[0014] Figure 2 A flow schematic diagram of a node resource planning method in one embodiment of the present disclosure is shown;

[0015] Figure 3 A functional unit schematic diagram of a node resource planning device in one embodiment of the present disclosure is shown;

[0016] Figure 4 A structural schematic diagram of an electronic device in one embodiment of the present disclosure is shown. DETAILED DESCRIPTION

[0017] To make the objectives, technical schemes, and advantages of the embodiments of the present disclosure clearer, the technical scheme in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are part of the embodiments of the present disclosure, rather than all the embodiments of the present disclosure. Based on the embodiments in the present disclosure, all other embodiments obtained by those skilled in the art without creative labor fall within the scope of protection of the present disclosure.

[0018] In the related art, under the premise of ensuring node service quality, existing resources are generally planned by manual planning based on the use of past node bandwidth and future customer resource demand. Manual planning requires high requirements, is time-consuming and laborious, and the resource coverage and actual customer demand bandwidth change a lot, so it is impossible to give the best planning for the overall resources.

[0019] Therefore, the node resource planning method provided by the embodiment of the present disclosure can quickly and accurately calculate the node planning line, ensure the quality of node service, and reduce the bandwidth cost. Figure 1 The node resource planning method provided by the embodiment of the present disclosure can include the following steps.

[0020] S1: Obtain historical reference information of a target large area containing a plurality of target nodes, wherein the historical reference information includes a sum of target node upper limits of each target node, a sum of target node minimum planning lines of each target node, and a bandwidth peak sum of the target nodes located in a user area, the bandwidth peak sum is a data group divided according to a preset time granularity, and the target node minimum planning line is determined based on a target node bottom line, a target node billing line, and a target node upper limit.

[0021] In the embodiment, the target large area can be a set of CDN acceleration areas associated with each other, and the target node can be each service node of the CDN acceleration area. The historical reference information of the target large area can be obtained, which can be the reference information within a certain time range, for example, one day, one week, one month, etc. The historical reference information can include node upper limit information of each target node, thereby representing the performance characteristics of the target node. The historical reference information can include node minimum planning line information of each target node, thereby representing the billing characteristics of the target node. The historical reference information can also include a bandwidth peak sum of the target nodes in the user area, thereby representing the bandwidth usage characteristics of the user area.

[0022] In an actual application example, the sum of node upper limits, the sum of node minimum planning lines, and the bandwidth peak sum of each 5-minute granularity customer area within the calculation date can be obtained under the granularity of the operator large area.

[0023] In some embodiments, for any target node, the target node bottom line, the target node billing line, and the target node upper limit can be obtained. The larger value of the target node bottom line and the target node billing line can be selected as a first comparison result. The smaller value of the first comparison result and the target node upper limit can be selected as a second comparison result. The second comparison result can be determined as the target node minimum planning line.

[0024] For example, the node minimum planning line can be calculated by the following formula: node minimum planning line = MIN(MAX(node bottom line, node billing line), node upper limit). The MIN symbol represents the minimum value of the data, and the MAX symbol represents the maximum value of the data.

[0025] S2: Determine the bandwidth over-planning point number based on the sum of the target node upper limits and the bandwidth peak sum.

[0026] In the embodiment, according to the sum of the upper limits of the target nodes, the bandwidth peak sum, and some pre-acquired fixed parameters, a specific algorithm rule can be used to determine the bandwidth over-planning point number.

[0027] In some embodiments, the first coefficient can be determined based on the sum of the upper limits of the target nodes, the bandwidth compression test discount coefficient, the number of the preset time granularity in a unit of time, the free time length of the billing node per month, and the free time length utilization ratio. The second coefficient can be determined based on the maximum value of the bandwidth peak sum. The bandwidth over-planning point number can be determined based on the ratio of the first coefficient and the second coefficient. The calculated point number value can be rounded up.

[0028] In an actual application example, the point number of the customer area bandwidth over the planning line = the sum of the upper limits of the operator area nodes * 0.9 * 12 * 36 * 0.7 / MAX (5-minute granularity customer area bandwidth peak sum). Wherein, 0.9 is the bandwidth compression test discount coefficient, 12 is the number of 5 minutes per hour, 36 is the free time length of the 95 billing nodes per month (unit: hour), and 0.7 is the node free time length utilization ratio.

[0029] S3: According to the bandwidth over-planning point number, determine the planning value sum of the target area from the bandwidth peak sum.

[0030] In the embodiment, the bandwidth over-planning point number can be used to determine the appropriate bandwidth planning value sum. For example, the bandwidth peak sum can be sorted in descending order according to the numerical value. For the sorted bandwidth peak sum, the bandwidth peak sum corresponding to the position of the bandwidth over-planning point number can be selected as the planning value sum. In this way, it can be ensured that the selected bandwidth planning value sum meets the actual demand of the user, and it can also avoid selecting excessive bandwidth planning value to prevent resource waste.

[0031] In an actual application example, the 5-minute granularity customer area bandwidth peak sum can be sorted in descending order. Then, the customer area bandwidth peak sum at the position of the “point number of the customer area bandwidth over the planning line” can be taken as the operator area planning value sum.

[0032] S4: Determine the target planning line of the target node based on the comparison result of the planning value sum and the preset condition, and the preset condition includes the node upper limit condition and the node minimum planning line condition.

[0033] In the embodiment, according to the comparison result of the planning value sum and the preset condition, the planning line of each target node can be quickly given. The preset condition includes the node upper limit condition and the node minimum planning line condition, so that the finally obtained target planning line can take into account the lower node bandwidth cost and the higher node service quality.

[0034] In some embodiments, when the planning value sum is greater than the sum of the target node upper limits, the target node upper limit is determined as the target planning line of the target node.

[0035] For example, if the operator area planning value sum is greater than the sum of the operator area node upper limits, it indicates that the node resource of the area is insufficient, and the node planning line can be set as the node upper limit.

[0036] In some embodiments, when the planning value sum is not greater than the sum of the target node upper limits and the planning value sum is less than the sum of the target node minimum planning lines, the target node minimum planning line is determined as the target planning line of the target node.

[0037] For example, if the operator area planning value sum is less than or equal to the sum of the operator area node upper limits, and the operator area planning value sum is less than the sum of the operator area node minimum planning lines, the node planning line can be set as the node minimum planning line.

[0038] In some embodiments, when the planning value sum is not greater than the sum of the target node upper limits and the planning value sum is not less than the sum of the target node minimum planning lines, a to-be-allocated planning value is determined based on the planning value sum and the sum of the target node minimum planning lines, and the target planning line of the target node is determined based on the to-be-allocated planning value.

[0039] For example, the operator area planning value sum minus the sum of the operator area node minimum planning lines can be taken as the area to-be-allocated planning value.

[0040] In some embodiments, determining the target planning line based on the to-be-allocated planning value comprises: sorting the target nodes in ascending order according to node bandwidth prices; calculating an added value of the to-be-allocated planning value and a first node minimum planning line for a first node of the sorted target nodes; comparing the added value with a first node upper limit; determining a first planning line of the first node according to the comparison result; updating the to-be-allocated planning value by deducting a first node difference value from the to-be-allocated planning value, the first node difference value being determined by the first node upper limit and the first node minimum planning line; and iteratively processing a next node of the first node until the to-be-allocated planning value is zero.

[0041] In some embodiments, determining the first planning line of the first node according to the comparison result comprises: if the added value is greater than or equal to the first node upper limit, determining the first node upper limit as the first planning line of the first node; or if the added value is less than the first node upper limit, determining the added value as the first planning line of the first node.

[0042] In one practical application example, according to the node bandwidth price (determined by the network operator), the nodes to be planned can be sorted in ascending order (cheap first). If the to-be-allocated planning value > 0, it is determined whether "node minimum planning line + to-be-allocated planning value" >= node upper limit; if yes, the node planning line = node upper limit; if no, the node planning line = node minimum planning line + to-be-allocated planning value. After the to-be-allocated planning value is deducted, the next node can be processed until the to-be-allocated planning value = 0. If the to-be-allocated planning value = 0, the node has not been processed, and the node planning line of the remaining node = node minimum planning line.

[0043] Referring to Figure 2 The node resource planning method provided by one embodiment of the present disclosure can be implemented through the following steps.

[0044] Step S201: Calculate the sum of customer area bandwidth peaks of each 5-minute granularity within the calculation date at the operator-region granularity. For example, the sum of customer peak bandwidths of each 5-minute granularity in a month for A operator-B region is 288*30 = 1440 values.

[0045] Step S202: Calculate the sum of node upper limits at the operator-region granularity. For example, the sum of upper limits of 10 nodes in A operator-B region is 500 Gbps.

[0046] In this embodiment, the node upper limit is the stress test bandwidth of the node. If the node bandwidth is greater than the upper limit, it is considered that the node cannot provide normal or complete service, which will affect the service quality of customer acceleration.

[0047] Step S203: Calculate the sum of node minimum planning lines at the operator-region granularity. For example, the node minimum planning line = MIN(MAX(node floor line 200 Gbps, node billing line 230 Gbps), node upper limit 500 Gbps) = 230 Gbps for A operator-B region.

[0048] In this embodiment, the node floor line is the floor billing bandwidth line signed with the operator. The node billing line is the bandwidth line actually settled with the operator.

[0049] Step S204: Calculate the number of points of customer area bandwidth exceeding the planning line = [sum of operator-region node upper limits] * 0.9 * 12 * 36 * 0.7 / MAX(5-minute granularity customer area bandwidth peak sum). Wherein, 0.9 is the stress test bandwidth discount coefficient, 12 is the number of 5-minute granularity per hour, 36 is the free time length of 95 billing nodes per month (unit: hour), 0.7 is the node free time length utilization ratio, and the point value can be rounded up. For example, the number of points of A operator-B region exceeding the planning line = 1368.

[0050] Step S205: Sort the customer area bandwidth peak sum in descending order, take the customer area bandwidth peak sum at the [number of points where customer area bandwidth exceeds planning line]th position in step S204 as the [sum of operator-regional planning values]. For example, A operator-B region, take the bandwidth value corresponding to the 1368th point = 360 Gbps.

[0051] Step S206: Determine whether [sum of operator-regional planning values] > [sum of upper limits of operator-regional nodes]. For example, A operator-B region, sum of planning values = 360, sum of upper limits = 500, because 360 < 500, proceed to step S207.

[0052] Step S207: Determine whether [sum of operator-regional planning values] >= [sum of lowest planning lines of operator-regional nodes]. For example, A operator-B region, sum of planning values = 360, sum of lowest planning lines = 230, because 360 > 230, proceed to step S208.

[0053] Step S208: At this time, the regional planning value to be allocated = [sum of operator-regional planning values] - [sum of lowest planning lines of operator-regional nodes]. For example, A operator-B region, sum of planning values = 360, sum of lowest planning lines = 230, then the planning value to be allocated = 360-230 = 130.

[0054] Step S209: The nodes to be planned are sorted in ascending order (cheaper first) according to the node bandwidth price (determined by the network operator). For example, A operator-B region, 10 nodes, after sorting, they are node 1, node 2, …, node 10 in turn.

[0055] Step S210: If the planning value to be allocated > 0, determine whether “lowest planning line of node + planning value to be allocated” >= upper limit of node; if yes, the planning line of node = upper limit of node; if no, the planning line of node = lowest planning line of node + planning value to be allocated. Subtract the allocated value from the planning value to be allocated, then process the next node until the planning value to be allocated = 0.

[0056] For example, A operator-B region, node 1: lowest planning line = 20, upper limit = 100, planning value to be allocated = 130, then 20+130 = 150 > 100, planning line of node 1 = 100, planning value to be allocated = 130-(100-20) = 50;

[0057] Node 2: lowest planning line = 20, upper limit = 100, then 20+50 = 70 < 100, planning line of node 2 = 70, planning value to be allocated = 0;

[0058] If the node has not been processed at this time, go to the next step S211.

[0059] Step S211: If the to-be-allocated planning value = 0, the node has not been processed, then the node planning line = the node lowest planning line. For example, A operator-B region, at this time, the to-be-allocated planning value = 0, and there are 8 nodes that have not been processed, therefore, the planning lines of the node 3 to the node 10 are all equal to the node lowest planning line.

[0060] In the embodiment, under the premise of ensuring quality, the charging cost characteristics of the node, the bandwidth characteristics of the operator region and the customer region are combined, the special super planning point number algorithm and the special allocation rule are used, the cost control planning line adjustment scheme can be quickly given, the calculation and the planning line adjustment can be performed at any time when needed, and the optimal node planning can be given.

[0061] The technical scheme provided by one or more embodiments of the present disclosure can obtain historical reference information of a target region, learn the performance characteristics and charging characteristics of each target node in the region, and the bandwidth usage characteristics of the user region. By using a specific algorithm rule, the bandwidth super planning point number can be determined, and then the appropriate bandwidth planning value sum can be determined. According to the comparison result of the planning value sum and the preset condition, the planning line of each target node can be quickly given.

[0062] The technical scheme provided by one or more embodiments of the present disclosure can quickly give a node planning line adjustment scheme that is beneficial to bandwidth cost control under the premise of ensuring quality, and can give the optimal node resource planning in time when needed.

[0063] Please refer to Figure 3 The present disclosure also provides a node resource planning device, which comprises:

[0064] An information acquisition unit 100 is configured to acquire historical reference information of a target region comprising a plurality of target nodes, wherein the historical reference information comprises a sum of target node upper limits of each target node, a sum of target node lowest planning lines of each target node, and a bandwidth peak sum of the target nodes located in a user region, the bandwidth peak sum is a data group divided according to a preset time granularity, and the target node lowest planning line is determined based on a target node bottom line, a target node charging line and a target node upper limit;

[0065] A first planning unit 200 is configured to determine a bandwidth super planning point number based on the sum of target node upper limits and the bandwidth peak sum;

[0066] A second planning unit 300 is configured to determine a planning value sum of the target region from the bandwidth peak sum according to the bandwidth super planning point number;

[0067] The third planning unit 400 is configured to determine a target planning line of the target node based on a comparison result of the planning value sum and a preset condition, and the preset condition includes a node upper limit condition and a node minimum planning line condition.

[0068] In an embodiment, the information obtaining unit 100 includes a minimum planning line obtaining sub-unit 101 configured to obtain, for any target node, a target node bottom line, a target node billing line, and a target node upper limit; select a larger value between the target node bottom line and the target node billing line as a first comparison result; select a smaller value between the first comparison result and the target node upper limit as a second comparison result; and determine the second comparison result as a target node minimum planning line.

[0069] In an embodiment, the first planning unit 200 is specifically configured to determine a first coefficient based on a sum of the target node upper limits, a pressure test bandwidth discount coefficient, a number of the preset time granularities in a unit time, a monthly free duration of a billing node, and a free duration utilization ratio; determine a second coefficient based on a maximum value of the bandwidth peak sum; and determine the bandwidth over-planning point number based on a ratio of the first coefficient to the second coefficient.

[0070] In an embodiment, the second planning unit 300 is specifically configured to sort the bandwidth peak sum in descending order according to a numerical value; and select, for the sorted bandwidth peak sum, a bandwidth peak sum corresponding to a position of the bandwidth over-planning point number as the planning value sum.

[0071] In an embodiment, the third planning unit 400 includes a first judgment sub-unit 401. The first judgment sub-unit 401 is configured to determine the target node upper limit as the target planning line of the target node when the planning value sum is greater than the sum of the target node upper limits.

[0072] In an embodiment, the third planning unit 400 includes a second judgment sub-unit 402. The second judgment sub-unit 402 is configured to determine the target node minimum planning line as the target planning line of the target node when the planning value sum is not greater than the sum of the target node upper limits and the planning value sum is less than the sum of the target node minimum planning lines.

[0073] In one embodiment, the third planning unit 400 comprises a third determining sub-unit 403. The third determining sub-unit 403 is configured to determine a to-be-allocated planning value based on the planning value sum and the target node minimum planning line sum when the planning value sum is not greater than the target node upper limit sum and the planning value sum is not less than the target node minimum planning line sum, and determine the target planning line of the target node based on the to-be-allocated planning value.

[0074] In one embodiment, the third determining sub-unit 403 is specifically configured to sort the target nodes in ascending order according to node bandwidth prices; calculate an addition value of the to-be-allocated planning value and a first target node minimum planning line for a first target node in the sorted target nodes; compare the addition value with a first target node upper limit; determine a first target node planning line of the first target node according to a comparison result; update the to-be-allocated planning value by subtracting a first target node difference value from the to-be-allocated planning value, the first target node difference value being determined by the first target node upper limit and the first target node minimum planning line; and iteratively process a next node of the first target node until the to-be-allocated planning value is zero.

[0075] In one embodiment, the determining the first target node planning line according to the comparison result comprises: if the addition value is greater than or equal to the first target node upper limit, determining the first target node upper limit as the first target node planning line; or if the addition value is less than the first target node upper limit, determining the addition value as the first target node planning line.

[0076] Each unit described in the above embodiments can be implemented by a computer chip or a product with certain functions. A typical implementation device is a computer. Specifically, the computer can be a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

[0077] For the convenience of description, the above device is described in various units by functions. Of course, the functions of each unit can be implemented in one or more software and / or hardware in the implementation of the present application.

[0078] Please refer to Figure 4 The present disclosure also provides an electronic device comprising a memory and a processor, wherein the memory is configured to store a computer program, and the computer program is configured to be executed by the processor to implement the above-mentioned node resource planning method.

[0079] The present disclosure also provides a computer readable storage medium for storing a computer program, which, when executed by a processor, implements the node resource planning method described above.

[0080] The processor can be a Central Processing Unit (CPU). The processor can also be other general-purpose processors, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field-Programmable Gate Array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or a combination thereof.

[0081] The memory, as a non-transitory computer readable storage medium, can be used to store non-transitory software programs, non-transitory computer executable programs and modules, such as program instructions / modules corresponding to the method in the embodiments of the present disclosure. The processor executes various functions and data processing of the processor by running the non-transitory software programs, instructions and modules stored in the memory, that is, implements the method in the method embodiments described above.

[0082] The memory can include a program storage area and a data storage area. The program storage area can store an operating system and at least one application required by a function; the data storage area can store data created by the processor and the like. In addition, the memory can include a high-speed random access memory, and can also include a non-transitory memory, such as at least one magnetic disk storage device, a flash memory device, or other non-transitory solid-state memory device. In some embodiments, the memory can optionally include a memory remotely disposed relative to the processor, and these remote memories can be connected to the processor through a network. Examples of the above network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and a combination thereof.

[0083] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program. The program can be stored in a computer readable storage medium. When the program is executed, it can include the processes of the above-mentioned embodiment methods. The storage medium can be a magnetic disc, an optical disc, a read-only memory (ROM), a random access memory (RAM), a flash memory, a hard disk drive (HDD) or a solid-state drive (SSD), etc. The storage medium can also include a combination of the above-mentioned types of memories.

[0084] Each of the embodiments in the specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other. Each embodiment focuses on the difference from other embodiments. In particular, the embodiments of the device, the equipment and the storage medium are basically similar to the method embodiments, so the description is relatively simple, and the relevant parts can be referred to the part of the method embodiment.

[0085] The above only describes the embodiments of the present application and is not intended to limit the present application. Those skilled in the art can make various modifications and changes to the present application. Any modification, equivalent replacement, improvement, etc. within the spirit and principles of the present application shall be included in the scope of the claims of the present application.

[0086] Although the embodiments of the present disclosure are described in conjunction with the drawings, various modifications and changes can be made by those skilled in the art without departing from the spirit and scope of the present disclosure, and such modifications and changes fall within the scope defined by the appended claims.

Claims

1. A node resource planning method, characterized in that, The method includes: Obtain historical reference information for a target region containing multiple target nodes. The historical reference information includes the sum of the target node upper limits of each target node, the sum of the target node minimum planning lines of each target node, and the sum of the bandwidth peaks of the target nodes located in the user region. The sum of the bandwidth peaks is a data group divided according to a preset time granularity. The target node minimum planning line is determined based on the target node guarantee line, the target node billing line, and the target node upper limit. The number of points exceeding the bandwidth plan is determined based on the sum of the upper limits of the target nodes and the sum of the peak bandwidth. Based on the number of bandwidth over-planning points, the total planned value of the target region is determined from the bandwidth peak values. Based on the comparison results between the sum of the planned values ​​and the preset conditions, the target planning line of the target node is determined. The preset conditions include the node upper limit condition and the node minimum planning line condition. The step of determining the number of bandwidth overrun points based on the sum of the upper limits of the target nodes and the sum of the peak bandwidth includes: The first coefficient is determined based on the sum of the target node upper limits, the load test bandwidth discount coefficient, the number of preset time granularities per unit time, the monthly free time of billing nodes, and the utilization rate of free time. The second coefficient is determined based on the maximum value of the sum of the bandwidth peaks; The number of bandwidth over-planning points is determined based on the ratio of the first coefficient to the second coefficient.

2. The method according to claim 1, characterized in that, The minimum planning line for the target node is determined based on the target node safety line, the target node billing line, and the target node upper limit, including: For any of the target nodes, obtain the target node's minimum guarantee line, the target node's billing line, and the target node's maximum limit; The larger value between the target node's guarantee line and the target node's billing line is selected as the first comparison result; The smaller value between the first comparison result and the upper limit of the target node is selected as the second comparison result; The second comparison result is determined as the minimum planning line for the target node.

3. The method according to claim 1 or 2, characterized in that, The step of determining the total planned value of the target region from the bandwidth peak value based on the number of bandwidth over-planning points includes: The bandwidth peaks are sorted in descending order according to their numerical values; For the sorted sum of bandwidth peaks, select the sum of bandwidth peaks at the position corresponding to the number of bandwidth over-planning points, and use it as the total planned value.

4. The method according to claim 1 or 2, characterized in that, The determination of the target planning line for the target node based on the comparison result between the sum of the planned values ​​and the preset conditions includes at least one of the following: When the sum of the planned values ​​is greater than the sum of the upper limits of the target nodes, the upper limit of the target nodes is determined as the target planning line of the target nodes; When the sum of the planned values ​​is not greater than the sum of the upper limits of the target nodes, and the sum of the planned values ​​is less than the sum of the lowest planned lines of the target nodes, the lowest planned line of the target nodes is determined as the target planned line of the target nodes. When the sum of the planned values ​​is not greater than the sum of the upper limits of the target nodes and not less than the sum of the lowest planned lines of the target nodes, the planned values ​​to be allocated are determined based on the sum of the planned values ​​and the sum of the lowest planned lines of the target nodes, and the target planned lines of the target nodes are determined based on the planned values ​​to be allocated.

5. The method according to claim 4, characterized in that, The step of determining the target planning line of the target node based on the planning value to be assigned includes: The target nodes are sorted in ascending order based on their bandwidth prices. For the first node of the sorted target nodes, calculate the sum of the planning value to be assigned and the lowest planning line of the first node; Compare the sum with the upper limit of the first and second nodes; Based on the comparison results, the first planning line of the first node is determined; The planning value to be allocated is updated by subtracting the difference between the first and second nodes from the planning value to be allocated. The difference between the first and second nodes is determined by the upper limit of the first node and the lower limit of the planning line of the first node. Iteratively process the next node after the first node until the planned value to be assigned is zero.

6. The method according to claim 5, characterized in that, Determining the first planning line of the first node based on the comparison result includes: If the sum is greater than or equal to the upper limit of the first node, then the upper limit of the first node is determined as the first planning line of the first node; If the summed value is less than the upper limit of the first node, then the summed value is determined as the first planning line of the first node.

7. A node resource planning device, characterized in that, The device includes: The information acquisition unit is used to acquire historical reference information of a target region containing multiple target nodes. The historical reference information includes the sum of the target node upper limits of each target node, the sum of the target node minimum planning lines of each target node, and the sum of the bandwidth peaks of the target nodes located in the user region. The sum of the bandwidth peaks is a data group divided according to a preset time granularity. The target node minimum planning line is determined based on the target node guarantee line, the target node billing line, and the target node upper limit. The first planning unit is used to determine the number of bandwidth over-planning points based on the sum of the upper limits of the target nodes and the sum of the peak bandwidth. The second planning unit is used to determine the total planned value of the target region from the bandwidth peak value based on the number of bandwidth over-planning points. The third planning unit is used to determine the target planning line of the target node based on the comparison result between the sum of the planning values ​​and the preset conditions. The preset conditions include the node upper limit condition and the node minimum planning line condition. The step of determining the number of bandwidth overrun points based on the sum of the upper limits of the target nodes and the sum of the peak bandwidth includes: The first coefficient is determined based on the sum of the target node upper limits, the load test bandwidth discount coefficient, the number of preset time granularities per unit time, the monthly free time of billing nodes, and the utilization rate of free time. The second coefficient is determined based on the maximum value of the sum of the bandwidth peaks; The number of bandwidth over-planning points is determined based on the ratio of the first coefficient to the second coefficient.

8. An electronic device, characterized in that, The electronic device includes a memory and a processor, the memory being used to store a computer program that, when executed by the processor, implements the method as described in any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium is used to store a computer program that, when executed by a processor, implements the method as described in any one of claims 1 to 6.

Images