Data processing method, device, electronic device and storage medium

Abstract

The embodiments of the present application provide a data processing method, apparatus, electronic device, and storage medium, the method comprising: collecting a first query volume of a domain name of a target source station within a first time period; when the first query volume exceeds a preset upper limit, scheduling a first query request within the preset upper limit to query the target source station via a shared node associated with an edge node, the shared node being used to transfer query requests between the edge node and the source station; and scheduling a second query request exceeding the preset upper limit to query the target source station via the edge node. This can reduce the processing pressure on the shared node.

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a data processing method, a data processing device, an electronic device, and a storage medium. Background Art

[0002] Content Delivery Network (CDN) is an intelligent virtual network built on the existing network. It relies on edge servers deployed in various locations and uses the load balancing, content distribution, scheduling and other functional modules of the central platform to enable users to obtain the required content nearby.

[0003] Existing methods for querying dynamic and static content handle dynamic and static content differently. For static content, it is distributed to various edge nodes. When a user queries static content, the static content is directly sent to the user's terminal from the edge node closest to the user. For dynamic content, a shared storage layer above the edge nodes aggregates query requests from multiple edge nodes and determines the optimal routing path for the query request. The query request is sent to the origin server via the preferred routing path through the shared storage layer to improve query speed.

[0004] However, with this solution, when the query volume of the source station is large, the shared storage layer has to process a large amount of data, which causes high processing pressure on the shared storage layer and easily affects access to other source stations. Summary of the Invention

[0005] An embodiment of the present application provides a data processing method to reduce the processing pressure of a shared storage layer.

[0006] Correspondingly, an embodiment of the present application also provides a data processing device, an electronic device and a storage medium to ensure the implementation and application of the above system.

[0007] In order to solve the above problems, an embodiment of the present application discloses a data processing method, which includes: collecting a first query volume of the domain name of the target source station within a first time period; when the first query volume exceeds a preset upper limit value, scheduling a first query request within the preset upper limit value, and querying the target source station through a shared node associated with an edge node, wherein the shared node is used to transfer query requests between the edge node and the source station; scheduling a second query request that exceeds the preset upper limit value, and querying the target source station through the edge node.

[0008] In order to solve the above problems, an embodiment of the present application discloses a data processing method, including: sending a number of queries related to the domain name of a target source station within a first time period, and the number of queries is used to determine a first query volume related to the domain name of the target source station within the first time period; when the first query volume exceeds a preset upper limit value, in response to the scheduling of the processing end, executing a query to the target source station for the query request.

[0009] To address the aforementioned issues, embodiments of the present application disclose a data processing method, comprising: collecting a first number of visits to a domain name of a target source station within a first time period. If the first number of visits exceeds a preset upper limit, dispatching a first access request within the preset upper limit to access the target source station via a shared node associated with an edge node, where the shared node is used to relay access requests between the edge node and the source station; and dispatching a second access request exceeding the preset upper limit to access the target source station via the edge node.

[0010] In order to solve the above problems, an embodiment of the present application discloses a data processing method, which includes: sending the number of visits related to the domain name of the target source station within a first time period, and the number of visits is used to determine the first visit volume related to the domain name of the target source station within the first time period; when the first visit volume exceeds a preset upper limit value, in response to the scheduling of the processing end, executing access to the target source station for the access request.

[0011] In order to solve the above problems, an embodiment of the present application discloses a data processing device, including: a query volume collection module, used to collect the first query volume of the domain name of the target source station within a first time period; a first scheduling module, used to schedule the first query request within the preset upper limit value when the first query volume exceeds the preset upper limit value, and query the target source station through a shared node associated with the edge node, and the shared node is used to transfer the query request between the edge node and the source station; a second scheduling module, used to schedule the second query request that exceeds the preset upper limit value, and query the target source station through the edge node.

[0012] In order to solve the above problems, an embodiment of the present application discloses a data processing device, which is characterized in that it includes: a query quantity sending module for sending the number of queries related to the domain name of the target source station within a first time period, and the query quantity is used to determine the first query volume related to the domain name of the target source station within the first time period; an execution module for executing a query to the target source station in response to the scheduling of the processing end when the first query volume exceeds a preset upper limit value.

[0013] To address the above-mentioned issues, an embodiment of the present application discloses a data processing device, comprising: a visit volume collection module configured to collect a first visit volume of a domain name of a target source station within a first time period; a first access scheduling module configured to, when the first visit volume exceeds a preset upper limit, schedule a first access request within the preset upper limit to access the target source station via a shared node associated with an edge node, the shared node being configured to relay access requests between the edge node and the source station; and a second access scheduling module configured to schedule a second access request exceeding the preset upper limit to access the target source station via the edge node.

[0014] In order to solve the above problems, an embodiment of the present application discloses a data processing device, which includes: an access number sending module for sending the access number related to the domain name of the target source station within a first time period, and the access number is used to determine the first access volume related to the domain name of the target source station within the first time period; an access execution module for executing access to the target source station in response to the scheduling of the processing end when the first access volume exceeds a preset upper limit value.

[0015] Compared with the prior art, the embodiments of the present application include the following advantages: in the embodiments of the present application, by collecting the first query volume of the domain name of the target source station, and when the first query volume exceeds the preset upper limit value, scheduling the first query request within the preset upper limit value, and querying the target source station through the edge node and the shared node, the query efficiency of the first query request is maintained; scheduling the second query request exceeding the preset upper limit value, and querying the target source station through the edge node, reducing the number of query requests transferred by the shared node, and reducing the processing pressure of the shared node. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] Figure 1 It is a structural diagram of a data processing system according to an embodiment of the present application;

[0017] Figure 2 It is a structural diagram of a data processing system in the prior art;

[0018] Figure 3 This is a schematic diagram of the structure of a processing terminal according to an embodiment of the present application;

[0019] Figure 4 This is a schematic diagram of a query request cut-out interaction process according to an embodiment of the present application;

[0020] Figure 5 This is a schematic diagram of a query request entering an interaction process according to an embodiment of the present application;

[0021] Figure 6 This is a flow chart of a data processing method according to an embodiment of the present application;

[0022] Figure 7 is a flowchart of a data processing method according to another embodiment of the present application;

[0023] Figure 8 is a flowchart of a data processing method according to another embodiment of the present application;

[0024] Figure 9 is a structural diagram of a data processing device according to an embodiment of the present application;

[0025] Figure 10 is a structural diagram of a data processing device according to another embodiment of the present application;

[0026] Figure 11 is a structural diagram of a data processing device according to another embodiment of the present application;

[0027] Figure 12 is a structural diagram of a data processing device according to another embodiment of the present application;

[0028] Figure 13 It is a structural diagram of an exemplary device according to an embodiment of the present application. DETAILED DESCRIPTION

[0029] In order to make the above-mentioned purposes, features and advantages of the present application more obvious and easy to understand, the present application is further described in detail below with reference to the accompanying drawings and specific implementation methods.

[0030] Figure 2 A schematic diagram of a conventional data processing system is shown. The data processing system includes a source station, edge nodes, shared nodes, and a processing end. The source station stores resource data corresponding to domain names. The edge nodes receive user query requests and return results. The shared nodes relay query requests between the edge nodes and the source station. The processing end interacts with the edge nodes to determine a preferred node path for the edge node to query the source station. Based on the preferred node path determined by the processing end, the edge node routes queries to the target source station via the shared nodes.

[0031] In the existing data processing process, shared nodes handle all query requests from source stations. When the query request volume from some source stations is too large, the shared nodes have a large processing load, which can easily affect the query quality of other source stations on the shared node. To reduce the processing load of shared nodes, the present application provides a data processing system that can dispatch some query requests directly to the source station through edge nodes when the query volume from the source station is large, thereby reducing the processing pressure on the shared nodes.

[0032] Specifically, Figure 1A schematic diagram of the structure of a data processing system according to an embodiment is shown. Figure 1 As shown, the data processing system includes: a source station, edge nodes, shared nodes, and a processing end. The source station is used to store resource data corresponding to a domain name. Edge nodes, which can also be referred to as edge servers, first-level nodes, or first-tier nodes, are used to receive user query requests and return request results to users. Edge nodes also interact with the processing end to determine how query requests are sent to the source station. In some examples, shared nodes can be nodes in a shared storage layer, which can be understood as a cache processing layer that aggregates requests from edge nodes and other nodes and then retrieves data from the corresponding source station. This shared storage layer can also be referred to as a shared storage pool, a shared resource pool, etc., and shared nodes can also be referred to as second-level nodes, second-tier nodes, etc. Shared nodes can be understood as upper-level nodes of multiple edge nodes and are used to relay query requests between edge nodes and the source station. As upper-level nodes of multiple edge nodes, shared nodes can collect query requests from multiple edge nodes, determine the corresponding routing method for the query requests, and send the query requests to the source station according to the routing method. For query requests, shared nodes can provide a high-quality routing method to route query requests, thereby improving data query quality. The processing end is used to interact with the edge node to determine how the edge node's query request is sent to the origin server based on the query volume of the origin server's domain name in each time period. In one example, the query volume of the domain name in each time period can be the query rate per second (QPS) of the domain name.

[0033] Specifically, a preset upper limit value is pre-set in the processing end. In step 102, the processing end collects a first query volume of the domain name of the target source station within a first time period.

[0034] In order to determine the query status of each domain name in the system, the first query volume within the target time period can be collected. The step of collecting the first query volume of the domain name of the target source station within the first time period includes: collecting the number of queries of the domain name of the target source station within the first time period from at least one edge node to obtain the first query volume.

[0035] The query request sent by the user is sent to the edge node closest to the user terminal. After the edge node receives the query request related to the domain name of the target source station, the edge node can send the corresponding query quantity to the processing terminal. The processing terminal collects the query quantities of multiple edge nodes to obtain a first query volume.

[0036] After determining the first query volume, the first query volume is compared with the preset upper limit value to determine whether the first query volume exceeds the preset upper limit value. If the first query volume exceeds the preset upper limit value, in step 104, the first query request within the preset upper limit value is scheduled to query the target source station through the edge node and the shared node associated with the edge node; in step 106, the second query request exceeding the preset upper limit value is scheduled to query the source station through the edge node.

[0037] After the processing end receives a query request sent by a user at an edge node, in order to implement the scheduling of the query request, in an optional embodiment, the step of scheduling a first query request within a preset upper limit value to query the target source station through a shared node associated with the edge node includes: for the first query request, the processing end sends first scheduling information to the edge node, so that the edge node queries the target source station through the shared node for the first query request based on the first scheduling information. The step of scheduling a second query request exceeding the preset upper limit value to query the target source station through the edge node includes: for the second query request, the processing end sends second scheduling information to the edge node, so that the edge node queries the target source station through the edge node for the second query request based on the second scheduling information.

[0038] After determining that the first query volume exceeds a preset upper limit, the processing end divides the query request into a first query request and a second query request based on the first query volume and the preset upper limit. For the first query request, first scheduling information is sent to the edge node, causing the edge node to query the target source station through the shared node based on the first scheduling information. For the second query request, second scheduling information is sent to the edge node, causing the edge node to query the target source station based on the second scheduling information.

[0039] For example, if the first query volume is 121 and the preset upper limit is 100, the first 100 query requests can be determined as the first query requests and the remaining 21 query requests as the second query requests according to the reception time of the query requests. For the first 100 query requests, the processing end returns the first scheduling information to the edge node. The first scheduling information may include the preferred routing path information corresponding to the query request. The edge node queries the target source station through the edge node and the shared node for the first query request based on the first scheduling information. For the remaining 21 query requests, the processing end sends the second scheduling information to the edge node, and the edge node queries the target source station for the second query request based on the second scheduling information.

[0040] Additionally, if the volume of first queries does not exceed the preset upper limit, the processing end dispatches query requests related to the target origin server to the target origin server via the shared node associated with the edge node. For domain names whose volume of first queries within the target period does not exceed the preset upper limit, query requests from the edge node are forwarded via the shared node to maintain efficient user access to the domain name.

[0041] Compared to querying or accessing the origin server through edge nodes, shared nodes can provide higher-quality transit services for the origin server's clients. Therefore, the preset upper limit can be set according to the level of the origin server's clients or services. For high-level clients or services with high query efficiency (or access efficiency), a higher preset upper limit can be set to provide them with higher-quality transit services. For low-level clients or services with low query efficiency requirements, their preset upper limit can be lowered.

[0042] In this embodiment, by collecting the first query volume of the domain name of the target source station, and when the first query volume exceeds the preset upper limit, scheduling the first query request within the preset upper limit, and querying the target source station through the edge node and the shared node, the query efficiency of the first query request is maintained; scheduling the second query request exceeding the preset upper limit, and querying the target source station through the edge node, reducing the number of query requests transferred by the shared node, and reducing the processing pressure of the shared node.

[0043] In addition to being applicable to CDN resource scheduling scenarios, the embodiments of this application can also be used in other resource scheduling scenarios with a logical hierarchy, such as Server Load Balancer (SLB). In addition to being applicable to dynamic acceleration products, the embodiments of this application can also be used in other video cloud products such as live broadcast and on-demand.

[0044] After the query volume corresponding to the domain name of the target source station exceeds the preset upper limit, the second query request for the domain name of the target source station is queried to the target source station through the edge node. In order to ensure the access efficiency of the domain name of the target source station after the query volume corresponding to the domain name of the target source station decreases. The data processing method also includes: collecting the second query volume of the domain name of the target source station in a second time period, the second time period being the time period after the first time period; when the second query volume is lower than the preset lower limit, scheduling the query request related to the domain name of the target source station, and querying the target source station through the shared node associated with the edge node.

[0045] The processing end collects the second query volume of the domain name of the target source station within the second time period, and compares the second query volume with the preset lower limit value. When the second query volume is lower than the preset lower limit value, the query request related to the domain name of the target source station is scheduled to query the target source station through the edge node and the upper-layer shared node. By monitoring the second query volume of the domain name of the target source station, when the second query volume is lower than the preset lower limit value, the method of querying the target source station by the edge node is changed from querying the target source station through the edge node to querying through the edge node and the shared node. This improves the access speed of the domain name of the target source station.

[0046] In the case where the query volume corresponding to the domain name exceeds the preset upper limit, the second query request is not forwarded through the shared node, but is directly requested to the source station. However, in the case where the query volume of multiple domain names exceeds the preset upper limit, it means that the processing volume of the shared node is too small, and the shared node needs to be expanded. Therefore, in an optional embodiment, the data processing method also includes: counting the number of target domain names that exceed the preset upper limit; when the number of domain names meets the expansion condition, outputting an expansion prompt, and the expansion prompt is used to prompt the expansion of the shared node. Among them, the expansion condition can be a preset value, for example, the preset value is 30. If the number of domain names exceeding the preset upper limit exceeds 30, an expansion prompt is output to expand the shared node. If the number of domain names exceeding the preset upper limit does not exceed 30, there is no need to expand the shared node.

[0047] The second query request queries the source station via the edge node, and the transmission speed of the resource data sent from the second query request to the source station and returned by the source station is slowed. To ensure data transmission quality, in an optional embodiment, the data processing method further includes: monitoring the data transmission quality of the second query request; if the data transmission quality falls below a preset quality requirement, scheduling the second query request to query the target source station via a shared node associated with the edge node.

[0048] The data transmission quality can be divided into a first quality level and a second quality level according to the quality level. The data quality level can be determined according to the time when the edge node receives the resource data returned by the source station, such as pre-setting the receiving duration. If the resource data is received within the receiving duration after sending the second query request, the data quality level is determined to be the first quality level; if the resource data is not received within the receiving duration after sending the second query request, the data quality level is determined to be the second quality level.

[0049] The first quality level is the level that meets the preset quality requirements, and the second quality level is the level that does not meet the preset quality requirements, that is, the second quality level is lower than the preset quality requirements. For the second query request of the second quality level, the processing end schedules the second query request through the edge node and the upper-layer shared node to query the target source station to ensure data transmission quality.

[0050] The processing end is described below in conjunction with a specific embodiment. Specifically, the processing end includes: a configuration component, a switching-out monitoring component, and a switching-in monitoring component. The configuration component is used to set the upper limit and lower limit corresponding to the domain name.

[0051] The cut-out monitoring component is used to monitor the query rate per second of the target domain name. When the query rate per second exceeds the upper limit, the first query request is dispatched to the source server through the shared node, and the second query request is dispatched to the source server through the edge node. The query rate per second can be understood as the number of queries within the target time period, such as the first query volume within the first time period and the second query volume within the second time period. Specifically, the cut-out monitoring component is used to perform the following steps:

[0052] Step 302: Monitor whether the query rate per second of the target domain name exceeds the upper limit. If the query rate per second exceeds the upper limit, execute step 304; if the query rate per second does not exceed the upper limit, stop executing.

[0053] Step 304: Calculate the amount by which the query rate per second exceeds the upper limit.

[0054] Step 306: Send a first scheduling message to the corresponding edge node to schedule the first query request within the upper limit value to be returned to the source station through the edge node and the shared node associated with the edge node; send a second scheduling message to the corresponding edge node to schedule the second query request that exceeds the amount to be returned to the source station through the edge node.

[0055] Specifically, the handoff interaction process between the processing end and the edge node is as follows: Figure 4 As shown, the interaction process includes the following steps:

[0056] Step 402: The processing end receives the number of queries in the first time period sent by the edge node.

[0057] Step 404: The processing end determines a first query volume corresponding to the domain name based on the number of queries from at least one edge node.

[0058] Step 406: The processing end determines whether the first query volume exceeds the preset upper limit value. If the first query volume does not exceed the preset upper limit value, the processing end sends first scheduling information to the edge node to schedule the query request of the edge node to query the source station through the edge node and the shared node associated with the edge node.

[0059] Step 408: When the first query volume exceeds a preset upper limit, the processing terminal sends the first scheduling information and the second scheduling information to the edge node. The edge node may receive at least one of the first scheduling information and the second scheduling information.

[0060] Step 410: The edge node schedules the first query request to query the source station through the edge node and the shared node according to the first scheduling information.

[0061] Step 412: The edge node schedules the second query request to query the source station through the edge node according to the second scheduling information.

[0062] In addition, if Figure 3 As shown, the cut-in monitoring component is used to monitor whether the query rate per second of the domain name that has been cut out is lower than the lower limit. When the query rate per second of the domain name that has been cut out exceeds the lower limit, the query request corresponding to the domain name is scheduled to query the source station through the edge node and the shared node associated with the edge node. The cut-in monitoring component is used to cut in the query request related to the domain name when the query rate per second of the domain name is lower than the lower limit, so that the query request is queried to the source station through the shared node to maintain the query quality of the query request. Specifically, the cut-in monitoring component is used to perform the following steps:

[0063] Step 308: Monitor whether the query rate per second of the domain name switched out is lower than the lower limit. If the query rate per second is lower than the lower limit, execute step 310; if the query rate per second is not lower than the lower limit, stop executing.

[0064] Step 310: Send scheduling information to the edge node to schedule the query request corresponding to the domain name, and return it to the source station through the edge node and the shared node associated with the edge node.

[0065] Specifically, the interaction process between the processing end and the edge node is as follows: Figure 5 As shown, the interaction process includes the following steps:

[0066] Step 502: The processing end receives the number of queries in the second time period sent by the edge node, where the second time period is the time period after the first time period.

[0067] Step 504: The processing end determines a second query quantity based on the number of queries of at least one edge node.

[0068] Step 506: The processing end determines whether the second query volume is lower than the preset lower limit. If the second query volume is not lower than the preset lower limit, the first query request is scheduled to be returned to the source station through the edge node and the shared node, and the second query request is scheduled to be returned to the source station through the edge node.

[0069] Step 508: When the second query volume is lower than the preset lower limit, the processing end returns the first scheduling information to the edge node.

[0070] Step 510: The edge node schedules a query request to query the source station through the shared node according to the first scheduling information.

[0071] Based on the above embodiments, the present application also provides a data processing method, which is applied to an edge node. The data processing method includes: step 602, sending the number of queries related to the domain name of the target source station within the first time period, and the number of queries is used to determine the first query volume related to the domain name of the target source station within the first time period; step 604, when the first query volume exceeds the preset upper limit value, in response to the scheduling of the processing end, executing a query to the target source station for the query request.

[0072] The edge node sends the query count of query requests related to the domain name of the target source station to the processing end, which determines a first query volume based on the query count. The processing end determines whether the first query volume exceeds a preset upper limit. If the first query volume exceeds the preset upper limit, the processing end schedules first query requests within the preset upper limit to query the target source station via the edge node and a shared node associated with the edge node; and schedules second query requests exceeding the preset upper limit to query the target source station via the edge node.

[0073] In this embodiment, the user's query request is sent to the nearest edge node, and the edge node sends the query quantity of the query request to the processing end. The processing end obtains a first query quantity based on the query quantity of multiple edge nodes, and when the first query quantity exceeds a preset upper limit value, the processing end schedules the first query request within the preset upper limit value to query the target source station through the edge node and the shared node, thereby maintaining the query speed of the first query request; and schedules the second query request exceeding the preset upper limit value to query the target source station through the edge node, thereby reducing the processing pressure of the shared node.

[0074] Optionally, as an embodiment, executing a query on the target source server in response to the query request includes at least one of the following:

[0075] Sending a first query request related to the domain name of the target source station to the target source station through the shared node;

[0076] A second query request related to the domain name of the target source station is queried to the target source station; wherein the shared node is used to receive the query request and query the target source station, the first query request is a query request within a preset upper limit value, and the second query request is a query request exceeding the preset upper limit value.

[0077] Specifically, the processing end can send first scheduling information to the edge node to schedule the edge node's query request to query the target source station through the edge node and the shared node. The processing end can send second scheduling information to the edge node to schedule the edge node's query request to query the target source station through the edge node. It is understood that the edge node can receive at least one of the first scheduling information and the second scheduling information to execute the query request to query the target source station in response to the scheduling of the processing end.

[0078] Based on the above embodiments, this application also provides a data processing method that can be applied to dynamic acceleration products and video cloud products, such as Figure 7 As shown, the method includes:

[0079] Step 702: Collect the first number of visits to the domain name of the target source station within the first time period.

[0080] Step 704: When the first access volume exceeds the preset upper limit, the first access request within the preset upper limit is scheduled to access the target source station through the shared node associated with the edge node. The shared node is used to transfer the access request between the edge node and the source station.

[0081] Step 706: Schedule the second access request exceeding the preset upper limit to access the target source station through the edge node.

[0082] The first access request and the second access request in this embodiment can be understood as requests for access to a target webpage, on-demand video data, and the like. By collecting the first access volume for the domain name of the target source station and, if the first access volume exceeds a preset upper limit, dispatching first access requests within the preset upper limit to access the target source station via edge nodes and shared nodes, the access efficiency of the first access requests is maintained. Second access requests exceeding the preset upper limit are dispatched to access the target source station via edge nodes, reducing the number of access requests forwarded by shared nodes and alleviating the processing pressure on the shared nodes.

[0083] Optionally, as an embodiment, the method further includes: when the first access volume does not exceed the preset upper limit value, scheduling access requests related to the target source station, and accessing the target source station through a shared node associated with an edge node.

[0084] Optionally, as an embodiment, collecting the first number of visits to the domain name of the target source station within the first time period includes: collecting the number of visits to the domain name of the target source station within the first time period from at least one edge node to obtain the first number of visits.

[0085] Optionally, as an embodiment, the scheduling accesses the target source station to the first access request within the preset upper limit value through the shared node associated with the edge node, including: for the first access request, sending first scheduling information to the edge node, so that the edge node accesses the first access request to the target source station through the shared node based on the first scheduling information.

[0086] Optionally, as an embodiment, the scheduling of the second access request that exceeds the preset upper limit value accesses the target source station through the edge node, including: for the second access request, sending second scheduling information to the edge node, so that the edge node accesses the second access request through the edge node to the target source station based on the second scheduling information.

[0087] Optionally, as an embodiment, the method further includes: collecting a second number of visits to the domain name of the target source station within a second time period, where the second time period is a time period after the first time period; when the second number of visits is lower than a preset lower limit, scheduling access requests related to the domain name of the target source station to access the target source station through a shared node associated with an edge node.

[0088] Optionally, as an embodiment, the method further includes: counting the number of target domain names that exceed a preset upper limit; when the number of domain names meets the expansion conditions, outputting an expansion prompt, wherein the expansion prompt is used to prompt the expansion of the shared node.

[0089] Optionally, as an embodiment, the method further includes: monitoring the data transmission quality of the second access request; when the data transmission quality is lower than the preset quality requirement, scheduling the second access request to access the target source station through the shared node associated with the edge node.

[0090] The processing flow of the data processing method of this embodiment is similar to the processing flow of the data processing method of the above embodiment. The specific processing flow can be referred to the above embodiment and will not be repeated here.

[0091] Based on the above embodiments, this application also provides a data processing method that can be applied to dynamic acceleration products and video cloud products, such as Figure 8 As shown, the method includes:

[0092] Step 802: Send the number of visits related to the domain name of the target source station in the first time period, where the number of visits is used to determine a first number of visits related to the domain name of the target source station in the first time period.

[0093] Step 804: When the first access volume exceeds a preset upper limit, in response to the scheduling of the processing end, access is performed on the target source station for the access request.

[0094] In an embodiment of the present application, a user's access request is sent to the nearest edge node. The edge node sends the access count of the access request to the processing end. The processing end obtains a first access count based on the access counts of multiple edge nodes. If the first access count exceeds a preset upper limit, the processing end schedules first access requests within the preset upper limit to query the target source station through the edge node and the shared node, thereby maintaining the access speed of the first access request. Second access requests exceeding the preset upper limit are scheduled to query the target source station through the edge node, thereby reducing the processing pressure on the shared node. The first access request and the second access request can be understood as access requests for the target web page, on-demand requests for on-demand video data, etc.

[0095] Optionally, as an embodiment, the access request executed to the target source station includes at least one of the following: a first access request related to the domain name of the target source station is accessed to the target source station through a shared node; a second access request related to the domain name of the target source station is accessed to the target source station; wherein the shared node is used to receive access requests and access the target source station, the first access request is an access request within the preset upper limit value, and the second access request is an access request exceeding the preset upper limit value.

[0096] The processing flow of the data processing method of this embodiment is similar to the processing flow of the data processing method of the above embodiment. The specific processing flow can be referred to the above embodiment and will not be repeated here.

[0097] It should be noted that for the method embodiments, for the sake of simplicity, they are all expressed as a series of action combinations, but those skilled in the art should be aware that the embodiments of the present application are not limited by the order of the actions described, because according to the embodiments of the present application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all preferred embodiments, and the actions involved are not necessarily required by the embodiments of the present application.

[0098] Based on the above embodiment, this embodiment further provides a data processing device, referring to Figure 9 , specifically including the following modules:

[0099] A query volume collection module 902 is configured to collect a first query volume of a domain name of a target source station within a first period of time;

[0100] A first scheduling module 904 is configured to, when the first query volume exceeds a preset upper limit, schedule first query requests within the preset upper limit to query the target source station through a shared node associated with the edge node, wherein the shared node is configured to transfer query requests between the edge node and the source station;

[0101] The second scheduling module 906 is configured to schedule a second query request exceeding the preset upper limit value to query the target source station through the edge node.

[0102] In summary, by collecting the first query volume of the domain name of the target source station, and when the first query volume exceeds the preset upper limit, scheduling the first query request within the preset upper limit, and querying the target source station through the edge node and the shared node, the query efficiency of the first query request is maintained; scheduling the second query request that exceeds the preset upper limit, and querying the target source station through the edge node, reducing the number of query requests transferred by the shared node, and reducing the processing pressure of the shared node.

[0103] Optionally, as an embodiment, the method further includes:

[0104] The third scheduling module is used to schedule query requests related to the target source station when the first query volume does not exceed the preset upper limit value, and query the target source station through the shared node associated with the edge node.

[0105] Optionally, as an embodiment, the query volume collection module 902 is specifically configured to:

[0106] The number of queries for the domain name of the target source station within the first time period is collected from at least one edge node to obtain the first query volume.

[0107] Optionally, as an embodiment, the first scheduling module 904 is specifically configured to:

[0108] For the first query request, first scheduling information is sent to the edge node, so that the edge node queries the target source station through the shared node for the first query request according to the first scheduling information.

[0109] Optionally, as an embodiment, the second scheduling module 906 is specifically configured to:

[0110] For the second query request, second scheduling information is sent to the edge node, so that the edge node queries the target source station through the edge node for the second query request according to the second scheduling information.

[0111] Optionally, as an embodiment, the data processing device further includes:

[0112] a query volume monitoring module, configured to collect a second query volume of the domain name of the target source station within a second time period, where the second time period is a time period after the first time period;

[0113] The first input processing module is used to schedule query requests related to the domain name of the target source station when the second query volume is lower than a preset lower limit, and query the target source station through the shared node associated with the edge node.

[0114] Optionally, as an embodiment, the data processing device further includes:

[0115] A domain name statistics module is cut out to count the number of target domain names that exceed a preset upper limit;

[0116] The prompt module is used to output an expansion prompt when the number of domain names meets the expansion conditions, and the expansion prompt is used to prompt the shared node to be expanded.

[0117] Optionally, as an embodiment, the data processing device further includes:

[0118] a quality monitoring module, configured to monitor the data transmission quality of the second query request;

[0119] The second cut-in processing module is used to schedule the second query request to query the target source station through the shared node associated with the edge node when the data transmission quality is lower than the preset quality requirement.

[0120] Reference Figure 10 , shows a structural block diagram of an optional embodiment of a data processing device of the present application, which may specifically include the following modules:

[0121] A query quantity sending module 1002 is configured to send a number of queries related to the domain name of the target source station within a first time period, wherein the number of queries is used to determine a first query volume related to the domain name of the target source station within the first time period;

[0122] The execution module 1004 is configured to execute a query to the target source station in response to the scheduling of the processing end when the first query volume exceeds a preset upper limit.

[0123] In summary, the user's query request is sent to the nearest edge node, and the edge node sends the query quantity of the query request to the processing end. The processing end obtains the first query quantity based on the query quantity of multiple edge nodes, and when the first query quantity exceeds the preset upper limit value, the first query request within the preset upper limit value is scheduled to query the target source station through the edge node and the shared node, thereby maintaining the query speed of the first query request; the second query request exceeding the preset upper limit value is scheduled to query the target source station through the edge node, thereby reducing the processing pressure of the shared node.

[0124] Optionally, as an embodiment, the execution module 1004 includes at least one of the following modules:

[0125] A first execution module is configured to query the target source station through a shared node for a first query request related to the domain name of the target source station;

[0126] The second execution module is used to query the target source station with a second query request related to the domain name of the target source station; wherein the shared node is used to receive the query request and query the target source station, the first query request is a query request within the preset upper limit value, and the second query request is a query request exceeding the preset upper limit value.

[0127] Based on the above embodiments, the present application also provides a data processing device, such as Figure 11 As shown, the device includes:

[0128] The pageview collection module 1102 is configured to collect the first pageviews of the domain name of the target source station within a first time period.

[0129] A first access scheduling module 1104 is configured to, when the first access volume exceeds a preset upper limit, schedule a first access request within the preset upper limit to access the target source station through a shared node associated with the edge node, wherein the shared node is configured to transfer access requests between the edge node and the source station;

[0130] The second access scheduling module 1106 is configured to schedule the second access request exceeding the preset upper limit to access the target source station through the edge node.

[0131] In summary, the first access request and the second access request can be understood as requests for access to the target webpage, on-demand video data, and so on. By collecting the first access volume for the domain name of the target source station and, if the first access volume exceeds a preset upper limit, dispatching first access requests within the preset upper limit to access the target source station via edge nodes and shared nodes, the access efficiency of the first access requests is maintained. Second access requests exceeding the preset upper limit are dispatched to access the target source station via edge nodes, reducing the number of access requests relayed by shared nodes and alleviating the processing pressure on the shared nodes.

[0132] Optionally, as an embodiment, the device further includes:

[0133] The third access scheduling module schedules access requests related to the target source station to access the target source station through the shared node associated with the edge node when the first access volume does not exceed the preset upper limit.

[0134] Optionally, as an embodiment, the pageview collection module is specifically configured to:

[0135] The number of visits to the domain name of the target source station within the first time period is collected from at least one edge node to obtain the first visit volume.

[0136] Optionally, as an embodiment, the first access scheduling module is specifically configured to:

[0137] For the first access request, first scheduling information is sent to the edge node, so that the edge node accesses the first access request to the target source station through the shared node according to the first scheduling information.

[0138] Optionally, as an embodiment, the second access scheduling module is specifically configured to:

[0139] For the second access request, second scheduling information is sent to the edge node, so that the edge node sends the second access request to the target source station through the edge node according to the second scheduling information.

[0140] Optionally, as an embodiment, the device further includes:

[0141] A visit monitoring module, configured to collect a second visit volume of the domain name of the target source station within a second time period, where the second time period is a time period after the first time period;

[0142] The first access entry module is used to schedule access requests related to the domain name of the target source station when the second access volume is lower than a preset lower limit, and access the target source station through a shared node associated with an edge node.

[0143] Optionally, as an embodiment, the device further includes:

[0144] A domain name quantity statistics module is used to count the number of target domain names that exceed a preset upper limit;

[0145] The prompt output module is used to output an expansion prompt when the number of domain names meets the expansion conditions, and the expansion prompt is used to prompt the shared node to be expanded.

[0146] Optionally, as an embodiment, the device further includes:

[0147] a transmission quality monitoring module, configured to monitor the data transmission quality of the second access request;

[0148] The second access entry module is used to schedule the second access request to access the target source station through the shared node associated with the edge node when the data transmission quality is lower than the preset quality requirement.

[0149] Based on the above embodiments, the present application also provides a data processing device, such as Figure 12 As shown, the device includes:

[0150] A visit number sending module 1202 is configured to send a visit number associated with the domain name of the target source station within a first period of time, wherein the visit number is used to determine a first visit volume associated with the domain name of the target source station within the first period of time;

[0151] The access execution module 1204 is configured to execute access to the target source station in response to the scheduling of the processing end when the first access amount exceeds a preset upper limit.

[0152] Optionally, as an embodiment, the access execution module includes at least one of the following modules:

[0153] A first access execution submodule, configured to send a first access request related to the domain name of the target source station to access the target source station through a shared node;

[0154] The second access execution submodule is used to send a second access request related to the domain name of the target source station to the target source station; wherein, the shared node is used to receive the access request and access the target source station, the first access request is an access request within the preset upper limit value, and the second access request is an access request exceeding the preset upper limit value.

[0155] In an embodiment of the present application, a user's access request is sent to the nearest edge node. The edge node sends the access count of the access request to the processing end. The processing end obtains a first access count based on the access counts of multiple edge nodes. If the first access count exceeds a preset upper limit, the processing end schedules first access requests within the preset upper limit to query the target source station through the edge node and the shared node, thereby maintaining the access speed of the first access request. Second access requests exceeding the preset upper limit are scheduled to query the target source station through the edge node, thereby reducing the processing pressure on the shared node. The first access request and the second access request can be understood as access requests for the target web page, on-demand requests for on-demand video data, etc.

[0156] An embodiment of the present application further provides a non-volatile readable storage medium, which stores one or more modules (programs). When the one or more modules are applied to a device, the device can execute instructions (instructions) of each method step in the embodiment of the present application.

[0157] The present invention provides one or more machine-readable media having instructions stored thereon, which, when executed by one or more processors, cause an electronic device to perform one or more of the methods described in the above embodiments. In the embodiments of the present invention, the electronic device includes a server, a terminal device, and the like.

[0158] The embodiments of the present disclosure may be implemented as a device configured as desired using any appropriate hardware, firmware, software, or any combination thereof, and the device may include electronic devices such as a server (cluster), a terminal, etc. Figure 13 An exemplary apparatus 1300 that can be used to implement various embodiments described in this application is schematically illustrated.

[0159] For one embodiment, Figure 13 An exemplary apparatus 1300 is shown having one or more processors 1302, a control module (chip set) 1304 coupled to at least one of the processor(s) 1302, a memory 1306 coupled to the control module 1304, a non-volatile memory (NVM) / storage device 1308 coupled to the control module 1304, one or more input / output devices 1310 coupled to the control module 1304, and a network interface 1312 coupled to the control module 1304.

[0160] The processor 1302 may include one or more single-core or multi-core processors, and the processor 1302 may include any combination of general-purpose processors or dedicated processors (e.g., graphics processors, application processors, baseband processors, etc.). In some embodiments, the apparatus 1300 can serve as a server, terminal, or other device described in the embodiments of the present application.

[0161] In some embodiments, the apparatus 1300 may include one or more computer-readable media (e.g., memory 1306 or NVM / storage 1308) having instructions 1314 and one or more processors 1302 configured in conjunction with the one or more computer-readable media to execute the instructions 1314 to implement a module to perform the actions described in the present disclosure.

[0162] For one embodiment, the control module 1304 may include any suitable interface controller to provide any suitable interface to at least one of the processor(s) 1302 and / or any suitable device or component in communication with the control module 1304 .

[0163] The control module 1304 may include a memory controller module to provide an interface to the memory 1306. The memory controller module may be a hardware module, a software module, and / or a firmware module.

[0164] The memory 1306 can be used, for example, to load and store data and / or instructions 1314 for the device 1300. For one embodiment, the memory 1306 can include any suitable volatile memory, such as a suitable DRAM. In some embodiments, the memory 1306 can include double data rate type four synchronous dynamic random access memory (DDR4 SDRAM).

[0165] For one embodiment, control module 1304 may include one or more input / output controllers to provide interfaces to NVM / storage device 1308 and input / output device(s) 1310 .

[0166] For example, NVM / storage 1308 may be used to store data and / or instructions 1314. NVM / storage 1308 may include any suitable non-volatile memory (e.g., flash memory) and / or may include any suitable non-volatile storage device(s) (e.g., one or more hard disk drives (HDDs), one or more compact disk (CD) drives, and / or one or more digital versatile disk (DVD) drives).

[0167] NVM / storage device 1308 may include storage resources that are part of the device on which apparatus 1300 is installed, or it may be accessible to the device without being part of the device. For example, NVM / storage device 1308 may be accessible over a network via input / output device(s) 1310.

[0168] (One or more) input / output devices 1310 may provide an interface for apparatus 1300 to communicate with any other appropriate devices. Input / output devices 1310 may include communication components, audio components, sensor components, etc. Network interface 1312 may provide an interface for apparatus 1300 to communicate via one or more networks. Apparatus 1300 may wirelessly communicate with one or more components of a wireless network according to any of one or more wireless network standards and / or protocols, for example, accessing a wireless network based on a communication standard, such as WiFi, 2G, 3G, 4G, 5G, etc., or a combination thereof for wireless communication.

[0169] For one embodiment, at least one of the processor(s) 1302 may be packaged together with the logic of one or more controllers of the control module 1304 (e.g., a memory controller module). For one embodiment, at least one of the processor(s) 1302 may be packaged together with the logic of one or more controllers of the control module 1304 to form a system-in-package (SiP). For one embodiment, at least one of the processor(s) 1302 may be integrated on the same die with the logic of one or more controllers of the control module 1304. For one embodiment, at least one of the processor(s) 1302 may be integrated on the same die with the logic of one or more controllers of the control module 1304 to form a system-on-chip (SoC).

[0170] In various embodiments, the apparatus 1300 may be, but is not limited to, a terminal device such as a server, a desktop computing device, or a mobile computing device (e.g., a laptop computing device, a handheld computing device, a tablet computer, a netbook, etc.). In various embodiments, the apparatus 1300 may have more or fewer components and / or a different architecture. For example, in some embodiments, the apparatus 1300 includes one or more cameras, a keyboard, a liquid crystal display (LCD) screen (including a touchscreen display), a non-volatile memory port, multiple antennas, a graphics chip, an application-specific integrated circuit (ASIC), and a speaker.

[0171] Among them, the main control chip can be used as a processor or control module in the detection device, sensor data, location information, etc. are stored in the memory or NVM / storage device, the sensor group can be used as an input / output device, and the communication interface may include a network interface.

[0172] An embodiment of the present application further provides an electronic device, comprising: a processor; and a memory on which executable code is stored. When the executable code is executed, the processor executes one or more methods described in the embodiments of the present application.

[0173] The embodiments of the present application further provide one or more machine-readable media on which executable codes are stored. When the executable codes are executed, the processor executes one or more methods described in the embodiments of the present application.

[0174] As for the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0175] The various embodiments in this specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the various embodiments can be referenced to each other.

[0176] The embodiments of the present application are described with reference to the flowcharts and / or block diagrams of the methods, terminal devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing terminal device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing terminal device generate instructions for implementing the steps in the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0177] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing terminal device to operate in a specific manner, so that the instructions stored in the computer readable memory produce a manufactured product including an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0178] These computer program instructions can also be loaded onto a computer or other programmable data processing terminal device so that a series of operating steps are executed on the computer or other programmable terminal device to produce a computer-implemented process, thereby providing instructions for executing on the computer or other programmable terminal device to implement the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0179] Although preferred embodiments of the present invention have been described, those skilled in the art may make additional changes and modifications to these embodiments once they become aware of the basic inventive concepts. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the embodiments of the present invention.

[0180] Finally, it should be noted that, in this document, relational terms such as first and second, etc., are used only to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual relationship or order between these entities or operations. Moreover, the terms "comprises," "comprising," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or terminal device that includes a series of elements includes not only those elements, but also other elements not explicitly listed, or elements inherent to such process, method, article, or terminal device. In the absence of further limitations, an element defined by the phrase "comprising a ..." does not exclude the presence of additional identical elements in the process, method, article, or terminal device that includes the element.

[0181] The above is a detailed introduction to a data processing method, a data processing device, an electronic device and a storage medium provided by the present application. Specific examples are used herein to illustrate the principles and implementation methods of the present application. The description of the above embodiments is only used to help understand the method of the present application and its core idea. At the same time, for those skilled in the art, according to the ideas of the present application, there may be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as limiting the present application.

Claims

1. A data processing method, characterized in that: The method includes: Collect the first query volume of the domain name of the target source station in the first period; In the case where the first query volume exceeds a preset upper limit, scheduling the first query request within the preset upper limit to query the target source station through a shared node associated with the edge node, wherein the shared node is used to transfer the query request between the edge node and the source station, wherein the edge node is a layer node and the shared node is an upper layer node of multiple edge nodes, and the preset upper limit is set according to the level corresponding to the customer of the source station or the service of the source station; The second query request exceeding the preset upper limit is scheduled to query the target source station through the edge node to reduce the processing pressure of the shared node.

2. The method according to claim 1, characterized in that Also includes: When the first query volume does not exceed the preset upper limit, a query request related to the target source station is scheduled to query the target source station through a shared node associated with an edge node.

3. The method according to claim 1, characterized in that The collecting of the first query volume of the domain name of the target source station in the first time period includes: The number of queries for the domain name of the target source station within the first time period is collected from at least one edge node to obtain the first query volume.

4. The method according to claim 1, wherein The scheduling of the first query request within the preset upper limit value, querying the target source station through the shared node associated with the edge node, includes: For the first query request, first scheduling information is sent to the edge node, so that the edge node queries the target source station through the shared node for the first query request according to the first scheduling information.

5. The method according to claim 4, characterized in that The scheduling of the second query request exceeding the preset upper limit value, querying the target source station through the edge node, includes: For the second query request, second scheduling information is sent to the edge node, so that the edge node queries the target source station through the edge node for the second query request according to the second scheduling information.

6. The method according to claim 1, characterized in that The method further comprises: Collecting a second query volume of the domain name of the target source station within a second time period, where the second time period is a time period after the first time period; When the second query volume is lower than a preset lower limit, a query request related to the domain name of the target source station is scheduled to query the target source station through a shared node associated with an edge node.

7. The method according to claim 1, characterized in that Also includes: Count the number of target domain names that exceed the preset upper limit; When the number of domain names meets the expansion condition, an expansion prompt is output, where the expansion prompt is used to prompt the shared node to be expanded.

8. The method according to claim 1, characterized in that Also includes: monitoring the data transmission quality of the second query request; When the data transmission quality is lower than the preset quality requirement, the second query request is scheduled to query the target source station through the shared node associated with the edge node.

9. A data processing method, characterized in that: include: Sending a number of queries related to the domain name of the target source station during a first time period, where the number of queries is used to determine a first query volume related to the domain name of the target source station during the first time period; When the first query volume exceeds a preset upper limit, in response to scheduling by the processing end, executing queries to the target source station for query requests exceeding the preset upper limit, so as to reduce processing pressure on the shared node, wherein the preset upper limit is set according to a level corresponding to a customer of the source station or a service of the source station; Among them, when the first query volume exceeds the preset upper limit value, the processing end schedules the query requests within the preset upper limit value, and queries the target source station through the shared node associated with the edge node. The shared node is used to transfer the query requests between the edge node and the source station. The edge node is a first-layer node, and the shared node is an upper-layer node of multiple edge nodes.

10. The method according to claim 9, characterized in that The query request to execute a query to the target source station includes at least one of the following: Sending a first query request related to the domain name of the target source station to the target source station through a shared node; A second query request related to the domain name of the target source station is queried to the target source station; wherein the shared node is used to receive the query request and query the target source station, the first query request is a query request within the preset upper limit value, and the second query request is a query request exceeding the preset upper limit value.

11. A data processing method, characterized in that: include: Collect the first visits of the domain name of the target source station in the first period; In the case where the first access volume exceeds a preset upper limit, scheduling a first access request within the preset upper limit to access the target source station through a shared node associated with an edge node. The shared node is used to transfer access requests between the edge node and the source station. The edge node is a layer node, and the shared node is an upper-layer node of multiple edge nodes. The preset upper limit is set according to the level corresponding to the source station's customers or the source station's services. The second access request exceeding the preset upper limit is scheduled to access the target source station through the edge node, so as to reduce the processing pressure of the shared node.

12. A data processing method, characterized in that: include: Sending a number of visits related to the domain name of the target source station in a first time period, where the number of visits is used to determine a first number of visits related to the domain name of the target source station in the first time period; When the first access volume exceeds a preset upper limit, in response to scheduling by the processing end, access requests exceeding the preset upper limit are directed to the target source station to reduce processing pressure on the shared node, wherein the preset upper limit is set according to a level corresponding to a customer of the source station or a service of the source station; Among them, when the first access volume exceeds the preset upper limit value, the processing end schedules the access requests within the preset upper limit value to access the target source station through the shared node associated with the edge node. The shared node is used to transfer the access requests between the edge node and the source station. The edge node is a first-layer node, and the shared node is an upper-layer node of multiple edge nodes.

13. A data processing device, characterized in that: include: A query volume collection module, configured to collect a first query volume of a domain name of a target source station within a first period of time; a first scheduling module configured to, when the first query volume exceeds a preset upper limit, schedule a first query request within the preset upper limit to query the target source station through a shared node associated with an edge node, the shared node being configured to relay query requests between the edge node and the source station, the edge node being a first-layer node and the shared node being an upper-layer node of multiple edge nodes, the preset upper limit being set according to a level corresponding to a customer of the source station or a service of the source station; The second scheduling module is used to schedule the second query request that exceeds the preset upper limit value to query the target source station through the edge node to reduce the processing pressure of the shared node.

14. A data processing device, characterized in that: include: a query quantity sending module, configured to send a query quantity related to the domain name of the target source station within a first time period, wherein the query quantity is used to determine a first query volume related to the domain name of the target source station within the first time period; an execution module, configured to, in response to scheduling by a processing terminal, execute a query to the target source station for the query request when the first query volume exceeds a preset upper limit, so as to reduce processing pressure on the shared node, wherein the preset upper limit is set according to a level corresponding to a customer of the source station or a service of the source station; Among them, when the first query volume exceeds the preset upper limit value, the processing end schedules the query requests within the preset upper limit value, and queries the target source station through the shared node associated with the edge node. The shared node is used to transfer the query requests between the edge node and the source station. The edge node is a first-layer node, and the shared node is an upper-layer node of multiple edge nodes.

15. A data processing device, characterized in that: include: A visit volume collection module, used to collect the first visit volume of the domain name of the target source station within the first time period; a first access scheduling module configured to, when the first access volume exceeds a preset upper limit, schedule a first access request within the preset upper limit to access the target source station through a shared node associated with an edge node, wherein the shared node is configured to relay access requests between the edge node and the source station, the edge node being a first-layer node and the shared node being an upper-layer node of multiple edge nodes, and the preset upper limit being set according to a level corresponding to a customer of the source station or a service of the source station; The second access scheduling module is used to schedule the second access request exceeding the preset upper limit value to access the target source station through the edge node to reduce the processing pressure of the shared node.

16. A data processing device, characterized in that: include: a visit number sending module, configured to send a visit number associated with the domain name of the target source station within a first time period, wherein the visit number is used to determine a first visit volume associated with the domain name of the target source station within the first time period; an access execution module, configured to, in response to scheduling by the processing end, execute access to the target source station for the access request when the first access volume exceeds a preset upper limit, so as to reduce processing pressure on the shared node, wherein the preset upper limit is set according to a level corresponding to a customer of the source station or a service of the source station; Among them, when the first access volume exceeds the preset upper limit value, the processing end schedules the access requests within the preset upper limit value to access the target source station through the shared node associated with the edge node. The shared node is used to transfer the access requests between the edge node and the source station. The edge node is a first-layer node, and the shared node is an upper-layer node of multiple edge nodes.

17. An electronic device, characterized in that: include: processor; and A memory having executable codes stored thereon, which, when executed, cause the processor to perform the method according to one or more of claims 1-8.

18. One or more machine-readable media having executable code stored thereon, which, when executed, causes a processor to perform the method of one or more of claims 1-8.

19. An electronic device, characterized in that: include: processor; and A memory having executable code stored thereon, which, when executed, causes the processor to perform the method according to one or more of claims 9-10.

20. One or more machine-readable media having executable code stored thereon, which, when executed, causes a processor to perform the method of one or more of claims 9-10.

Images