Bandwidth cost scheduling method and device, computer equipment, computer readable storage medium and computer program product

Abstract

The invention relates to a bandwidth cost scheduling method and device, computer equipment, a computer readable storage medium and a computer program product. The method comprises the following steps: acquiring a bandwidth allocation quantity and an original bandwidth proportion of a first service provider, and determining a unit proportion bandwidth quantity of the converged content distribution network by utilizing the bandwidth allocation quantity and the original bandwidth proportion; determining the real-time cost redundant bandwidth of the first service provider according to the total bandwidth cost data and the total real-time bandwidth data of the first service provider; according to the real-time cost redundancy bandwidth and the unit proportion bandwidth amount, determining the bandwidth switching amount proportion of the first service provider relative to the second service provider; and executing a bandwidth scheduling operation matched with the bandwidth cut amount proportion. By adopting the method, the bandwidth of the converged content distribution network can be dynamically scheduled and adjusted, and the overall resource utilization rate of the converged content distribution network is improved.

Description

Technical Field

[0001] The present application relates to the technical field of content distribution networks, and in particular to a bandwidth cost scheduling method, apparatus, computer equipment, computer-readable storage medium, and computer program product. Background Art

[0002] In the field of content distribution network technology, cost control is crucial for content distribution network service providers. Cost control mainly includes two aspects: bandwidth cost management and hardware equipment cost management. Since the cost of hardware equipment is difficult to change, the currently commonly used intelligent scheduling method is mainly implemented for bandwidth cost management.

[0003] In traditional technology, traffic monitoring tools can be used to monitor traffic data in real time to understand bandwidth usage, and intelligent traffic scheduling algorithms can be used to route user requests to the optimal content distribution network node based on the user's geographical location, network conditions, and node load. However, with the further development of content distribution network technology, a converged content distribution network has emerged that can aggregate resources from multiple service providers for converged transmission. How to combine existing intelligent scheduling methods with converged content distribution networks has become a problem that needs to be solved urgently. Summary of the invention

[0004] Based on this, it is necessary to provide a bandwidth cost scheduling method, apparatus, computer equipment, computer-readable storage medium and computer program product that can improve resource utilization of a converged content distribution network in response to the above technical problems.

[0005] In a first aspect, the present application provides a bandwidth cost scheduling method, which is applied to a converged content distribution network, wherein a first service provider and a second service provider exist in the converged content distribution network, including:

[0006] Acquire the bandwidth allocation and original bandwidth ratio of the first service provider, and determine the unit ratio bandwidth of the converged content distribution network by using the bandwidth allocation and the original bandwidth ratio;

[0007] determining a real-time cost redundant bandwidth of the first service provider according to the total bandwidth cost data and the total real-time bandwidth data of the first service provider;

[0008] Determining a bandwidth cut ratio of the first service provider to the second service provider according to the real-time cost redundant bandwidth and the unit ratio bandwidth;

[0009] A bandwidth scheduling operation matching the bandwidth slicing ratio is performed.

[0010] In one embodiment, determining the bandwidth cut ratio of the first service provider relative to the second service provider according to the real-time cost redundant bandwidth and the unit ratio bandwidth includes:

[0011] determining a comparison result of the total real-time bandwidth data of the first service provider and a node cost line of the first service provider;

[0012] Based on the comparison result, the real-time cost redundant bandwidth and the unit ratio bandwidth amount are processed to obtain the bandwidth cut ratio.

[0013] In one embodiment, the real-time cost redundant bandwidth and the unit ratio bandwidth are processed based on the comparison result to obtain the bandwidth cut ratio, including:

[0014] When the total real-time bandwidth data is less than the node cost line, the bandwidth cut ratio is determined by using the difference between the real-time cost redundant bandwidth and the cost redundant protection bandwidth of the first service provider and the unit ratio bandwidth amount.

[0015] In one embodiment, based on the comparison result, the real-time cost redundant bandwidth and the unit ratio bandwidth are processed to obtain the bandwidth cut ratio, including:

[0016] In the case where the total real-time bandwidth data is greater than the node cost line, the expected cut-off ratio is determined by using the absolute value of the real-time cost redundant bandwidth and the unit ratio bandwidth amount;

[0017] Determining the bandwidth ratio of the second service provider according to a comparison result of the integrated real-time bandwidth of the second service provider and the peak value corresponding to the current billing mode;

[0018] The bandwidth cutting ratio is determined according to the undertaken bandwidth ratio and the expected cutting ratio.

[0019] In one embodiment, determining the bandwidth ratio of the second service provider according to the comparison result of the integrated real-time bandwidth of the second service provider and the peak value corresponding to the current billing mode includes:

[0020] When the integrated real-time bandwidth is smaller than the peak value corresponding to the current charging mode, the undertaken bandwidth ratio is determined by using the difference between the integrated real-time bandwidth and the peak value corresponding to the current charging mode and the unit ratio bandwidth amount.

[0021] In one embodiment, the real-time cost redundant bandwidth and the unit ratio bandwidth are processed based on the comparison result to obtain the bandwidth cut ratio, including:

[0022] When the total real-time bandwidth data reaches the node cost line, the difference between the second service provider's integrated real-time bandwidth and the peak value corresponding to the current billing mode and the unit ratio bandwidth are used to determine the second service provider's undertaken bandwidth ratio, and the undertaken bandwidth ratio is used as the bandwidth cut ratio.

[0023] In a second aspect, the present application further provides a bandwidth cost scheduling device, which is applied to a converged content distribution network, wherein a first service provider and a second service provider exist in the converged content distribution network, including:

[0024] A ratio acquisition module, configured to acquire the bandwidth allocation amount and the original bandwidth ratio of the first service provider, and determine the unit ratio bandwidth amount of the converged content distribution network by using the bandwidth allocation amount and the original bandwidth ratio;

[0025] a redundancy determination module, configured to determine the real-time cost redundant bandwidth of the first service provider according to the total bandwidth cost data and the total real-time bandwidth data of the first service provider;

[0026] a bandwidth cut determination module, configured to determine a bandwidth cut ratio of the first service provider relative to the second service provider according to the real-time cost redundant bandwidth and the unit ratio bandwidth;

[0027] The bandwidth scheduling module is used to perform a bandwidth scheduling operation that matches the bandwidth slicing ratio.

[0028] In a third aspect, the present application further provides a computer device, wherein the computer device comprises a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the bandwidth cost scheduling method described in any one of the embodiments of the first aspect is implemented.

[0029] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the bandwidth cost scheduling method described in any one of the embodiments of the first aspect is implemented.

[0030] In a fifth aspect, the present application further provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, the bandwidth cost scheduling method of any one of the embodiments of the first aspect is implemented.

[0031] The above-mentioned bandwidth cost scheduling method, apparatus, computer equipment, computer-readable storage medium and computer program product obtain the bandwidth allocation amount and original bandwidth ratio of the first service provider, and use the bandwidth allocation amount and original bandwidth ratio to determine the unit ratio bandwidth of the converged content distribution network; determine the real-time cost redundant bandwidth of the first service provider based on the total bandwidth cost data and total real-time bandwidth data of the first service provider; determine the bandwidth cut ratio of the first service provider relative to the second service provider based on the real-time cost redundant bandwidth and the unit ratio bandwidth; perform bandwidth scheduling operations that match the bandwidth cut ratio, which can realize dynamic scheduling adjustment of the bandwidth of the converged content distribution network and improve the overall resource utilization of the converged content distribution network. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0033] Figure 1 A diagram of an application environment of a bandwidth cost scheduling method in an embodiment;

[0034] Figure 2 A schematic diagram of a flow chart of a bandwidth cost scheduling method in an embodiment;

[0035] Figure 3 A schematic flow chart of a step of determining a bandwidth cut ratio in one embodiment;

[0036] Figure 4 is a flow chart of a bandwidth cost scheduling method in another embodiment;

[0037] Figure 5 is a structural block diagram of a bandwidth cost scheduling device 500 in one embodiment;

[0038] Figure 6 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0039] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0040] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.

[0041] The bandwidth cost scheduling method provided in the embodiment of the present application can be applied to Figure 1 In the application environment shown, there are a first service provider node 102 provided by a first service provider and a second service provider node 104 provided by a second service provider in the converged content distribution network 100 .

[0042] Exemplarily, the converged content distribution network 100 can obtain the bandwidth allocation amount and the original bandwidth proportion of the first service provider from the first service provider node 102. The converged content distribution network 100 can calculate the unit ratio bandwidth amount corresponding to the unit ratio in the converged content distribution network 100 according to the bandwidth allocation amount and the original bandwidth proportion of the first service provider. The converged content distribution network 100 can read the total bandwidth cost data and the total real-time bandwidth data of the first service provider from the first service provider node 102, and determine the real-time cost redundant bandwidth of the first service provider using the total bandwidth cost data and the total real-time bandwidth data. The converged content distribution network 100 can determine the bandwidth cut ratio of the first service provider relative to the second service provider according to the real-time cost redundant bandwidth and the unit ratio bandwidth amount. The converged content distribution network 100 can perform a bandwidth scheduling operation that matches the bandwidth cut ratio.

[0043] In this embodiment, by utilizing the real-time cost redundancy of service providers, the bandwidth allocation ratio between different service providers in the converged content distribution network is dynamically and real-time adjusted, thereby achieving dynamic optimization of bandwidth resources, which helps to improve the cost-effectiveness and overall resource utilization of the entire converged content distribution network.

[0044] In an exemplary embodiment, Figure 2 As shown, a bandwidth cost scheduling method is provided, which is applied to Figure 1 The integrated content distribution network 100 in FIG. 1 is taken as an example to illustrate the method, which includes the following steps S202 to S208. Among them:

[0045] Step S202: Obtain the bandwidth allocation and original bandwidth ratio of the first service provider, and determine the unit bandwidth ratio of the converged content delivery network using the bandwidth allocation and original bandwidth ratio.

[0046] Among them, the unit bandwidth price coefficients of various service providers in the converged content distribution network are the same.

[0047] The bandwidth allocation amount may be used to characterize the bandwidth amount allocated by the converged content delivery network to the content delivery network node of the first service provider.

[0048] The raw bandwidth share may be used to represent the data share of the bandwidth allocation of the first service provider in the total bandwidth of the converged content delivery network.

[0049] The unit ratio bandwidth amount can be used to represent the bandwidth amount corresponding to the unit ratio (1%) in the converged content distribution network.

[0050] For example, the converged content delivery network can read the bandwidth allocation amount allocated to the first service provider and the original bandwidth ratio corresponding to the first service provider from the operation log, and perform calculations using the bandwidth allocation amount and the original bandwidth ratio to obtain the unit ratio bandwidth amount.

[0051] Optionally, in some implementations, the unit ratio bandwidth amount may be determined using the following formula:

[0052] E = X / N.

[0053] Where E represents the unit bandwidth ratio, X represents the bandwidth allocation, and N represents the original bandwidth ratio.

[0054] Step S204: determining the real-time cost redundant bandwidth of the first service provider according to the total bandwidth cost data and the total real-time bandwidth data of the first service provider.

[0055] The real-time cost redundant bandwidth may be used to indicate the amount of bandwidth that the first service provider can still receive without incurring corresponding bandwidth costs.

[0056] Exemplarily, the converged content distribution network can read the corresponding bandwidth cost data and real-time bandwidth data from each content distribution network node of the first service provider. The current total bandwidth cost data and total real-time bandwidth data of the first service provider are obtained by summarizing each content distribution network node. The real-time cost redundant bandwidth of the first service provider is calculated using the total bandwidth cost data and the total real-time bandwidth data.

[0057] Optionally, in some implementations, the real-time cost redundant bandwidth may be determined using the following formula:

[0058] R = C - B.

[0059] Wherein, R may represent the real-time cost redundant bandwidth, C may represent the total bandwidth cost data, and B may represent the total real-time bandwidth data.

[0060] Step S206: Determine the bandwidth cut ratio of the first service provider to the second service provider according to the real-time cost redundant bandwidth and the unit ratio bandwidth.

[0061] Exemplarily, the converged content distribution network may calculate a ratio value corresponding to the real-time cost redundant bandwidth using the real-time cost redundant bandwidth and the unit ratio bandwidth, and use the calculated ratio value as the bandwidth cut ratio of the first service provider to the second service provider.

[0062] Step S208: Execute a bandwidth scheduling operation that matches the bandwidth slicing ratio.

[0063] Exemplarily, when the bandwidth slicing ratio is greater than zero, a bandwidth scheduling operation of scheduling the bandwidth resources of the second service provider that matches the absolute value of the bandwidth slicing ratio to the first service provider may be performed. When the bandwidth slicing ratio is less than zero, a bandwidth scheduling operation of scheduling the bandwidth resources of the first service provider that matches the absolute value of the bandwidth slicing ratio to the second service provider may be performed.

[0064] In the above-mentioned bandwidth cost scheduling method, the unit ratio bandwidth amount corresponding to the unit ratio in the converged content distribution network is determined by the bandwidth allocation amount allocated to each service provider by the converged content distribution network and the original bandwidth ratio corresponding to the bandwidth allocation amount. According to the current real-time cost redundant bandwidth and unit ratio bandwidth amount of the service provider, the bandwidth cut ratio that can be scheduled and adjusted by the current service provider is determined, and a bandwidth scheduling operation matching the bandwidth cut ratio is performed. This can realize dynamic scheduling and adjustment of the bandwidth of the converged content distribution network and improve the overall resource utilization of the converged content distribution network.

[0065] In an exemplary embodiment, the above step S206 may further include: determining a comparison result between the total real-time bandwidth data of the first service provider and the node cost line of the first service provider. Based on the comparison result, the real-time cost redundant bandwidth and the unit ratio bandwidth are processed to obtain the bandwidth cut ratio.

[0066] The node cost line can be used to represent the critical point of the operating cost of each content distribution network node in the converged content distribution network, and is used to evaluate the economic efficiency of the content distribution node to ensure that its operating cost does not exceed the benefits it brings. The calculation of the node cost line involves multiple factors such as the minimum bandwidth value, the upper bandwidth value, the price coefficient, the billing type, and the billing value.

[0067] For example, the converged content distribution network can compare the total real-time bandwidth data of the current first service provider with the node cost line of the first service provider to obtain a comparison result of the total real-time bandwidth data and the node cost line. Based on the comparison result, the corresponding calculation method is used to calculate the real-time cost redundant bandwidth and the unit ratio bandwidth to obtain the bandwidth cut ratio in the current scenario.

[0068] In this embodiment, the node cost line is used to evaluate the current redundancy of the service provider. Based on the comparison result between the total real-time bandwidth data and the node cost line, a corresponding calculation method is used to determine the bandwidth cutting ratio in the current scenario. This can be adapted to a variety of different usage scenarios and improve the accuracy of the bandwidth cutting ratio.

[0069] Optionally, in some embodiments, when the total real-time bandwidth data is less than the node cost line, it can be determined that the current first service provider can still undertake a certain amount of bandwidth without incurring corresponding bandwidth costs. In this case, the real-time cost redundant bandwidth of the first service provider is generally greater than zero or greater than a certain reserved redundant protection bandwidth. Therefore, the scheduling strategy that can be executed at this time is: scheduling the bandwidth of other service providers in the converged content distribution network to the current first service provider, so as to reduce the bandwidth cost of a certain service provider in the converged content distribution network without incurring additional bandwidth costs for the first service provider, thereby maximizing the benefits of the converged content distribution network as a whole.

[0070] Optionally, in some implementations, the first service provider may include manufacturer A, and the second service provider may include manufacturer B and manufacturer C. During the initialization process, the converged content distribution network allocates 20% of the bandwidth to manufacturer A, 30% of the bandwidth to manufacturer B, and 50% of the bandwidth to manufacturer C. The real-time cost redundant bandwidth of manufacturer A is R (greater than zero at this time), and its cost redundant protection bandwidth is M (should be less than the real-time cost redundant bandwidth). The unit ratio bandwidth corresponding to each unit ratio (i.e. 1%) in the converged content distribution network is E.

[0071] The bandwidth cut ratio can be determined using the following formula:

[0072] P = (R - M) / E.

[0073] Wherein, P is the bandwidth cut ratio, R is the real-time cost redundant bandwidth, M is the cost redundant protection bandwidth, and E is the unit ratio bandwidth.

[0074] Since the calculated bandwidth cut ratio is greater than zero at this time, bandwidth matching the bandwidth cut ratio can be cut from manufacturer B and manufacturer C to manufacturer A. For example, when manufacturer B and manufacturer C adopt an average allocation method, a bandwidth scheduling operation matching the bandwidth cut ratio can be performed to cut P / 2 bandwidth from manufacturer B to manufacturer A, and cut P / 2 bandwidth from manufacturer C to manufacturer A. After the bandwidth scheduling operation is completed, the bandwidth allocation of manufacturer A accounts for 20%+P in the converged content distribution network, while the bandwidth allocation of manufacturer B accounts for 30%-P / 2 in the converged content distribution network, and the bandwidth allocation of manufacturer C accounts for 50%-P / 2 in the converged content distribution network.

[0075] In this embodiment, when the overall bandwidth of the first service provider does not reach the node cost line, the difference between the real-time cost redundant bandwidth and the cost redundant protection bandwidth of the first service provider is used to perform calculations and processing with the unit ratio bandwidth to obtain the bandwidth cut ratio. This can reduce the bandwidth cost of the second service provider through bandwidth scheduling within the scope of the first service provider, thereby reducing the overall bandwidth cost of the converged content distribution network.

[0076] In an exemplary embodiment, Figure 3 As shown, a method for determining the bandwidth cut ratio is also provided, including the following steps S302 to S306. Among them:

[0077] Step S302: when the total real-time bandwidth data is greater than the node cost line, the expected cut-off ratio is determined using the absolute value of the real-time cost redundant bandwidth and the unit ratio bandwidth.

[0078] Exemplarily, when the total real-time bandwidth data of the first service provider is greater than the node cost line of the first service provider, if the first service provider continues to undertake the bandwidth of the current original bandwidth ratio, the corresponding bandwidth cost will be incurred. In this case, the real-time cost redundancy data of the first service provider is less than zero. At this time, it is necessary to adjust the bandwidth according to the real-time bandwidth conditions of other service providers in the current converged content distribution network, converged billing, etc., so as to maximize the benefits of the converged content distribution network. Therefore, when the total real-time bandwidth data of the first service provider is greater than the node cost line of the first service provider, the converged content distribution network can use the absolute value of the real-time cost redundancy bandwidth of the first service provider and the unit ratio bandwidth to perform calculations and obtain the expected volume ratio.

[0079] Optionally, in some embodiments, the expected cut ratio may be determined using the following formula:

[0080] P = ABS(R) / E.

[0081] Wherein, P is the expected cut ratio. ABS() represents a function for taking an absolute value. R represents the real-time cost redundant bandwidth. E represents the unit ratio bandwidth.

[0082] Step S304: Determine the bandwidth ratio of the second service provider according to the comparison result of the integrated real-time bandwidth of the second service provider and the peak value corresponding to the current billing mode.

[0083] Among them, the billing mode may include but is not limited to the daily peak and monthly average mode, the traffic-based billing mode, the bandwidth-based billing mode, etc.

[0084] Exemplarily, the converged content distribution network may determine that the proportion of the bandwidth undertaken by the second service provider is 0 when the converged real-time bandwidth of the second service provider reaches the peak value corresponding to the currently used billing mode. When the converged real-time bandwidth of the second service provider is less than the peak value corresponding to the current billing mode, the current proportion of the bandwidth undertaken by the second service provider is calculated using the converged real-time bandwidth and the peak value corresponding to the current billing mode.

[0085] Step S306, determining the bandwidth cutting ratio according to the accepted bandwidth ratio and the expected cutting ratio.

[0086] For example, the converged content distribution network may use the expected cut ratio as the bandwidth cut ratio when the bearer bandwidth ratio is greater than the expected cut ratio, or use the bearer bandwidth ratio as the bandwidth cut ratio when the bearer bandwidth ratio is less than the expected cut ratio.

[0087] In this embodiment, when the cost redundancy of the first service provider reaches the node cost line, the bandwidth proportion that the second service provider can currently undertake is determined based on the peak value of the second service provider's converged real-time bandwidth and converged billing usage. The bandwidth cutting proportion currently within the bandwidth carrying range of the second service provider can be determined, thereby ensuring the stable operation of the converged content distribution network.

[0088] Optionally, in some implementations, step S304 may further include: when the integrated real-time bandwidth is less than the peak value corresponding to the current billing mode, determining the acceptance bandwidth ratio using the difference between the integrated real-time bandwidth and the peak value corresponding to the current billing mode and the unit ratio bandwidth.

[0089] For example, when it is determined that the converged real-time bandwidth of the second service provider is less than the peak value corresponding to the current billing mode, the converged content distribution network may use the following formula to determine the bandwidth ratio:

[0090] Q = D / E.

[0091] Wherein, Q may represent the bearer bandwidth ratio, D may represent the difference between the integrated real-time bandwidth and the peak value corresponding to the current billing mode, and E may represent the unit ratio bandwidth amount.

[0092] In this embodiment, when the second service provider has bandwidth carrying capacity, the proportion of the bearer bandwidth that the second service provider can currently receive is determined based on the difference between the current integrated real-time bandwidth of the second service provider and the peak value corresponding to the current billing model. This can improve the accuracy of determining the bearer bandwidth proportion and ensure the stable operation of the second service provider.

[0093] Optionally, in some implementations, when the current billing mode is a daily peak monthly average mode, the converged content distribution network may use the peak value of the bandwidth of the day as the peak value corresponding to the current billing mode. The first service provider in the converged content distribution network may include manufacturer A, and the second service provider may include manufacturer B and manufacturer C. When the total real-time bandwidth data of manufacturer A is greater than the node cost line, the expected cut-off ratio of manufacturer A may be determined by using the absolute value of the real-time cost redundant bandwidth of manufacturer A and the unit ratio bandwidth.

[0094] When the integrated real-time bandwidth of any service provider of manufacturer B or manufacturer C reaches the bandwidth peak of the day, and the integrated real-time bandwidth of the other service provider is less than the bandwidth peak of the day, the bearer bandwidth ratio of the service provider less than the bandwidth peak of the day can be determined based on the difference between the integrated real-time bandwidth of the service provider less than the bandwidth peak of the day and the bandwidth peak of the day and the unit ratio bandwidth. When the bearer bandwidth ratio of the service provider less than the bandwidth peak of the day is greater than or equal to the expected cut-off ratio of manufacturer A, the bandwidth of manufacturer A's expected cut-off ratio can be fully dispatched to the service provider less than the bandwidth peak of the day, while the bandwidth of the service provider greater than the bandwidth peak of the day remains unchanged. When the bearer bandwidth ratio of the service provider less than the bandwidth peak of the day is less than the expected cut-off ratio of manufacturer A, the bandwidth of manufacturer A at the bearer bandwidth ratio can be dispatched to the service provider less than the bandwidth peak of the day.

[0095] When neither manufacturer B nor manufacturer C reaches the bandwidth peak of the day, the following formula can be used to determine the bearer bandwidth ratio corresponding to each second service provider:

[0096] Q1 = D1 / E,

[0097] Q2 = D2 / E.

[0098] Q1 indicates the bearer bandwidth ratio of vendor B. D1 indicates the difference between the integrated real-time bandwidth of vendor B and the peak bandwidth of the day. Q2 indicates the bearer bandwidth ratio of vendor C. D2 indicates the difference between the integrated real-time bandwidth of vendor C and the peak bandwidth of the day. E indicates the unit ratio bandwidth.

[0099] If the sum of the bearer bandwidth ratios of manufacturer B and manufacturer C is greater than the expected cut ratio of manufacturer A, the expected cut ratio can be used as the bandwidth cut ratio, and the bandwidth under the bandwidth cut ratio in manufacturer A can be scheduled to manufacturer B and manufacturer C. The allocation ratio of the scheduled bandwidth in manufacturer B and manufacturer C can be determined based on the bearer bandwidth ratio of manufacturer B and manufacturer C. For example, the bandwidth allocation ratio can be determined by referring to the following formula:

[0100] Q1×P / (Q1+Q2),

[0101] Q2×P / (Q1+Q2).

[0102] Where, Q1 represents the bearer bandwidth ratio of manufacturer B. Q2 represents the bearer bandwidth ratio of manufacturer C. P represents the expected cut ratio of manufacturer A. Q1×P / (Q1+Q2) is the allocation ratio of manufacturer B. Q2×P / (Q1+Q2) is the allocation ratio of manufacturer C.

[0103] If the sum of the bearer bandwidth ratios of manufacturer B and manufacturer C is less than the expected cut-off ratio of manufacturer A, manufacturer B can only receive the bandwidth corresponding to the bearer bandwidth ratio scheduled from manufacturer A. Similarly, manufacturer C can only receive the bandwidth corresponding to the bearer bandwidth ratio scheduled from manufacturer A.

[0104] If the combined real-time bandwidth of vendor B and vendor C both reaches the peak bandwidth of the day, the bearer bandwidth ratio is 0. The bandwidth of vendor A cannot be dispatched to vendor B or vendor C.

[0105] In this embodiment, by adopting different methods to schedule bandwidth resources in the converged content distribution network according to different application scenarios, the flexibility of bandwidth cost scheduling can be improved.

[0106] In an exemplary embodiment, a method for determining a bandwidth cut ratio is also provided, comprising:

[0107] When the total real-time bandwidth data reaches the node cost line, the difference between the second service provider's integrated real-time bandwidth and the peak value corresponding to the current billing model and the unit ratio bandwidth are used to determine the second service provider's undertaken bandwidth ratio, and the undertaken bandwidth ratio is used as the bandwidth cut ratio.

[0108] Exemplarily, when the total real-time bandwidth data of the first service provider is equal to the node cost line, or the total real-time bandwidth data fluctuates near the node cost line, it is determined that the total real-time bandwidth data reaches the node cost line. At this time, the node resources of the first service provider have basically reached the cost line, and it is no longer possible to take on more bandwidth, but maintaining the current bandwidth will not incur additional bandwidth costs. In this case, the node resource real-time cost redundancy data of the first service provider is equal to zero or fluctuates between zero and the reserved redundant protection bandwidth. Since the bandwidth of the first service provider is saturated, it is necessary to schedule and adjust the bandwidth of the second service provider according to the converged real-time bandwidth, converged billing, etc. of the second service provider to maximize the revenue of the converged content distribution network.

[0109] The converged content distribution network can use the difference between the converged real-time bandwidth of the second service provider and the peak value corresponding to the current billing mode and the unit ratio bandwidth to perform calculation processing to determine the bandwidth ratio of the second service provider, and use the bandwidth ratio as the bandwidth cut ratio corresponding to the first service provider.

[0110] Optionally, in some implementations, when the second service provider includes manufacturer B and manufacturer C, if only one of the service providers has a converged real-time bandwidth that reaches the peak value corresponding to the current billing mode, the bearer bandwidth ratio of the service provider can be calculated according to the difference between the converged real-time bandwidth of the service provider whose converged real-time bandwidth is less than the peak value and the peak value and the unit proportional bandwidth amount, with reference to the following formula:

[0111] Q = D / (2 * E).

[0112] Wherein, Q may represent the bearer bandwidth ratio, D may represent the difference between the service provider's integrated real-time bandwidth and the peak value, and E may represent the unit ratio bandwidth amount.

[0113] Based on the proportion of the carrying bandwidth, the converged content distribution network can dispatch the bandwidth of the service provider whose converged real-time bandwidth reaches the peak value corresponding to the current billing model to the service provider whose converged real-time bandwidth is less than the peak value. At the same time, it can also prevent the real-time bandwidth of the service provider receiving the bandwidth from exceeding the bandwidth peak value of the day, leaving a certain cost redundancy.

[0114] If the combined real-time bandwidth of vendor B and vendor C both reaches the peak value corresponding to the current billing model, the bandwidth share of each service provider remains unchanged.

[0115] If the combined real-time bandwidth of vendor B and vendor C does not reach the peak value corresponding to the current billing model, neither vendor B nor vendor C will incur additional bandwidth costs, and there is no need to change the bandwidth share of each service provider.

[0116] In this embodiment, when the real-time cost redundant bandwidth of the first service provider is small, determining whether the second service provider needs to perform bandwidth scheduling based on the peak value corresponding to the second service provider's integrated real-time bandwidth and the current billing mode can improve the resource utilization of bandwidth cost scheduling.

[0117] In an exemplary embodiment, Figure 4 As shown, a bandwidth cost scheduling method is also provided, including the following steps S402 to S414. Among them:

[0118] Step S402: Obtain the bandwidth allocation and original bandwidth ratio of the first service provider, and determine the unit bandwidth ratio of the converged content delivery network using the bandwidth allocation and original bandwidth ratio.

[0119] Step S404: determining the real-time cost redundant bandwidth of the first service provider according to the total bandwidth cost data and the total real-time bandwidth data of the first service provider.

[0120] Step S406: determining a comparison result between the total real-time bandwidth data of the first service provider and the node cost line.

[0121] Exemplarily, the converged content distribution network can obtain and use the bandwidth allocation of the first service provider and the original bandwidth ratio of the first service provider to calculate the unit ratio bandwidth. The real-time cost redundant bandwidth of the first service provider is calculated using the total bandwidth cost data and the total real-time bandwidth data of the first service provider. Compare the total real-time bandwidth data of the first service provider with the node cost line. When the total real-time bandwidth data is less than the node cost line, execute step S408. When the total real-time bandwidth data reaches the node cost line, execute step S410. When the total real-time bandwidth data is greater than the node cost line, execute step S412.

[0122] Step S408: Determine the bandwidth cut ratio by using the difference between the real-time cost redundant bandwidth and the cost redundant protection bandwidth and the unit ratio bandwidth.

[0123] Step S410: determining a bandwidth cut ratio according to the integrated real-time bandwidth of the second service provider and a peak value corresponding to the current billing mode.

[0124] Step S412: determining the bandwidth cutting ratio according to the expected cutting ratio of the first service provider and the accepted bandwidth ratio of the second service provider.

[0125] Step S414: Execute a bandwidth scheduling operation that matches the bandwidth slicing ratio.

[0126] Exemplarily, after executing step S408, in the case of executing step S414, the bandwidth amount in the second service provider that matches the bandwidth cut ratio can be dispatched to the first service provider. After executing step S410, in the case of executing step S414, the bandwidth cut ratio of the first service provider is zero, and bandwidth scheduling based on the bandwidth cut ratio is implemented between the second service providers based on the bearer bandwidth ratio of the second service provider. After executing step S412, in the case of executing step S414, the bandwidth amount in the first service provider that matches the bandwidth cut ratio can be dispatched to the second service provider.

[0127] In this embodiment, by real-time monitoring and adjusting the bandwidth allocation of each service provider in the converged content distribution network, dynamic optimization of bandwidth resources is achieved, which can greatly improve the cost efficiency and resource utilization of the entire converged content distribution network while maintaining the high performance and reliability of each service provider.

[0128] It should be understood that, although the steps in the flowcharts involved in the above embodiments are displayed in sequence according to the indications of the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless there is a clear description in this article, there is no strict order restriction on the execution of these steps, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above embodiments may include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0129] Based on the same inventive concept, the embodiment of the present application also provides a bandwidth cost scheduling device for implementing the bandwidth cost scheduling method involved above. The implementation solution provided by the device to solve the problem is similar to the implementation solution recorded in the above method, so the specific limitations in one or more bandwidth cost scheduling device embodiments provided below can refer to the limitations of the bandwidth cost scheduling method above, and will not be repeated here.

[0130] In an exemplary embodiment, Figure 5 As shown, a bandwidth cost scheduling device 500 is provided, which is applied to a converged content distribution network, in which there are a first service provider and a second service provider, including: a ratio acquisition module 502, a redundancy determination module 504, a cut amount determination module 506 and a bandwidth scheduling module 508, wherein:

[0131] The ratio acquisition module 502 is used to acquire the bandwidth allocation amount and the original bandwidth ratio of the first service provider, and determine the unit ratio bandwidth amount of the converged content distribution network by using the bandwidth allocation amount and the original bandwidth ratio.

[0132] The redundancy determination module 504 is configured to determine the real-time cost redundant bandwidth of the first service provider according to the total bandwidth cost data and the total real-time bandwidth data of the first service provider.

[0133] The cut amount determination module 506 is used to determine the bandwidth cut amount ratio of the first service provider to the second service provider according to the real-time cost redundant bandwidth and the unit ratio bandwidth.

[0134] The bandwidth scheduling module 508 is used to perform bandwidth scheduling operations that match the bandwidth slicing ratio.

[0135] In an exemplary embodiment, the cutting amount determination module 506 includes: a cost comparison unit, which is used to determine the comparison result of the total real-time bandwidth data of the first service provider and the node cost line of the first service provider; a ratio calculation unit, which is used to process the real-time cost redundant bandwidth and the unit ratio bandwidth based on the comparison result to obtain the bandwidth cutting amount ratio.

[0136] In an exemplary embodiment, the ratio calculation unit is also used to determine the bandwidth cutting ratio by using the difference between the real-time cost redundant bandwidth and the cost redundant protection bandwidth of the first service provider and the unit ratio bandwidth when the total real-time bandwidth data is less than the node cost line.

[0137] In an exemplary embodiment, the ratio calculation unit includes: an expected determination subunit, which is used to determine the expected cutting ratio by using the absolute value of the real-time cost redundant bandwidth and the unit ratio bandwidth when the total real-time bandwidth data is greater than the node cost line; a bearer determination subunit, which is used to determine the second service provider's undertaken bandwidth ratio based on the comparison result of the second service provider's fused real-time bandwidth and the peak value corresponding to the current billing mode; and a ratio determination subunit, which is used to determine the bandwidth cutting ratio based on the undertaken bandwidth ratio and the expected cutting ratio.

[0138] In an exemplary embodiment, the bearer determination subunit is further used to determine the acceptance bandwidth ratio by using the difference between the fused real-time bandwidth and the peak value corresponding to the current billing mode and the unit ratio bandwidth when the fused real-time bandwidth is less than the peak value corresponding to the current billing mode.

[0139] In an exemplary embodiment, the proportion calculation unit is used to determine the second service provider's undertaken bandwidth proportion by using the difference between the second service provider's fused real-time bandwidth and the peak value corresponding to the current billing mode and the unit proportion bandwidth when the total real-time bandwidth data reaches the node cost line, and use the undertaken bandwidth proportion as the bandwidth cutting proportion.

[0140] Each module in the bandwidth cost scheduling device 500 can be implemented in whole or in part by software, hardware, or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute operations corresponding to each module.

[0141] In an exemplary embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as shown in FIG. Figure 6 As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. Among them, the processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store data such as bandwidth allocation, original bandwidth ratio, unit ratio bandwidth, real-time cost redundant bandwidth, bandwidth cut ratio, etc. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a bandwidth cost scheduling method is implemented.

[0142] Those skilled in the art will understand that Figure 6 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0143] In an exemplary embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the steps in the above-mentioned method embodiments when executing the computer program.

[0144] In an exemplary embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps in the above-mentioned method embodiments are implemented.

[0145] In an exemplary embodiment, a computer program product is provided, including a computer program, and when the computer program is executed by a processor, the steps in the above method embodiments are implemented.

[0146] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.

[0147] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0148] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A bandwidth cost scheduling method, characterized in that: Applied to a converged content distribution network, wherein a first service provider and a second service provider exist in the converged content distribution network; The method comprises: Acquire the bandwidth allocation and original bandwidth ratio of the first service provider, and determine the unit ratio bandwidth of the converged content distribution network by using the bandwidth allocation and the original bandwidth ratio; determining a real-time cost redundant bandwidth of the first service provider according to the total bandwidth cost data and the total real-time bandwidth data of the first service provider; Determining a bandwidth cut ratio of the first service provider to the second service provider according to the real-time cost redundant bandwidth and the unit ratio bandwidth; A bandwidth scheduling operation matching the bandwidth slicing ratio is performed.

2. The method according to claim 1, characterized in that: The determining, according to the real-time cost redundant bandwidth and the unit ratio bandwidth, the bandwidth cut ratio of the first service provider to the second service provider includes: determining a comparison result of the total real-time bandwidth data of the first service provider and a node cost line of the first service provider; Based on the comparison result, the real-time cost redundant bandwidth and the unit ratio bandwidth amount are processed to obtain the bandwidth cut ratio.

3. The method according to claim 2, characterized in that The step of processing the real-time cost redundant bandwidth and the unit ratio bandwidth based on the comparison result to obtain the bandwidth cut ratio includes: When the total real-time bandwidth data is less than the node cost line, the bandwidth cut ratio is determined by using the difference between the real-time cost redundant bandwidth and the cost redundant protection bandwidth of the first service provider and the unit ratio bandwidth amount.

4. The method according to claim 2, characterized in that: The step of processing the real-time cost redundant bandwidth and the unit ratio bandwidth based on the comparison result to obtain the bandwidth cut ratio includes: In the case where the total real-time bandwidth data is greater than the node cost line, the expected cut-off ratio is determined by using the absolute value of the real-time cost redundant bandwidth and the unit ratio bandwidth amount; Determining the bandwidth ratio of the second service provider according to a comparison result of the integrated real-time bandwidth of the second service provider and the peak value corresponding to the current billing mode; The bandwidth cutting ratio is determined according to the undertaken bandwidth ratio and the expected cutting ratio.

5. The method according to claim 4, characterized in that The determining the bandwidth ratio of the second service provider according to the comparison result of the integrated real-time bandwidth of the second service provider and the peak value corresponding to the current billing mode includes: When the integrated real-time bandwidth is smaller than the peak value corresponding to the current charging mode, the undertaken bandwidth ratio is determined by using the difference between the integrated real-time bandwidth and the peak value corresponding to the current charging mode and the unit ratio bandwidth amount.

6. The method according to claim 2, characterized in that The step of processing the real-time cost redundant bandwidth and the unit ratio bandwidth based on the comparison result to obtain the bandwidth cut ratio includes: When the total real-time bandwidth data reaches the node cost line, the difference between the integrated real-time bandwidth of the second service provider and the peak value corresponding to the current billing mode and the unit ratio bandwidth are used to determine the bandwidth ratio of the second service provider, and the bandwidth ratio is used as the bandwidth cutting ratio.

7. A bandwidth cost scheduling device, characterized in that: Applied to a converged content distribution network, wherein the converged content distribution network has a first service provider and a second service provider; the device comprises: A ratio acquisition module, configured to acquire the bandwidth allocation amount and the original bandwidth ratio of the first service provider, and determine the unit ratio bandwidth amount of the converged content distribution network by using the bandwidth allocation amount and the original bandwidth ratio; a redundancy determination module, configured to determine the real-time cost redundant bandwidth of the first service provider according to the total bandwidth cost data and the total real-time bandwidth data of the first service provider; a bandwidth cut determination module, configured to determine a bandwidth cut ratio of the first service provider relative to the second service provider according to the real-time cost redundant bandwidth and the unit ratio bandwidth; The bandwidth scheduling module is used to perform a bandwidth scheduling operation that matches the bandwidth slicing ratio.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

9. 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 6 are implemented.

10. A computer program product, comprising a computer program, 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 6 are implemented.

Images