WO2021184589A1

WO2021184589A1 - Flow scheduling method and device, server, and storage medium

Info

Publication number: WO2021184589A1
Application number: PCT/CN2020/099315
Authority: WO
Inventors: 张毅
Original assignee: 平安科技（深圳）有限公司
Priority date: 2020-03-19
Filing date: 2020-06-30
Publication date: 2021-09-23
Also published as: CN111432247A; CN111432247B

Abstract

The present application relates to the technical field of artificial intelligence, and provides a flow scheduling method, comprising: determining a first area and determining a second area; if there is a third area, then according to the distance between the first area and the third area and a preset scheduling flow threshold of a target server node, determining from a flow of the server node a flow to be scheduled; 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, then determining link quality scores and node attribute information of server nodes other than the first scheduling server node and the target server node; determining a second scheduling server node according to the link quality scores and the node attribute information; and scheduling the flow to be scheduled to the first scheduling server node and the second scheduling server node. The present application also provides a flow scheduling device, a server, and a storage medium. The present application can improve the quality of service of a server node.

Description

Traffic scheduling method, device, server and storage medium

This application claims the priority of a Chinese patent application filed with the Chinese Patent Office on March 19, 2020. The application number is 202010196010.2. The title of the invention is "Traffic scheduling method, device, server and storage medium". The entire content is incorporated herein by reference. Applying.

Technical field

This application relates to the field of artificial intelligence technology, and in particular to a traffic scheduling method, device, server, and storage medium.

Background technique

At present, with the rapid growth of video and other content traffic, the importance of CDN (Content Delivery Network), which is responsible for content transmission, has become increasingly prominent. However, the inventor realized that the traffic of server nodes in a certain area will suddenly The increase will increase the service pressure of the server node. Once the traffic carrying range of the server node is exceeded, the service quality of the server node will decrease.

Therefore, how to improve the service quality of server nodes is a technical problem that needs to be solved urgently.

Summary of the invention

In view of the above, it is necessary to provide a traffic scheduling method, device, server, and storage medium, which can improve the service quality of server nodes.

The first aspect of the present application provides a traffic scheduling method, the method includes:

When the traffic of the target server node is greater than the preset traffic threshold, determine a first area and determine a second area, where the first area is the geographic area to which the target server node belongs, and the second area is the target The geographic area to which the server node’s traffic belongs;

If there is a third area other than the first area in the second area, according to the distance between the first area and the third area and the preset scheduling traffic threshold of the target server node, Determining the to-be-scheduled traffic from the traffic of the target server node;

Determine the first scheduling server node according to the to-be-scheduled traffic;

If the receivable traffic of the first scheduling server node is less than the to-be-scheduled traffic, determining link quality scores and node attribute information of server nodes other than the first scheduling server node and the target server node;

Determine a second scheduling server node according to the link quality score and the node attribute information;

Scheduling the to-be-scheduled traffic to the first scheduling server node and the second scheduling server node.

A second aspect of the present application provides a server including a processor and a memory, and the processor is configured to execute computer-readable instructions stored in the memory to implement the following steps:

A third aspect of the present application provides a computer-readable storage medium having at least one computer-readable instruction stored thereon, and the at least one computer-readable instruction is executed by a processor to implement the following steps:

A fourth aspect of the present application provides a traffic scheduling device, the device including:

The determining module is configured to determine a first area and a second area when the traffic of the target server node is greater than a preset traffic threshold, where the first area is the geographic area to which the target server node belongs, and the second The area is the geographic area to which the traffic of the target server node belongs;

The determining module is further configured to, if there is a third area other than the first area in the second area, according to the distance between the first area and the third area and the target server The preset scheduling flow threshold of the node, and determining the flow to be scheduled from the flow of the target server node;

The determining module is further configured to determine the first scheduling server node according to the to-be-scheduled traffic;

The determining module is further configured to determine links of server nodes other than the first scheduling server node and the target server node if the receivable traffic of the first scheduling server node is less than the to-be-scheduled traffic Quality score and node attribute information;

The determining module is further configured to determine a second scheduling server node according to the link quality score and the node attribute information;

The scheduling module is configured to schedule the traffic to be scheduled to the first scheduling server node and the second scheduling server node.

From the above technical solution, in this application, when the traffic increases suddenly, that is, when the traffic of the target server node is greater than the preset traffic threshold, the traffic to be scheduled can be determined, and the traffic to be scheduled can be scheduled to the first scheduling server node to slow down the current server node. To improve service quality, you can also calculate the link quality scores of other server nodes, and then determine the appropriate server node (second scheduling server node) based on the link quality scores and the server node attribute information of other server nodes. Part of the traffic is dispatched to these 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.

Description of the drawings

Fig. 1 is a flowchart of a preferred embodiment of a traffic scheduling method disclosed in the present application.

Fig. 2 is a functional module diagram of a preferred embodiment of a traffic scheduling device disclosed in the present application.

FIG. 3 is a schematic diagram of the structure of a server in a preferred embodiment of the traffic scheduling method according to the present application.

Detailed ways

The traffic scheduling method of the embodiment of the present application is applied to a server, and can also be applied to a hardware environment formed by a server and an electronic device connected to the server through a network, and is executed by the server and the electronic device. Networks include, but are not limited to: wide area networks, metropolitan area networks, or local area networks.

Please refer to FIG. 1. FIG. 1 is a flowchart of a preferred embodiment of a traffic scheduling method disclosed in the present application. Among them, according to different needs, the order of the steps in the flowchart can be changed, and some steps can be omitted.

S11. When the traffic of the target server node is greater than a preset traffic threshold, the server determines a first area and determines a second area, where the first area is the geographic area to which the target server node belongs, and the second area is The geographic area to which the traffic of the target server node belongs.

In the embodiment of the present application, a maximum traffic threshold can be preset, such as 95% of the bandwidth value purchased for the server node, when there is an average of server nodes (target server nodes) within a preset time range (for example, 10 minutes) When the traffic is greater than the maximum traffic threshold, it will affect the quality of service of the target server. In order to ensure the quality of service of the server node, the traffic of the server node needs to be scheduled, that is, part of the traffic is transferred to other server nodes to determine which server node’s traffic belongs to. Geographical area (the second area, such as Guangdong, Guangxi, etc.).

S12. If there is a third area other than the first area in the second area, the server will schedule according to the distance between the first area and the third area and the preset schedule of the target server node. The flow threshold is used to determine the flow to be scheduled from the flow of the target server node.

Wherein, the preset scheduling flow threshold is a preset flow threshold, such as 30% of the total flow of the server node. When the server node needs to perform flow scheduling, 30% of the flow of the server node can be scheduled.

Optionally, it can be judged whether there is a third area in addition to the first area in the geographic area to which the traffic belongs. Assuming that the geographic area to which the target server node belongs (the first area) is Beijing, the geographic area to which the traffic of the target server node belongs ( The second region) includes Guangdong, Guangxi, and Beijing, that is, the target server node has access traffic from users in Guangdong, Guangxi, and Beijing (that is, there are access requests from users in Guangdong, Guangxi, and Beijing), which can be considered as the second There is a third area (Guangdong and Guangxi) in addition to the first area in the area. Assuming that the geographic region to which the target server node belongs is Beijing, and the geographic region to which the traffic of the target server node belongs is Beijing, it can be considered that there is no third region other than the first region in the second region.

In the embodiment of this application, in addition to determining how much traffic needs to be transferred based on the scheduling flow threshold, it is also necessary to determine which part of the traffic to transfer based on the distance between the first area and each third area, and priority can be given to the distance from the first area. For example, if the distance between Guangxi and Beijing is farther than the distance between Guangdong and Beijing, the traffic from Guangxi will be transferred away first. Therefore, it is necessary to determine the to-be-scheduled traffic of the server node and the fourth area to which the to-be-scheduled traffic belongs.

S13. The server determines the first scheduling server node according to the traffic to be scheduled.

Specifically, the determining the first scheduling server node according to the to-be-scheduled traffic includes:

Determining the geographic area to which the traffic to be dispatched belongs as the fourth area;

The server node in the fourth area is determined as the first scheduling server node.

S14. If the receivable traffic of the first scheduling server node is less than the to-be-scheduled traffic, the server determines link quality scores and node attributes of server nodes other than the first scheduling server node and the target server node information.

In the embodiment of this application, it can be determined whether the receivable traffic of the first scheduling server node is less than the to-be-scheduled traffic. If the receivable traffic of the first scheduling server node is greater than or equal to the to-be-scheduled traffic, the to-be-scheduled traffic can be The scheduling traffic is scheduled to the first scheduling server node. If the receivable traffic of the first scheduling server node is less than the traffic to be scheduled, link quality scores and node attribute information of server nodes other than the first scheduling server node and the target server node may be determined.

Specifically, the determining the link quality scores of server nodes other than the first scheduling server node and the target server node includes:

Determining the server node other than the first scheduling server node and the target server node as the first server node;

Determining the response time and download speed of the first server node to access the network of the fourth area;

According to a preset weight, a normalization operation is performed on the response time and the download speed to obtain the link quality score of the network from the first server node to the fourth area.

Specifically, the determining the response time and the download speed for the first server node to access the network of the fourth area includes:

Invoke an Internet packet explorer command through the agent program of the first server node to determine the response time of the first server node to access the network of the fourth area;

Acquiring, according to the historical access log of the first server node, the download traffic and download time of the network where the first server node accesses the fourth area;

Determine the download speed at which the first server node accesses the network in the fourth area according to the download traffic and the download time.

Wherein, the Internet packet explorer (Ping) is a program used to test the network connection. It can use the uniqueness of the IP address of the machine on the network to send a data packet to the target IP address, and then ask the other party to return a data of the same size Package to determine whether two network machines are connected and what is the delay.

Among them, Agent refers to a software or hardware entity capable of autonomous activities.

In this alternative embodiment, the agent deployed on the server node (the first server node) can be used to ping the main route of the network in the fourth area to obtain the response time, and the server node can be obtained through historical access log data. The download traffic and download time of accessing the network in the fourth area are calculated to obtain the download speed.

Specifically, the preset weight includes a response weight and a download weight, and the response time and download speed are normalized according to the preset weight to obtain the information from the first server node to the fourth area. The link quality score of the network includes:

Determine the response value of the first server node according to the response weight and the response time of the first server node accessing the network of the fourth area, and determine the response value of the first server node according to the download weight and the access time of the first server node. The download speed of the network in the fourth area, and determine the download value of the first server node;

Calculating the ratio of the download value of the first server node to the response value of the first server node;

Perform a normalization operation on the ratio to obtain a link quality score of the network from the first server node to the fourth area.

Among them, normalization is an algorithm proposed for the convenience of data processing and mapping data to a range of 0 to 1.

As an optional implementation manner, the response time of the first server node's access to the network in the fourth area can be multiplied by the response weight to obtain the response value, and the download speed of the first server node's access to the network in the fourth area can be multiplied by Download the weight to obtain the download value, because the smaller the response time value, the better the service quality provided by the server node. The larger the download speed value, the better the service quality provided by the server node. Therefore, the response value is used as the denominator, and the download value is used as the The numerator, the larger the ratio of the response value to the download value, the larger the corresponding link quality score, and the better the service quality provided by the server node.

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 application, because the first scheduling server node cannot receive all the to-be-scheduled traffic, it needs to find other server nodes to receive the remaining to-be-scheduled traffic.

Specifically, the node attribute information includes real-time availability status, real-time traffic percentage, operator, traffic cost, and traffic growth rate. According to the link quality score and the node attribute information, determining the second scheduling server node includes :

Sorting the first server node according to the link quality score from large to small to obtain the first queue;

Determine, from the first server node, a second server node that is not suitable for scheduling according to the real-time availability status of the first server node, the real-time traffic percentage, the operator, and the traffic growth rate;

Delete the second server node from all nodes in the first queue to obtain a second queue;

According to the traffic cost, from all the nodes in the second queue, the node with the first arrangement order is determined as the second scheduling server node.

In this optional implementation manner, all first server nodes can be sorted according to their corresponding link quality scores from large to small to obtain the first queue, and according to the real-time availability status and real-time traffic percentage of the first server node , The operator and the traffic growth rate, determine the first server node that is not suitable for traffic scheduling, that is, the second server node, and delete the second server node in the first queue to obtain the second queue, and then consider the traffic cost in combination. Select the top-ranked server node to be scheduled from the second queue for traffic scheduling. The first server node can be selected. The server node to be scheduled for traffic scheduling has a higher link quality score, that is, the server node to be scheduled. The quality of services provided is high.

Specifically, according to the real-time availability status of the first server node, the real-time traffic percentage, the operator, and the traffic growth rate, the first server node that is not suitable for scheduling is determined from the first server node. The second server node includes:

For each node in the first server node, determine whether the real-time available state of the node is a preset state;

If the real-time available state of the node is a preset state, judging whether the real-time traffic percentage of the node is less than a preset percentage threshold;

If the real-time traffic percentage of the node is less than the preset percentage threshold, judging whether the operator of the node is a preset operator;

If the operator of the node is a preset operator, determine the traffic growth rate of the node within the preset time range according to the log file of the node;

Judging whether the traffic growth rate is greater than a preset rate threshold;

If the traffic growth rate is greater than the preset rate threshold, the node is determined as a second server node that 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 that is not suitable for scheduling; if the real-time traffic percentage of the first server node is greater than or equal to the percentage Threshold (for example, the server node has purchased 90% of the bandwidth), the service pressure of the server node is relatively high, and it is not suitable for scheduling; if the operator of the first server node is not the preset operator, it is not suitable for receiving the traffic to be scheduled Scheduling; the log file of the first server node can be used to determine the traffic growth rate of the first server node in the most recent period. If the traffic growth rate is greater than the preset speed threshold, the service pressure of the first server node will increase quickly. It is unable to continue to provide good quality services and is not suitable for scheduling. By screening out the first server node (that is, the second server node) that is not suitable for scheduling, it can be ensured that the traffic to be scheduled can be scheduled to a suitable server node.

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 application, 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, and a part of the scheduled traffic is scheduled to the first scheduling server node , And scheduling another part of the traffic to be scheduled to the second scheduling server node. That is, the to-be-scheduled traffic can be scheduled to the currently most suitable server node, which can improve the service quality of the server node.

In the method flow described in Figure 1, when the traffic increases suddenly, that is, when the traffic of the target server node is greater than the preset traffic threshold, the traffic to be scheduled can be determined, and the traffic to be scheduled can be scheduled to the first scheduling server node to slow down the current server. The service pressure of the node can improve the service quality, and the link quality scores of other server nodes can be calculated, and then the appropriate server node (second scheduling server node) can be determined according to the link quality score and the server node attribute information of other server nodes. Part of the traffic is dispatched to these 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 above are only specific implementations of this application, but the scope of protection of this application is not limited to this. For those of ordinary skill in the art, without departing from the creative concept of this application, they can also make Improvements, but these all belong to the scope of protection of this application.

Please refer to FIG. 2. FIG. 2 is a functional module diagram of a preferred embodiment of a traffic scheduling device disclosed in the present application.

In some embodiments, the traffic scheduling device runs in a server. The traffic scheduling device may include multiple functional modules composed of program code segments, and the program is a series of computer-readable instruction codes. The program code of each program segment in the flow scheduling device may be stored in a memory and executed by at least one processor to execute part or all of the steps in the flow scheduling method described in FIG. 1. For details, refer to FIG. 1. The related description in the method will not be repeated here.

In this embodiment, the traffic scheduling device can be divided into multiple functional modules according to the functions it performs. The functional modules may include: a determining module 201 and a scheduling module 202. The module referred to in this application refers to a series of computer program segments that can be executed by at least one processor and can complete fixed functions, and are stored in a memory.

The determining module 201 is configured to determine a first area and a second area when the traffic of the target server node is greater than a preset traffic threshold, wherein the first area is the geographic area to which the target server node belongs, and the first area is the geographic area to which the target server node belongs. The second area is the geographic area to which the traffic of the target server node belongs.

The determining module 201 is further configured to: if there is a third area other than the first area in the second area, according to the distance between the first area and the third area and the target The preset scheduling flow threshold of the server node determines the flow to be scheduled from the flow of the target server node.

The determining module 201 is further configured to determine the first scheduling server node according to the traffic to be scheduled.

The determining module 201 is further configured to determine the chain of server nodes other than the first scheduling server node and the target server node if the receivable traffic of the first scheduling server node is less than the to-be-scheduled traffic. Road quality score and node attribute information.

In the embodiment of this application, it can be determined whether the receivable traffic of the first scheduling server node is less than the to-be-scheduled traffic. If the receivable traffic of the first scheduling server node is greater than or equal to the to-be-scheduled traffic, the to-be-scheduled traffic can be The scheduling traffic is scheduled to the first scheduling server node. If the receivable traffic of the first dispatch server node is less than the traffic to be dispatched, link quality scores and node attribute information of server nodes other than the first dispatch 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.

The scheduling module 202 is 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 application, because the first scheduling server node cannot receive all the to-be-scheduled traffic, the to-be-scheduled traffic needs to be divided into two parts for scheduling, and a part of the scheduled traffic is scheduled to the first scheduling server node , And scheduling another part of the traffic to be scheduled to the second scheduling server node. That is, the to-be-scheduled traffic can be scheduled to the currently most suitable server node, which can improve the service quality of the server node.

As an optional implementation manner, the method for the determining module 201 to determine the first scheduling server node according to the to-be-scheduled traffic is specifically as follows:

As an optional implementation manner, the method for the determining module 201 to determine the link quality scores of server nodes other than the first scheduling server node and the target server node is specifically as follows:

As an optional implementation manner, the node attribute information includes real-time availability status, real-time traffic percentage, operator, traffic cost, and traffic growth rate. The determining module 201 is based on the link quality score and the node attribute. Information, the method for determining the second scheduling server node is specifically:

Determine, from the first server nodes, a second server node that is not suitable for scheduling according to the real-time availability status of the first server node, the real-time traffic percentage, the operator, and the traffic growth rate;

As an optional implementation manner, the determining module 201 obtains data from the first server node according to the real-time availability status, the real-time traffic percentage, the operator, and the traffic growth rate. The method for determining the second server node that is not suitable for scheduling among the server nodes is specifically as follows:

If the real-time traffic percentage of the node is less than the preset percentage threshold, judging whether the operator of the node is the preset operator;

As an optional implementation manner, the manner in which the determining module 201 determines the response time and download speed of the first server node to access the network in the fourth area is specifically as follows:

As an optional implementation manner, the preset weight includes a response weight and a download weight, and the determination module 201 performs a normalization operation on the response time and download speed according to the preset weight to obtain the first The method of the link quality score between the server node and the network in the fourth area is specifically as follows:

In the traffic scheduling device described in Figure 2, 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 can be determined, and the traffic to be scheduled can be scheduled to the first scheduling server node to slow down the current The service pressure of the server node can improve the service quality. You can also calculate the link quality scores of other server nodes, and then determine the appropriate server node (second scheduling server node) based on the link quality scores and the server node attribute information of other server nodes , Dispatch part of the traffic to these server nodes, find a suitable server node 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 in a preferred embodiment of the traffic scheduling method according to the present application. The server 3 includes a memory 31, at least one processor 32, computer readable instructions 33 stored in the memory 31 and executable on the at least one processor 32, and at least one communication bus 34.

Those skilled in the art can understand that the schematic diagram shown in FIG. 3 is only an example of the server 3, and does not constitute a limitation on the server 3. It may include more or less components than those shown in the figure, or combine some Components, or different components, for example, the server 3 may also include input and output devices, network access devices, and so on.

The server 3 also includes, but is not limited to, any electronic product that can interact with the user through a keyboard, a mouse, a remote control, a touch panel, or a voice control device, for example, a personal computer, a tablet computer, a smart phone, and a personal computer. Digital assistants (Personal Digital Assistant, PDA), game consoles, interactive network television (Internet Protocol Television, IPTV), smart wearable devices, etc.

The at least one processor 32 may be a central processing unit (Central Processing Unit, CPU), or other general-purpose processors, digital signal processors (Digital Signal Processors, DSPs), and application specific integrated circuits (ASICs). ), Field-Programmable Gate Array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. The processor 32 can be a microprocessor or the processor 32 can also be any conventional processor, etc. The processor 32 is the control center of the server 3, and connects each of the entire server 3 through various interfaces and lines. part.

The memory 31 may be used to store the computer-readable instructions 33 and/or modules/units, and the processor 32 can run or execute the computer-readable instructions and/or modules/units stored in the memory 31, and The data stored in the memory 31 is called to realize various functions of the server 3. The memory 31 may mainly include a storage program area and a storage data area. The storage program area may store an operating system, an application program required by at least one function (such as a sound playback function, an image playback function, etc.), etc.; the storage data area may The data etc. created in accordance with the use of the server 3 are stored. In addition, the memory 31 may include volatile memory such as high-speed random access memory, and may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart media card (SMC), and a secure digital ( Secure Digital, SD card, Flash Card, at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device.

With reference to FIG. 1, the memory 31 in the server 3 stores multiple instructions to implement a traffic scheduling method, and the processor 32 can execute the multiple instructions to achieve:

Specifically, for the specific implementation method of the above-mentioned instructions by the processor 32, reference may be made to the description of the relevant steps in the embodiment corresponding to FIG. 1, which will not be repeated here.

In the server 3 described in Figure 3, when the traffic increases suddenly, that is, when the traffic of the target server node is greater than the preset traffic threshold, the traffic to be scheduled can be determined, and the traffic to be scheduled can be scheduled to the first scheduling server node to slow down the current server. The service pressure of the node can improve the service quality, and the link quality scores of other server nodes can be calculated, and then the appropriate server node (second scheduling server node) can be determined according to the link quality score and the server node attribute information of other server nodes. Part of the traffic is dispatched to these 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.

When the integrated modules/units of the server 3 are implemented in the form of software functional units and sold or used as independent products, they may be stored in a computer-readable storage medium, which may be non-volatile. The storage medium can also be a volatile storage medium. Based on this understanding, this application implements all or part of the processes in the above-mentioned embodiments and methods, and can also be completed by instructing relevant hardware through computer-readable instructions, and the computer-readable instructions can be stored in a computer-readable storage medium. When the computer-readable instructions are executed by the processor, they can implement the steps of the foregoing method embodiments. Wherein, the computer-readable instruction includes computer-readable instruction code, and the computer-readable instruction code may be in the form of source code, object code, executable file, or some intermediate form. The computer-readable medium may include: any entity or device capable of carrying the computer-readable instruction code, recording medium, U disk, mobile hard disk, magnetic disk, optical disk, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory).

In the several embodiments provided in this application, it should be understood that the disclosed system, device, and method can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of the modules is only a logical function division, and there may be other division methods in actual implementation.

The modules described as separate components may or may not be physically separated, and the components displayed as modules may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules can be selected according to actual needs to achieve the objectives of the solutions of the embodiments.

In addition, the functional modules in the various embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware, or may be implemented in the form of hardware plus software functional modules.

For those skilled in the art, it is obvious that the present application is not limited to the details of the foregoing exemplary embodiments, and the present application can be implemented in other specific forms without departing from the spirit or basic characteristics of the application. Therefore, no matter from which point of view, the embodiments should be regarded as exemplary and non-limiting. The scope of this application is defined by the appended claims rather than the above description, and therefore it is intended to fall into the claims. All changes in the meaning and scope of the equivalent elements of are included in this application. Any associated diagram marks in the claims should not be regarded as limiting the claims involved. In addition, it is obvious that the word "including" does not exclude other units or steps, and the singular does not exclude the plural. Multiple units or devices stated in the system claims can also be implemented by one unit or device through software or hardware. The second class words are used to indicate names, and do not indicate any specific order.

Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the application and not to limit them. Although the application has been described in detail with reference to the preferred embodiments, those of ordinary skill in the art should understand that the technical solutions of the application can be Make modifications or equivalent replacements without departing from the spirit and scope of the technical solution of the present application.

Claims

A flow scheduling method, wherein the flow scheduling method includes:

When the traffic of the target server node is greater than the preset traffic threshold, determine a first area and determine a second area, where the first area is the geographic area to which the target server node belongs, and the second area is the target The geographic area to which the server node’s traffic belongs;

If there is a third area other than the first area in the second area, according to the distance between the first area and the third area and the preset scheduling traffic threshold of the target server node, Determining the to-be-scheduled traffic from the traffic of the target server node;

Determine the first scheduling server node according to the to-be-scheduled traffic;

If the receivable traffic of the first scheduling server node is less than the to-be-scheduled traffic, determining link quality scores and node attribute information of server nodes other than the first scheduling server node and the target server node;

Determine a second scheduling server node according to the link quality score and the node attribute information;

Scheduling the to-be-scheduled traffic to the first scheduling server node and the second scheduling server node.
The traffic scheduling method according to claim 1, wherein the determining the first scheduling server node according to the to-be-scheduled traffic comprises:

Determining the geographic area to which the traffic to be dispatched belongs as the fourth area;

The server node in the fourth area is determined as the first scheduling server node.
The traffic scheduling method according to claim 2, wherein said determining the link quality scores of server nodes other than the first scheduling server node and the target server node comprises:

Determining the server node other than the first scheduling server node and the target server node as the first server node;

Determining the response time and download speed of the first server node to access the network of the fourth area;

According to a preset weight, a normalization operation is performed on the response time and the download speed to obtain the link quality score of the network from the first server node to the fourth area.
The traffic scheduling method according to claim 3, wherein the node attribute information includes real-time available status, real-time traffic percentage, operator, traffic cost, and traffic growth rate, and the node attribute information is based on the link quality score and the node The attribute information that determines the second scheduling server node includes:

Sorting the first server node according to the link quality score from large to small to obtain the first queue;

Determine, from the first server nodes, a second server node that is not suitable for scheduling according to the real-time availability status of the first server node, the real-time traffic percentage, the operator, and the traffic growth rate;

Delete the second server node from all nodes in the first queue to obtain a second queue;

According to the traffic cost, from all the nodes in the second queue, the node with the first arrangement order is determined as the second scheduling server node.
The traffic scheduling method according to claim 4, wherein the real-time availability status of the first server node, the real-time traffic percentage, the operator, and the traffic growth rate are determined from the first server node. The second server node determined to be unsuitable for scheduling among the server nodes includes:

For each node in the first server node, determine whether the real-time available state of the node is a preset state;

If the real-time available state of the node is a preset state, judging whether the real-time traffic percentage of the node is less than a preset percentage threshold;

If the real-time traffic percentage of the node is less than the preset percentage threshold, judging whether the operator of the node is a preset operator;

If the operator of the node is a preset operator, determine the traffic growth rate of the node within the preset time range according to the log file of the node;

Judging whether the traffic growth rate is greater than a preset rate threshold;

If the traffic growth rate is greater than the preset rate threshold, the node is determined as a second server node that is not suitable for scheduling.
The traffic scheduling method according to claim 3, wherein the determining the response time and the download speed of the first server node to access the network of the fourth area comprises:

Invoke an Internet packet explorer command through the agent program of the first server node to determine the response time of the first server node to access the network of the fourth area;

Acquiring, according to the historical access log of the first server node, the download traffic and download time of the network where the first server node accesses the fourth area;

Determine the download speed at which the first server node accesses the network in the fourth area according to the download traffic and the download time.
The traffic scheduling method according to claim 3, wherein the preset weight includes a response weight and a download weight, and the response time and the download speed are normalized according to the preset weight to obtain the first The link quality score of a server node to the network of the fourth area includes:

Determine the response value of the first server node according to the response weight and the response time of the first server node accessing the network of the fourth area, and determine the response value of the first server node according to the download weight and the access time of the first server node. The download speed of the network in the fourth area, and determine the download value of the first server node;

Calculating the ratio of the download value of the first server node to the response value of the first server node;

Perform a normalization operation on the ratio to obtain a link quality score of the network from the first server node to the fourth area.
A server, wherein the server includes a processor and a memory, and the processor is configured to execute at least one computer-readable instruction stored in the memory to implement the following steps:

When the traffic of the target server node is greater than the preset traffic threshold, determine a first area and determine a second area, where the first area is the geographic area to which the target server node belongs, and the second area is the target The geographic area to which the server node’s traffic belongs;

If there is a third area other than the first area in the second area, according to the distance between the first area and the third area and the preset scheduling traffic threshold of the target server node, Determining the to-be-scheduled traffic from the traffic of the target server node;

Determine the first scheduling server node according to the to-be-scheduled traffic;

If the receivable traffic of the first scheduling server node is less than the to-be-scheduled traffic, determining link quality scores and node attribute information of server nodes other than the first scheduling server node and the target server node;

Determine a second scheduling server node according to the link quality score and the node attribute information;

Scheduling the to-be-scheduled traffic to the first scheduling server node and the second scheduling server node.
The server according to claim 8, wherein when the first scheduling server node is determined according to the to-be-scheduled traffic, the processor executes the at least one computer-readable instruction to implement the following steps:

Determining the geographic area to which the traffic to be dispatched belongs as the fourth area;

The server node in the fourth area is determined as the first scheduling server node.
The server according to claim 9, wherein, when determining the link quality scores of server nodes other than the first scheduling server node and the target server node, the processor executes the at least one Computer readable instructions to achieve the following steps:

Determining the server node other than the first scheduling server node and the target server node as the first server node;

Determining the response time and download speed of the first server node to access the network of the fourth area;

According to a preset weight, a normalization operation is performed on the response time and the download speed to obtain the link quality score of the network from the first server node to the fourth area.
The server according to claim 10, wherein the node attribute information includes real-time availability status, real-time traffic percentage, operator, traffic cost, and traffic growth rate, and according to the link quality score and the node attribute information Information, when the second scheduling server node is determined, the processor executes the at least one computer-readable instruction to implement the following steps:

Sorting the first server node according to the link quality score from large to small to obtain the first queue;

Determine, from the first server nodes, a second server node that is not suitable for scheduling according to the real-time availability status of the first server node, the real-time traffic percentage, the operator, and the traffic growth rate;

Delete the second server node from all nodes in the first queue to obtain a second queue;

According to the traffic cost, from all the nodes in the second queue, the node with the first arrangement order is determined as the second scheduling server node.
The server according to claim 11, wherein, according to the real-time availability status of the first server node, the real-time traffic percentage, the operator, and the traffic growth rate, from the first server node When a second server node that is not suitable for scheduling is determined among the server nodes, the processor executes the at least one computer-readable instruction to implement the following steps:

For each node in the first server node, determine whether the real-time available state of the node is a preset state;

If the real-time available state of the node is a preset state, judging whether the real-time traffic percentage of the node is less than a preset percentage threshold;

If the real-time traffic percentage of the node is less than the preset percentage threshold, judging whether the operator of the node is a preset operator;

If the operator of the node is a preset operator, determine the traffic growth rate of the node within the preset time range according to the log file of the node;

Judging whether the traffic growth rate is greater than a preset rate threshold;

If the traffic growth rate is greater than the preset rate threshold, the node is determined as a second server node that is not suitable for scheduling.
10. The server according to claim 10, wherein the processor executes the at least one computer readable instruction when determining the response time and download speed of the first server node accessing the network of the fourth area To achieve the following steps:

Invoke an Internet packet explorer command through the agent program of the first server node to determine the response time of the first server node to access the network of the fourth area;

Acquiring, according to the historical access log of the first server node, the download traffic and download time of the network where the first server node accesses the fourth area;

Determine the download speed at which the first server node accesses the network in the fourth area according to the download traffic and the download time.
A computer-readable storage medium, wherein the computer-readable storage medium stores at least one computer-readable instruction, and when the at least one computer-readable instruction is executed by a processor, the following steps are implemented:

When the traffic of the target server node is greater than the preset traffic threshold, determine a first area and determine a second area, where the first area is the geographic area to which the target server node belongs, and the second area is the target The geographic area to which the server node’s traffic belongs;

If there is a third area other than the first area in the second area, according to the distance between the first area and the third area and the preset scheduling traffic threshold of the target server node, Determining the to-be-scheduled traffic from the traffic of the target server node;

Determine the first scheduling server node according to the to-be-scheduled traffic;

If the receivable traffic of the first scheduling server node is less than the to-be-scheduled traffic, determining link quality scores and node attribute information of server nodes other than the first scheduling server node and the target server node;

Determine a second scheduling server node according to the link quality score and the node attribute information;

Scheduling the to-be-scheduled traffic to the first scheduling server node and the second scheduling server node.
The storage medium according to claim 14, wherein, when the first scheduling server node is determined according to the to-be-scheduled traffic, the at least one computer-readable instruction is executed by a processor to implement the following steps:

Determining the geographic area to which the traffic to be dispatched belongs as the fourth area;

The server node in the fourth area is determined as the first scheduling server node.
The storage medium according to claim 15, wherein, when the link quality scores of server nodes other than the first scheduling server node and the target server node are determined, the at least one computer-readable instruction It is executed by the processor to achieve the following steps:

Determining the server node other than the first scheduling server node and the target server node as the first server node;

Determining the response time and download speed of the first server node to access the network of the fourth area;

According to a preset weight, a normalization operation is performed on the response time and the download speed to obtain the link quality score of the network from the first server node to the fourth area.
The storage medium according to claim 16, wherein the node attribute information includes real-time availability status, real-time traffic percentage, operator, traffic cost, and traffic growth rate, and in accordance with the link quality score and the node Attribute information, when determining the second scheduling server node, the at least one computer-readable instruction is executed by the processor to implement the following steps:

Sorting the first server node according to the link quality score from large to small to obtain the first queue;

Determine, from the first server nodes, a second server node that is not suitable for scheduling according to the real-time availability status of the first server node, the real-time traffic percentage, the operator, and the traffic growth rate;

Delete the second server node from all nodes in the first queue to obtain a second queue;

According to the traffic cost, from all the nodes in the second queue, the node with the first arrangement order is determined as the second scheduling server node.
The storage medium according to claim 17, wherein, according to the real-time availability status of the first server node, the real-time traffic percentage, the operator, and the traffic growth rate, from the first server node When a second server node that is not suitable for scheduling is determined among a server node, the at least one computer-readable instruction is further used to implement the following steps when being executed by the processor:

For each node in the first server node, determine whether the real-time available state of the node is a preset state;

If the real-time available state of the node is a preset state, judging whether the real-time traffic percentage of the node is less than a preset percentage threshold;

If the real-time traffic percentage of the node is less than the preset percentage threshold, judging whether the operator of the node is a preset operator;

If the operator of the node is a preset operator, determine the traffic growth rate of the node within the preset time range according to the log file of the node;

Judging whether the traffic growth rate is greater than a preset rate threshold;

If the traffic growth rate is greater than the preset rate threshold, the node is determined as a second server node that is not suitable for scheduling.
The storage medium according to claim 16, wherein the at least one computer-readable instruction is executed by a processor when determining the response time and download speed of the first server node accessing the network of the fourth area The time is also used to achieve the following steps:

Invoke an Internet packet explorer command through the agent program of the first server node to determine the response time of the first server node to access the network of the fourth area;

Acquiring, according to the historical access log of the first server node, the download traffic and download time of the network where the first server node accesses the fourth area;

Determine the download speed at which the first server node accesses the network in the fourth area according to the download traffic and the download time.
A flow scheduling device, wherein the flow scheduling device includes:

The determining module is configured to determine a first area and a second area when the traffic of the target server node is greater than a preset traffic threshold, where the first area is the geographic area to which the target server node belongs, and the second The area is the geographic area to which the traffic of the target server node belongs;

The determining module is further configured to, if there is a third area other than the first area in the second area, according to the distance between the first area and the third area and the target server The preset scheduling flow threshold of the node, and determining the flow to be scheduled from the flow of the target server node;

The determining module is further configured to determine the first scheduling server node according to the to-be-scheduled traffic;

The determining module is further configured to determine links of server nodes other than the first scheduling server node and the target server node if the receivable traffic of the first scheduling server node is less than the to-be-scheduled traffic Quality score and node attribute information;

The determining module is further configured to determine a second scheduling server node according to the link quality score and the node attribute information;

The scheduling module is configured to schedule the traffic to be scheduled to the first scheduling server node and the second scheduling server node.