Business scheduling method and device, computer equipment, storage medium and computer program product

Abstract

The embodiment of the invention provides a service scheduling method and device, computer equipment, a storage medium and a computer program product, and relates to the technical field of network data management. The method comprises the following steps: receiving a first data acquisition request sent by a content distribution node from a data acquisition terminal; generating a first random code corresponding to the first data acquisition request, and obtaining update resource address information corresponding to the first data acquisition request according to the first random code; returning request response information containing the updated resource address information to the content distribution node; the content distribution node is used for returning request response information to the data acquisition terminal and sending a second data acquisition request from the data acquisition terminal to the decision system; the second data acquisition request carries a second random code; sending the first random code to a decision system; and the decision system is used for acquiring a service scheduling strategy of the scheduling system according to the first random code and the second random code. According to the method, the timeliness and the accuracy of service scheduling are improved.

Description

Technical Field

[0001] The present application relates to the technical field of network data management, and in particular to a service scheduling method, apparatus, computer equipment, storage medium and computer program product. Background Art

[0002] In the field of Content Delivery Network (CDN), it is usually necessary to introduce 302 scheduling technology to achieve fast redirection, load balancing and precise scheduling functions.

[0003] The current optimization direction of 302 scheduling technology usually tends to be better load balancing algorithms (network factors, bandwidth factors, etc.), and the characteristics and needs of various business scenarios are not fully and comprehensively considered, resulting in the inability to timely discover that 302 scheduling is not applicable to some business scenarios, which leads to low accuracy and low availability of business scheduling. Summary of the invention

[0004] Based on this, it is necessary to provide a service scheduling method, apparatus, computer equipment, storage medium and computer program product to address the above technical issues.

[0005] In a first aspect, the present application provides a service scheduling method, which is applied to a scheduling system. The method comprises:

[0006] receiving a first data acquisition request sent by a content distribution node from a data acquisition terminal;

[0007] Generate a first random code corresponding to the first data acquisition request, and obtain update resource address information corresponding to the first data acquisition request according to the first random code;

[0008] Returning a request response message including the update resource address information to the content distribution node; the content distribution node is used to return the request response message to the data acquisition terminal, and send a second data acquisition request from the data acquisition terminal to the decision system; the second data acquisition request carries a second random code;

[0009] The first random code is sent to the decision system; the decision system is used to obtain the service scheduling strategy of the scheduling system according to the first random code and the second random code.

[0010] In one embodiment, obtaining the update resource address information corresponding to the first data acquisition request based on the first random code includes: determining an update edge server for the data acquisition terminal; determining the redirection resource address information corresponding to the first data acquisition request based on the update edge server; and obtaining the update resource address information corresponding to the first data acquisition request based on the first random code and the redirection resource address information.

[0011] In one of the embodiments, obtaining the updated resource address information corresponding to the first data acquisition request based on the first random code and the redirected resource address information includes: writing the first random code as a parameter into the redirected resource address information to obtain the updated resource address information corresponding to the first data acquisition request.

[0012] In a second aspect, the present application provides a service scheduling method, which is applied to a decision-making system. The method comprises:

[0013] Obtaining a first random code set from a scheduling system;

[0014] Obtaining a second random code set from a content distribution node;

[0015] A service scheduling policy of the scheduling system is acquired according to the first random code set and the second random code set.

[0016] In one embodiment, obtaining the service scheduling strategy of the scheduling system according to the first random code set and the second random code set includes: obtaining the scheduling success rate of the scheduling system according to the first random code set and the second random code set; and obtaining the service scheduling strategy of the scheduling system according to the scheduling success rate.

[0017] In one embodiment, obtaining the scheduling success rate of the scheduling system based on the first random code set and the second random code set includes: obtaining a first number of identical random codes in the second random code set and the first random code; and obtaining the scheduling success rate of the scheduling system based on a ratio of the first number of identical random codes to a second amount of data in the first random code set.

[0018] In one of the embodiments, the business scheduling policy of the scheduling system is obtained based on the scheduling success rate, including: if the scheduling success rate is less than a preset success rate threshold, determining that the business scheduling policy of the scheduling system is to shut down the scheduling function of the scheduling system; if the scheduling success rate is greater than or equal to the preset success rate threshold, obtaining the corresponding user agent concentration and address concentration; based on the user agent concentration and the address concentration, obtaining the business scheduling policy of the scheduling system.

[0019] In a third aspect, the present application provides a service scheduling device, which is applied to a scheduling system. The device includes:

[0020] A receiving module, configured to receive a first data acquisition request sent by a content distribution node from a data acquisition terminal;

[0021] a random code generation module, configured to generate a first random code corresponding to the first data acquisition request, and obtain update resource address information corresponding to the first data acquisition request according to the first random code;

[0022] A response module, used to return the request response information including the update resource address information to the content distribution node; the content distribution node is used to return the request response information to the data acquisition terminal, and send a second data acquisition request from the data acquisition terminal to the decision system; the second data acquisition request carries a second random code;

[0023] A sending module is used to send the first random code to the decision system; the decision system is used to obtain the service scheduling strategy of the scheduling system according to the first random code and the second random code.

[0024] In a fourth aspect, the present application provides a service scheduling device, which is applied to a decision-making system. The device includes:

[0025] A first acquisition module, used to acquire a first random code set from a scheduling system;

[0026] A second acquisition module, used to acquire a second random code set from a content distribution node;

[0027] A decision module is used to obtain a service scheduling strategy of the scheduling system according to the first random code set and the second random code set.

[0028] In a fifth aspect, the present application further provides a computer device. The computer device includes a memory and a processor, the memory stores a computer program, and the processor implements the following steps when executing the computer program:

[0029] receiving a first data acquisition request sent by a content distribution node from a data acquisition terminal;

[0030] Generate a first random code corresponding to the first data acquisition request, and obtain update resource address information corresponding to the first data acquisition request according to the first random code;

[0031] Returning a request response message including the update resource address information to the content distribution node; the content distribution node is used to return the request response message to the data acquisition terminal, and send a second data acquisition request from the data acquisition terminal to the decision system; the second data acquisition request carries a second random code;

[0032] The first random code is sent to the decision system; the decision system is used to obtain the service scheduling strategy of the scheduling system according to the first random code and the second random code.

[0033] In a sixth aspect, the present application further provides a computer device. The computer device includes a memory and a processor, the memory stores a computer program, and the processor implements the following steps when executing the computer program:

[0034] Obtaining a first random code set from a scheduling system;

[0035] Obtaining a second random code set from a content distribution node;

[0036] A service scheduling policy of the scheduling system is acquired according to the first random code set and the second random code set.

[0037] In a seventh aspect, the present application further provides a computer-readable storage medium. The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the following steps are implemented:

[0038] receiving a first data acquisition request sent by a content distribution node from a data acquisition terminal;

[0039] Generate a first random code corresponding to the first data acquisition request, and obtain update resource address information corresponding to the first data acquisition request according to the first random code;

[0040] Returning a request response message including the update resource address information to the content distribution node; the content distribution node is used to return the request response message to the data acquisition terminal, and send a second data acquisition request from the data acquisition terminal to the decision system; the second data acquisition request carries a second random code;

[0041] The first random code is sent to the decision system; the decision system is used to obtain the service scheduling strategy of the scheduling system according to the first random code and the second random code.

[0042] In an eighth aspect, the present application further provides a computer-readable storage medium. The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the following steps are implemented:

[0043] Obtaining a first random code set from a scheduling system;

[0044] Obtaining a second random code set from a content distribution node;

[0045] A service scheduling policy of the scheduling system is acquired according to the first random code set and the second random code set.

[0046] In a ninth aspect, the present application further provides a computer program product. The computer program product includes a computer program, and when the computer program is executed by a processor, the following steps are implemented:

[0047] receiving a first data acquisition request sent by a content distribution node from a data acquisition terminal;

[0048] Generate a first random code corresponding to the first data acquisition request, and obtain update resource address information corresponding to the first data acquisition request according to the first random code;

[0049] Returning a request response message including the update resource address information to the content distribution node; the content distribution node is used to return the request response message to the data acquisition terminal, and send a second data acquisition request from the data acquisition terminal to the decision system; the second data acquisition request carries a second random code;

[0050] The first random code is sent to the decision system; the decision system is used to obtain the service scheduling strategy of the scheduling system according to the first random code and the second random code.

[0051] In a tenth aspect, the present application further provides a computer program product. The computer program product includes a computer program, and when the computer program is executed by a processor, the following steps are implemented:

[0052] Obtaining a first random code set from a scheduling system;

[0053] Obtaining a second random code set from a content distribution node;

[0054] A service scheduling policy of the scheduling system is acquired according to the first random code set and the second random code set.

[0055] In the above-mentioned business scheduling method, apparatus, computer equipment, storage medium and computer program product, the scheduling system can receive a first data acquisition request from a data acquisition terminal sent by a content distribution node; generate a first random code corresponding to the first data acquisition request, and obtain updated resource address information corresponding to the first data acquisition request based on the first random code; return request response information containing updated resource address information to the content distribution node; the content distribution node is used to return the request response information to the data acquisition terminal, and send a second data acquisition request from the data acquisition terminal to the decision system; the second data acquisition request carries a second random code; send the first random code to the decision system; the decision system is used to obtain the business scheduling strategy of the scheduling system based on the first random code and the second random code. In the method provided in the embodiment of the present application, the scheduling system can generate a first random code corresponding to the first data acquisition request, and return the first random code to the data acquisition terminal through the content distribution node. Next, the decision system can receive the first random code and the second random code included in the second data acquisition request from the data acquisition terminal, and obtain the business scheduling strategy of the scheduling system based on the first random code and the second random code. Therefore, the corresponding scheduling method can be adjusted dynamically according to the data acquisition business, avoiding the problem of not being able to timely discover that 302 scheduling is not applicable to some business scenarios, thereby improving the timeliness and accuracy of business scheduling. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0057] FIG1 is a schematic diagram of a flow chart of a service scheduling method provided in an embodiment of the present application;

[0058] FIG2 is a schematic diagram of a process of performing service scheduling by a service scheduling system provided in an embodiment of the present application;

[0059] FIG3 is a schematic diagram of a process for obtaining and updating resource address information provided in an embodiment of the present application;

[0060] FIG4 is a flow chart of another service scheduling method provided in an embodiment of the present application;

[0061] FIG5 is a schematic diagram of a flow chart of a log analysis system obtaining business scheduling analysis data according to an embodiment of the present application;

[0062] FIG6 is a schematic diagram of a process for obtaining a service scheduling strategy of a scheduling system provided in an embodiment of the present application;

[0063] FIG7 is a schematic diagram of a flow chart of a configuration decision system for configuring a service scheduling strategy according to an embodiment of the present application;

[0064] FIG8 is a structural block diagram of a service scheduling device provided in an embodiment of the present application;

[0065] FIG9 is a structural block diagram of another service scheduling device provided in an embodiment of the present application;

[0066] FIG. 10 is an internal structure diagram of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION

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

[0068] Glossary

[0069] Content Delivery Network (CDN) is a network technology that optimizes content transmission and access speed by deploying servers in different geographical locations around the world. CDN caches the content of the source station (origin server) on multiple servers (edge ​​servers) and redirects requests to the nearest server (edge ​​server) based on the user's geographical location, thereby reducing data transmission time and latency and increasing website loading speed.

[0070] 302 dispatch: 302 dispatch in CDN (Content Distribution Network) means that when a user requests a resource, the CDN server redirects the user's request to another server to obtain the resource through the http status code 302.

[0071] In an exemplary embodiment, as shown in FIG1 , a service scheduling method is provided. This embodiment is illustrated by applying the method to a scheduling system. The method includes the following steps:

[0072] Step 102: Receive a first data acquisition request sent by a content distribution node from a data acquisition terminal.

[0073] in,

[0074] The method of the embodiment of the present application can be applied to a business scheduling system, as shown in FIG2, the business scheduling system may include a data acquisition terminal, a content distribution node (CDN node), a scheduling system and a decision system, and the decision system may include a log analysis system and a configuration decision system. A user can initiate a DNS domain name resolution request to a computer domain name system (Domain Name System, DNS) server through a browser or other application on the data acquisition terminal, and the DNS server can return the IP address of the CDN service manufacturer's scheduling machine to the data acquisition terminal. The user can trigger a first data acquisition request for the data to be acquired to the CDN node according to the IP address of the scheduling machine. The first data acquisition request can carry the terminal IP address of the data acquisition terminal, the user IP address of the user and the resource address information (Uniform Resource Locator, URL), and the CDN node can forward the first data acquisition request to the scheduling node, which can be a 302 scheduling node in the CDN network, wherein the 302 scheduling node is a redirection strategy in the CDN (Content Delivery Network, content distribution network) for processing the traffic distribution requested by the client. When a client requests a resource from the CDN, the CDN will determine whether the current edge node has a copy of the resource according to certain rules. If not, CDN will return a 302 status code, which is a random code, and redirect the client to the source server or other edge nodes to obtain the required resources. The terminal IP address of the data acquisition terminal is used to represent the address information of the data acquisition terminal; the user IP address of the user is used to represent the address information of the user; the resource address information URL, as a uniform resource identifier (URI), provides a standardized naming and access method for various resources on the Internet. Its main function is to accurately locate the resources that users want to access throughout the entire Internet. Whether it is a web page, picture, file or other type of network resource, its location can be specified by a unique URL, so that the server can understand the user's request and provide the corresponding resources.

[0075] Step 104: Generate a first random code corresponding to the first data acquisition request, and obtain update resource address information corresponding to the first data acquisition request according to the first random code.

[0076] The scheduling system, i.e., the scheduling node 302, after receiving the first data acquisition request sent by the content distribution node from the data acquisition terminal, can use a random code generation algorithm, for example, using a cryptographically secure pseudo-random number generator (CSPRNG), to generate a first random code for the first data acquisition request, the first random code containing 32 characters, and the 32 characters are not repeated. The process of generating the first random code can include determining a character set and cyclically generating random code characters. Specifically, first determining the character set used to generate the random code. A character set containing numbers (0-9), uppercase letters (AZ) and lowercase letters (az) can be selected, which can provide more combination possibilities. For example, the size of the character set is 62 (10 numbers + 26 uppercase letters + 26 lowercase letters); a 32-bit random code is generated by cyclically 32 times; in each cycle, a character is randomly selected from the selected character set. For example, a random number generator is used to generate a random integer between 0 and 61, and then the corresponding character is selected from the character set based on this integer; assuming that the randomly generated integer is 25, in a character set containing numbers and letters, the corresponding character may be "y" (if the character set is defined in a specific order); the characters selected in each cycle are combined in sequence to eventually form a 32-bit random code string. For example, the character selected in the first cycle is "a", the second is "5", the third is "F", and so on, and after sequential combination, a random code similar to "a5FgH... (32 bits in total)" is obtained. Furthermore, the 302 scheduling node can attach the generated first random code as a parameter to the redirected resource address information corresponding to the resource address information URL, and obtain the updated resource address information corresponding to the first data acquisition request, and the updated resource address information is the URL to which the first random code is attached. For example, the URL in the first data acquisition request is http: / / www.leo***ang.top / do****ad / test.apk; the URL of the updated resource address information is http: / / 1.113.1.114 / www.leo***ang.top / do****ad / test.a***uuid = 652e****0cf4146f****61d3****377d. In addition, the 302 scheduling node can also send the reporting information carrying the first random code to the log analysis system in the decision system, and the reporting information carrying the first random code can include the terminal IP address, the user IP address of the user, and the updated resource address information URL.

[0077] Step 106: Return request response information including updated resource address information to the content distribution node.

[0078] Among them, the content distribution node is used to return the request response information to the data acquisition terminal, and send the second data acquisition request from the data acquisition terminal to the decision system; the second data acquisition request carries the second random code. The 302 scheduling node can determine the redirection edge server for the first data acquisition request, and generate the corresponding redirection resource address information, and then, the first random code can be attached to the redirection resource address information as a parameter to obtain the updated resource address information. Further, the 302 scheduling node can generate a request response information containing the updated resource address information, and return the request response information to the content distribution node CDN node, the CDN node can return the request response information to the data acquisition terminal, the data acquisition terminal receives the request response information, can regenerate the second data acquisition request for the data to be acquired, and send the second data acquisition request to the CDN node, the CDN node can normally respond to the acquisition operation for the data to be acquired corresponding to the second data acquisition request, and send the reporting information containing the second random code to the log analysis system of the decision system.

[0079] The second data acquisition request may include the terminal IP address of the data acquisition terminal, the user IP address of the user, update resource address information and a second random code.

[0080] Step 108: Send the first random code to the decision system.

[0081] The 302 scheduling node may also send the reporting information carrying the first random code to the log analysis system in the decision system, and the reporting information carrying the first random code may include the terminal IP address, the user IP address of the user, and the update resource address information URL. The CDN node may send the reporting information containing the second random code to the log analysis system of the decision system. If the first random code and the second random code are the same, it indicates that the 302 jump is successful for the current data acquisition service; if the first random code and the second random code are different, it indicates that the 302 jump is not successful for the current data acquisition service.

[0082] Based on this, the log analysis system can store a first random code set and a second random code set; further, the log analysis system can generate corresponding business scheduling analysis data according to the first random code set and the second random code set, and the business scheduling analysis data can include 302 jump success rate analysis data, that is, universally unique identifier (Universally Unique Identifier, UUID) recovery rate and UUID failure analysis data, the UUID failure analysis data includes user agent (User Agent, UA) concentration and user IP concentration, and the universal unique identifier can be a random code. The log analysis system can send the business scheduling analysis data to the configuration decision system of the decision system, and the configuration decision system can obtain the business scheduling strategy of the scheduling system according to the business scheduling analysis data. In a possible implementation, the log analysis system can obtain the first number of random codes of the second random code set that exist in the first random code set, and determine the ratio of the first number to the second number of random codes of the first random code set as the recovery rate of the 302 random code, and the recovery rate of the 302 random code can be used to represent the 302 jump success rate.

[0083] In the method of this embodiment, the scheduling system can receive a first data acquisition request from a data acquisition terminal sent by a content distribution node; generate a first random code corresponding to the first data acquisition request, and obtain the updated resource address information corresponding to the first data acquisition request according to the first random code; return the request response information containing the updated resource address information to the content distribution node; the content distribution node is used to return the request response information to the data acquisition terminal, and send a second data acquisition request from the data acquisition terminal to the decision system; the second data acquisition request carries a second random code; send the first random code to the decision system; the decision system is used to obtain the service scheduling strategy of the scheduling system according to the first random code and the second random code. In the method provided by the embodiment of the present application, the scheduling system can generate a first random code corresponding to the first data acquisition request, and return the first random code to the data acquisition terminal through the content distribution node. Next, the decision system can receive the first random code and the second random code contained in the second data acquisition request from the data acquisition terminal, and obtain the service scheduling strategy of the scheduling system according to the first random code and the second random code, so that the corresponding scheduling method can be adjusted according to the data acquisition service dynamics, avoiding the problem that the 302 scheduling cannot be applied to some business scenarios in a timely manner, and improving the timeliness and accuracy of business scheduling.

[0084] In an exemplary embodiment, as shown in FIG. 3 , obtaining the update resource address information corresponding to the first data acquisition request according to the first random code in step 104 may include steps 302 to 306:

[0085] Step 302: determine an update edge server for the data acquisition terminal.

[0086] The CDN scheduling node of the scheduling system can determine a redirection edge server, also called an update edge server, for the data acquisition service corresponding to the first data acquisition request sent by the data acquisition terminal. The update edge server is a server for users to obtain data to be obtained.

[0087] Step 304: Determine redirection resource address information corresponding to the first data acquisition request according to the updated edge server.

[0088] The redirection resource address information may be the address information of the update edge server.

[0089] Step 306: Obtain update resource address information corresponding to the first data acquisition request according to the first random code and the redirected resource address information.

[0090] In an exemplary embodiment, step 306 may include:

[0091] The first random code is written into the redirected resource address information as a parameter to obtain the updated resource address information corresponding to the first data acquisition request.

[0092] Among them, the 302 scheduling node can attach the generated first random code as a parameter to the redirected resource address information corresponding to the resource address information URL to obtain the updated resource address information corresponding to the first data acquisition request, and the updated resource address information is the URL to which the first random code is attached. For example, the URL in the first data acquisition request is http: / / www.leo***ang.top / do****ad / test.apk; the URL of the updated resource address information is http: / / 1.113.1.114 / www.leo***ang.top / do****ad / test.a***uuid = 652e****0cf4146f****61d3****377d.

[0093] In the method of this embodiment, the 302 scheduling node can determine the redirection edge server for the data acquisition service corresponding to the first data acquisition request sent by the data acquisition terminal, and append the generated first random code as a parameter to the redirection resource address information corresponding to the resource address information URL, so as to obtain the updated resource address information corresponding to the first data acquisition request, so as to facilitate the subsequent log analysis system to determine the 302 jump success rate, and further, to determine the service scheduling strategy of the scheduling system, thereby improving the flexibility and accuracy of service scheduling.

[0094] In an exemplary embodiment, as shown in FIG. 4 and FIG. 5 , a service scheduling method is provided. This embodiment is illustrated by applying the method to a decision-making system. The method includes the following steps:

[0095] Step 402: Obtain a first random code set from a scheduling system.

[0096] Among them, the decision system includes a log analysis system and a configuration decision system. The CDN node can return the request response information sent by the 302 scheduling node to the data acquisition terminal. The data acquisition terminal receives the request response information and can regenerate a second data acquisition request for the data to be acquired, and send the second data acquisition request to the CDN node. The CDN node can normally respond to the acquisition operation for the data to be acquired corresponding to the second data acquisition request, and send the reporting information containing the second random code to the log analysis system of the decision system. Based on this, the log analysis system can store multiple first random codes from the scheduling system, that is, a first random code set.

[0097] Step 404: Acquire a second random code set from a content distribution node.

[0098] The log analysis system may store a plurality of second random codes from the content distribution node, that is, a second random code set.

[0099] Step 406: Acquire a service scheduling policy of the scheduling system according to the first random code set and the second random code set.

[0100] The log analysis system can generate corresponding business scheduling analysis data based on the first random code set and the second random code set. The business scheduling analysis data may include 302 jump success rate analysis data, user agent (UA) concentration and user IP concentration. The log analysis system can send the business scheduling analysis data to the configuration decision system of the decision system, and the configuration decision system can obtain the business scheduling strategy of the scheduling system based on the business scheduling analysis data. In a possible implementation, the log analysis system can obtain the first number of random codes of the second random code set that exist in the first random code set, and determine the ratio of the first number to the second number of random codes of the first random code set as the recovery rate of the 302 random code, and the recovery rate of the 302 random code can be used to represent the 302 jump success rate.

[0101] In the method of this embodiment, the decision system can obtain the business scheduling strategy of the scheduling system based on the first random code set and the second random code set, and dynamically adjust the corresponding scheduling method according to the data acquisition business, so as to avoid the problem of not being able to timely discover that 302 scheduling is not applicable to some business scenarios, and improve the timeliness and accuracy of business scheduling.

[0102] In an exemplary embodiment, as shown in FIG6 , step 406 may include steps 602 to 604. Among them:

[0103] Step 602: Obtain a scheduling success rate of the scheduling system according to the first random code set and the second random code set.

[0104] In this step, the log analysis system can obtain the first number of random codes of the second random code set that exist in the first random code set, and determine the ratio of the first number to the second number of random codes of the first random code set as the recovery rate of the 302 random code. The recovery rate of the 302 random code can be used to represent the 302 jump success rate, and the 302 jump success rate can be used as the scheduling success rate. If a matching first random code of any current second random code in the second random code set can be matched in the first random code set, and the matching first random code is the same as the corresponding current second random code, it indicates that the data acquisition service corresponding to the current second random code and the matching first random code is a 302 jump success; if the matching first random code of the current second random code does not exist in the first random code set, it indicates that the data acquisition service corresponding to the current second random code and the matching first random code is not a 302 jump success. It can also be understood that, for the current data acquisition service, if the corresponding first random code is the same as the second random code, it indicates that the current data acquisition service is a 302 jump success; if the corresponding first random code is different from the second random code, it indicates that the current data acquisition service is not a 302 jump success.

[0105] Step 604: Obtain the service scheduling strategy of the scheduling system according to the scheduling success rate.

[0106] As shown in FIG7 , the log analysis system may send the service scheduling analysis data including the 302 jump success rate analysis data to the configuration decision system of the decision system, and the 302 jump success rate analysis data may include the 302 jump success rate. In the configuration decision system, if the 302 jump success rate is less than the preset success rate threshold, it can be determined that the data acquisition terminal corresponding to the data acquisition service does not support the 302 scheduling function. In this case, the configuration decision system can turn off the 302 scheduling configuration function of the domain name. If the 302 jump success rate is greater than or equal to the preset success rate threshold, the configuration decision system can analyze the characteristics of the 302 jump failure service according to the service scheduling analysis data, and then determine the service scheduling strategy for the 302 scheduling function.

[0107] In the method of this embodiment, the decision system can obtain the business scheduling strategy of the scheduling system based on the first random code set and the second random code set, and dynamically adjust the corresponding scheduling method according to the data acquisition business, so as to avoid the problem of not being able to timely discover that 302 scheduling is not applicable to some business scenarios, and improve the timeliness and accuracy of business scheduling.

[0108] In an exemplary embodiment, step 602 may include:

[0109] Obtaining a first number of the same random codes in the second random code set and the first random code;

[0110] The scheduling success rate of the scheduling system is obtained according to the ratio of the first number of the same random codes to the second data amount of the first random code set.

[0111] Among them, for the current data acquisition service, if the corresponding first random code is the same as the second random code, it indicates that the current data acquisition service is a 302 jump success; if the corresponding first random code is different from the second random code, it indicates that the current data acquisition service is not a 302 jump success. The log analysis system can obtain the first number of random codes in the second random code set that exist in the first random code set. The first number can be the number of identical random codes in the first random code set and the second random code set. The first number can also be understood as the number of data acquisition services with a 302 jump success; next, the ratio of the first number to the second number of random codes in the first random code set is determined as the recovery rate of the 302 random code. The recovery rate of the 302 random code can be used to represent the 302 jump success rate, and the 302 jump success rate can be used as the scheduling success rate. Among them, if a matching first random code of any current second random code in the second random code set can be matched in the first random code set, and the matching first random code is the same as the corresponding current second random code, it indicates that the data acquisition service corresponding to the current second random code and the matching first random code is a 302 jump success; if there is no matching first random code of the current second random code in the first random code set, it indicates that the data acquisition service corresponding to the current second random code and the matching first random code is not a 302 jump success.

[0112] In the method of this embodiment, the jump success rate 302 may be determined according to the number of identical random codes in the first random code set and the second random code set, thereby improving the accuracy of determining the jump success rate 302 .

[0113] In an exemplary embodiment, step 604 may include:

[0114] If the scheduling success rate is less than the preset success rate threshold, the business scheduling strategy of the scheduling system is determined to shut down the scheduling function of the data acquisition terminal; if the scheduling success rate is greater than or equal to the preset success rate threshold, the corresponding user agent concentration and address concentration are obtained; based on the user agent concentration and address concentration, the business scheduling strategy of the data acquisition terminal is obtained.

[0115] If the 302 jump success rate is greater than or equal to the preset success rate threshold, the configuration decision system can analyze the characteristics of the 302 jump failure service according to the service scheduling analysis data, and then determine the service scheduling strategy for the 302 scheduling function. Specifically, the user agent concentration, that is, UA concentration and address concentration, that is, user IP concentration, can be obtained from the service scheduling analysis data; next, it can be determined whether the failed UA is concentrated according to the UA concentration, if there is concentration, the configuration decision system issues a service scheduling strategy instruction to close the 302 scheduling function for a specific UA; it is determined whether the failed user IP is concentrated, if there is concentration, the configuration decision system issues a service scheduling strategy instruction to close the 302 scheduling function for a specific user IP. If the 302 jump failure data has a concentrated feature, continue to observe the next round of random code recovery after the configuration instruction is issued. If the 302 jump failure data does not have a concentrated feature, if the scheduling success rate is greater than or equal to the second threshold, it is considered that the failure is within a reasonable range, and the service scheduling strategy is determined as the 302 scheduling strategy. In addition, for the data of the 302 jump success, the 302 scheduling function is selectively turned on. The log analysis system will also collect statistics on the logs reported by the CDN nodes (after 302) to analyze whether there is concentration of suffixes or directories whose file sizes are smaller than the set threshold. If the statistical results show that these URL suffixes or directories are concentrated, the results will be notified to the dedicated technical support, who will evaluate with the customer whether to turn off the 302 scheduling function for certain specific URL suffixes and directories.

[0116] In the method of this embodiment, the configuration decision system can obtain the 302 jump success rate, UA concentration and address concentration based on the business scheduling analysis data provided by the log analysis system, and then, it can discuss each situation and determine the business scheduling strategies for various situations and aspects, so as to avoid the problem of not being able to timely discover that 302 scheduling is not applicable to some business scenarios, and improve the comprehensiveness, timeliness and accuracy of business scheduling.

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

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

[0119] In one embodiment, as shown in FIG8 , a service scheduling device is provided, including: a receiving module 802, a random code generating module 804, a responding module 806 and a sending module 808, wherein:

[0120] The receiving module 802 is used to receive a first data acquisition request sent by the content distribution node from the data acquisition terminal;

[0121] A random code generation module 804, configured to generate a first random code corresponding to the first data acquisition request, and obtain update resource address information corresponding to the first data acquisition request according to the first random code;

[0122] The response module 806 is used to return the request response information including the update resource address information to the content distribution node; the content distribution node is used to return the request response information to the data acquisition terminal, and send a second data acquisition request from the data acquisition terminal to the decision system; the second data acquisition request carries a second random code;

[0123] The sending module 808 is used to send the first random code to the decision system; the decision system is used to obtain the service scheduling strategy of the scheduling system according to the first random code and the second random code.

[0124] In one embodiment, the random code generation module 804 is also used to: determine an update edge server for the data acquisition terminal; determine the redirection resource address information corresponding to the first data acquisition request based on the update edge server; and obtain the update resource address information corresponding to the first data acquisition request based on the first random code and the redirection resource address information.

[0125] In one embodiment, the random code generation module 804 is further used to: write the first random code as a parameter into the redirected resource address information to obtain the updated resource address information corresponding to the first data acquisition request.

[0126] In one embodiment, as shown in FIG. 9 , a service scheduling device is provided, including: a first acquisition module 902 , a second acquisition module 904 and a decision module 906 , wherein:

[0127] A first acquisition module 902, configured to acquire a first random code set from a scheduling system;

[0128] A second acquisition module 904, configured to acquire a second random code set from a content distribution node;

[0129] The decision module 906 is used to obtain the service scheduling strategy of the scheduling system according to the first random code set and the second random code set.

[0130] In one embodiment, the decision module 906 is further used to: obtain a scheduling success rate of the scheduling system according to the first random code set and the second random code set; and obtain the service scheduling strategy of the scheduling system according to the scheduling success rate.

[0131] In one embodiment, the decision module 906 is further used to: obtain a first number of identical random codes in the second random code set and the first random code; and obtain the scheduling success rate of the scheduling system based on a ratio of the first number of identical random codes to a second amount of data in the first random code set.

[0132] In one embodiment, the decision module 906 is also used to: if the scheduling success rate is less than a preset success rate threshold, determine that the business scheduling policy of the scheduling system is to shut down the scheduling function of the scheduling system; if the scheduling success rate is greater than or equal to the preset success rate threshold, obtain the corresponding user agent concentration and address concentration; based on the user agent concentration and the address concentration, obtain the business scheduling policy of the scheduling system.

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

[0134] In one embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be shown in FIG10. The computer device includes a processor, a memory, and a network interface connected via a system bus. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store business scheduling related data. The network interface of the computer device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, a business scheduling method is implemented.

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

[0136] In one embodiment, a computer device is further provided, including a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the steps in the above method embodiments when executing the computer program.

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

[0138] In one embodiment, a computer program product is provided, including a computer program, which implements the steps in the above method embodiments when executed by a processor.

[0139] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties.

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

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

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

Claims

1. A service scheduling method, characterized in that: Applied to a dispatching system, the method comprises: receiving a first data acquisition request sent by a content distribution node from a data acquisition terminal; Generate a first random code corresponding to the first data acquisition request, and obtain update resource address information corresponding to the first data acquisition request according to the first random code; Returning a request response message including the update resource address information to the content distribution node; the content distribution node is used to return the request response message to the data acquisition terminal, and send a second data acquisition request from the data acquisition terminal to the decision system; the second data acquisition request carries a second random code; The first random code is sent to the decision system; the decision system is used to obtain the service scheduling strategy of the scheduling system according to the first random code and the second random code.

2. The method according to claim 1, characterized in that The obtaining, according to the first random code, update resource address information corresponding to the first data acquisition request includes: determining an update edge server for the data acquisition terminal; Determining, according to the update edge server, redirection resource address information corresponding to the first data acquisition request; The update resource address information corresponding to the first data acquisition request is obtained according to the first random code and the redirected resource address information.

3. The method according to claim 2, characterized in that The obtaining, according to the first random code and the redirected resource address information, the update resource address information corresponding to the first data acquisition request includes: The first random code is written into the redirected resource address information as a parameter to obtain the updated resource address information corresponding to the first data acquisition request.

4. A service scheduling method, characterized in that: Applied to a decision-making system, the method comprises: Obtaining a first random code set from a scheduling system; Obtaining a second random code set from a content distribution node; A service scheduling policy of the scheduling system is acquired according to the first random code set and the second random code set.

5. The method according to claim 4, characterized in that The acquiring, according to the first random code set and the second random code set, a service scheduling strategy of the scheduling system includes: Acquire a scheduling success rate of the scheduling system according to the first random code set and the second random code set; The service scheduling strategy of the scheduling system is obtained according to the scheduling success rate.

6. The method according to claim 5, characterized in that The acquiring, according to the first random code set and the second random code set, a scheduling success rate of the scheduling system includes: Obtaining a first number of identical random codes in the second random code set and the first random code; The scheduling success rate of the scheduling system is obtained according to a ratio of the first number of the same random codes to a second data amount of the first random code set.

7. The method according to claim 5, characterized in that The acquiring the service scheduling strategy of the scheduling system according to the scheduling success rate includes: If the scheduling success rate is less than a preset success rate threshold, determining that the service scheduling strategy of the scheduling system is to shut down the scheduling function of the scheduling system; If the scheduling success rate is greater than or equal to the preset success rate threshold, obtaining the corresponding user agent concentration and address concentration; The service scheduling strategy of the scheduling system is acquired according to the user agent concentration and the address concentration.

8. A service scheduling device, characterized in that: Applied to a dispatching system, the device comprises: A receiving module, configured to receive a first data acquisition request sent by a content distribution node from a data acquisition terminal; a random code generation module, configured to generate a first random code corresponding to the first data acquisition request, and obtain update resource address information corresponding to the first data acquisition request according to the first random code; A response module, used to return the request response information including the update resource address information to the content distribution node; the content distribution node is used to return the request response information to the data acquisition terminal, and send a second data acquisition request from the data acquisition terminal to the decision system; the second data acquisition request carries a second random code; A sending module is used to send the first random code to the decision system; the decision system is used to obtain the service scheduling strategy of the scheduling system according to the first random code and the second random code.

9. A service scheduling device, characterized in that: Applied to a decision-making system, the device comprises: A first acquisition module, used to acquire a first random code set from a scheduling system; A second acquisition module, used to acquire a second random code set from a content distribution node; A decision module is used to obtain a service scheduling strategy of the scheduling system according to the first random code set and the second random code set.

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

Images