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

Abstract

Embodiments of the present application provide a service scheduling method and device, computer equipment, storage medium and computer program product, and relate to the technical field of network data management. The method comprises: receiving a first data acquisition request from a data acquisition terminal sent by a content distribution node; generating a first random code corresponding to the first data acquisition request, and obtaining updated 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 the request response information to the data acquisition terminal, and sending a second data acquisition request from the data acquisition terminal to a 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 for obtaining a service scheduling strategy of a scheduling system according to the first random code and the second random code. The method improves the timeliness and accuracy of service scheduling.

Description

TECHNICAL FIELD

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

[0002] In the field of content delivery network (CDN), it is usually necessary to introduce 302 scheduling technology to realize the functions of fast redirection, load balancing and precise scheduling.

[0003] The optimization direction of the current 302 scheduling technology is usually biased towards better load balancing algorithms (network factors, bandwidth factors, etc.), and the characteristics and needs of various business scenarios are not considered fully and comprehensively enough, which leads to the inability to discover in time that the 302 scheduling is not applicable to some business scenarios, and thus leads to the problems of low accuracy and low availability of service scheduling. SUMMARY

[0004] Therefore, it is necessary to provide a service scheduling method and device, computer equipment, a storage medium and a computer program product to solve the above technical problems.

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

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

[0007] 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;

[0008] returning request response information containing the update resource address information to the content delivery node; the content delivery node is configured to return the request response information to the data acquisition terminal and send a second data acquisition request from the data acquisition terminal to a decision system; the second data acquisition request carries a second random code;

[0009] sending the first random code to the decision system; the decision system is configured to obtain a service scheduling strategy of the scheduling system according to the first random code and the second random code.

[0010] In one of the embodiments, the obtaining the updated resource address information corresponding to the first data acquisition request according to the first random code comprises: determining an updated edge server for the data acquisition terminal; determining redirection resource address information corresponding to the first data acquisition request according to the updated edge server; and obtaining the updated resource address information corresponding to the first data acquisition request according to the first random code and the redirection resource address information.

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

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

[0013] obtaining a first random code set from the decision system;

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

[0015] obtaining a service scheduling strategy of the decision system according to the first random code set and the second random code set.

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

[0017] In one of the embodiments, the obtaining the scheduling success rate of the decision system according to the first random code set and the second random code set comprises: obtaining a first number of same random codes of the first random code set in the second random code set; and obtaining the scheduling success rate of the decision system according to a ratio of the first number of the same random codes to a second data amount of the first random code set.

[0018] In one embodiment, obtaining the service scheduling policy of the scheduling system based on the scheduling success rate includes: if the scheduling success rate is less than a preset success rate threshold, determining that the service scheduling policy of the scheduling system is to disable 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; and obtaining the service scheduling policy of the scheduling system based on the user agent concentration and the address concentration.

[0019] Thirdly, this application provides a service scheduling device for use in a scheduling system. The device includes:

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

[0021] The random code generation module is used to 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 based on the first random code.

[0022] The response module is used to return 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;

[0023] The 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 based on the first random code and the second random code.

[0024] Fourthly, this application provides a service scheduling device for use in a decision-making system. The device includes:

[0025] The first acquisition module is used to acquire the first set of random codes from the scheduling system;

[0026] The second acquisition module is used to acquire a second set of random codes from the content distribution node;

[0027] The decision module is used to obtain the service scheduling strategy of the scheduling system based on the first random code set and the second random code set.

[0028] Fifthly, this application also provides a computer device. The computer device includes a memory and a processor, the memory storing a computer program, and the processor executing the computer program to perform the following steps:

[0029] Receive the first data acquisition request from the data acquisition terminal sent by the content distribution node;

[0030] 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 based on the first random code;

[0031] The content distribution node returns a request response containing the updated resource address information to the content distribution node; the content distribution node returns the request response to the data acquisition terminal and sends 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 based on the first random code and the second random code.

[0033] Sixthly, this application also provides a computer device. The computer device includes a memory and a processor, the memory storing a computer program, and the processor executing the computer program to perform the following steps:

[0034] Obtain the first set of random codes from the scheduling system;

[0035] Obtain the second set of random codes from the content distribution node;

[0036] The service scheduling strategy of the scheduling system is obtained based on the first random code set and the second random code set.

[0037] Seventhly, this application also provides a computer-readable storage medium. The computer-readable storage medium stores a computer program thereon, which, when executed by a processor, performs the following steps:

[0038] Receive the first data acquisition request from the data acquisition terminal sent by the content distribution node;

[0039] 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 based on the first random code;

[0040] The content distribution node returns a request response containing the updated resource address information to the content distribution node; the content distribution node returns the request response to the data acquisition terminal and sends 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 based on the first random code and the second random code.

[0042] Eighthly, this application also provides a computer-readable storage medium. The computer-readable storage medium stores a computer program thereon, which, when executed by a processor, performs the following steps:

[0043] Obtain the first set of random codes from the scheduling system;

[0044] Obtain the second set of random codes from the content distribution node;

[0045] The service scheduling strategy of the scheduling system is obtained based on the first random code set and the second random code set.

[0046] Ninthly, this application also provides a computer program product. The computer program product includes a computer program that, when executed by a processor, performs the following steps:

[0047] Receive the first data acquisition request from the data acquisition terminal sent by the content distribution node;

[0048] 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 based on the first random code;

[0049] The content distribution node returns a request response containing the updated resource address information to the content distribution node; the content distribution node returns the request response to the data acquisition terminal and sends 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 based on the first random code and the second random code.

[0051] Tenthly, this application also provides a computer program product. The computer program product includes a computer program that, when executed by a processor, performs the following steps:

[0052] Obtain the first set of random codes from the scheduling system;

[0053] Obtain the second set of random codes from the content distribution node;

[0054] The service scheduling strategy of the scheduling system is obtained based on the first random code set and the second random code set.

[0055] In the aforementioned service 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 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 a first random code to the decision system; the decision system is used to obtain the service scheduling strategy of the scheduling system based on the first random code and the second random code. In the method provided in this application embodiment, 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 a second random code contained in the second data acquisition request from the data acquisition terminal. Based on the first random code and the second random code, the system can obtain the business scheduling strategy of the scheduling system. Thus, the corresponding scheduling method can be dynamically adjusted according to the data acquisition business, avoiding the inability to detect the problem that 302 scheduling is not applicable to some business scenarios in a timely manner, and improving the timeliness and accuracy of business scheduling. Attached Figure Description

[0056] To more clearly illustrate the technical solutions in the embodiments of this application or related technologies, the drawings used in the description of the embodiments of this application or related technologies will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0057] Figure 1 A flowchart illustrating a service scheduling method provided in an embodiment of this application;

[0058] Figure 2 A schematic diagram illustrating the process of service scheduling in a service scheduling system provided in this application embodiment;

[0059] Figure 3 This application provides a schematic diagram of a process for obtaining updated resource address information in an embodiment of the present application.

[0060] Figure 4 A flowchart illustrating another service scheduling method provided in an embodiment of this application;

[0061] Figure 5 This application provides a schematic diagram of a log analysis system for acquiring business scheduling analysis data.

[0062] Figure 6 A flowchart illustrating a process for obtaining a service scheduling strategy from a scheduling system, as provided in an embodiment of this application;

[0063] Figure 7 A schematic diagram illustrating the process of configuring a service scheduling strategy in a configuration decision system provided in this application embodiment;

[0064] Figure 8 A structural block diagram of a service scheduling device provided in an embodiment of this application;

[0065] Figure 9 A structural block diagram of another service scheduling device provided in the embodiments of this application;

[0066] Figure 10 This is an internal structural diagram of a computer device provided in an embodiment of this application. Detailed Implementation

[0067] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0068] Glossary

[0069] A Content Delivery Network (CDN) is a network technology that optimizes content delivery and access speed by deploying servers in different geographical locations around the world. CDNs reduce data transmission time and latency, and improve website loading speed by caching content from the origin server (origin server) across multiple servers (edge ​​servers) and redirecting requests to the nearest server (edge ​​server) based on the user's geographical location.

[0070] 302 redirection: In CDN (Content Delivery Network), 302 redirection refers to the process where, when a user requests a resource, the CDN server redirects the user's request to another server using the HTTP status code 302 to obtain the resource.

[0071] In one exemplary embodiment, such as Figure 1 As shown, a service scheduling method is provided. This embodiment illustrates the application of this method to a scheduling system. The method includes the following steps:

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

[0073] in,

[0074] The method described in this application embodiment can be applied to a service scheduling system, such as... Figure 2 As shown, the service scheduling system may include a data acquisition terminal, a content delivery network (CDN) node, a scheduling system, and a decision-making system. The decision-making system may include a log analysis system and a configuration decision-making system. Users can initiate DNS domain name resolution requests to the computer's Domain Name System (DNS) server via a browser or other applications on the data acquisition terminal. The DNS server can return the IP address of the CDN service provider's scheduling machine to the data acquisition terminal. Based on the scheduling machine's IP address, the user can trigger a first data acquisition request for the data to be acquired to the CDN node. This first data acquisition request can carry the terminal IP address of the data acquisition terminal, the user's IP address, and resource address information (Uniform Resource Locator, URL). The CDN node can forward this first data acquisition request to the scheduling node, which can be a 302 scheduling node in the CDN network. A 302 scheduling node is a redirection strategy in a CDN (Content Delivery Network) used to handle traffic distribution for client requests. When a client requests resources from the CDN, the CDN will determine whether the current edge node has a copy of the resource according to certain rules. If not, the CDN will return a 302 status code (random code), redirecting the client to the origin server or other edge nodes to obtain the required resource. The terminal IP address of the data acquisition terminal represents its address information; the user IP address represents its address information; 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 resource a user wants to access across the entire Internet. Whether it's a webpage, image, file, or other type of network resource, its location can be specified through a unique URL, enabling the server to understand the user's request and provide the corresponding resource.

[0075] Step 104: 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 based on the first random code.

[0076] The scheduling system, specifically the 302 scheduling node, upon receiving a first data acquisition request from the data acquisition terminal sent by the content distribution node, can utilize a random code generation algorithm, such as a cryptographically secure pseudo-random number generator (CSPRNG), to generate a first random code for the first data acquisition request. This first random code consists of 32 unique characters. The process of generating the first random code can include determining a character set and cyclically generating random code characters. Specifically, first, the character set used to generate the random code is determined. A character set containing digits (0-9), uppercase letters (AZ), and lowercase letters (az) can be selected, providing more combination possibilities. For example, the character set size could be 62 (10 digits + 26 uppercase letters + 26 lowercase letters). The 32-bit random code is generated by looping 32 times. In each loop, a character is randomly selected from the chosen character set. For example, a random number generator can be used to generate a random integer between 0 and 61. Then, a corresponding character can be selected from a character set based on this integer. Assuming the randomly generated integer is 25, the corresponding character in a character set containing numbers and letters might be "y" (if the character set is defined in a specific order). The characters selected in each loop are combined sequentially to form a 32-bit random code string. For instance, if the first loop selects "a", the second "5", the third "F", etc., the resulting combination would be something like "a5FgH… (32 bits in total)". Furthermore, the 302 scheduling node can append 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. This updated resource address information is the URL with the first random code appended. For example, the URL in the first data acquisition request is http: / / www.leo***ang.top / do****ad / test.apk; the URL for the updated resource address information is http: / / 1.113.1.114 / www.leo***ang.top / do****ad / test.a***uuid = 652e****0cf4146f****61d3****377d. Additionally, the 302 scheduling node can also send the reporting information carrying the first random code to the log analysis system in the decision system. This reporting information carrying the first random code may include the terminal IP address, the user's IP address, and the updated resource address information URL.

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

[0078] The content distribution node (CDN) returns request-response information to the data acquisition terminal and sends 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 302 scheduling node can determine the redirection edge server for the first data acquisition request and generate corresponding redirection resource address information. Then, it can append the first random code as a parameter to the redirection resource address information to obtain updated resource address information. Further, the 302 scheduling node can generate request-response information containing the updated resource address information and return it to the CDN node. The CDN node can return the request-response information to the data acquisition terminal. Upon receiving the request-response information, the data acquisition terminal can regenerate a second data acquisition request for the data to be acquired and send it to the CDN node. The CDN node can normally respond to the acquisition operation 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's user IP address, 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 can also send reporting information carrying the first random code to the log analysis system in the decision system. This reporting information may include the terminal IP address, the user's IP address, and the URL for updating resource address information. The CDN node can send reporting information containing the second random code to the log analysis system of the decision system. If the first and second random codes are the same, it indicates a successful 302 redirect for the current data acquisition service; if the first and second random codes are different, it indicates a successful non-302 redirect for the current data acquisition service.

[0082] Based on this, the log analysis system can store a first set of random codes and a second set of random codes. Further, the log analysis system can generate corresponding business scheduling analysis data based on the first set of random codes and the second set of random codes. This business scheduling analysis data can include 302 redirect success rate analysis data, namely, Universally Unique Identifier (UUID) retrieval rate and UUID failure analysis data. The UUID failure analysis data includes User Agent (UA) concentration and User IP concentration. The Universally Unique Identifier can be a random code. The log analysis system can send this business scheduling analysis data to the configuration decision system of the decision system. The configuration decision system can obtain the business scheduling policy of the scheduling system based on the business scheduling analysis data. In one possible implementation, the log analysis system can obtain a first number of random codes from the second set that exist in the first set of random codes, and determine the ratio of this first number to a second number of random codes from the first set of random codes as the 302 random code retrieval rate. This 302 random code retrieval rate can be used to represent the 302 redirect success rate.

[0083] In 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 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 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 a 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 by this application embodiment, 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 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 dynamically adjusted according to the data acquisition business, avoiding the inability to promptly detect the problem of 302 scheduling being unsuitable for some business scenarios, and improving the timeliness and accuracy of business scheduling.

[0084] In one exemplary embodiment, such as Figure 3 As shown, step 104, obtaining the updated resource address information corresponding to the first data acquisition request based on the first random code, may include steps 302 to 306:

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

[0086] Specifically, the CDN scheduling node in this scheduling system can determine the redirection edge server, also known as the update edge server, for the data retrieval service corresponding to the first data retrieval request sent by the data retrieval terminal. This update edge server is the server where the user retrieves the data to be retrieved.

[0087] Step 304: Based on the updated edge server, determine the redirected resource address information corresponding to the first data acquisition request.

[0088] The redirected resource address information can be the address information of the update edge server.

[0089] Step 306: 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.

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

[0091] 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 retrieval request.

[0092] Specifically, the 302 scheduling node can append 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. The updated resource address information is the URL with the first random code appended. For example, the URL in the first data acquisition request is http: / / www.leo***ang.top / do****ad / test.apk; the URL for 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 to obtain the updated resource address information corresponding to the first data acquisition request. This facilitates the subsequent log analysis system to determine the 302 redirection success rate, and further, it can determine the business scheduling strategy of the scheduling system, thereby improving the flexibility and accuracy of business scheduling.

[0094] In one exemplary embodiment, such as Figure 4 and Figure 5 As shown, a service scheduling method is provided. This embodiment illustrates the application of this method to a decision-making system. The method includes the following steps:

[0095] Step 402: Obtain the first set of random codes from the scheduling system.

[0096] The decision-making system includes a log analysis system and a configuration decision-making system. The CDN node can return the request response information sent by the 302 scheduling node to the data acquisition terminal. Upon receiving the request response information, the data acquisition terminal can regenerate a second data acquisition request for the data to be acquired and send this second data acquisition request to the CDN node. The CDN node can then normally respond to the acquisition operation 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-making system. Based on this, the log analysis system can store multiple first random codes from the scheduling system, i.e., a first random code set.

[0097] Step 404: Obtain the second set of random codes from the content distribution node.

[0098] The log analysis system can store multiple second random codes from the content distribution nodes, i.e., a set of second random codes.

[0099] Step 406: Obtain the service scheduling strategy of the scheduling system based on 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. This data may include 302 redirect success rate analysis data, User Agent (UA) concentration, and User IP concentration. The log analysis system can send this data to the configuration decision system, which can then obtain the business scheduling policy based on the data. In one possible implementation, the log analysis system can obtain a first number of random codes from the second random code set that exist in the first random code set, and determine the ratio of this first number to a second number of random codes in the first random code set as the 302 random code retrieval rate. This 302 random code retrieval rate can be used to represent the 302 redirect 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 obtained, so as to avoid the problem that the 302 scheduling is not applicable to some business scenarios in a timely manner, and improve the timeliness and accuracy of business scheduling.

[0102] In one exemplary embodiment, such as Figure 6 As shown, step 406 may include steps 602 to 604. Wherein:

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

[0104] In this step, the log analysis system can obtain a first number of random codes in the second random code set that exist in the first random code set, and determine the ratio of this first number to a second number of random codes in the first random code set as the 302 random code retrieval rate. This 302 random code retrieval rate can be used to represent the 302 jump success rate, and can be used as the scheduling success rate. Specifically, if a matching first random code can be found in the first random code set for any current second random code in the second random code set, and this matching first random code is identical to the corresponding current second random code, then the data acquisition service corresponding to the current second random code and the matching first random code has successfully completed a 302 jump. If no matching first random code exists in the first random code set for the current second random code, then the data acquisition service corresponding to the current second random code and the matching first random code has not successfully completed a 302 jump. This can also be understood as follows: for the current data acquisition service, if the first random code and the second random code are the same, it indicates that the current data acquisition service has successfully completed a 302 redirect; if the first random code and the second random code are different, it indicates that the current data acquisition service has successfully completed a non-302 redirect.

[0105] Step 604: Obtain the business scheduling strategy of the scheduling system based on the scheduling success rate.

[0106] Among them, such as Figure 7As shown, the log analysis system can send business scheduling analysis data, including 302 redirect success rate analysis data, to the configuration decision system of the decision system. This 302 redirect success rate analysis data can include the 302 redirect success rate. In the configuration decision system, if the 302 redirect success rate is less than a 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 disable the 302 scheduling configuration function for the domain name. If the 302 redirect success rate is greater than or equal to the preset success rate threshold, the configuration decision system can analyze the characteristics of the 302 redirect failure service based on the business scheduling analysis data, and then determine the business 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 obtained, so as to avoid the problem that the 302 scheduling is not applicable to some business scenarios in a timely manner, and improve the timeliness and accuracy of business scheduling.

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

[0109] Obtain the first number of identical random codes in the second random code set and the first random code set;

[0110] The scheduling success rate of the scheduling system is obtained by the ratio of the first number of identical random codes to the second data volume of the first random code set.

[0111] Specifically, for the current data acquisition service, if the corresponding first random code and second random code are the same, it indicates that the current data acquisition service has successfully completed a 302 redirect; if the corresponding first random code and second random code are different, it indicates that the current data acquisition service has not successfully completed a 302 redirect. The log analysis system can obtain a first number of random codes from the second random code set that exist in the first random code set. This first number can be the number of identical random codes in both the first and second random code sets, and can also be understood as the number of data acquisition services that have successfully completed a 302 redirect. Next, the ratio of this first number to a second number of random codes in the first random code set is determined as the 302 random code recovery rate. This 302 random code recovery rate can be used to represent the 302 redirect success rate, and can be used as the scheduling success rate. Specifically, if a matching first random code can be found in the first random code set for any current second random code in the second random code set, and the matching first random code is the same as the corresponding current second random code, then the data acquisition service corresponding to the current second random code and the matching first random code is successfully redirected via 302; if no matching first random code exists in the first random code set for the current second random code, then the data acquisition service corresponding to the current second random code and the matching first random code is successfully redirected via non-302.

[0112] In the method of this embodiment, the success rate of 302 redirection can be determined based on the number of identical random codes in the first random code set and the second random code set, which can improve the accuracy of the determination of the success rate of 302 redirection.

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

[0114] If the scheduling success rate is less than the preset success rate threshold, the business scheduling policy of the scheduling system is determined to disable 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 policy of the data acquisition terminal is obtained.

[0115] If the 302 redirect success rate is greater than or equal to a preset success rate threshold, the configuration decision system can analyze the characteristics of failed 302 redirects based on business scheduling analysis data, and then determine the business scheduling strategy for the 302 scheduling function. Specifically, it can obtain user agent concentration (UA concentration) and address concentration (user IP concentration) from the business scheduling analysis data. Next, it can determine whether failed UAs exhibit concentration. If concentration exists, the configuration decision system issues a business scheduling strategy instruction to disable the 302 scheduling function for the specific UA. It can also determine whether failed user IPs exhibit concentration. If concentration exists, the configuration decision system issues a business scheduling strategy instruction to disable the 302 scheduling function for the specific user IP. If the failed 302 redirect data shows concentration characteristics, the system continues to observe the next round of random code retrieval after issuing the configuration instruction. If the failed 302 redirect data does not show concentration characteristics, and the scheduling success rate is greater than or equal to a second threshold, the failure is considered within a reasonable range, and the business scheduling strategy is determined as the 302 scheduling strategy. Furthermore, for data with successful 302 redirects, the 302 scheduling function is selectively enabled. The log analysis system will also perform statistics on the logs reported by CDN nodes (after 302), and analyze whether there is a concentration of file suffixes or directories whose file size is less 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 then work with the customer to evaluate whether to disable 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 redirect success rate, UA concentration, and address concentration based on the business scheduling analysis data provided by the log analysis system. Then, it can discuss different situations and determine various business scheduling strategies to avoid the inability to detect the problem that 302 scheduling is not applicable to some business scenarios in a timely manner, thereby improving the comprehensiveness, timeliness, and accuracy of business scheduling.

[0117] It should be understood that although the steps in the flowcharts of the embodiments described above are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowcharts of the embodiments described above may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the steps or stages of other steps.

[0118] Based on the same inventive concept, this application also provides a service scheduling apparatus for implementing the service scheduling method described above. The solution provided by this apparatus is similar to the implementation described in the above method; therefore, the specific limitations in one or more service scheduling apparatus embodiments provided below can be found in the limitations of the service scheduling method described above, and will not be repeated here.

[0119] In one embodiment, such as Figure 8 As shown, a service scheduling device is provided, including: a receiving module 802, a random code generation module 804, a response 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] The random code generation module 804 is used to 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 based on the first random code.

[0122] The response module 806 is used to return 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;

[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 based on the first random code and the second random code.

[0124] In one embodiment, the random code generation module 804 is further configured to: determine an update edge server for the data acquisition terminal; determine 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 configured 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, such as Figure 9 As shown, a service scheduling device is provided, including: a first acquisition module 902, a second acquisition module 904, and a decision module 906, wherein:

[0127] The first acquisition module 902 is used to acquire the first set of random codes from the scheduling system;

[0128] The second acquisition module 904 is used to acquire a second set of random codes from the content distribution node;

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

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

[0131] In one embodiment, the decision module 906 is further configured 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 the ratio of the first number of identical random codes to the second data volume of the first random code set.

[0132] In one embodiment, the decision module 906 is further configured to: if the scheduling success rate is less than a preset success rate threshold, determine that the service scheduling policy of the scheduling system is to disable 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; and obtain the service scheduling policy of the scheduling system based on the user agent concentration and the address concentration.

[0133] Each module in the aforementioned service scheduling device can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in the processor of a computer device in hardware form or independent of it, or stored in the memory of the computer device in software form, so that the processor can call and execute the operations corresponding to each module.

[0134] In one embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be as follows: Figure 10As shown, the computer device includes a processor, memory, and a network interface connected via a system bus. The processor provides computing and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system, computer programs, and a database. The internal memory provides an environment for the operation of the operating system and computer programs stored in the non-volatile storage media. The database stores service scheduling-related data. The network interface communicates with external terminals via a network connection. When the computer program is executed by the processor, it implements a service scheduling method.

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

[0136] In one embodiment, a computer device is also provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps in the above method embodiments.

[0137] In one embodiment, a computer-readable storage medium is provided having a computer program stored thereon that, when executed by a processor, implements the steps in the above method embodiments.

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

[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, data stored, data displayed, 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 will understand that all or part of the processes in the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium. When executed, the computer program can include the processes of the embodiments described above. Any references to memory, databases, or other media 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), magnetic 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. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM). The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, etc., and are not limited to these.

[0141] The technical features of the above embodiments can be combined in any way. For the sake of brevity, 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 embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are specific and detailed, they should not be construed as limiting the scope of this patent application. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this application should be determined by the appended claims.

Claims

1. A service scheduling method, characterized in that, Applied to a scheduling system, the method includes: Receive the first data acquisition request from the data acquisition terminal sent by the content distribution node; Generate a first random code corresponding to the first data acquisition request, and determine the 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; write the first random code as a parameter into the redirection resource address information to obtain the update resource address information corresponding to the first data acquisition request. The content distribution node returns a request response containing the updated resource address information to the content distribution node; the content distribution node returns the request response to the data acquisition terminal and sends 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 configured to obtain a first number of identical random codes in the second random code set and the first random code, and to obtain the scheduling success rate of the scheduling system based on the ratio of the first number of identical random codes to the second data volume of the first random code set; the decision system is further configured to determine that the business scheduling strategy of the scheduling system is to disable the scheduling function of the scheduling system if the scheduling success rate is less than a preset success rate threshold, and to obtain the corresponding user agent concentration and address concentration if the scheduling success rate is greater than or equal to the preset success rate threshold, and to obtain the business scheduling strategy of the scheduling system based on the user agent concentration and the address concentration; the first random code set comes from the scheduling system, and the second random code set comes from the content distribution node.

2. A service scheduling method, characterized in that, Applied to a decision-making system, the method includes: Obtain the first set of random codes from the scheduling system; Obtain the second set of random codes from the content distribution node; Obtain the first number of identical random codes in the second random code set and the first random code set; The scheduling success rate of the scheduling system is obtained by the ratio of the first number of identical random codes to the second data volume of the first random code set. If the scheduling success rate is less than a preset success rate threshold, then the business scheduling strategy of the scheduling system is determined to be to disable the scheduling function of the scheduling system. If the scheduling success rate is greater than or equal to the preset success rate threshold, then obtain the corresponding user agent concentration and address concentration. Based on the user agent centralization and the address centralization, the service scheduling strategy of the scheduling system is obtained.

3. A service scheduling device, characterized in that, The device, used in a scheduling system, includes: The receiving module is used to receive the first data acquisition request sent by the content distribution node from the data acquisition terminal; A random code generation module is used to generate a first random code corresponding to the first data acquisition request and 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 write the first random code as a parameter into the redirection resource address information to obtain the update resource address information corresponding to the first data acquisition request. The response module is used to return 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; A sending module is configured to send the first random code to the decision system; the decision system is configured to obtain a first number of identical random codes in the second random code set and the first random code, and to obtain the scheduling success rate of the scheduling system based on the ratio of the first number of identical random codes to the second data volume of the first random code set; the decision system is further configured to determine that the business scheduling strategy of the scheduling system is to disable the scheduling function of the scheduling system if the scheduling success rate is less than a preset success rate threshold, and to obtain the corresponding user agent concentration and address concentration if the scheduling success rate is greater than or equal to the preset success rate threshold, and to obtain the business scheduling strategy of the scheduling system based on the user agent concentration and the address concentration; the first random code set comes from the scheduling system, and the second random code set comes from the content distribution node.

4. A service scheduling device, characterized in that, The device, applied to a decision-making system, includes: The first acquisition module is used to acquire the first set of random codes from the scheduling system; The second acquisition module is used to acquire a second set of random codes from the content distribution node; The decision module is used to obtain a first number of identical random codes in the second random code set and the first random code set; obtain the scheduling success rate of the scheduling system based on the ratio of the first number of identical random codes to the second data volume of the first random code set; if the scheduling success rate is less than a preset success rate threshold, determine that the service scheduling strategy of the scheduling system is to disable 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; and obtain the service scheduling strategy of the scheduling system based on the user agent concentration and the address concentration.

5. 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, it implements the steps of the method according to any one of claims 1-2.

Images