CN113949741A - Scheduling method, scheduling device, electronic equipment and storage medium - Google Patents
Scheduling method, scheduling device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN113949741A CN113949741A CN202111196290.8A CN202111196290A CN113949741A CN 113949741 A CN113949741 A CN 113949741A CN 202111196290 A CN202111196290 A CN 202111196290A CN 113949741 A CN113949741 A CN 113949741A
- Authority
- CN
- China
- Prior art keywords
- time period
- cdn
- room
- sub
- scheduling times
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
- H04L43/0894—Packet rate
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/24—Monitoring of processes or resources, e.g. monitoring of server load, available bandwidth, upstream requests
- H04N21/2402—Monitoring of the downstream path of the transmission network, e.g. bandwidth available
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/25—Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
- H04N21/262—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
- H04N21/26208—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints
- H04N21/26216—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints involving the channel capacity, e.g. network bandwidth
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Abstract
The embodiment of the invention provides a scheduling method, a scheduling device, electronic equipment and a storage medium, wherein the method comprises the following steps: acquiring bandwidth data of each content delivery network CDN machine room in a first historical time period and service scheduling times of each CDN machine room in a second historical time period; for each CDN machine room, determining the ratio of the current bandwidth of the CDN machine room to the service scheduling times based on the acquired bandwidth data of the CDN machine room and the service scheduling times; calculating the current bandwidth value of the CDN computer room according to the ratio of the current bandwidth of the CDN computer room to the service scheduling times and the current scheduling times; and adjusting the service scheduling times scheduled to the CDN machine room in the next time period based on the size relation between the current bandwidth value of the CDN machine room and the preset bandwidth threshold value of the CDN machine room. The embodiment of the invention can reduce the time delay of scheduling feedback and improve the accuracy of the scheduling strategy.
Description
Technical Field
The present invention relates to the field of scheduling technologies, and in particular, to a scheduling method, a scheduling apparatus, an electronic device, and a storage medium.
Background
Video source data is usually stored in a CDN (Content Delivery Network) server for downloading and playing by an end user. In practical application, different regions and operators access to CDN rooms of various cooperators, and the service capabilities, service qualities, bandwidth costs, charging rules, and the like of each cooperator and each CDN room are different. When a terminal user has a demand for downloading and playing video data, a downloading request aiming at a target video is sent to the scheduling server, and then the scheduling server determines a target CDN machine room for responding to the downloading request of the user from each CDN machine room based on factors such as the service quality, the service capacity and the like of each CDN machine room, and schedules the downloading request of the user to the target CDN machine room. For example, the bandwidth capacity of a CDN room is 200G, and after receiving a download request from a user, the scheduling server needs to control the user demand scheduled to the CDN room to not exceed 200G, so as to ensure the service quality of the CDN room.
In the related art, the implementation process of scheduling the download request of the user by the scheduling server is as follows: in unit time of a historical time period, the scheduling server counts the number of times each CDN machine room is scheduled and bandwidth data corresponding to the scheduling fed back by the CDN machine rooms, and then determines a target CDN machine room required to be scheduled by a user download request in the next unit time based on the number of times each CDN machine room is scheduled and the corresponding bandwidth data. The historical time period may be one hour, one day or one week, etc. prior to the current time, and the unit time may be 3 minutes, 5 minutes, 10 minutes, etc.
However, in practical applications, limited by factors such as geographical distances between the scheduling server and each CDN room, network states, and the like, bandwidth data corresponding to scheduling of each CDN room acquired by the scheduling server lags behind the corresponding scheduled times in time, so that real-time bandwidth data corresponding to scheduling of each CDN room cannot be acquired, and further, delay of video scheduling feedback is large, and accuracy of the determined scheduling policy is not high based on the acquired scheduled times and corresponding bandwidth data of each CDN room.
Disclosure of Invention
Embodiments of the present invention provide a scheduling method, a scheduling apparatus, an electronic device, and a storage medium, so as to reduce a time delay of scheduling feedback and improve accuracy of a scheduling policy. The specific technical scheme is as follows:
in a first aspect of the present invention, there is provided a scheduling method, where the method includes:
acquiring bandwidth data of each content delivery network CDN machine room in a first historical time period and service scheduling times of each CDN machine room in a second historical time period;
for each CDN machine room, determining the ratio of the current bandwidth of the CDN machine room to the service scheduling times based on the acquired bandwidth data of the CDN machine room and the service scheduling times;
calculating the current bandwidth value of the CDN computer room according to the ratio of the current bandwidth of the CDN computer room to the service scheduling times and the current scheduling times;
and adjusting the service scheduling times scheduled to the CDN machine room in the next time period based on the size relation between the current bandwidth value of the CDN machine room and the preset bandwidth threshold value of the CDN machine room.
Optionally, the obtaining bandwidth data of each content delivery network CDN room in a first historical time period and the service scheduling times of each CDN room in a second historical time period includes:
dividing the first historical time period into a plurality of sub-time periods according to a first unit time length to obtain each first sub-time period;
acquiring bandwidth data of each CDN machine room in each first sub-time period in the first historical time period;
dividing the second historical time period into a plurality of sub-time periods according to a second unit time length to obtain each second sub-time period;
acquiring service scheduling times of each CDN machine room in each second sub-time period in the second historical time period;
wherein the first historical time period is included in the second historical time period, and the first sub-time period is greater than the second sub-time period.
Optionally, the determining a ratio of the current bandwidth of the CDN room to the number of service schedules based on the obtained bandwidth data of the CDN room and the number of service schedules includes:
dividing the service scheduling times of the CDN computer room in each second sub-time period in the second historical time period into a preset number of groups according to a preset length in a mode that the starting time of the second historical time period is sequentially increased, wherein the preset length is determined according to the length of the first historical time period, and the preset number is determined based on the lengths of the first historical time period and the second historical time period;
and determining the ratio of the current bandwidth of the CDN computer room to the service scheduling times based on the preset number of groups and the bandwidth data of the CDN computer room in each first sub-time period in the first historical time period.
Optionally, the determining a ratio of a current bandwidth of the CDN room to the number of service scheduling times based on the preset number of packets and the bandwidth data of the CDN room in each first sub-time period within the first historical time period includes:
aggregating the service scheduling times in each second sub-time period in each group to obtain target scheduling times in a plurality of first sub-time periods of the group;
respectively calculating the ratio of the bandwidth corresponding to each group to the service scheduling times and the sum of the squares of the residuals based on the bandwidth data of the CDN computer room in each first sub-time period in the first historical time period and the target scheduling times contained in the preset number of groups;
and determining the ratio of the bandwidth corresponding to the packet with the minimum residual square sum to the service scheduling times as the ratio of the current bandwidth of the CDN computer room to the service scheduling times.
Optionally, the adjusting the number of service scheduling times scheduled to the CDN room in the next time period based on a size relationship between the current bandwidth value of the CDN room and a preset bandwidth threshold of the CDN room includes:
judging whether the current bandwidth value of the CDN computer room is larger than a preset bandwidth threshold value of the CDN computer room;
if the number of the service scheduling times is larger than the preset threshold, reducing the service scheduling times scheduled to the CDN computer room in the next time period;
and if not, increasing the scheduling times of scheduling to the CDN computer room in the next time period.
In a second aspect of the present invention, there is also provided a scheduling apparatus, including:
the acquisition module is used for acquiring bandwidth data of each content delivery network CDN machine room in a first historical time period and service scheduling times of each CDN machine room in a second historical time period;
the determining module is used for determining the ratio of the current bandwidth of each CDN machine room to the service scheduling times based on the acquired bandwidth data of the CDN machine room and the service scheduling times;
the calculation module is used for calculating the current bandwidth value of the CDN computer room according to the ratio of the current bandwidth of the CDN computer room to the service scheduling times and the current scheduling times;
and the adjusting module is used for adjusting the service scheduling times scheduled to the CDN computer room in the next time period based on the size relation between the current bandwidth value of the CDN computer room and the preset bandwidth threshold value of the CDN computer room.
Optionally, the obtaining module includes:
the first dividing module is used for dividing the first historical time period into a plurality of sub-time periods according to a first unit time length to obtain each first sub-time period;
a first obtaining submodule, configured to obtain bandwidth data of each CDN room in each first sub-time period within the first historical time period;
the second division submodule is used for dividing the second historical time period into a plurality of sub-time periods according to a second unit time length to obtain each second sub-time period;
the second obtaining submodule is used for obtaining the service scheduling times of each CDN computer room in each second sub-time period in the second historical time period; wherein the first historical time period is included in the second historical time period, and the first sub-time period is greater than the second sub-time period.
Optionally, the determining module includes:
a third division submodule, configured to divide the service scheduling times of the CDN room in each second sub-time period within the second historical time period into a preset number of groups in a manner that a preset length is sequentially incremented by a start time of the second historical time period, where the preset length is determined according to a length of the first historical time period, and the preset number is determined based on the lengths of the first historical time period and the second historical time period;
and the determining submodule is used for determining the ratio of the current bandwidth of the CDN computer room to the service scheduling times based on the preset number of groups and the bandwidth data of the CDN computer room in each first sub-time period in the first historical time period.
In another aspect of the present invention, there is also provided an electronic device, including a processor, a communication interface, a memory and a communication bus, where the processor, the communication interface, and the memory complete communication with each other through the communication bus;
a memory for storing a computer program;
and a processor for implementing the steps of any of the above scheduling methods when executing the program stored in the memory.
In yet another aspect of the present invention, there is also provided a computer-readable storage medium, in which a computer program is stored, and the computer program, when executed by a processor, implements the steps of any of the scheduling methods described above.
In yet another aspect of the present invention, there is also provided a computer program product containing instructions which, when run on a computer, cause the computer to perform the steps of any of the scheduling methods described above.
According to the scheduling method, the scheduling device, the electronic device and the storage medium provided by the embodiment of the invention, for each CDN computer room, the ratio of the current bandwidth of the CDN computer room to the service scheduling times can be determined through the bandwidth data and the service scheduling times of the CDN computer room in a historical time period, and further, the current bandwidth value of the CDN computer room is calculated by combining the ratio and the current scheduling times of the CDN computer room, so that the problem that the scheduling feedback time delay is large due to the fact that real-time bandwidth data cannot be obtained in the prior art is solved. Furthermore, under the condition that the current bandwidth value of the CDN room is obtained, the number of service scheduling times scheduled to the CDN room in the next time period can be adjusted based on the calculated size relationship between the current bandwidth value of the CDN room and the preset bandwidth threshold of the CDN room, so that the accuracy of the scheduling policy is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below.
Fig. 1 is a schematic flowchart of a scheduling method according to an embodiment of the present invention;
FIG. 2 is a schematic flow chart illustrating an embodiment of obtaining historical data according to the present invention;
fig. 3 is a schematic flow chart of an implementation of determining a ratio of a current bandwidth to a service scheduling number according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a scheduling apparatus according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be described below with reference to the drawings in the embodiments of the present invention.
In order to solve the problem that in the related art, bandwidth data corresponding to scheduling of each CDN room acquired by a scheduling server lags behind corresponding scheduled times in time, so that real-time bandwidth data corresponding to scheduling of each CDN room cannot be acquired, and further, delay of video scheduling feedback is large, so that a determined scheduling policy is not high in accuracy based on the acquired scheduled times of each CDN room and the corresponding bandwidth data, an embodiment of the present invention provides a scheduling method, a scheduling apparatus, an electronic device, and a storage medium. The scheduling method provided by the embodiment of the invention comprises the following steps:
acquiring bandwidth data of each content delivery network CDN machine room in a first historical time period and service scheduling times of each CDN machine room in a second historical time period;
for each CDN machine room, determining the ratio of the current bandwidth of the CDN machine room to the service scheduling times based on the acquired bandwidth data of the CDN machine room and the service scheduling times;
calculating the current bandwidth value of the CDN computer room according to the ratio of the current bandwidth of the CDN computer room to the service scheduling times and the current scheduling times;
and adjusting the service scheduling times scheduled to the CDN machine room in the next time period based on the size relation between the current bandwidth value of the CDN machine room and the preset bandwidth threshold value of the CDN machine room.
According to the scheduling method provided by the embodiment of the invention, for each CDN computer room, the ratio of the current bandwidth of the CDN computer room to the service scheduling times can be determined through the bandwidth data and the service scheduling times of the CDN computer room in a historical time period, and further, the current bandwidth value of the CDN computer room is calculated by combining the ratio and the current scheduling times of the CDN computer room, so that the problem that the scheduling feedback time delay is large due to the fact that real-time bandwidth data cannot be obtained in the prior art is solved. Furthermore, under the condition that the current bandwidth value of the CDN room is obtained, the number of service scheduling times scheduled to the CDN room in the next time period can be adjusted based on the calculated size relationship between the current bandwidth value of the CDN room and the preset bandwidth threshold of the CDN room, so that the accuracy of the scheduling policy is improved.
The following describes a scheduling method provided by an embodiment of the present invention in detail:
for the convenience of understanding, the related terms in the embodiments of the present invention are explained first:
CDN machine room: a set of servers that provide services to users. In the service scheduling application of the embodiment of the invention, the minimum unit is the service scheduling unit.
Bandwidth: traffic through the network card per second. The bandwidth of the CDN room represents an average value of a sum of total bandwidths of all servers of the CDN room over a period of time.
Service scheduling times are as follows: and scheduling the service scheduling times to a certain CDN machine room within unit time length.
Ratio of bandwidth to service scheduling times: indicating the bandwidth value used per traffic schedule.
As shown in fig. 1, a scheduling method provided in the embodiment of the present invention can be implemented by the following steps:
s101, acquiring bandwidth data of each CDN room of the content delivery network in a first historical time period and service scheduling times of each CDN room in a second historical time period.
An execution main body of the scheduling method provided by the embodiment of the present invention may be a scheduling server, and the scheduling server obtains bandwidth data of each CDN room in a first historical time period and service scheduling times of each CDN room in a second historical time period in a process of implementing service scheduling. The service scheduling may be video scheduling, advertisement scheduling, news scheduling, or the like, and the embodiment of the present invention is not limited herein.
In practical application, the bandwidth data of each CDN room is provided by a third party, and a corresponding time point is marked, and the service scheduling times of each CDN room can be marked and counted by the scheduling server at the time point, so that time point misalignment may exist between the bandwidth data of each CDN room and the service scheduling times within a historical time period acquired by the scheduling server. For example, the obtained bandwidth data of the CDN room at the marked time point is 0, which may indicate that the CDN room is service scheduling times between the marked time points [1, 6], may also indicate that the CDN room is service scheduling times between the marked time points [ -2,3), and so on, where the marked time point of the current time point may be defined as 0, and accordingly, the time point before the current time point may be marked as a negative number less than 0, and the time point after the current time point may be marked as a positive number greater than 0, that is, the obtained bandwidth data of the CDN room at the marked time point is 0, which may correspond to the service scheduling times that are ahead or behind by a period of time. In order to determine an accurate corresponding relationship between bandwidth data of each CDN room and the number of service schedules, in this embodiment of the present invention, the first historical time period may be set to be included in the second historical time period.
Illustratively, the first and second historical time periods may be a time period within tens of minutes, hours, a day, a week, or the like, prior to the current time. For example, the first historical period of time may be 60 to 30 minutes before the current time, the second historical period of time may be 60 to 20 minutes before the current time, or the first historical period of time may be 90 to 50 minutes before the current time, the second historical period of time may be 90 to 30 minutes before the current time, and so on.
In the embodiment of the invention, the bandwidth data of each CDN machine room in the first historical time period and the service scheduling times of each CDN machine room in the second historical time period containing the first historical time period are obtained, so that the corresponding relation between the bandwidth data of each CDN machine room and the service scheduling times can be more accurately determined.
And S102, determining the ratio of the current bandwidth of the CDN computer room to the service scheduling times based on the acquired bandwidth data of the CDN computer room and the service scheduling times for each CDN computer room.
After the bandwidth data of each CDN room in the first historical time period and the service scheduling times of each CDN room in the second historical time period are obtained, for each CDN room, the obtained bandwidth data of the CDN room in the first historical time period and the service scheduling times of the CDN room in the second historical time period may be aligned by using a least square method to determine a correspondence between the bandwidth data of the CDN room in the first historical time period and the service scheduling times, and based on the correspondence, a ratio of the current bandwidth of the CDN room to the service scheduling times is estimated.
For example, the obtained bandwidth data of the CDN room in the first historical time period may be fitted with the service scheduling times of the CDN room in the second historical time period by using a least square method to obtain an optimal correspondence between the bandwidth data of the CDN room in the first historical time period and the service scheduling times, and then a ratio of the bandwidth and the service scheduling times in the optimal correspondence is determined as a ratio of the current bandwidth of the CDN room to the service scheduling times.
Of course, the bandwidth data of the CDN room in the first historical time period obtained may also be aligned with the service scheduling times of the CDN room in the second historical time period by other methods, for example, a maximum likelihood method.
And S103, calculating the current bandwidth value of the CDN computer room according to the ratio of the current bandwidth of the CDN computer room to the service scheduling times and the current scheduling times.
The scheduling server can obtain the current scheduling times of each CDN room, and after determining the ratio of the current bandwidth of each CDN room to the service scheduling times, for each CDN room, the current bandwidth value of the CDN room can be calculated according to the ratio of the current bandwidth of the CDN room to the service scheduling times and the current scheduling times.
As an optional implementation manner in the embodiment of the present invention, for each CDN room, a ratio of a current bandwidth of the CDN room to a service scheduling time may be multiplied by the current scheduling time of the CDN room, and a result of the multiplication is determined as a current bandwidth value of the CDN room.
And S104, adjusting the service scheduling times scheduled to the CDN computer room in the next time period based on the size relation between the current bandwidth value of the CDN computer room and the preset bandwidth threshold value of the CDN computer room.
In practical application, bandwidth capacity, service quality, bandwidth cost, charging rules and the like of different CDN rooms are different, and after the current bandwidth value of each CDN room is determined, the number of service scheduling times scheduled to the CDN room in the next time period may be adjusted according to a size relationship between the current bandwidth value of the CDN room and a preset bandwidth threshold of the CDN room for each CDN room.
As an optional implementation manner in the embodiment of the present invention, for each CDN room, an implementation process for adjusting the number of service scheduling times scheduled to the CDN room in a next time period based on a size relationship between a current bandwidth value of the CDN room and a preset bandwidth threshold of the CDN room may include:
judging whether the current bandwidth value of the CDN computer room is larger than a preset bandwidth threshold value of the CDN computer room;
if the number of the service scheduling times is larger than the preset threshold, reducing the service scheduling times scheduled to the CDN computer room in the next time period;
and if not, increasing the scheduling times of scheduling to the CDN computer room in the next time period.
If the current bandwidth value of the CDN room is greater than the preset bandwidth threshold of the CDN room, it indicates that the current load of the CDN room is large, and may exceed the service capability of the CDN room, which further affects the service quality, so that the number of times of service scheduling to the CDN room in the next time period may be reduced. The next time period may be a next unit time period, for example, 1 minute, 2 minutes, or 5 minutes after the current time, and so on.
If the current bandwidth value of the CDN room is not greater than the preset bandwidth threshold of the CDN room, it indicates that the current load of the CDN room can carry service scheduling, and there may be a certain surplus, so that the number of times of scheduling to the CDN room in the next time period can be increased, so as to more fully utilize resources of the CDN room.
As an optional implementation manner of the embodiment of the present invention, the scheduling server may receive a service scheduling request sent by a terminal user, and further schedule the service scheduling request to a CDN room capable of processing the service based on a situation that each CDN room can be scheduled in a next time period.
According to the scheduling method provided by the embodiment of the invention, for each CDN computer room, the ratio of the current bandwidth of the CDN computer room to the service scheduling times can be determined through the bandwidth data and the service scheduling times of the CDN computer room in a historical time period, and further, the current bandwidth value of the CDN computer room is calculated by combining the ratio and the current scheduling times of the CDN computer room, so that the problem that the scheduling feedback time delay is large due to the fact that real-time bandwidth data cannot be obtained in the prior art is solved. Furthermore, under the condition that the current bandwidth value of the CDN room is obtained, the number of service scheduling times scheduled to the CDN room in the next time period can be adjusted based on the calculated size relationship between the current bandwidth value of the CDN room and the preset bandwidth threshold of the CDN room, so that the accuracy of the scheduling policy is improved.
As an optional implementation manner of the embodiment of the present invention, as shown in fig. 2, the implementation manner of obtaining bandwidth data of each CDN room of the content delivery network in the first historical time period and the service scheduling times of each CDN room in the second historical time period in step S101 may include:
s201, dividing the first historical time period into a plurality of sub-time periods according to the first unit time length to obtain each first sub-time period.
In the embodiment of the invention, the bandwidth data of each CDN computer room in the first historical time period can be acquired by taking the first unit time length as the time granularity. Specifically, the first historical time period is divided into a plurality of sub-time periods according to the first unit time length to obtain each first sub-time period, and then bandwidth data of each CDN room in each first sub-time period in the first historical time period is obtained.
For example, the first unit time length is 5 minutes, the first historical time period may be divided into a plurality of sub-time periods with time lengths of 5 minutes, and each of the first sub-time periods is obtained. For example, if the first historical time period is 65 minutes to 31 minutes before the current time, the time period is divided into 5 minutes to obtain a plurality of first sub-time periods of 65-61, 60-56, … …, 35-31, etc. The first unit time may also be 4 minutes, 8 minutes, 10 minutes, and the like, which is not limited in the embodiment of the present invention.
S202, bandwidth data of each CDN computer room in each first sub-time period in the first historical time period is obtained.
In the embodiment of the invention, the average value of the bandwidth data of each CDN computer room in each first sub-time period in the first historical time period is determined as the bandwidth data of each CDN computer room in each first sub-time period in the first historical time period.
And S203, dividing the second historical time period into a plurality of sub-time periods according to the second unit time length to obtain each second sub-time period.
In the embodiment of the present invention, the service scheduling times of each CDN room in the second historical time period may be obtained with the second unit time length as the time granularity. Specifically, the second historical time period is divided into a plurality of sub-time periods according to the second unit time length to obtain each second sub-time period, and then the service scheduling times of each CDN room in each second sub-time period in the second historical time period are obtained.
For example, the second unit time length is 1 minute, the second historical time period may be divided into a plurality of sub-time periods with the time length of 1 minute, and each second sub-time period is obtained. For example, if the second historical time period is 65 minutes to 21 minutes before the current time, the plurality of second sub-time periods having a time length of 1 minute may be obtained by dividing the time length by the unit time length of 1 minute. The second unit time may also be 2 minutes, 4 minutes, 5 minutes, and the like, which is not limited in the embodiment of the present invention.
And S204, acquiring the service scheduling times of each CDN machine room in each second sub-time period in the second historical time period.
In the embodiment of the invention, the total number of the service scheduling times of each CDN machine room in each second sub-time period in the second historical time period is determined as the service scheduling times of each CDN machine room in each second sub-time period in the second historical time period.
The first history time period is contained in the second history time period, and the first sub-time period is larger than the second sub-time period.
In practical application, time point dislocation may exist between bandwidth data of each CDN room and service scheduling times within a historical time period acquired by a scheduling server, so that a first historical time period is set to be included in a second historical time period, and a first sub-time period is greater than a second sub-time period. And further dividing the first historical time period into a plurality of sub-time periods according to the first unit time length, obtaining bandwidth data of each CDN machine room in each first sub-time period in the first historical time period, dividing the second historical time period into a plurality of sub-time periods according to the second unit time length, and obtaining service scheduling times of each CDN machine room in each second sub-time period in the second historical time period, so that the obtained service scheduling times are more than the bandwidth data, and further, the bandwidth data of the CDN machine room and the service scheduling times can be better aligned under the condition that time point dislocation exists between the bandwidth data of the CDN machine room and the service scheduling times.
As an optional implementation manner of the embodiment of the present invention, as shown in fig. 3, the implementation manner of determining, in step S102, a ratio of a current bandwidth of the CDN room to a service scheduling time based on the obtained bandwidth data of the CDN room and the service scheduling time may include:
and S301, dividing the service scheduling times of the CDN computer room in each second sub-time period in the second historical time period into a preset number of groups in a mode that the preset length is sequentially increased by the starting time of the second historical time period.
The preset length is determined according to the length of the first historical time period, and the preset number is determined according to the lengths of the first historical time period and the second historical time period.
In the embodiment of the invention, after the bandwidth data of each CDN machine room in each first sub-time period in the first historical time period and the service scheduling times of each CDN machine room in each second sub-time period in the second historical time period are obtained, the service scheduling times of the CDN machine rooms in each second sub-time period in the second historical time period are divided into the preset number of groups for each CDN machine room.
Illustratively, the first historical period is 65 minutes to 31 minutes before the current time, one unit length is expressed in granularity of 1 minute, the length of the first historical period is 35, and the preset length is set to be 35. The second history period is 65 minutes to 21 minutes before the current time, one unit length is expressed in granularity of 1 minute, the length of the second history period is 45, and the preset number is set to be 11 as the length of the second history period-the length of the first history period +1, i.e., 45-35+ 1.
Namely, the service scheduling times of the CDN room in each second sub-time period in the second historical time period are divided into a preset number (11) of packets according to a preset length (35) in a manner that the starting time (65 minutes before the current time) of the second historical time period sequentially increases, where each packet includes the service scheduling times in the second sub-time periods.
Illustratively, the data sequence corresponding to the service scheduling times in each packet obtained after the packet is shown in table 1 below, where QPS represents the historical service scheduling times, QPS [ -65] represents the service scheduling times at the 65 th minute before the current time, QPS [ -64] represents the service scheduling times at the 64 th minute before the current time, and so on.
Table 1 service scheduling times grouping
| Group number | Service scheduling times data sequence |
| 1 | QPS[-65]，QPS[-64]，……，QPS[-31] |
| 2 | QPS[-64]，QPS[-63]，……，QPS[-30] |
| 3 | QPS[-63]，QPS[-62]，……，QPS[-29] |
| …… | …… |
| 10 | QPS[-56]，QPS[-55]，……，QPS[-22] |
| 11 | QPS[-55]，QPS[-54]，……，QPS[-21] |
And S302, determining the ratio of the current bandwidth of the CDN computer room to the service scheduling times based on the preset number of groups and the bandwidth data of the CDN computer room in each first sub-time period in the first historical time period.
After obtaining a preset number of packets, for each packet, aligning the service scheduling times in each packet with the bandwidth data of the CDN room in the first historical time period by combining the service scheduling times in each second sub-time period included in the packet and the bandwidth data of the CDN room in each first sub-time period in the first historical time period, and further obtaining a ratio of the current bandwidth of the CDN room to the service scheduling times.
As an optional implementation manner of the embodiment of the present invention, the step S302 is an implementation process of determining a ratio of a current bandwidth of the CDN room to a service scheduling frequency based on a preset number of packets and bandwidth data of the CDN room in each first sub-time period within a first historical time period, and may include:
step one, aiming at each group, aggregating the service scheduling times in each second sub-time period in the group to obtain the target scheduling times in a plurality of first sub-time periods of the group.
And for each CDN computer room, dividing the service scheduling times of the CDN computer room in each second sub-time period in the second historical time period into a preset number of groups, and then aggregating the service scheduling times in each second sub-time period in each group for each group to obtain the target scheduling times of the group in a plurality of first sub-time periods.
Illustratively, the length of the first sub-time period is 5 minutes, and the length of the second sub-time period is 1 minute, then, after dividing the service scheduling times of the CDN room in each second sub-time period in the second historical time period into a preset number of groups, for each group, aggregating the service scheduling times in each sub-time period with a duration of 1 minute in the group, to obtain a plurality of target scheduling times in the sub-time period with a duration of 5 minutes in the group. It can be understood that the service scheduling times in the sub-time periods with the time lengths of 5 minutes are aggregated, so that the target scheduling times in the sub-time periods with the time lengths of 5 minutes of the group are obtained.
For example, in packet 1, QPS5m [ -60] represents an average value of the number of traffic scheduling times per minute from the 65 th minute to the 61 th minute before the current time, QPS5m [ -60] ═ avg (QPS [ -65], QPS [ -64], … …, QPS [ -61]) can be calculated by the expression, QPS5m [ -55] represents an average value of the number of traffic scheduling times per minute from the 60 th minute to the 56 th minute before the current time, and QPS5m [ -55] ═ avg (QPS [ -60], QPS [ -59], … …, QPS [ -56]), and so on.
It can be understood that the target scheduling times in the plurality of first sub-time periods included in each packet obtained after aggregation are different from a phase difference (i.e., a misalignment of the marked time point) existing between the bandwidth data of the CDN room in each first sub-time period in the first historical time period. Illustratively, the first historical time period is 65 minutes to 31 minutes before the current time, the time point of the first sub-time period is 60, and the first scheduling number of services included in the first packet indicates: the average value of the number of service schedules for each minute from 65 th to 61 th minutes before the current time, then the phase difference between the number of service schedules and the bandwidth data at this time is-5, and the first number of service schedules contained in the second packet indicates: the average value of the traffic scheduling times per minute from 64 th to 60 th minutes before the current time, the phase difference between the traffic scheduling times and the bandwidth data at this time is-4, and so on.
Table 2 service scheduling times packet aggregation data
And secondly, respectively calculating the ratio of the bandwidth corresponding to each group to the service scheduling times and the sum of the squares of the residuals based on the bandwidth data of the CDN computer room in each first sub-time period in the first historical time period and the target scheduling times contained in the preset number of groups.
In practical application, time point dislocation may exist between bandwidth data of each CDN room in a historical time period acquired by a scheduling server and service scheduling times, in an embodiment of the present invention, a first historical time period is set to be included in a second historical time period, and a first sub-time period is greater than a second sub-time period, so that bandwidth data of each CDN room in each first sub-time period in the first historical time period and service scheduling times of each room in each second sub-time period in the second historical time period are acquired for each CDN room, the service scheduling times are further grouped, and the service scheduling times in each group are aggregated to a time granularity the same as the bandwidth data.
Then, for each CDN room, the ratio of the bandwidth corresponding to each group to the number of service scheduling times and the sum of squares of residuals are calculated respectively by using the bandwidth data of the CDN room in each first sub-time period within the first historical time period, that is, the quasi-real-time bandwidth data of the CDN room, and the number of service scheduling times of the CDN room in each first sub-time period in each group of the CDN room in the second historical time period after aggregation.
As an optional implementation manner of the embodiment of the present invention, an implementation process of calculating a ratio between a bandwidth corresponding to each packet and a service scheduling time and a sum of squared residuals may include:
and calculating the ratio of the bandwidth corresponding to each group to the service scheduling times and the residual sum of squares by using a least square method.
In the embodiment of the present invention, a least square method may be used to perform linear fitting on the bandwidth data of the CDN room in each first sub-time period in the first historical time period and the target scheduling times of the CDN room in each first sub-time period included in the preset number of packets, and calculate a ratio between a bandwidth and a service scheduling time corresponding to each packet and a sum of squares of residuals.
For example, the calculated ratio of the bandwidth corresponding to each packet to the number of times of traffic scheduling may be represented as k [ ], and the sum of squared residuals may be represented as rss [ ], and the calculation result may be shown in table 3 below.
TABLE 3 ratio and residual sum of squares calculation
And step three, determining the ratio of the bandwidth corresponding to the packet with the minimum residual square sum to the service scheduling times as the ratio of the current bandwidth of the CDN computer room to the service scheduling times.
After the ratio of the bandwidth corresponding to each packet to the number of service scheduling times and the residual square sum are obtained through calculation, the packet corresponding to the minimum residual square sum is determined, and the ratio of the bandwidth of the packet to the number of service scheduling times is determined as the ratio of the current bandwidth of the CDN computer room to the number of service scheduling times.
It can be understood that, in the process of linearly fitting the bandwidth data of the CDN room in each first sub-time period within the first historical time period and the target scheduling times of the CDN room in each first sub-time period included in the preset number of packets by using the least square method, a sum of squares of residuals corresponding to each packet is obtained, where the smaller the sum of squares of residuals is, the more accurate the linear fitting is, that is, the more matched the service scheduling times corresponding to the corresponding packet is with the quasi-real-time bandwidth data, that is, the smaller the phase difference between the time point corresponding to the service scheduling times and the time point corresponding to the bandwidth data is, so that the ratio of the bandwidth corresponding to the packet with the smallest sum of squares of residuals in the calculation results of the packets to the service scheduling times is determined as the ratio of the current bandwidth of the CDN room to the service scheduling times, which solves the problem that the real-time bandwidth data cannot be obtained in the prior art, resulting in a problem of large scheduling feedback delay.
In practical application, time point dislocation may exist between bandwidth data of each CDN room in a historical time period acquired by a scheduling server and service scheduling times, in an embodiment of the present invention, a first historical time period is set to be included in a second historical time period, a first sub-time period is greater than a second sub-time period, bandwidth data of each CDN room in each first sub-time period in the first historical time period and service scheduling times of each CDN room in each second sub-time period in the second historical time period are acquired, the service scheduling times are further grouped, the service scheduling times in each group are aggregated to a time granularity same as the bandwidth data, and it is convenient to calculate a ratio of the bandwidth to the service scheduling times by using a least square method, so as to more accurately estimate a ratio of a current bandwidth of the CDN room to the service scheduling times.
Corresponding to the foregoing method embodiment, an embodiment of the present invention provides a scheduling apparatus, and as shown in fig. 4, the apparatus may include:
an obtaining module 401, configured to obtain bandwidth data of each content delivery network CDN room in a first historical time period and service scheduling times of each CDN room in a second historical time period;
a determining module 402, configured to determine, for each CDN room, a ratio of a current bandwidth of the CDN room to a number of service schedules based on the obtained bandwidth data of the CDN room and the number of service schedules;
a calculating module 403, configured to calculate a current bandwidth value of the CDN room according to a ratio of a current bandwidth of the CDN room to a service scheduling time and the current scheduling time;
and an adjusting module 404, configured to adjust the service scheduling times scheduled to the CDN room in the next time period based on a size relationship between the current bandwidth value of the CDN room and a preset bandwidth threshold of the CDN room.
The scheduling device provided by the embodiment of the invention can determine the ratio of the current bandwidth of the CDN machine room to the service scheduling times through the bandwidth data and the service scheduling times of the CDN machine room in a historical time period for each CDN machine room, and further calculate the current bandwidth value of the CDN machine room by combining the ratio and the current scheduling times of the CDN machine room, thereby solving the problem that the scheduling feedback time delay is larger because the real-time bandwidth data cannot be obtained at present. Furthermore, under the condition that the current bandwidth value of the CDN room is obtained, the number of service scheduling times scheduled to the CDN room in the next time period can be adjusted based on the calculated size relationship between the current bandwidth value of the CDN room and the preset bandwidth threshold of the CDN room, so that the accuracy of the scheduling policy is improved.
Optionally, the obtaining module 401 includes:
the first dividing module is used for dividing the first historical time period into a plurality of sub-time periods according to the first unit time length to obtain each first sub-time period;
the first obtaining submodule is used for obtaining bandwidth data of each CDN machine room in each first sub-time period in the first historical time period;
the second division submodule is used for dividing the second historical time period into a plurality of sub-time periods according to the second unit time length to obtain each second sub-time period;
the second obtaining submodule is used for obtaining the service scheduling times of each CDN computer room in each second sub-time period in a second historical time period; the first history time period is contained in the second history time period, and the first sub-time period is larger than the second sub-time period.
Optionally, the determining module 402 includes:
the third division submodule is used for dividing the service scheduling times of the CDN computer room in each second sub-time period in the second historical time period into a preset number of groups in a mode that the preset length is sequentially increased by the starting time of the second historical time period, the preset length is determined according to the length of the first historical time period, and the preset number is determined based on the lengths of the first historical time period and the second historical time period;
and the determining submodule is used for determining the ratio of the current bandwidth of the CDN computer room to the service scheduling times based on the preset number of groups and the bandwidth data of the CDN computer room in each first sub-time period in the first historical time period.
Optionally, the determining submodule is specifically configured to:
aggregating the service scheduling times in each second sub-time period in each group to obtain target scheduling times in a plurality of first sub-time periods of the group;
respectively calculating the ratio of the bandwidth corresponding to each group to the service scheduling times and the sum of the squares of the residuals based on the bandwidth data of the CDN computer room in each first sub-time period in the first historical time period and the target scheduling times contained in the preset number of groups;
and determining the ratio of the bandwidth corresponding to the packet with the minimum residual square sum to the service scheduling times as the ratio of the current bandwidth of the CDN computer room to the service scheduling times.
Optionally, the adjusting module 404 is specifically configured to:
judging whether the current bandwidth value of the CDN computer room is larger than a preset bandwidth threshold value of the CDN computer room;
if the number of the service scheduling times is larger than the preset threshold, reducing the service scheduling times scheduled to the CDN computer room in the next time period;
and if not, increasing the scheduling times of scheduling to the CDN computer room in the next time period.
An embodiment of the present invention further provides an electronic device, as shown in fig. 5, which includes a processor 501, a communication interface 502, a memory 503 and a communication bus 504, where the processor 501, the communication interface 502 and the memory 503 complete mutual communication through the communication bus 504,
a memory 503 for storing a computer program;
the processor 501, when executing the program stored in the memory 503, implements the following steps:
acquiring bandwidth data of each content delivery network CDN machine room in a first historical time period and service scheduling times of each CDN machine room in a second historical time period;
for each CDN machine room, determining the ratio of the current bandwidth of the CDN machine room to the service scheduling times based on the acquired bandwidth data of the CDN machine room and the service scheduling times;
calculating the current bandwidth value of the CDN computer room according to the ratio of the current bandwidth of the CDN computer room to the service scheduling times and the current scheduling times;
and adjusting the service scheduling times scheduled to the CDN machine room in the next time period based on the size relation between the current bandwidth value of the CDN machine room and the preset bandwidth threshold value of the CDN machine room.
The electronic device provided by the embodiment of the invention can determine the ratio of the current bandwidth of the CDN machine room to the service scheduling times through the bandwidth data and the service scheduling times of the CDN machine room in a historical time period for each CDN machine room, and further calculate the current bandwidth value of the CDN machine room by combining the ratio and the current scheduling times of the CDN machine room, so that the problem that the scheduling feedback time delay is large due to the fact that real-time bandwidth data cannot be obtained in the prior art is solved. Furthermore, under the condition that the current bandwidth value of the CDN room is obtained, the number of service scheduling times scheduled to the CDN room in the next time period can be adjusted based on the calculated size relationship between the current bandwidth value of the CDN room and the preset bandwidth threshold of the CDN room, so that the accuracy of the scheduling policy is improved.
The communication bus mentioned in the above terminal may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.
The communication interface is used for communication between the terminal and other equipment.
The Memory may include a Random Access Memory (RAM) or a non-volatile Memory (non-volatile Memory), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the processor.
The Processor may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; the device can also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, a discrete Gate or transistor logic device, or a discrete hardware component.
In yet another embodiment of the present invention, a computer-readable storage medium is further provided, in which a computer program is stored, and the computer program, when executed by a processor, implements the steps of a scheduling method as described in any of the above embodiments.
In a further embodiment of the present invention, there is also provided a computer program product comprising instructions which, when run on a computer, cause the computer to perform the steps of a scheduling method as described in any of the above embodiments.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the device/electronic apparatus embodiments, since they are substantially similar to the method embodiments, the description is relatively simple, and for the relevant points, reference may be made to some descriptions of the method embodiments.
The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.
Claims (10)
1. A method of scheduling, the method comprising:
acquiring bandwidth data of each content delivery network CDN machine room in a first historical time period and service scheduling times of each CDN machine room in a second historical time period;
for each CDN machine room, determining the ratio of the current bandwidth of the CDN machine room to the service scheduling times based on the acquired bandwidth data of the CDN machine room and the service scheduling times;
calculating the current bandwidth value of the CDN computer room according to the ratio of the current bandwidth of the CDN computer room to the service scheduling times and the current scheduling times;
and adjusting the service scheduling times scheduled to the CDN machine room in the next time period based on the size relation between the current bandwidth value of the CDN machine room and the preset bandwidth threshold value of the CDN machine room.
2. The method of claim 1, wherein the obtaining bandwidth data of each content delivery network CDN room in a first historical time period and the service scheduling times of each CDN room in a second historical time period comprises:
dividing the first historical time period into a plurality of sub-time periods according to a first unit time length to obtain each first sub-time period;
acquiring bandwidth data of each CDN machine room in each first sub-time period in the first historical time period;
dividing the second historical time period into a plurality of sub-time periods according to a second unit time length to obtain each second sub-time period;
acquiring service scheduling times of each CDN machine room in each second sub-time period in the second historical time period;
wherein the first historical time period is included in the second historical time period, and the first sub-time period is greater than the second sub-time period.
3. The method of claim 2, wherein the determining a ratio of a current bandwidth of the CDN room to a number of service schedules based on the obtained bandwidth data of the CDN room and the number of service schedules comprises:
dividing the service scheduling times of the CDN computer room in each second sub-time period in the second historical time period into a preset number of groups according to a preset length in a mode that the starting time of the second historical time period is sequentially increased, wherein the preset length is determined according to the length of the first historical time period, and the preset number is determined based on the lengths of the first historical time period and the second historical time period;
and determining the ratio of the current bandwidth of the CDN computer room to the service scheduling times based on the preset number of groups and the bandwidth data of the CDN computer room in each first sub-time period in the first historical time period.
4. The method of claim 3, wherein the determining a ratio of a current bandwidth of the CDN room to a number of service schedules based on the predetermined number of packets and bandwidth data of the CDN room in each first sub-time period within the first historical time period comprises:
aggregating the service scheduling times in each second sub-time period in each group to obtain target scheduling times in a plurality of first sub-time periods of the group;
respectively calculating the ratio of the bandwidth corresponding to each group to the service scheduling times and the sum of the squares of the residuals based on the bandwidth data of the CDN computer room in each first sub-time period in the first historical time period and the target scheduling times contained in the preset number of groups;
and determining the ratio of the bandwidth corresponding to the packet with the minimum residual square sum to the service scheduling times as the ratio of the current bandwidth of the CDN computer room to the service scheduling times.
5. The method of claim 1, wherein the adjusting the number of service scheduling times scheduled to the CDN room in a next time period based on a size relationship between a current bandwidth value of the CDN room and a preset bandwidth threshold of the CDN room comprises:
judging whether the current bandwidth value of the CDN computer room is larger than a preset bandwidth threshold value of the CDN computer room;
if the number of the service scheduling times is larger than the preset threshold, reducing the service scheduling times scheduled to the CDN computer room in the next time period;
and if not, increasing the scheduling times of scheduling to the CDN computer room in the next time period.
6. A scheduling apparatus, the apparatus comprising:
the acquisition module is used for acquiring bandwidth data of each content delivery network CDN machine room in a first historical time period and service scheduling times of each CDN machine room in a second historical time period;
the determining module is used for determining the ratio of the current bandwidth of each CDN machine room to the service scheduling times based on the acquired bandwidth data of the CDN machine room and the service scheduling times;
the calculation module is used for calculating the current bandwidth value of the CDN computer room according to the ratio of the current bandwidth of the CDN computer room to the service scheduling times and the current scheduling times;
and the adjusting module is used for adjusting the service scheduling times scheduled to the CDN computer room in the next time period based on the size relation between the current bandwidth value of the CDN computer room and the preset bandwidth threshold value of the CDN computer room.
7. The apparatus of claim 6, wherein the obtaining module comprises:
the first dividing module is used for dividing the first historical time period into a plurality of sub-time periods according to a first unit time length to obtain each first sub-time period;
a first obtaining submodule, configured to obtain bandwidth data of each CDN room in each first sub-time period within the first historical time period;
the second division submodule is used for dividing the second historical time period into a plurality of sub-time periods according to a second unit time length to obtain each second sub-time period;
the second obtaining submodule is used for obtaining the service scheduling times of each CDN computer room in each second sub-time period in the second historical time period; wherein the first historical time period is included in the second historical time period, and the first sub-time period is greater than the second sub-time period.
8. The apparatus of claim 7, wherein the determining module comprises:
a third division submodule, configured to divide the service scheduling times of the CDN room in each second sub-time period within the second historical time period into a preset number of groups in a manner that a preset length is sequentially incremented by a start time of the second historical time period, where the preset length is determined according to a length of the first historical time period, and the preset number is determined based on the lengths of the first historical time period and the second historical time period;
and the determining submodule is used for determining the ratio of the current bandwidth of the CDN computer room to the service scheduling times based on the preset number of groups and the bandwidth data of the CDN computer room in each first sub-time period in the first historical time period.
9. An electronic device is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor and the communication interface are used for realizing mutual communication by the memory through the communication bus;
a memory for storing a computer program;
a processor for implementing the method steps of any one of claims 1 to 5 when executing a program stored in the memory.
10. A computer-readable storage medium, characterized in that a computer program is stored in the computer-readable storage medium, which computer program, when being executed by a processor, carries out the method steps of any one of the claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111196290.8A CN113949741B (en) | 2021-10-14 | 2021-10-14 | Scheduling method, scheduling device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111196290.8A CN113949741B (en) | 2021-10-14 | 2021-10-14 | Scheduling method, scheduling device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113949741A true CN113949741A (en) | 2022-01-18 |
| CN113949741B CN113949741B (en) | 2023-07-21 |
Family
ID=79330348
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111196290.8A Active CN113949741B (en) | 2021-10-14 | 2021-10-14 | Scheduling method, scheduling device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113949741B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117176489A (en) * | 2023-11-03 | 2023-12-05 | 联通在线信息科技有限公司 | Broadband piecewise linear fitting method, device, electronic equipment and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102065142A (en) * | 2010-12-23 | 2011-05-18 | 网宿科技股份有限公司 | File downloading based scheduling method and system for content delivery network (CDN) |
| US8073940B1 (en) * | 2008-11-17 | 2011-12-06 | Amazon Technologies, Inc. | Managing content delivery network service providers |
| BR102016021194A2 (en) * | 2016-01-11 | 2017-07-18 | Beijing Baidu Netcom Science And Technology Co., Ltd. | METHOD AND TRAFFIC MANAGEMENT DEVICE IN THE DATA CENTER NETWORK |
| CN107465708A (en) * | 2016-06-02 | 2017-12-12 | 腾讯科技（深圳）有限公司 | A kind of CDN bandwidth scheduling systems and method |
| WO2018054369A1 (en) * | 2016-09-23 | 2018-03-29 | 北京奇虎科技有限公司 | Method and apparatus for selecting streaming data transmission node |
| CN112671664A (en) * | 2020-12-04 | 2021-04-16 | 新浪网技术(中国)有限公司 | CDN scheduling system and method based on refined scheduling |
| CN112751718A (en) * | 2021-01-28 | 2021-05-04 | 深圳市晨北科技有限公司 | Bandwidth adjusting method and device, terminal and storage medium |
| WO2021087639A1 (en) * | 2019-11-04 | 2021-05-14 | Microsoft Technology Licensing, Llc | Cdn optimization platform |
-
2021
- 2021-10-14 CN CN202111196290.8A patent/CN113949741B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8073940B1 (en) * | 2008-11-17 | 2011-12-06 | Amazon Technologies, Inc. | Managing content delivery network service providers |
| CN102065142A (en) * | 2010-12-23 | 2011-05-18 | 网宿科技股份有限公司 | File downloading based scheduling method and system for content delivery network (CDN) |
| BR102016021194A2 (en) * | 2016-01-11 | 2017-07-18 | Beijing Baidu Netcom Science And Technology Co., Ltd. | METHOD AND TRAFFIC MANAGEMENT DEVICE IN THE DATA CENTER NETWORK |
| CN107465708A (en) * | 2016-06-02 | 2017-12-12 | 腾讯科技（深圳）有限公司 | A kind of CDN bandwidth scheduling systems and method |
| WO2018054369A1 (en) * | 2016-09-23 | 2018-03-29 | 北京奇虎科技有限公司 | Method and apparatus for selecting streaming data transmission node |
| WO2021087639A1 (en) * | 2019-11-04 | 2021-05-14 | Microsoft Technology Licensing, Llc | Cdn optimization platform |
| CN112671664A (en) * | 2020-12-04 | 2021-04-16 | 新浪网技术(中国)有限公司 | CDN scheduling system and method based on refined scheduling |
| CN112751718A (en) * | 2021-01-28 | 2021-05-04 | 深圳市晨北科技有限公司 | Bandwidth adjusting method and device, terminal and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117176489A (en) * | 2023-11-03 | 2023-12-05 | 联通在线信息科技有限公司 | Broadband piecewise linear fitting method, device, electronic equipment and storage medium |
| CN117176489B (en) * | 2023-11-03 | 2024-02-27 | 联通在线信息科技有限公司 | Broadband piecewise linear fitting method, device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113949741B (en) | 2023-07-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10880226B2 (en) | Scheduled transmission of data | |
| US20220078075A1 (en) | Adaptive Capacity Management of Connections Associated with a Service | |
| CN110620681B (en) | Network connection timeout time setting method, device, equipment and medium | |
| CN113746650B (en) | Bandwidth allocation method, bandwidth allocation device, scheduling server and medium | |
| CN111064760B (en) | Method and device for accessing service in content distribution network | |
| CN108156257B (en) | Information pushing method and device | |
| CN111291252B (en) | Method and device for adjusting query rate per second, electronic equipment and storage medium | |
| CN113949741A (en) | Scheduling method, scheduling device, electronic equipment and storage medium | |
| CN109951540B (en) | Data acquisition method and device based on content timeliness and electronic equipment | |
| CN109688421B (en) | Request message processing method, device and system, server and storage medium | |
| CN109788326B (en) | Video resource pre-pushing method, device and system | |
| CN111278039B (en) | User perception suppression identification method, device, equipment and medium | |
| CN114338516B (en) | Traffic forwarding and policy determining method and device | |
| CN114006821B (en) | Service range adjusting method and device, electronic equipment and storage medium | |
| CN113835905A (en) | Message queue load balancing method and device, electronic equipment and medium | |
| CN110691143B (en) | File pushing method and device, electronic equipment and medium | |
| CN110399218B (en) | Data scheduling method and device | |
| CN110572299B (en) | Equipment testing method, system, device, network node, terminal and storage medium | |
| CN112860388B (en) | Regulation strategy updating method and related equipment | |
| CN111245559B (en) | Information determination method, information judgment method and device and computing equipment | |
| CN109756384B (en) | Data source state determination method and device and computer readable storage medium | |
| CN110650358B (en) | Node distribution method, device, node distribution server and medium | |
| CN112099949B (en) | Task distribution control method and device, electronic equipment and storage medium | |
| CN115037696B (en) | Data transmission method, device, electronic equipment and storage medium | |
| CN117544516A (en) | Bandwidth automatic scheduling method, medium and device based on normal distribution curve |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |