CN113949741B - Scheduling method, scheduling device, electronic equipment and storage medium - Google Patents

Scheduling method, scheduling device, electronic equipment and storage medium Download PDF

Info

Publication number
CN113949741B
CN113949741B CN202111196290.8A CN202111196290A CN113949741B CN 113949741 B CN113949741 B CN 113949741B CN 202111196290 A CN202111196290 A CN 202111196290A CN 113949741 B CN113949741 B CN 113949741B
Authority
CN
China
Prior art keywords
machine room
time period
cdn
sub
cdn machine
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.)
Active
Application number
CN202111196290.8A
Other languages
Chinese (zh)
Other versions
CN113949741A (en
Inventor
张瀚文
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing QIYI Century Science and Technology Co Ltd
Original Assignee
Beijing QIYI Century Science and Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing QIYI Century Science and Technology Co Ltd filed Critical Beijing QIYI Century Science and Technology Co Ltd
Priority to CN202111196290.8A priority Critical patent/CN113949741B/en
Publication of CN113949741A publication Critical patent/CN113949741A/en
Application granted granted Critical
Publication of CN113949741B publication Critical patent/CN113949741B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Databases & Information Systems (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

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 CDN machine room of the content delivery network 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 machine room according to the ratio of the current bandwidth of the CDN machine 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 magnitude 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 the scheduling feedback and improve the accuracy of the scheduling strategy.

Description

Scheduling method, scheduling device, electronic equipment and storage medium
Technical Field
The present invention relates to the field of scheduling technologies, and in particular, to a scheduling method, a scheduling device, an electronic device, and a storage medium.
Background
Video source data is typically stored in a CDN (Content Delivery Network ) server for download playback by end users, etc. In practical applications, under different regions and operators, CDN rooms of various cooperators are accessed, and service capabilities, service qualities, bandwidth costs, charging rules, and the like of the cooperators and the CDN rooms are different. When a terminal user has a requirement for downloading and playing video data, a downloading request aiming at a target video is sent to a dispatching server, and then the dispatching server determines a target CDN machine room for responding to the downloading request of the user from all CDN machine rooms based on factors such as service quality, service capacity and the like of all CDN machine rooms, and dispatches 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 quality of service of the CDN room.
In the related art, the implementation process of the scheduling server for scheduling the download request of the user is as follows: and in the unit time of the historical time period, the scheduling server counts the scheduled times of each CDN machine room and the scheduled corresponding bandwidth data fed back by the CDN machine room, so as to determine the target CDN machine room to be scheduled for the user downloading request in the next unit time based on the scheduled times of each CDN machine room and the corresponding bandwidth data. The historical time period may be one hour, one day, or one week, etc. before the current time, and the unit time may be 3 minutes, 5 minutes, or 10 minutes, etc.
However, in practical application, due to the limitation of factors such as geographical distance between the dispatching server and each CDN machine room, network state and the like, the bandwidth data corresponding to each CDN machine room which is dispatched and acquired by the dispatching server lags behind the corresponding dispatched times in time, so that the real-time bandwidth data corresponding to each CDN machine room which is dispatched cannot be acquired, further, the delay of video dispatching feedback is caused to be larger, and the accuracy of the determined dispatching strategy is not high based on the acquired times of each CDN machine room which is dispatched and the corresponding bandwidth data.
Disclosure of Invention
The embodiment of the invention aims to provide a scheduling method, a scheduling device, electronic equipment and a storage medium, so as to reduce the time delay of scheduling feedback and improve the accuracy of a scheduling strategy. The specific technical scheme is as follows:
in a first aspect of the present invention, there is provided a scheduling method, wherein the method includes:
acquiring bandwidth data of each CDN machine room of the content delivery network 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 machine room according to the ratio of the current bandwidth of the CDN machine 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 magnitude 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 the bandwidth data of each CDN room of the content delivery network in the first historical period and the service scheduling times of each CDN room in the second historical 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 history period is included in the second history period, and the first sub-period is greater than the second sub-period.
Optionally, the determining, based on the obtained bandwidth data and the service scheduling number of times of the CDN machine room, a ratio of a current bandwidth of the CDN machine room to the service scheduling number of times includes:
dividing the service scheduling times of the CDN machine room in each second sub-time period in the second historical time period into preset number of groups according to 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 machine room to the service scheduling times based on the preset number of packets and the bandwidth data of the CDN machine room in each first sub-time period in the first historical time period.
Optionally, the determining, based on the preset number of packets and the bandwidth data of the CDN machine room in each first sub-period in the first historical period, a ratio of a current bandwidth of the CDN machine room to a service scheduling number of times includes:
for each packet, aggregating the service scheduling times in each second sub-time period in the packet to obtain target scheduling times in a plurality of first sub-time periods of the packet;
Based on bandwidth data of the CDN machine room in each first sub-time period in the first historical time period and target scheduling times contained in the preset number of packets, respectively calculating a ratio of bandwidth corresponding to each packet to service scheduling times and a residual square sum;
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 machine room to the service scheduling times.
Optionally, the adjusting the service scheduling number of times scheduled to the CDN machine room in the next time period based on the magnitude relation between the current bandwidth value of the CDN machine room and the preset bandwidth threshold of the CDN machine room includes:
judging whether the current bandwidth value of the CDN machine room is larger than a preset bandwidth threshold of the CDN machine room or not;
if the service scheduling number is larger than the service scheduling number, the service scheduling number to the CDN machine room in the next time period is reduced;
if not, increasing the dispatching times to the CDN machine room in the next time period.
In a second aspect of the present invention, there is also provided a scheduling apparatus, wherein the apparatus includes:
the acquisition module is used for acquiring bandwidth data of each CDN machine room of the content delivery network 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 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 for each CDN machine room;
the calculating module is used for calculating the current bandwidth value of the CDN machine room according to the ratio of the current bandwidth of the CDN machine room to the service scheduling times and the current scheduling times;
the adjusting module is used for adjusting the service scheduling times scheduled to the CDN machine room in the next time period based on the magnitude relation between the current bandwidth value of the CDN machine room and the preset bandwidth threshold value of the CDN machine room.
Optionally, the acquiring module includes:
the first dividing sub-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;
the first acquisition submodule is used for acquiring bandwidth data of each CDN machine room in each first sub-time period in the first historical time period;
the second dividing sub-module 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 machine room in each second sub-time period in the second historical time period; wherein the first history period is included in the second history period, and the first sub-period is greater than the second sub-period.
Optionally, the determining module includes:
a third dividing sub-module, configured to divide the number of service scheduling times of the CDN machine room in each second sub-period in the second historical period into a preset number of packets according to a preset length in a manner that a starting time of the second historical period sequentially increases, where the preset length is determined according to a length of the first historical period, and the preset number is determined based on lengths of the first historical period and the second historical period;
the determining submodule is used for determining the ratio of the current bandwidth of the CDN machine room to the service scheduling times based on the preset number of packets and the bandwidth data of the CDN machine room in each first sub-time period in the first historical time period.
In yet 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, wherein the processor, the communication interface, and the memory perform communication with each other through the communication bus;
a memory for storing a computer program;
and the processor is used for realizing the steps of any one of the scheduling methods when executing the programs stored in the memory.
In yet another aspect of the present invention, there is also provided a computer readable storage medium having stored therein a computer program which, when executed by a processor, implements the steps of any of the scheduling methods described above.
In yet another aspect of the 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 equipment and the storage medium, for each CDN machine room, the ratio of the current bandwidth of the CDN machine room to the service scheduling times can be determined through the bandwidth data of the CDN machine room and the service scheduling times in the historical time period, and further, the current bandwidth value of the CDN machine room is calculated by combining the ratio and the current scheduling times of the CDN machine room, so that the problem that the scheduling feedback delay is large due to the fact that the real-time bandwidth data cannot be acquired in the prior art is solved. Furthermore, under the condition that the current bandwidth value of the CDN machine room is obtained, the service scheduling times scheduled to the CDN machine room in the next time period can be adjusted based on the calculated size relation between the current bandwidth value of the CDN machine room and the preset bandwidth threshold of the CDN machine room, and the accuracy of the scheduling strategy 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 flow chart of a scheduling method according to an embodiment of the present invention;
FIG. 2 is a flowchart of an embodiment of acquiring historical data;
fig. 3 is a flow chart of a method for 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 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 accompanying drawings in the embodiments of the present invention.
In order to solve the problem that in the related art, bandwidth data corresponding to each CDN machine room which is scheduled and acquired by a scheduling server lags behind corresponding scheduled times in time, so that real-time bandwidth data corresponding to each CDN machine room which is scheduled cannot be acquired, further delay of video scheduling feedback is larger, and the accuracy of a determined scheduling strategy is low based on the acquired scheduled times of each CDN machine room and the corresponding bandwidth data. The scheduling method provided by the embodiment of the invention comprises the following steps:
Acquiring bandwidth data of each CDN machine room of the content delivery network 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 machine room according to the ratio of the current bandwidth of the CDN machine 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 magnitude 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 machine room, the ratio of the current bandwidth of the CDN machine room to the service scheduling times can be determined through the bandwidth data and the service scheduling times of the CDN machine room in the historical time period, and further, the current bandwidth value of the CDN machine room is calculated by combining the ratio with the current scheduling times of the CDN machine room, so that the problem that the scheduling feedback delay is large due to the fact that the real-time bandwidth data cannot be acquired in the prior art is solved. Furthermore, under the condition that the current bandwidth value of the CDN machine room is obtained, the service scheduling times scheduled to the CDN machine room in the next time period can be adjusted based on the calculated size relation between the current bandwidth value of the CDN machine room and the preset bandwidth threshold of the CDN machine room, and the accuracy of the scheduling strategy is improved.
The following describes a scheduling method provided by the embodiment of the present invention in detail:
for ease of understanding, the relevant terms in the embodiments of the present invention will be 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 service scheduling is the minimum unit.
Bandwidth: flow through the network card per second. The bandwidth of the CDN room represents the sum of the total bandwidths of all servers of the CDN room, and an average value in a time period.
Number of service scheduling: and in the unit time length, scheduling the service scheduling times to a certain CDN machine room.
Ratio of bandwidth to number of traffic scheduling: representing the bandwidth value used per traffic schedule.
As shown in fig. 1, the scheduling method provided by the embodiment of the present invention may be implemented by the following steps:
s101, obtaining bandwidth data of each CDN machine room of the content delivery network in a first historical time period and service scheduling times of each CDN machine room in a second historical time period.
The execution main body of the scheduling method provided by the embodiment of the invention can be a scheduling server, and the scheduling server obtains 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 in the process of realizing service scheduling. The service schedule may be video schedule, advertisement schedule, quick message schedule, news schedule, etc., which is not limited herein.
In practical application, the bandwidth data of each CDN machine room is provided by a third party, and corresponding time points are marked, and the service scheduling times of each CDN machine room can be marked and counted by the scheduling server, so that there may be a misalignment between the bandwidth data of each CDN machine room and the service scheduling times in the historical time period acquired by the scheduling server. For example, the obtained bandwidth data of the CDN machine room at the marking time point is 0 may indicate that the CDN machine room is the service scheduling number between marking time points [1,6 ], may also indicate that the CDN machine room is the service scheduling number between marking time points [ -2, 3), and so on, where the marking time point of the current time point may be defined as 0, and accordingly, a time point before the current time point may be marked as a negative number less than 0, and a 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 machine room at the marking time point is 0 may correspond to the service scheduling number of a period of time forward or backward. In order to determine an accurate correspondence between bandwidth data and service scheduling times of each CDN machine room, in the embodiment of the present invention, the first historical time period may be set to be included in the second historical time period.
By way of example, the first historical period of time and the second historical period of time may be a period of time within tens of minutes, hours, a day or week, or the like, prior to the current time. For example, the first history period may be 60 minutes to 30 minutes before the current time, the second history period may be 60 minutes to 20 minutes before the current time, or the first history period may be 90 minutes to 50 minutes before the current time, the second history period may be 90 minutes 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.
S102, 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.
After obtaining bandwidth data of each CDN machine room in the first historical time period and service scheduling times of each CDN machine room in the second historical time period, aiming at each CDN machine room, aligning the obtained bandwidth data of the CDN machine room in the first historical time period with the service scheduling times of the CDN machine room in the second historical time period by using a least square method to determine a corresponding relation between the bandwidth data of the CDN machine room and the service scheduling times in the first historical time period, and estimating a ratio of a current bandwidth of the CDN machine room to the service scheduling times based on the corresponding relation.
For example, the obtained bandwidth data of the CDN machine room in the first historical time period and the service scheduling number of the CDN machine room in the second historical time period may be fitted by using a least square method, so as to obtain an optimal correspondence between the bandwidth data of the CDN machine room and the service scheduling number of the CDN machine room in the first historical time period, and further determine a ratio of the bandwidth under the optimal correspondence to the service scheduling number as a ratio of the current bandwidth of the CDN machine room to the service scheduling number of the CDN machine room.
Of course, other methods may be used to align the acquired bandwidth data of the CDN machine room in the first historical period with the service scheduling number of the CDN machine room in the second historical period, for example, a maximum likelihood method, etc., and in particular, embodiments of the present invention are not illustrated herein.
S103, calculating the current bandwidth value of the CDN machine room according to the ratio of the current bandwidth of the CDN machine room to the service scheduling times and the current scheduling times.
The scheduling server can obtain the current scheduling times of each CDN machine room, and after determining the ratio of the current bandwidth of each CDN machine room to the service scheduling times, the current bandwidth value of each CDN machine room can be calculated according to the ratio of the current bandwidth of the CDN machine room to the service scheduling times and the current scheduling times.
As an optional implementation manner of the embodiment of the present invention, for each CDN machine room, the ratio of the current bandwidth of the CDN machine room to the service scheduling number may be multiplied by the current scheduling number of the CDN machine room, and the multiplied result may be determined as the current bandwidth value of the CDN machine room.
S104, adjusting the service scheduling times scheduled to the CDN machine room in the next time period based on the magnitude relation between the current bandwidth value of the CDN machine room and the preset bandwidth threshold of the CDN machine room.
In practical application, the bandwidth capacity, service capability, service quality, bandwidth cost, charging rule and the like of different CDN rooms are different, and after determining the current bandwidth value of each CDN room, the number of service scheduling times scheduled to the CDN room in the next time period can be adjusted for each CDN room according to the size relationship between the current bandwidth value of the CDN room and the preset bandwidth threshold of the CDN room.
As an optional implementation manner of the embodiment of the present invention, for each CDN machine room, based on a size relationship between a current bandwidth value of the CDN machine room and a preset bandwidth threshold of the CDN machine room, an implementation process of adjusting a number of service scheduling times scheduled to the CDN machine room in a next time period may include:
Judging whether the current bandwidth value of the CDN machine room is larger than a preset bandwidth threshold of the CDN machine room or not;
if the service scheduling number is larger than the service scheduling number, the service scheduling number to the CDN machine room in the next time period is reduced;
if not, increasing the dispatching times to the CDN machine room in the next time period.
If the current bandwidth value of the CDN machine room is greater than the preset bandwidth threshold of the CDN machine room, it indicates that the current load of the CDN machine room is greater, and may exceed the service capability of the CDN machine room, further affecting the service quality, so that the number of service scheduling times for scheduling to the CDN machine room in the next time period may be reduced. This next time period may be the next unit time period, for example, 1 minute, 2 minutes, or 5 minutes, etc. after the current time.
If the current bandwidth value of the CDN machine room is not greater than the preset bandwidth threshold of the CDN machine room, it indicates that the current load of the CDN machine room can carry service scheduling, and there may be a certain surplus, so that the scheduling number of times for scheduling to the CDN machine room in the next time period may be increased, so as to more fully utilize the resources of the CDN machine room.
As an optional implementation manner of the embodiment of the present invention, the scheduling server may receive a service scheduling request sent by the terminal user, and further schedule the service scheduling request to a CDN machine room capable of processing the service based on the fact that the service scheduling request can be scheduled in the next time period of each CDN machine room.
According to the scheduling method provided by the embodiment of the invention, for each CDN machine room, the ratio of the current bandwidth of the CDN machine room to the service scheduling times can be determined through the bandwidth data and the service scheduling times of the CDN machine room in the historical time period, and further, the current bandwidth value of the CDN machine room is calculated by combining the ratio with the current scheduling times of the CDN machine room, so that the problem that the scheduling feedback delay is large due to the fact that the real-time bandwidth data cannot be acquired in the prior art is solved. Furthermore, under the condition that the current bandwidth value of the CDN machine room is obtained, the service scheduling times scheduled to the CDN machine room in the next time period can be adjusted based on the calculated size relation between the current bandwidth value of the CDN machine room and the preset bandwidth threshold of the CDN machine room, and the accuracy of the scheduling strategy is improved.
As an optional implementation manner of the embodiment of the present invention, as shown in fig. 2, in the step S101, an implementation manner of obtaining bandwidth data of each CDN machine room of the content delivery network in a first historical period and service scheduling times of each CDN machine room in a second historical period 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 machine 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, each first sub-time period is obtained, and then bandwidth data of each CDN machine room under each first sub-time period in the first historical time period is obtained.
For example, the first unit time period is 5 minutes, and then the first history time period may be divided into a plurality of sub-time periods with the time period of 5 minutes, to obtain each first sub-time period. For example, the first historical time period is 65 minutes to 31 minutes before the current time, and then divided according to the unit time length of 5 minutes, a plurality of first sub-time periods of 65-61, 60-56, … …,35-31, etc. can be obtained. The first unit duration may also be 4 minutes, 8 minutes, 10 minutes, etc., which is not limited in the embodiment of the present invention.
S202, obtaining bandwidth data of each CDN machine room in each first sub-time period in the first historical time period.
In the embodiment of the invention, the average value of the bandwidth data of each CDN machine room in each first sub-time period in the first historical time period is determined as the bandwidth data of each CDN machine 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 invention, the service scheduling times of each CDN machine room in the second historical time period can be acquired by taking 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, each second sub-time period is obtained, and then the service scheduling times of each CDN machine room under each second sub-time period in the second historical time period are obtained.
For example, if the second unit time period is 1 minute, the second history period may be divided into a plurality of sub-periods having a time period of 1 minute, to obtain each of the second sub-periods. For example, the second historical time period is 65 minutes to 21 minutes before the current time, and then the second historical time period is divided according to 1 minute unit time length, so that a plurality of second sub-time periods with the time length of 1 minute can be obtained. The second unit duration may also be 2 minutes, 4 minutes, 5 minutes, etc., which is not limited in the embodiment of the present invention.
S204, obtaining 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 historical time period is contained in the second historical time period, and the first sub-time period is larger than the second sub-time period.
In practical application, because there may be a dislocation of time points between bandwidth data of each CDN machine room and service scheduling times in a historical time period acquired by the scheduling server, the first historical time period is set to be included in the second historical time period, and the first sub-time period is greater than the second sub-time period. And dividing the first historical time period into a plurality of sub-time periods according to the first unit time length, acquiring bandwidth data of each CDN machine room under 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 acquiring service scheduling times of each CDN machine room under each second sub-time period in the second historical time period, so that the acquired service scheduling times are more than the bandwidth data, and further, under the condition that time point dislocation exists between the bandwidth data of the CDN machine room and the service scheduling times, better aligning the bandwidth data of the CDN machine room with the service scheduling times.
As an optional implementation manner of the embodiment of the present invention, as shown in fig. 3, in the step S102, the determining, based on the obtained bandwidth data and the service scheduling number of the CDN machine room, the ratio of the current bandwidth of the CDN machine room to the service scheduling number may include:
s301, dividing the service scheduling times of the CDN machine 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.
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.
In the embodiment of the invention, after obtaining bandwidth data of each CDN machine room in each first sub-time period in the first historical time period and obtaining service scheduling times of each CDN machine room in each second sub-time period in the second historical time period, dividing the service scheduling times of each CDN machine room in each second sub-time period in the second historical time period into a preset number of packets 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 1 minute granularity, the length of the first historical period is 35, and the preset length is set to 35. The second history period is 65 minutes to 21 minutes before the current time, represents a unit length in 1 minute granularity, the length of the second history period is 45, and the preset number is set to be the length of the second history period-the length of the first history period +1, namely 45-35+1=11.
Namely, the service scheduling times of the CDN machine 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 mode that the starting time (65 minutes before the current time) of the second historical time period sequentially increases, and each packet contains a plurality of service scheduling times in the second sub-time period.
Illustratively, the data sequence corresponding to the number of traffic schedules in each packet obtained after the packet is shown in Table 1 below, wherein QPS represents the historical number of traffic schedules, QPS < -65 > represents the number of traffic schedules at 65 minutes before the current time, QPS < -64 > represents the number of traffic schedules at 64 minutes before the current time, and so on.
Table 1 traffic scheduling number of packets
Packet number Service scheduling number 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]
S302, determining a ratio of a current bandwidth of the CDN machine room to service scheduling times based on a preset number of packets and bandwidth data of the CDN machine room in each first sub-time period in a first historical time period.
After obtaining the preset number of packets, for each packet, the service scheduling times in each second sub-time period contained in the packet and the bandwidth data of the CDN machine room in each first sub-time period in the first historical time period can be combined, and the service scheduling times in each packet and the bandwidth data in the first historical time period are aligned, so that the ratio of the current bandwidth of the CDN machine room to the service scheduling times is obtained.
As an optional implementation manner of the embodiment of the present invention, step S302 may include the implementation process of determining a ratio of a current bandwidth of the CDN room to a service scheduling number of the CDN room based on a preset number of packets and bandwidth data of the CDN room in each first sub-period in the first historical period:
step one, for each packet, aggregating the service scheduling times in each second sub-time period in the packet to obtain target scheduling times in a plurality of first sub-time periods of the packet.
Dividing the service scheduling times of the CDN machine room in each second sub-time period in the second historical time period into a preset number of groups according to each CDN machine room, and then aggregating the service scheduling times of each second sub-time period in each group according to each group to obtain target scheduling times of the group in a plurality of first sub-time periods.
For example, the length of the first sub-period is 5 minutes, and the length of the second sub-period is 1 minute, and then, after dividing the service scheduling times of the CDN machine room in each second sub-period in the second historical period into a preset number of packets, for each packet, aggregating the service scheduling times in each sub-period of 1 minute in each packet to obtain the target scheduling times in each sub-period of 5 minutes in each packet. It can be understood that the service scheduling times under the sub-time periods of 5 times of 1 minute are aggregated, so as to obtain the target scheduling times under the sub-time periods of 5 times of the packet.
For example, the data sequence corresponding to the target scheduling times in the first sub-periods included in each packet obtained after aggregation is shown in the following table 2, wherein in the packet 1, QPS5m < -60 > represents an average value of the traffic scheduling times in each of 65 th to 61 th minutes before the current time, QPS5m < -60 > = avg (QPS < -65 >, QPS < -64 >, … …, QPS < -61 >), QPS5m < -55 > represents an average value of the traffic scheduling times in each of 60 th to 56 th minutes before the current time, and accordingly, QPS5m < -55 > = avg (QPS < -60 >, QPS < -59 >, … …, QPS < -56 >), and so on can be calculated by the expression.
It can be understood that the target scheduling number of times in the plurality of first sub-periods included in each packet obtained after aggregation is different from a phase difference (i.e. a dislocation of the marking time point) existing between bandwidth data of the CDN machine room in each first sub-period in the first historical period. Illustratively, the first historical time period is 65 minutes to 31 minutes before the current time, the first sub-time period is marked with a time point of 60, and the first traffic schedule number included in the first packet indicates that: the average value of the service scheduling times of each minute from 65 minutes to 61 minutes before the current moment, the phase difference between the service scheduling times and the bandwidth data is-5, and the first service scheduling times contained in the second packet are represented as follows: average of the traffic scheduling times per minute from 64 th minute to 60 th minute 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 traffic scheduling times packet aggregated data
And step two, respectively calculating the ratio of the bandwidth corresponding to each packet to the service scheduling times and the residual square sum based on the bandwidth data of the CDN machine room in each first sub-time period in the first historical time period and the target scheduling times contained in the preset number of packets.
In the embodiment of the present invention, the first historical time period is set to be included in the second historical time period, and the first sub-time period is greater than the second sub-time period, so that for each CDN machine room, 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 are further grouped, and the service scheduling times in each group are aggregated to the same time granularity as the bandwidth data.
Then, for each CDN machine room, the ratio of the bandwidth corresponding to each group to the service scheduling number and the residual square sum are calculated respectively by utilizing the bandwidth data of the CDN machine room in each first sub-time period in the first historical time period, namely the quasi-real-time bandwidth data of the CDN machine room, and the service scheduling number of the CDN machine room in each group in the CDN machine room after aggregation.
As an optional implementation manner of the embodiment of the present invention, the calculating the ratio of the bandwidth corresponding to each packet to the service scheduling number and the implementation process of the sum of squares of residuals may include:
and calculating the ratio of the bandwidth corresponding to each packet to the service scheduling times and the residual square sum by using a least square method.
In the embodiment of the invention, the least square method can be utilized to linearly fit the bandwidth data of the CDN machine room in each first sub-time period in the first historical time period and the target scheduling times of the CDN machine room in each first sub-time period contained in the preset number of packets, and the ratio of the bandwidth corresponding to each packet to the service scheduling times and the residual square sum are calculated.
Illustratively, the calculated ratio of the bandwidth corresponding to each packet to the number of times of traffic scheduling may be expressed as k [ ], the sum of squares of residuals may be expressed as rss [ ], and the calculation result may be as shown in table 3 below.
Table 3 ratio and residual sum of squares calculation results
And thirdly, 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 machine room to the service scheduling times.
After calculating the ratio of the bandwidth corresponding to each packet to the service scheduling times and the residual square sum, determining the packet with the minimum residual square sum, and determining the ratio of the bandwidth of the packet to the service scheduling times as the ratio of the current bandwidth of the CDN machine room to the service scheduling times.
It can be understood that in the process of linearly fitting the bandwidth data of the CDN machine room in each first sub-time period in the first historical time period and the target scheduling times of the CDN machine room in each first sub-time period included in the preset number of packets by using the least square method, the smaller the sum of squares of residuals is, the more accurate the linear fitting is indicated, that is, the more matched the service scheduling times corresponding to the corresponding packets with the quasi-real-time bandwidth data is, 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 each packet to the service scheduling times is determined as the ratio of the current bandwidth of the CDN machine room to the service scheduling times, thereby solving the problem that the current real-time bandwidth data cannot be obtained and the scheduling feedback delay is larger.
In the embodiment of the invention, the first historical time period is set to be included in the second historical time period, the first sub-time period is larger than the second sub-time period, 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 are further grouped, and the service scheduling times in each group are aggregated to the same time granularity as the bandwidth data, so that the ratio of bandwidth to service scheduling times is calculated by using a least square method, and the ratio of the current bandwidth of the CDN machine room to the service scheduling times is estimated more accurately.
Corresponding to the above method embodiment, the embodiment of the present invention provides a scheduling apparatus, as shown in fig. 4, where the apparatus may include:
an obtaining module 401, configured to obtain bandwidth data of each CDN machine room of the content delivery network in a first historical period, and service scheduling times of each CDN machine room in a second historical period;
a determining module 402, configured to determine, for each CDN machine room, a ratio of a current bandwidth of the CDN machine room to a service scheduling number based on the acquired bandwidth data of the CDN machine room and the service scheduling number;
a calculating module 403, configured to calculate a current bandwidth value of the CDN machine room according to a ratio of a current bandwidth of the CDN machine room to a service scheduling number and the current scheduling number;
and the adjusting module 404 is configured to adjust the service scheduling times scheduled to the CDN machine room in the next time period based on the magnitude relation between the current bandwidth value of the CDN machine room and the preset bandwidth threshold of the CDN machine room.
According to the scheduling device provided by the embodiment of the invention, for each CDN machine room, the ratio of the current bandwidth of the CDN machine room to the service scheduling times can be determined through the bandwidth data and the service scheduling times of the CDN machine room in the historical time period, and further, the current bandwidth value of the CDN machine room is calculated by combining the ratio with the current scheduling times of the CDN machine room, so that the problem that the scheduling feedback delay is large due to the fact that the real-time bandwidth data cannot be acquired in the prior art is solved. Furthermore, under the condition that the current bandwidth value of the CDN machine room is obtained, the service scheduling times scheduled to the CDN machine room in the next time period can be adjusted based on the calculated size relation between the current bandwidth value of the CDN machine room and the preset bandwidth threshold of the CDN machine room, and the accuracy of the scheduling strategy is improved.
Optionally, the acquiring module 401 includes:
the first dividing sub-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 acquisition submodule is used for acquiring bandwidth data of each CDN machine room in each first sub-time period in the first historical time period;
the second dividing sub-module 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 service scheduling times of each CDN machine room in each second sub-time period in the second historical time period; the first historical time period is contained in the second historical time period, and the first sub-time period is larger than the second sub-time period.
Optionally, the determining module 402 includes:
the third dividing sub-module is used for dividing the service scheduling times of the CDN machine room in each second sub-time period in the second historical time period into a preset number of groups in a mode that the starting time of the second historical time period is sequentially increased according to the preset length, 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;
The determining submodule is used for determining the ratio of the current bandwidth of the CDN machine room to the service scheduling times based on the preset number of packets and the bandwidth data of the CDN machine room in each first sub-time period in the first historical time period.
Optionally, the determining submodule is specifically configured to:
for each packet, aggregating the service scheduling times in each second sub-time period in the packet to obtain target scheduling times in a plurality of first sub-time periods of the packet;
based on bandwidth data of the CDN machine room in each first sub-time period in the first historical time period and target scheduling times contained in a preset number of packets, respectively calculating a ratio of bandwidth corresponding to each packet to service scheduling times and a residual square sum;
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 machine room to the service scheduling times.
Optionally, the adjustment module 404 is specifically configured to:
judging whether the current bandwidth value of the CDN machine room is larger than a preset bandwidth threshold of the CDN machine room or not;
if the service scheduling number is larger than the service scheduling number, the service scheduling number to the CDN machine room in the next time period is reduced;
If not, increasing the dispatching times to the CDN machine room in the next time period.
The embodiment of the invention also provides an electronic device, as shown in fig. 5, which comprises a processor 501, a communication interface 502, a memory 503 and a communication bus 504, wherein the processor 501, the communication interface 502 and the memory 503 complete communication with each other through the communication bus 504,
a memory 503 for storing a computer program;
the processor 501 is configured to execute the program stored in the memory 503, and implement the following steps:
acquiring bandwidth data of each CDN machine room of the content delivery network 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 machine room according to the ratio of the current bandwidth of the CDN machine 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 magnitude 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 electronic equipment provided by the embodiment of the invention, aiming at each CDN machine room, the ratio of the current bandwidth of the CDN machine room to the service scheduling times can be determined through the bandwidth data of the CDN machine room and the service scheduling times in the historical time period, and further, the current bandwidth value of the CDN machine room is calculated by combining the ratio with the current scheduling times of the CDN machine room, so that the problem that the scheduling feedback delay is large because the real-time bandwidth data cannot be acquired in the prior art is solved. Furthermore, under the condition that the current bandwidth value of the CDN machine room is obtained, the service scheduling times scheduled to the CDN machine room in the next time period can be adjusted based on the calculated size relation between the current bandwidth value of the CDN machine room and the preset bandwidth threshold of the CDN machine room, and the accuracy of the scheduling strategy is improved.
The communication bus mentioned by the above terminal may be a peripheral component interconnect standard (Peripheral Component Interconnect, abbreviated as PCI) bus or an extended industry standard architecture (Extended Industry Standard Architecture, abbreviated as EISA) bus, etc. The communication bus may be classified as an address bus, a data bus, a control bus, or the like. For ease of illustration, the figures are shown with only one bold line, but not with only one bus or one type of bus.
The communication interface is used for communication between the terminal and other devices.
The memory may include random access memory (Random Access Memory, RAM) or 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 aforementioned processor.
The processor may be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU for short), a network processor (Network Processor, NP for short), etc.; but also digital signal processors (Digital Signal Processor, DSP for short), application specific integrated circuits (Application Specific Integrated Circuit, ASIC for short), field-programmable gate arrays (Field-Programmable Gate Array, FPGA for short) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.
In a further embodiment of the present invention, there is also provided a computer readable storage medium having stored therein a computer program which, when executed by a processor, implements the steps of a scheduling method according to any of the above embodiments.
In a further embodiment 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 a scheduling method as described in any of the above embodiments.
In the above embodiments, it may be implemented in whole or in part 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, produces a flow or function in accordance with embodiments of the present invention, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. The computer instructions may be stored in or transmitted from one computer-readable storage medium to another, for example, by wired (e.g., coaxial cable, optical fiber, digital Subscriber Line (DSL)), or wireless (e.g., infrared, wireless, microwave, etc.). The computer readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains an integration of one or more 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)), etc.
It is noted that relational terms such as first and second, and the like are 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. Moreover, 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 one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
In this specification, each embodiment is described in a related manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for the apparatus/electronics embodiments, since they are substantially similar to the method embodiments, the description is relatively simple, with reference to the description of the method embodiments in part.
The foregoing description is only of the preferred embodiments of the present invention and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention are included in the protection scope of the present invention.

Claims (10)

1. A scheduling method, the method comprising:
acquiring bandwidth data of each CDN machine room of the content delivery network 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 machine room according to the ratio of the current bandwidth of the CDN machine 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 magnitude 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 CDN room of the content delivery network during the first historical time period and the number of service schedules of each CDN room during the 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 history period is included in the second history period, and the first sub-period is greater than the second sub-period.
3. The method of claim 2, wherein determining the ratio of the current bandwidth of the CDN room to the number of service schedules based on the acquired bandwidth data of the CDN room and the number of service schedules comprises:
dividing the service scheduling times of the CDN machine room in each second sub-time period in the second historical time period into preset number of groups according to 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 machine room to the service scheduling times based on the preset number of packets and the bandwidth data of the CDN machine room in each first sub-time period in the first historical time period.
4. The method of claim 3, wherein determining the ratio of the current bandwidth of the CDN room to the number of service schedules based on the preset number of packets and the bandwidth data of the CDN room in each first sub-period in the first historical period comprises:
for each packet, aggregating the service scheduling times in each second sub-time period in the packet to obtain target scheduling times in a plurality of first sub-time periods of the packet;
based on bandwidth data of the CDN machine room in each first sub-time period in the first historical time period and target scheduling times contained in the preset number of packets, respectively calculating a ratio of bandwidth corresponding to each packet to service scheduling times and a residual square sum;
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 machine room to the service scheduling times.
5. The method of claim 1, wherein the adjusting the number of service schedules scheduled to the CDN room in the next time period based on the magnitude relation between the current bandwidth value of the CDN room and the preset bandwidth threshold of the CDN room comprises:
judging whether the current bandwidth value of the CDN machine room is larger than a preset bandwidth threshold of the CDN machine room or not;
if the service scheduling number is larger than the service scheduling number, the service scheduling number to the CDN machine room in the next time period is reduced;
if not, increasing the dispatching times to the CDN machine room in the next time period.
6. A scheduling apparatus, the apparatus comprising:
the acquisition module is used for acquiring bandwidth data of each CDN machine room of the content delivery network 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 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 for each CDN machine room;
the calculating module is used for calculating the current bandwidth value of the CDN machine room according to the ratio of the current bandwidth of the CDN machine room to the service scheduling times and the current scheduling times;
The adjusting module is used for adjusting the service scheduling times scheduled to the CDN machine room in the next time period based on the magnitude relation between the current bandwidth value of the CDN machine room and the preset bandwidth threshold value of the CDN machine room.
7. The apparatus of claim 6, wherein the acquisition module comprises:
the first dividing sub-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;
the first acquisition submodule is used for acquiring bandwidth data of each CDN machine room in each first sub-time period in the first historical time period;
the second dividing sub-module 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 machine room in each second sub-time period in the second historical time period; wherein the first history period is included in the second history period, and the first sub-period is greater than the second sub-period.
8. The apparatus of claim 7, wherein the determining module comprises:
A third dividing sub-module, configured to divide the number of service scheduling times of the CDN machine room in each second sub-period in the second historical period into a preset number of packets according to a preset length in a manner that a starting time of the second historical period sequentially increases, where the preset length is determined according to a length of the first historical period, and the preset number is determined based on lengths of the first historical period and the second historical period;
the determining submodule is used for determining the ratio of the current bandwidth of the CDN machine room to the service scheduling times based on the preset number of packets and the bandwidth data of the CDN machine room in each first sub-time period in the first historical time period.
9. The electronic equipment is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus;
a memory for storing a computer program;
a processor for carrying out the method steps of any one of claims 1-5 when executing a program stored on a memory.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored therein a computer program which, when executed by a processor, implements the method steps of any of claims 1-5.
CN202111196290.8A 2021-10-14 2021-10-14 Scheduling method, scheduling device, electronic equipment and storage medium Active CN113949741B (en)

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 CN113949741A (en) 2022-01-18
CN113949741B true 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)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117354072B (en) * 2023-10-11 2024-06-21 广东云下汇金科技有限公司 Automatic charging adjustment method and device for data center network bandwidth flow
CN117176489B (en) * 2023-11-03 2024-02-27 联通在线信息科技有限公司 Broadband piecewise linear fitting method, device, electronic equipment and storage medium

Citations (8)

* Cited by examiner, † Cited by third party
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

Patent Citations (8)

* Cited by examiner, † Cited by third party
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

Also Published As

Publication number Publication date
CN113949741A (en) 2022-01-18

Similar Documents

Publication Publication Date Title
US11677683B2 (en) Upstream bandwidth management methods and apparatus
CN113949741B (en) Scheduling method, scheduling device, electronic equipment and storage medium
US10880226B2 (en) Scheduled transmission of data
CN110659123A (en) Distributed task distribution scheduling method and device based on message
CN108156257B (en) Information pushing method and device
CN110620699B (en) Message arrival rate determination method, device, equipment and computer readable storage medium
CN110460879B (en) Video request scheduling method, device, server and storage medium
WO2020181821A1 (en) Traffic source ratio adjusting method and apparatus, computer device, and storage medium
CN107493486B (en) Method, system and terminal equipment for video playing termination
CN114006821B (en) Service range adjusting method and device, electronic equipment and storage medium
CN110620939B (en) Network state determination method and device, electronic equipment and storage medium
CN109951540B (en) Data acquisition method and device based on content timeliness and electronic equipment
CN111031350B (en) Transcoding resource scheduling method, electronic device and computer readable storage medium
CN109688421B (en) Request message processing method, device and system, server and storage medium
JP4845773B2 (en) A system that estimates the total number of outgoing connections from all terminals
CN110570257A (en) multimedia data delivery method, device and computer readable storage medium
CN114158104B (en) Network selection method, device, terminal and storage medium
US8862724B2 (en) Processing apparatus, processing method, and communication system
CN109756384B (en) Data source state determination method and device and computer readable storage medium
CN115202871B (en) Collaborative space division method, device, equipment and storage medium
CN115174948B (en) Scheduling method and device based on transcoding resources
CN115297364B (en) Cloud game video transmission time delay determining method, cloud game video transmission time delay determining system and electronic equipment
CN115941775B (en) Client registration method and device, electronic equipment and storage medium
US20070220567A1 (en) Method and Related Device for Scheduling Sequence of Broadcasting Data Items in an On-demand Broadcast System
CN113891392B (en) Congestion control method, device, equipment and storage medium

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