CN111432247B - Traffic scheduling method, traffic scheduling device, server and storage medium - Google Patents
Traffic scheduling method, traffic scheduling device, server and storage medium Download PDFInfo
- Publication number
- CN111432247B CN111432247B CN202010196010.2A CN202010196010A CN111432247B CN 111432247 B CN111432247 B CN 111432247B CN 202010196010 A CN202010196010 A CN 202010196010A CN 111432247 B CN111432247 B CN 111432247B
- Authority
- CN
- China
- Prior art keywords
- server node
- traffic
- node
- area
- scheduling
- 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
Links
Images
Classifications
-
- 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
-
- 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/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/2407—Monitoring of transmitted content, e.g. distribution time, number of downloads
-
- 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
Abstract
A method of traffic scheduling, the method comprising: determining a first area and determining a second area; if a third area except the first area exists in the second area, determining traffic to be scheduled from the traffic of the server nodes according to the distance between the first area and the third area and a preset scheduling traffic threshold of the target server node; determining a first scheduling server node according to the flow to be scheduled; if the receivable flow of the first scheduling server node is smaller than the flow to be scheduled, determining the link quality fraction and the node attribute information of the server nodes except the first scheduling server node and the target server node; determining a second scheduling server node according to the link quality fraction and the node attribute information; and dispatching the traffic to be dispatched to the first dispatching server node and the second dispatching server node. The invention also provides a traffic scheduling device, a server and a storage medium. The invention can improve the service quality of the server node.
Description
Technical Field
The present invention relates to the field of traffic scheduling technologies, and in particular, to a traffic scheduling method, an apparatus, a server, and a storage medium.
Background
At present, with the rapid increase of the traffic of videos and other contents, the importance of a CDN (Content Delivery Network) responsible for Content transmission is increasingly highlighted, but in practice, it is found that the traffic of a server node in a certain area suddenly increases, so that the service pressure of the server node becomes higher, and once the traffic exceeds the traffic bearing range of the server node, the service quality of the server node decreases.
Therefore, how to improve the service quality of the server node is a technical problem that needs to be solved urgently.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a traffic scheduling method, apparatus, server, and storage medium, which can improve the quality of service of a server node.
A first aspect of the present invention provides a traffic scheduling method, where the method includes:
when the traffic of a target server node is larger than a preset traffic threshold, determining a first area and a second area, wherein the first area is a geographical area to which the target server node belongs, and the second area is a geographical area to which the traffic of the target server node belongs;
if a third area except the first area exists in the second area, determining traffic to be scheduled from the traffic of the target server node according to the distance between the first area and the third area and a preset scheduling traffic threshold of the target server node;
determining a first scheduling server node according to the traffic to be scheduled;
if the receivable flow of the first scheduling server node is smaller than the flow to be scheduled, determining the link quality scores and node attribute information of the server nodes except the first scheduling server node and the target server node;
determining a second scheduling server node according to the link quality fraction and the node attribute information;
and scheduling the traffic to be scheduled to the first scheduling server node and the second scheduling server node.
In a possible implementation manner, the determining, according to the traffic to be scheduled, a first scheduling server node includes:
determining a geographic area to which the traffic to be scheduled belongs as a fourth area;
determining the server node of the fourth area as the first dispatch server node.
In one possible implementation, the determining link quality scores for server nodes other than the first scheduling server node and the target server node comprises:
determining the server node other than the first dispatch server node and the target server node as a first server node;
determining a response time and a download speed of the first server node to access the network of the fourth area;
and carrying out normalization operation on the response time and the downloading speed according to a preset weight to obtain a link quality score from the first server node to the network of the fourth area.
In one possible implementation manner, the node attribute information includes a real-time available status, a real-time traffic percentage, an operator, a traffic cost, and a traffic growth rate, and the determining the second scheduling server node according to the link quality score and the node attribute information includes:
sequencing the first server nodes from large to small according to the link quality scores to obtain a first queue;
determining a second server node from the first server nodes that is not suitable for scheduling based on the real-time availability status of the first server nodes, the real-time traffic percentage, the operator, and the traffic growth rate;
deleting the second server node from all the nodes of the first queue to obtain a second queue;
and determining the nodes with the first arrangement sequence as second scheduling server nodes from all nodes of the second queue according to the flow cost.
In one possible implementation, the determining, according to the real-time availability status, the real-time traffic percentage, the operator, and the traffic growth rate of the first server node, a second server node unsuitable for scheduling from the first server node comprises:
judging whether the real-time available state of each node in the first server node is a preset state or not;
if the real-time available state of the node is a preset state, judging whether the real-time flow percentage of the node is smaller than a preset percentage threshold value;
if the real-time traffic percentage of the node is smaller than a preset percentage threshold value, judging whether an operator of the node is a preset operator;
if the operator of the node is a preset operator, determining the flow increasing speed of the node within a preset time range according to the log file of the node;
judging whether the flow rate increase speed is greater than a preset speed threshold value or not;
and if the flow rate increase speed is greater than a preset speed threshold value, determining the node as a second server node which is not suitable for scheduling.
In one possible implementation manner, the determining the response time and the download speed of the first server node to access the network of the fourth area includes:
determining, by the agent of the first server node, a response time for the first server node to access the network of the fourth area by invoking an internet packet explorer command;
acquiring the download flow and the download time of the first server node accessing a network of a fourth area according to the historical access log of the first server node;
and determining the downloading speed of the first server node accessing the network of the fourth area according to the downloading flow and the downloading time.
In a possible implementation manner, the preset weight includes a response weight and a download weight, and the performing normalization operation on the response time and the download speed according to the preset weight to obtain a link quality score from the first server node to the network of the fourth area includes:
determining a response value of the first server node according to the response weight and the response time of the first server node for accessing the network of the fourth area, and determining a download value of the first server node according to the download weight and the download speed of the first server node for accessing the network of the fourth area;
calculating a ratio of a download value of the first server node to a response value of the first server node;
and carrying out normalization operation on the ratio to obtain the link quality score from the first server node to the network of the fourth area.
A second aspect of the present invention provides a traffic scheduling apparatus, including:
the determining module is used for determining a first area and a second area when the flow of a target server node is larger than a preset flow threshold, wherein the first area is a geographical area to which the target server node belongs, and the second area is a geographical area to which the flow of the target server node belongs;
the determining module is further configured to determine, if a third area other than the first area exists in the second area, traffic to be scheduled from traffic of the target server node according to a distance between the first area and the third area and a preset scheduling traffic threshold of the target server node;
the determining module is further configured to determine a first scheduling server node according to the traffic to be scheduled;
the determining module is further configured to determine, if the receivable traffic of the first scheduling server node is smaller than the traffic to be scheduled, a link quality score and node attribute information of server nodes other than the first scheduling server node and the target server node;
the determining module is further configured to determine a second scheduling server node according to the link quality score and the node attribute information;
and the scheduling module is used for scheduling the traffic to be scheduled to the first scheduling server node and the second scheduling server node.
A third aspect of the present invention provides a server comprising a processor and a memory, wherein the processor is configured to implement the traffic scheduling method when executing a computer program stored in the memory.
A fourth aspect of the present invention provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the traffic scheduling method.
By the technical scheme, when the flow is suddenly increased, namely the flow of the target server node is larger than the preset flow threshold value, the flow to be scheduled can be determined, the flow to be scheduled is scheduled to the first scheduling server node to slow down the service pressure of the current server node and improve the service quality, the link quality scores of other server nodes can be calculated, then the proper server node (second scheduling server node) is determined according to the link quality scores and the server node attribute information of the other server nodes, a part of the flow is scheduled to the server nodes, and the proper server node is searched to share part of the service pressure, so that the service pressure of the current server node is reduced, and the service quality of the server node is improved.
Drawings
Fig. 1 is a flowchart of a traffic scheduling method according to a preferred embodiment of the present invention.
Fig. 2 is a functional block diagram of a traffic scheduling apparatus according to a preferred embodiment of the present disclosure.
Fig. 3 is a schematic structural diagram of a server according to a preferred embodiment of the traffic scheduling method of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention.
The traffic scheduling method of the embodiment of the invention is applied to a server, and can also be applied to a hardware environment formed by the server and electronic equipment connected with the server through a network, and the server and the electronic equipment execute together. Networks include, but are not limited to: a wide area network, a metropolitan area network, or a local area network.
A server may refer to a computer system that provides services to other devices (e.g., electronic devices) in a network. A personal computer may also be called a server if it can provide File Transfer Protocol (FTP) service to the outside. In a narrow sense, a server refers to a high-performance computer, which can provide services to the outside through a network, and has higher requirements on stability, security, performance and the like compared with a common personal computer, so that hardware such as a CPU, a chipset, a memory, a disk system, a network and the like is different from the common personal computer.
Referring to fig. 1, fig. 1 is a flowchart illustrating a traffic scheduling method according to a preferred embodiment of the present invention. The order of the steps in the flowchart may be changed, and some steps may be omitted.
S11, when the flow of a target server node is larger than a preset flow threshold, a server determines a first area and a second area, wherein the first area is a geographical area to which the target server node belongs, and the second area is a geographical area to which the flow of the target server node belongs.
In this embodiment of the present invention, a maximum traffic threshold may be preset, for example, 95% of a bandwidth value purchased for the server node, and when an average traffic of a server node (a target server node) within a preset time range (for example, within 10 minutes) is greater than the maximum traffic threshold, the service quality of the target server may be affected, in order to ensure the service quality of the server node, traffic of the server node needs to be scheduled, that is, a part of the traffic is scheduled to another server node, and a geographic area (a second area, for example, a second area, such as guangdong, guangxi, and the like) to which the traffic of the server node belongs may be determined.
And S12, if a third area except the first area exists in the second area, the server determines the traffic to be scheduled from the traffic of the target server node according to the distance between the first area and the third area and a preset scheduling traffic threshold of the target server node.
The preset scheduling traffic threshold is a preset traffic threshold, for example, 30% of the total traffic of the server node, and when the server node needs to perform traffic scheduling, 30% of the traffic of the server node may be scheduled.
Alternatively, it may be determined whether a third area (the first area) other than the first area exists in the geographic area to which the traffic belongs, and assuming that the geographic area (the first area) to which the target server node belongs is beijing, the geographic area (the second area) to which the traffic of the target server node belongs includes guangdong, guangxi, and beijing, that is, there is access traffic from users in the guangdong, guangxi, and beijing areas in the target server node (that is, there is an access request from a user in the guangdong, guangxi, and beijing areas), it may be considered that the third area (the guangdong and the guangxi) other than the first area exists in the second area. Assuming that the geographic area to which the target server node belongs is beijing, and the geographic area to which the traffic of the target server node belongs is beijing, it can be considered that a third area other than the first area does not exist in the second area.
In the embodiment of the present invention, in addition to determining how much traffic needs to be diverted according to the scheduling traffic threshold, which part of the traffic needs to be diverted is also determined according to the distance between the first area and each third area, and the traffic of the third area which is farthest from the first area may be preferentially diverted, for example, if the distance between guangxi and beijing is farther than the distance between guangdong and beijing, the traffic of guangxi is preferentially diverted. Therefore, traffic to be scheduled of the server node and a fourth area to which the traffic to be scheduled belongs need to be determined.
And S13, the server determines a first scheduling server node according to the flow to be scheduled.
Specifically, the determining a first scheduling server node according to the traffic to be scheduled includes:
determining a geographic area to which the traffic to be scheduled belongs as a fourth area;
determining the server node of the fourth area as the first dispatch server node.
And S14, if the receivable flow of the first scheduling server node is smaller than the flow to be scheduled, the server determines the link quality scores and the node attribute information of the server nodes except the first scheduling server node and the target server node.
In the embodiment of the present invention, it may be determined whether the receivable traffic of the first scheduling server node is smaller than the traffic to be scheduled, and if the receivable traffic of the first scheduling server node is greater than or equal to the traffic to be scheduled, the traffic to be scheduled may be scheduled to the first scheduling server node. If the receivable traffic of the first scheduling server node is smaller than the traffic to be scheduled, the link quality scores and node attribute information of the server nodes except the first scheduling server node and the target server node may be determined.
Specifically, the determining the link quality scores of the server nodes except for the first scheduling server node and the target server node includes:
determining the server node other than the first dispatch server node and the target server node as a first server node;
determining a response time and a download speed of the first server node to access the network of the fourth area;
and carrying out normalization operation on the response time and the downloading speed according to a preset weight to obtain a link quality score from the first server node to the network of the fourth area.
Specifically, the determining the response time and the downloading speed of the first server node for accessing the network of the fourth area includes:
determining a response time for the first server node to access the network of the fourth area by the agent of the first server node invoking an internet packet explorer command;
acquiring the downloading flow and the downloading time of the first server node accessing the network of the fourth area according to the historical access log of the first server node;
and determining the downloading speed of the first server node accessing the network of the fourth area according to the downloading flow and the downloading time.
The internet packet finder (Ping) is a program for testing the network connection amount, and can send a data packet to a target IP address by using the uniqueness of the IP address of a machine on a network, and then require the opposite side to return a data packet with the same size to determine whether two network machines are connected and communicated, and what the time delay is.
An Agent (Agent) refers to a software or hardware entity capable of autonomous activity.
In this optional embodiment, the response time may be obtained by a proxy deployed on a server node (first server node) going to a master route of the network in the Ping fourth area, and the download traffic and the download time of the network in the fourth area accessed by the server node may be obtained by data of the historical access log, and the download speed may be obtained by calculation.
Specifically, the preset weight includes a response weight and a download weight, and the performing normalization operation on the response time and the download speed according to the preset weight to obtain a link quality score of the network from the first server node to the fourth area includes:
determining a response value of the first server node according to the response weight and the response time of the first server node for accessing the network of the fourth area, and determining a download value of the first server node according to the download weight and the download speed of the first server node for accessing the network of the fourth area;
calculating a ratio of a download value of the first server node to a response value of the first server node;
and carrying out normalization operation on the ratio to obtain the link quality score from the first server node to the network of the fourth area.
The normalization is an algorithm which is proposed for convenience of data processing and maps data into a range of 0 to 1.
As an optional implementation manner, the response time of the first server node accessing the network in the fourth area may be multiplied by the response weight to obtain the response value, and the download speed of the first server node accessing the network in the fourth area may be multiplied by the download weight to obtain the download value, because the smaller the value of the response time is, the better the service quality provided by the server node is, the larger the value of the download speed is, the better the service quality provided by the server node is, therefore, taking the response value as the denominator, taking the download value as the numerator, the larger the ratio of the response value to the download value is, the larger the corresponding link quality score is, and the better the service quality provided by the server node is.
S15, the server determines a second scheduling server node according to the link quality score and the node attribute information.
In the embodiment of the present invention, because the first scheduling server node cannot receive all the traffic to be scheduled, other server nodes need to be searched to receive the remaining traffic to be scheduled.
Specifically, the determining the second scheduling server node according to the link quality score and the node attribute information includes:
sequencing the first server nodes from large to small according to the link quality scores to obtain a first queue;
determining a second server node from the first server nodes that is not suitable for scheduling based on the real-time availability status of the first server nodes, the real-time traffic percentage, the operator, and the traffic growth rate;
deleting the second server node from all the nodes of the first queue to obtain a second queue;
and determining the node with the first arrangement sequence as a second scheduling server node from all nodes of the second queue according to the flow cost.
In this optional implementation manner, all first server nodes may be sorted from large to small according to their corresponding link quality scores to obtain a first queue, and according to the real-time available state, the real-time traffic percentage, the operator, and the traffic growth speed of the first server node, the first server node that is not suitable for traffic scheduling, that is, the second server node, is determined, the second server node in the first queue is deleted to obtain a second queue, and then, in combination with consideration of the traffic cost, the server node to be scheduled that is ranked earlier may be selected from the second queue for traffic scheduling, and the server node that is ranked first may be selected, where the link quality score of the server node to be scheduled for traffic scheduling is higher, that is, the service quality provided by the server node to be scheduled is higher.
Specifically, the determining, according to the real-time availability status, the real-time traffic percentage, the operator, and the traffic growth rate of the first server node, a second server node that is not suitable for scheduling from the first server node includes:
judging whether the real-time available state of each node in the first server node is a preset state or not;
if the real-time available state of the node is a preset state, judging whether the real-time flow percentage of the node is smaller than a preset percentage threshold value;
if the real-time traffic percentage of the node is smaller than a preset percentage threshold value, judging whether an operator of the node is a preset operator;
if the operator of the node is a preset operator, determining the flow increasing speed of the node within a preset time range according to the log file of the node;
judging whether the flow rate increase speed is greater than a preset speed threshold value or not;
and if the flow rate increase speed is greater than a preset speed threshold value, determining the node as a second server node which is not suitable for scheduling.
In this alternative embodiment, if the real-time availability status of a node indicates that the node is not operating normally, the node is considered to be a second server node unsuitable for scheduling; if the real-time flow percentage of the first server node is greater than or equal to the percentage threshold (for example, 90% of the purchased bandwidth of the server node), the service pressure of the server node is relatively high and is not suitable for scheduling; if the operator of the first server node is not a preset operator, the traffic to be scheduled cannot be received, and the first server node is not suitable for scheduling; the traffic increase speed of the first server node in the recent period of time can be determined through the log file of the first server node, and if the traffic increase speed is greater than a preset speed threshold, the service pressure of the first server node can be increased rapidly, so that the first server node cannot continue to provide good-quality services, and is not suitable for scheduling. By screening out the first server node (namely the second server node) which is not suitable for scheduling, the traffic to be scheduled can be scheduled to the suitable server node.
And S16, the server schedules the traffic to be scheduled to the first scheduling server node and the second scheduling server node.
In the embodiment of the present invention, because the first scheduling server node cannot receive all the traffic to be scheduled, the traffic to be scheduled needs to be divided into two parts for scheduling, one part of the traffic with scheduling is scheduled to the first scheduling server node, and the other part of the traffic to be scheduled is scheduled to the second scheduling server node. The traffic to be scheduled can be scheduled to the currently most suitable server node, and the service quality of the server node can be improved.
In the method flow described in fig. 1, when the traffic suddenly increases, that is, the traffic of the target server node is greater than the preset traffic threshold, the traffic to be scheduled may be determined, the traffic to be scheduled is scheduled to the first scheduling server node to slow down the service pressure of the current server node and improve the service quality, the link quality scores of other server nodes may also be calculated, then a suitable server node (second scheduling server node) is determined according to the link quality scores and the server node attribute information of the other server nodes, a part of the traffic is scheduled to the server nodes, and a suitable server node is found to share part of the service pressure, so that the service pressure of the current server node is reduced, and the service quality of the server node is improved.
Referring to fig. 2, fig. 2 is a functional block diagram of a traffic scheduling apparatus according to a preferred embodiment of the present invention.
In some embodiments, the traffic scheduling device operates in a server. The traffic scheduler may comprise a plurality of functional modules consisting of program code segments. Program code of various program segments in the traffic scheduling apparatus may be stored in the memory and executed by the at least one processor to perform some or all of the steps of the traffic scheduling method described in fig. 1.
In this embodiment, the traffic scheduling apparatus may be divided into a plurality of functional modules according to the functions executed by the traffic scheduling apparatus. The functional module may include: a determination module 201 and a scheduling module 202. The module referred to herein is a series of computer program segments capable of being executed by at least one processor and capable of performing a fixed function and is stored in memory.
The determining module 201 is configured to determine a first area and a second area when a traffic of a target server node is greater than a preset traffic threshold, where the first area is a geographic area to which the target server node belongs, and the second area is a geographic area to which the traffic of the target server node belongs.
In the embodiment of the present invention, a maximum traffic threshold may be preset, for example, 95% of a bandwidth value purchased for the server node, and when an average traffic of the server node (target server node) in a preset time range (for example, within 10 minutes) is greater than the maximum traffic threshold, the service quality of the target server may be affected, in order to ensure the service quality of the server node, traffic of the server node needs to be scheduled, that is, a part of the traffic is scheduled to another server node, and a geographic area (a second area, for example, a second area, such as guangdong, guangxi, and the like) to which the traffic of the server node belongs may be determined.
The determining module 201 is further configured to determine, if a third area other than the first area exists in the second area, traffic to be scheduled from the traffic of the target server node according to the distance between the first area and the third area and the preset scheduling traffic threshold of the target server node.
The preset scheduling traffic threshold is a preset traffic threshold, for example, 30% of the total traffic of the server node, and when the server node needs to perform traffic scheduling, 30% of the traffic of the server node may be scheduled.
Alternatively, it may be determined whether a third area other than the first area exists in the geographic area to which the traffic belongs, and assuming that the geographic area (first area) to which the target server node belongs is beijing, the geographic area (second area) to which the traffic of the target server node belongs includes guangdong, guangxi, and beijing, that is, there is access traffic from users in the guangdong, guangxi, and beijing areas in the target server node (that is, there is an access request from a user in the guangdong, guangxi, and beijing areas), it may be considered that the third area other than the first area exists in the second area (the guangdong and the guangxi). Assuming that the geographic area to which the target server node belongs is beijing, and the geographic area to which the traffic of the target server node belongs is beijing, it may be considered that a third area other than the first area does not exist in the second area.
In the embodiment of the present invention, in addition to determining how much traffic needs to be diverted according to the scheduling traffic threshold, which part of the traffic needs to be diverted is also determined according to the distance between the first area and each third area, and the traffic of the third area which is farthest from the first area may be preferentially diverted, for example, if the distance between guangxi and beijing is farther than the distance between guangdong and beijing, the traffic of guangxi is preferentially diverted. Therefore, traffic to be scheduled of the server node and a fourth area to which the traffic to be scheduled belongs need to be determined.
The determining module 201 is further configured to determine a first scheduling server node according to the traffic to be scheduled.
The determining module 201 is further configured to determine, if the receivable traffic of the first scheduling server node is smaller than the traffic to be scheduled, a link quality score and node attribute information of server nodes other than the first scheduling server node and the target server node.
In the embodiment of the present invention, it may be determined whether the receivable traffic of the first scheduling server node is smaller than the traffic to be scheduled, and if the receivable traffic of the first scheduling server node is greater than or equal to the traffic to be scheduled, the traffic to be scheduled may be scheduled to the first scheduling server node. If the receivable traffic of the first scheduling server node is smaller than the traffic to be scheduled, the link quality scores and the node attribute information of the server nodes except the first scheduling server node and the target server node may be determined.
The determining module 201 is further configured to determine a second scheduling server node according to the link quality score and the node attribute information.
In the embodiment of the present invention, because the first scheduling server node cannot receive all the traffic to be scheduled, other server nodes need to be searched to receive the remaining traffic to be scheduled.
A scheduling module 202, configured to schedule the traffic to be scheduled to the first scheduling server node and the second scheduling server node. In the embodiment of the present invention, because the first scheduling server node cannot receive all the traffic to be scheduled, the traffic to be scheduled needs to be divided into two parts for scheduling, one part of the traffic with scheduling is scheduled to the first scheduling server node, and the other part of the traffic to be scheduled is scheduled to the second scheduling server node. The traffic to be scheduled can be scheduled to the currently most suitable server node, and the service quality of the server node can be improved.
As an optional implementation manner, the determining module 201 determines, according to the traffic to be scheduled, a manner of determining the first scheduling server node specifically is:
determining a geographic area to which the traffic to be scheduled belongs as a fourth area;
determining the server node of the fourth area as the first dispatch server node.
As an optional implementation manner, the determining module 201 determines the link quality scores of the server nodes except for the first scheduling server node and the target server node specifically by:
determining the server nodes other than the first scheduling server node and the target server node as first server nodes;
determining a response time and a download speed of the first server node to access the network of the fourth area;
and carrying out normalization operation on the response time and the downloading speed according to a preset weight to obtain a link quality score from the first server node to the network of the fourth area.
As an optional implementation manner, the node attribute information includes a real-time available state, a real-time traffic percentage, an operator, a traffic cost, and a traffic growth rate, and the determining module 201 determines the second scheduling server node according to the link quality score and the node attribute information in a specific manner:
sequencing the first server nodes from large to small according to the link quality scores to obtain a first queue;
determining a second server node from the first server nodes that is not suitable for scheduling based on the real-time availability status of the first server nodes, the real-time traffic percentage, the operator, and the traffic growth rate;
deleting the second server node from all the nodes of the first queue to obtain a second queue;
and determining the node with the first arrangement sequence as a second scheduling server node from all nodes of the second queue according to the flow cost.
In this optional embodiment, all the first server nodes may be ranked from large to small according to their corresponding link quality scores to obtain a first queue, and according to the real-time availability status, the real-time traffic percentage, the operator, and the traffic growth speed of the first server node, a first server node that is not suitable for traffic scheduling, that is, a second server node, is determined, and the second server node in the first queue is deleted to obtain a second queue, and then, in combination with traffic cost, a server node to be scheduled that is ranked earlier may be selected from the second queue for traffic scheduling, and a server node to be scheduled that is ranked first may be selected, where the link quality score of the server node to be scheduled for traffic scheduling is higher, that is, the service quality provided by the server node to be scheduled is higher.
As an optional implementation manner, the determining module 201 determines, according to the real-time availability status, the real-time traffic percentage, the operator, and the traffic growth rate of the first server node, a second server node that is not suitable for scheduling from the first server node by specifically:
judging whether the real-time available state of each node in the first server node is a preset state or not;
if the real-time available state of the node is a preset state, judging whether the real-time flow percentage of the node is smaller than a preset percentage threshold value;
if the real-time traffic percentage of the node is smaller than a preset percentage threshold value, judging whether an operator of the node is a preset operator;
if the operator of the node is a preset operator, determining the flow increasing speed of the node within a preset time range according to the log file of the node;
judging whether the flow increasing speed is larger than a preset speed threshold value or not;
and if the flow increasing speed is larger than a preset speed threshold value, determining the node as a second server node which is not suitable for scheduling.
In this alternative embodiment, if the real-time available status of a node indicates that the node is not operating normally, the node is considered as a second server node unsuitable for scheduling; if the real-time flow percentage of the first server node is greater than or equal to the percentage threshold (for example, 90% of the purchased bandwidth of the server node), the service pressure of the server node is relatively high and is not suitable for scheduling; if the operator of the first server node is not a preset operator, the traffic to be scheduled cannot be received, and the first server node is not suitable for scheduling; the traffic increase speed of the first server node in the recent period of time can be determined through the log file of the first server node, and if the traffic increase speed is greater than a preset speed threshold, the service pressure of the first server node can be increased rapidly, so that the first server node cannot continue to provide good-quality services, and is not suitable for scheduling. By screening out the first server node (namely the second server node) which is not suitable for scheduling, the traffic to be scheduled can be scheduled to the suitable server node.
As an optional implementation manner, the determining module 201 determines the response time and the downloading speed of the first server node accessing the network of the fourth area specifically by:
determining, by the agent of the first server node, a response time for the first server node to access the network of the fourth area by invoking an internet packet explorer command;
acquiring the download flow and the download time of the first server node accessing a network of a fourth area according to the historical access log of the first server node;
and determining the downloading speed of the first server node accessing the network of the fourth area according to the downloading flow and the downloading time.
The internet packet finder (Ping) is a program for testing the network connection amount, and can send a data packet to a target IP address by using the uniqueness of the IP address of a machine on a network, and then require the opposite side to return a data packet with the same size to determine whether two network machines are connected and communicated, and what the time delay is.
An Agent (Agent) refers to a software or hardware entity capable of autonomous activity.
In this optional embodiment, the agent deployed on the server node (first server node) may be used to go to the master route of the network in the Ping fourth area, obtain the response time, obtain the download traffic and the download time of the network in the fourth area accessed by the server node through the data of the historical access log, and obtain the download speed through calculation.
As an optional implementation manner, the preset weight includes a response weight and a download weight, and the determining module 201 performs normalization operation on the response time and the download speed according to the preset weight, and a manner of obtaining a link quality score from the first server node to the network of the fourth area is specifically:
determining a response value of the first server node according to the response weight and the response time of the first server node for accessing the network of the fourth area, and determining a download value of the first server node according to the download weight and the download speed of the first server node for accessing the network of the fourth area;
calculating a ratio of a download value of the first server node to a response value of the first server node;
and carrying out normalization operation on the ratio to obtain the link quality score from the first server node to the network of the fourth area.
The normalization is an algorithm for mapping data to a range of 0 to 1, which is proposed for convenience of data processing.
As an optional implementation manner, the response time of the first server node accessing the network in the fourth area may be multiplied by the response weight to obtain the response value, and the download speed of the first server node accessing the network in the fourth area may be multiplied by the download weight to obtain the download value, because the smaller the value of the response time is, the better the service quality provided by the server node is, the larger the value of the download speed is, the better the service quality provided by the server node is, therefore, taking the response value as the denominator, taking the download value as the numerator, the larger the ratio of the response value to the download value is, the larger the corresponding link quality score is, and the better the service quality provided by the server node is.
In the traffic scheduling apparatus depicted in fig. 2, when traffic suddenly increases, that is, when the traffic of a target server node is greater than a preset traffic threshold, the traffic to be scheduled may be determined, the traffic to be scheduled is scheduled to a first scheduling server node to slow down the service pressure of the current server node and improve the service quality, link quality scores of other server nodes may also be calculated, then a suitable server node (a second scheduling server node) is determined according to the link quality scores and server node attribute information of the other server nodes, a part of the traffic is scheduled to the server nodes, and the suitable server node is searched to share part of the service pressure, so that the service pressure of the current server node is reduced, and the service quality of the server node is improved.
As shown in fig. 3, fig. 3 is a schematic structural diagram of a server according to a preferred embodiment of the traffic scheduling method of the present invention. The server 3 comprises a memory 31, at least one processor 32, a computer program 33 stored in the memory 31 and executable on the at least one processor 32, and at least one communication bus 34.
It will be appreciated by those skilled in the art that the schematic diagram shown in fig. 3 is merely an example of the server 3, and does not constitute a limitation of the server 3, and may include more or less components than those shown, or combine some components, or different components, for example, the server 3 may further include input and output devices, network access devices, etc.
The at least one Processor 32 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, a transistor logic device, a discrete hardware component, etc. The processor 32 may be a microprocessor or the processor 32 may be any conventional processor or the like, and the processor 32 is a control center of the server 3 and connects the various parts of the entire server 3 by various interfaces and lines.
The memory 31 may be used to store the computer program 33 and/or the module/unit, and the processor 32 implements various functions of the server 3 by running or executing the computer program and/or the module/unit stored in the memory 31 and calling data stored in the memory 31. The memory 31 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application program required by at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data (such as audio data) created according to the use of the server 3, and the like. In addition, the memory 31 may include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), at least one magnetic disk storage device, a Flash memory device, and the like.
With reference to fig. 1, the memory 31 in the server 3 stores a plurality of instructions to implement a traffic scheduling method, and the processor 32 can execute the plurality of instructions to implement:
when the traffic of a target server node is larger than a preset traffic threshold, determining a first area and a second area, wherein the first area is a geographical area to which the target server node belongs, and the second area is a geographical area to which the traffic of the target server node belongs;
if a third area except the first area exists in the second area, determining traffic to be scheduled from the traffic of the target server node according to the distance between the first area and the third area and a preset scheduling traffic threshold of the target server node;
determining a first scheduling server node according to the traffic to be scheduled;
if the receivable flow of the first scheduling server node is smaller than the flow to be scheduled, determining the link quality scores and node attribute information of the server nodes except the first scheduling server node and the target server node;
determining a second scheduling server node according to the link quality fraction and the node attribute information;
and scheduling the traffic to be scheduled to the first scheduling server node and the second scheduling server node.
Specifically, the processor 32 may refer to the description of the relevant steps in the embodiment corresponding to fig. 1 for a specific implementation method of the instruction, which is not described herein again.
In the server 3 described in fig. 3, when the traffic suddenly increases, that is, when the traffic of the target server node is greater than the preset traffic threshold, the traffic to be scheduled may be determined, the traffic to be scheduled is scheduled to the first scheduling server node to slow down the service pressure of the current server node and improve the service quality, the link quality scores of other server nodes may also be calculated, then according to the link quality scores and the server node attribute information of the other server nodes, a suitable server node (second scheduling server node) is determined, a part of the traffic is scheduled to the server nodes, and a suitable server node is found to share part of the service pressure, so that the service pressure of the current server node is reduced, and the service quality of the server node is improved.
The modules/units integrated by the server 3 may be stored in a computer-readable storage medium if they are implemented in the form of software functional units and sold or used as separate products. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may also be implemented by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method embodiments may be implemented. The code of the computer program may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying said computer program code, recording medium, U-disk, removable hard disk, magnetic disk, optical disk, computer Memory, read-Only Memory (ROM).
In the embodiments provided in the present invention, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is only one logical functional division, and other divisions may be realized in practice.
The modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.
In addition, functional modules in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional module.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference signs in the claims shall not be construed as limiting the claim concerned. Furthermore, it will be obvious that the term "comprising" does not exclude other elements or steps, and the singular does not exclude the plural. A plurality of units or means recited in the system claims may also be implemented by one unit or means in software or hardware. The terms second, etc. are used to denote names, but not to denote any particular order.
Finally, it should be noted that the above embodiments are only intended to illustrate the technical solutions of the present invention and not to limit the same, and although the present invention is described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications or equivalent substitutions can be made to the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention.
Claims (9)
1. A traffic scheduling method, characterized in that the method comprises:
when the traffic of a target server node is larger than a preset traffic threshold, determining a first area and determining a second area, wherein the first area is a geographical area to which the target server node belongs, and the second area is a geographical area to which the traffic of the target server node belongs;
if a third area except the first area exists in the second area, determining traffic to be scheduled from the traffic of the target server node according to the distance between the first area and the third area and a preset scheduling traffic threshold of the target server node;
determining a first scheduling server node according to the traffic to be scheduled;
if the receivable traffic of the first scheduling server node is smaller than the traffic to be scheduled, determining link quality scores and node attribute information of server nodes except the first scheduling server node and the target server node, including: determining the server nodes other than the first scheduling server node and the target server node as first server nodes;
determining a second scheduling server node according to the link quality score and the node attribute information, including: determining a second server node which is not suitable for scheduling from the first server nodes according to the real-time available state, the real-time traffic percentage, the operator, the traffic cost and the traffic growth speed in the node attribute information of the first server node, wherein the method comprises the following steps: for each node in the first server node, judging whether the real-time available state of the node is a preset state or not, if the real-time available state of the node is the preset state and the real-time traffic percentage of the node is smaller than a preset percentage threshold, judging whether an operator of the node is a preset operator or not, if the operator of the node is the preset operator, determining the traffic increase speed of the node within a preset time range according to a log file of the node, and if the traffic increase speed is larger than the preset speed threshold, determining the node as a second server node which is not suitable for scheduling;
and scheduling the traffic to be scheduled to the first scheduling server node and the second scheduling server node.
2. The method of claim 1, wherein the determining a first scheduling server node according to the traffic to be scheduled comprises:
determining a geographic area to which the traffic to be scheduled belongs as a fourth area;
determining the server node of the fourth area as the first dispatch server node.
3. The method of claim 2, wherein determining the link quality scores for the server nodes other than the first scheduling server node and the target server node comprises:
determining a response time and a download speed of the first server node to access the network of the fourth area;
and carrying out normalization operation on the response time and the downloading speed according to a preset weight to obtain a link quality score from the first server node to the network of the fourth area.
4. The method of claim 3, wherein determining a second scheduling server node based on the link quality score and the node attribute information comprises:
sequencing the first server nodes from large to small according to the link quality scores to obtain a first queue;
deleting the second server node from all the nodes of the first queue to obtain a second queue;
and determining the nodes with the first arrangement sequence as second scheduling server nodes from all nodes of the second queue according to the flow cost.
5. The method of claim 3, wherein determining the response time and the download speed of the first server node to access the network of the fourth area comprises:
determining, by the agent of the first server node, a response time for the first server node to access the network of the fourth area by invoking an internet packet explorer command;
acquiring the download flow and the download time of the first server node accessing a network of a fourth area according to the historical access log of the first server node;
and determining the downloading speed of the first server node accessing the network of the fourth area according to the downloading flow and the downloading time.
6. The method according to claim 3, wherein the preset weight comprises a response weight and a download weight, and the normalizing the response time and the download speed according to the preset weight to obtain the link quality score of the network from the first server node to the fourth area comprises:
determining a response value of the first server node according to the response weight and the response time of the first server node for accessing the network of the fourth area, and determining a download value of the first server node according to the download weight and the download speed of the first server node for accessing the network of the fourth area;
calculating a ratio of a download value of the first server node to a response value of the first server node;
and carrying out normalization operation on the ratio to obtain the link quality score from the first server node to the network of the fourth area.
7. A traffic scheduling apparatus, characterized in that the traffic scheduling apparatus comprises:
the determining module is used for determining a first area and a second area when the flow of a target server node is larger than a preset flow threshold, wherein the first area is a geographical area to which the target server node belongs, and the second area is a geographical area to which the flow of the target server node belongs;
the determining module is further configured to determine, if a third area other than the first area exists in the second area, traffic to be scheduled from traffic of the target server node according to a distance between the first area and the third area and a preset scheduling traffic threshold of the target server node;
the determining module is further configured to determine a first scheduling server node according to the traffic to be scheduled;
the determining module is further configured to determine, if the receivable traffic of the first scheduling server node is smaller than the traffic to be scheduled, a link quality score and node attribute information of a server node other than the first scheduling server node and the target server node, where the determining module includes: determining the server node other than the first dispatch server node and the target server node as a first server node;
the determining module is further configured to determine a second scheduling server node according to the link quality score and the node attribute information, and includes: determining a second server node which is not suitable for scheduling from the first server nodes according to the real-time available state, the real-time traffic percentage, the operator, the traffic cost and the traffic increase speed in the node attribute information of the first server nodes, and the method comprises the following steps: for each node in the first server node, judging whether the real-time available state of the node is a preset state or not, if the real-time available state of the node is the preset state and the real-time traffic percentage of the node is smaller than a preset percentage threshold, judging whether an operator of the node is a preset operator or not, if the operator of the node is the preset operator, determining the traffic increase speed of the node within a preset time range according to a log file of the node, and if the traffic increase speed is larger than the preset speed threshold, determining the node as a second server node which is not suitable for scheduling;
and the scheduling module is used for scheduling the traffic to be scheduled to the first scheduling server node and the second scheduling server node.
8. A server, characterized in that the server comprises a processor and a memory, the processor being configured to execute a computer program stored in the memory to implement the traffic scheduling method according to any of claims 1 to 6.
9. A computer-readable storage medium, wherein the computer-readable storage medium stores at least one instruction, which when executed by a processor, implements the traffic scheduling method of any of claims 1 to 6.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010196010.2A CN111432247B (en) | 2020-03-19 | 2020-03-19 | Traffic scheduling method, traffic scheduling device, server and storage medium |
| PCT/CN2020/099315 WO2021184589A1 (en) | 2020-03-19 | 2020-06-30 | Flow scheduling method and device, server, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010196010.2A CN111432247B (en) | 2020-03-19 | 2020-03-19 | Traffic scheduling method, traffic scheduling device, server and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111432247A CN111432247A (en) | 2020-07-17 |
| CN111432247B true CN111432247B (en) | 2022-10-18 |
Family
ID=71548153
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010196010.2A Active CN111432247B (en) | 2020-03-19 | 2020-03-19 | Traffic scheduling method, traffic scheduling device, server and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN111432247B (en) |
| WO (1) | WO2021184589A1 (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113194042B (en) * | 2021-03-19 | 2023-02-21 | 迅雷计算机（深圳）有限公司 | Control method and device for flow transmission speed and storage medium |
| CN113157460B (en) * | 2021-05-20 | 2023-06-30 | 苏州达家迎信息技术有限公司 | Service node splitting method and device, storage medium and electronic equipment |
| CN116208556A (en) * | 2021-11-30 | 2023-06-02 | 中兴通讯股份有限公司 | Flow balancing method, electronic device, and computer-readable storage medium |
| CN115277565A (en) * | 2022-08-09 | 2022-11-01 | 北京有竹居网络技术有限公司 | Traffic channel scheduling method and device, electronic equipment and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109040190A (en) * | 2018-07-02 | 2018-12-18 | 咪咕文化科技有限公司 | A kind of dispatching method, device and computer readable storage medium |
| CN109510778A (en) * | 2019-01-03 | 2019-03-22 | Oppo广东移动通信有限公司 | Method, apparatus, system, equipment and the storage medium of flow scheduling |
| CN109558152A (en) * | 2018-10-26 | 2019-04-02 | 深圳壹账通智能科技有限公司 | Flow switching method, device, medium and electronic equipment when system gray scale is issued |
| CN109951716A (en) * | 2019-03-26 | 2019-06-28 | 北京达佳互联信息技术有限公司 | A kind of main broadcaster's dispatching method, device, electronic equipment and readable storage medium storing program for executing |
| CN110198267A (en) * | 2018-04-26 | 2019-09-03 | 腾讯科技（深圳）有限公司 | A kind of traffic scheduling method, system and server |
| CN110661879A (en) * | 2019-10-12 | 2020-01-07 | 北京奇艺世纪科技有限公司 | Node scheduling method, device and system, scheduling server and terminal equipment |
| CN110708369A (en) * | 2019-09-25 | 2020-01-17 | 深圳市网心科技有限公司 | File deployment method and device for equipment nodes, scheduling server and storage medium |
| CN110830540A (en) * | 2018-08-14 | 2020-02-21 | 深圳Tcl新技术有限公司 | Method for accessing smart television to cloud server, storage medium and application server |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8719627B2 (en) * | 2011-05-20 | 2014-05-06 | Microsoft Corporation | Cross-cloud computing for capacity management and disaster recovery |
| CN104168300B (en) * | 2013-05-17 | 2017-06-27 | 中国电信股份有限公司 | Content accelerated method and system |
| CN106330962B (en) * | 2016-09-30 | 2019-04-12 | 中国联合网络通信集团有限公司 | A kind of flow cleaning management method and device |
| US11349912B2 (en) * | 2016-11-29 | 2022-05-31 | Level 3 Communications, Llc | Cross-cluster direct server return in a content delivery network (CDN) |
| CN107205030B (en) * | 2017-05-31 | 2020-06-12 | 成都博视美达文化传播有限公司 | Server resource scheduling method and system |
-
2020
- 2020-03-19 CN CN202010196010.2A patent/CN111432247B/en active Active
- 2020-06-30 WO PCT/CN2020/099315 patent/WO2021184589A1/en active Application Filing
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110198267A (en) * | 2018-04-26 | 2019-09-03 | 腾讯科技（深圳）有限公司 | A kind of traffic scheduling method, system and server |
| CN109040190A (en) * | 2018-07-02 | 2018-12-18 | 咪咕文化科技有限公司 | A kind of dispatching method, device and computer readable storage medium |
| CN110830540A (en) * | 2018-08-14 | 2020-02-21 | 深圳Tcl新技术有限公司 | Method for accessing smart television to cloud server, storage medium and application server |
| CN109558152A (en) * | 2018-10-26 | 2019-04-02 | 深圳壹账通智能科技有限公司 | Flow switching method, device, medium and electronic equipment when system gray scale is issued |
| CN109510778A (en) * | 2019-01-03 | 2019-03-22 | Oppo广东移动通信有限公司 | Method, apparatus, system, equipment and the storage medium of flow scheduling |
| CN109951716A (en) * | 2019-03-26 | 2019-06-28 | 北京达佳互联信息技术有限公司 | A kind of main broadcaster's dispatching method, device, electronic equipment and readable storage medium storing program for executing |
| CN110708369A (en) * | 2019-09-25 | 2020-01-17 | 深圳市网心科技有限公司 | File deployment method and device for equipment nodes, scheduling server and storage medium |
| CN110661879A (en) * | 2019-10-12 | 2020-01-07 | 北京奇艺世纪科技有限公司 | Node scheduling method, device and system, scheduling server and terminal equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2021184589A1 (en) | 2021-09-23 |
| CN111432247A (en) | 2020-07-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111432247B (en) | Traffic scheduling method, traffic scheduling device, server and storage medium | |
| US7523454B2 (en) | Apparatus and method for routing a transaction to a partitioned server | |
| CN108776934B (en) | Distributed data calculation method and device, computer equipment and readable storage medium | |
| CN109618002B (en) | Micro-service gateway optimization method, device and storage medium | |
| US7912949B2 (en) | Systems and methods for recording changes to a data store and propagating changes to a client application | |
| US7925785B2 (en) | On-demand capacity management | |
| US9185006B2 (en) | Exchange of server health and client information through headers for request management | |
| CN110830564B (en) | CDN scheduling method, device, system and computer readable storage medium | |
| US20060179059A1 (en) | Cluster monitoring system with content-based event routing | |
| CN110708256B (en) | CDN scheduling method, CDN scheduling device, network equipment and storage medium | |
| CN108243044A (en) | The method and apparatus of service deployment | |
| CN109478147A (en) | Adaptive resource management in distributed computing system | |
| CN109151070B (en) | Block chain-based service scheduling method and electronic device for point-to-point CDN (content delivery network) | |
| US20200320154A1 (en) | A webpage loading method, webpage loading system and server | |
| CN108924203B (en) | Data copy self-adaptive distribution method, distributed computing system and related equipment | |
| CN112764920A (en) | Edge application deployment method, device, equipment and storage medium | |
| CN104158675A (en) | Computing node arranging method, processing node, controller and system | |
| CN107038067B (en) | Management method and device for processing resources in distributed stream processing | |
| CN111385328B (en) | Service request processing method, system and electronic equipment | |
| TW202112113A (en) | Resource sharing method, device, computer device and storage media | |
| CN113538024B (en) | Advertisement management method, system and content transmission network equipment | |
| CN115883330B (en) | Alarm event processing method, system, equipment and storage medium | |
| CN116192752A (en) | Service flow control method, device, electronic equipment and storage medium | |
| US20060179342A1 (en) | Service aggregation in cluster monitoring system with content-based event routing | |
| CN112511868B (en) | Video playing method and device, electronic equipment and computer 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 |