Data processing method and device, computer equipment and storage medium

Abstract

The invention relates to a data processing method and device, computer equipment and a storage medium. The method comprises the steps that a plurality of virtual sub-nodes are combined into a combined node, storage devices of different virtual sub-nodes in the combined node can be shared, and therefore under the condition that a target resource cannot be queried in the storage device of one virtual sub-node, the target resource can be obtained by accessing storage devices of other virtual sub-nodes; the target resource does not need to be obtained directly through source returning, so that the source returning frequency can be reduced, the source returning cost is reduced, and the problem that the source returning cost is increased due to the fact that the number of small nodes in the same machine room is large is solved.

Description

Technical Field

[0001] This application relates to the field of computer technology, and in particular to a data processing method, apparatus, computer equipment, and storage medium. Background Technology

[0002] With the development of the internet, more and more data resource requests are being handled by CDN nodes to improve response speed and reduce data pressure on resource servers. However, to maximize resource efficiency, CDNs build multiple billed small nodes within the same data center, each a separate billing unit. While this improves resource utilization, each small node is physically isolated, and storage is not shared. This means that the same file needs to be cached once on each small node. The more small nodes there are, the more times files need to be fetched from the CDN parent node, increasing the bandwidth cost of the parent node, i.e., increasing the origin pull cost. Summary of the Invention

[0003] This application provides a data processing method, apparatus, computer equipment, and storage medium to address the problem of increased back-to-source costs due to a large number of small nodes within the same data center.

[0004] Firstly, this application provides a data processing method applied to merging nodes, the method comprising:

[0005] When the first node in the merging nodes receives multiple resource requests through the target communication port, the first node responds to each resource request received by the first node using its respective storage devices, wherein the first node is any virtual child node in the merging nodes.

[0006] If the target resource requested by the target resource request is not found in any of the storage devices of the first node, the target resource is queried in each of the storage devices of the second node, wherein the second node is a virtual child node in the merged node that is different from the first node, and the target resource request is any resource request obtained by the first node.

[0007] When the target resource is found in the storage device of the second node, the target resource obtained from the storage device of the second node is fed back to the client corresponding to the target resource request through the target communication port.

[0008] Secondly, this application provides a data processing apparatus, the apparatus comprising:

[0009] The response module is used to respond to each resource request obtained by the first node through each storage device of the first node when the first node in the merging node obtains multiple resource requests through the target communication port, wherein the first node is any virtual child node in the merging node.

[0010] The query module is used to query the target resource in each storage device of the second node when the target resource requested by the target resource request is not found in each storage device of the first node, wherein the second node is a virtual child node in the merging node that is different from the first node, and the target resource request is any resource request obtained by the first node.

[0011] The feedback module is used to, when the target resource is found in the storage device of the second node, send the target resource obtained from the storage device of the second node back to the client corresponding to the target resource request through the target communication port.

[0012] Thirdly, this application provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the above-described data processing method.

[0013] Fourthly, this application also provides a computer storage medium storing computer-executable instructions for performing the above-described data processing method.

[0014] Compared with the prior art, the technical solution provided in this application has the following advantages: When the first node in the merging node obtains multiple resource requests through the target communication port, the method provided in this application utilizes each storage device of the first node to respond to each resource request obtained by the first node, wherein the first node is any virtual child node in the merging node; if the target resource requested by the target resource request is not found in any storage device of the first node, the target resource is queried in each storage device of the second node, wherein the second node is a virtual child node in the merging node different from the first node, and the target resource request is any resource request obtained by the first node; when the target resource is found in the storage device of the second node, the target resource obtained from the storage device of the second node is fed back to the client corresponding to the target resource request through the target communication port.

[0015] Based on the above method, multiple virtual child nodes are merged into a merged node. Within the merged node, the storage devices of different virtual child nodes can be shared. Therefore, if the target resource cannot be found in the storage device of a virtual child node, it can be obtained by accessing the storage devices of other virtual child nodes, without having to directly retrieve the target resource from the origin. This reduces the number of origin retrievals and thus lowers the origin retrieval cost, solving the problem of increased origin retrieval costs due to a large number of small nodes in the same data center. Attached Figure Description

[0016] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with the invention and, together with the description, serve to explain the principles of the invention.

[0017] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, for those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0018] One or more embodiments are illustrated by way of example with reference numerals in the accompanying drawings. These illustrations do not constitute a limitation on the embodiments. Elements with the same reference numerals in the drawings are denoted as similar elements. Unless otherwise stated, the figures in the drawings are not to be limited by scale.

[0019] Figure 1 An application environment diagram of a data processing method provided in an embodiment of this application;

[0020] Figure 2 This is a schematic diagram of the structure of each independent node provided in the embodiments of this application;

[0021] Figure 3 This is a schematic diagram of the structure of the merge node provided in an embodiment of this application;

[0022] Figure 4 This is a schematic diagram illustrating the relationship between the communication port and the public network switch provided in an embodiment of this application.

[0023] Figure 5 A flowchart illustrating a data processing method provided in an embodiment of this application;

[0024] Figure 6 A structural block diagram of a data processing apparatus provided in an embodiment of this application;

[0025] Figure 7 This is a schematic diagram of the internal structure of a computer device provided in an embodiment of this application. Detailed Implementation

[0026] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0027] The following disclosure provides numerous different embodiments or examples for implementing various structures of the invention. To simplify the disclosure, specific examples of components and arrangements are described below. These are merely examples and are not intended to limit the scope of the invention. Furthermore, reference numerals and / or letters may be repeated in different examples. Such repetition is for simplification and clarity and does not in itself indicate a relationship between the various embodiments and / or arrangements discussed.

[0028] Figure 1 This is a diagram illustrating the application environment of a data processing method in one embodiment. (Refer to...) Figure 1 This data processing method is applied to a data processing system. The data processing system includes a client 110 and a data center system 120. The client 110 and the data center system 120 are connected via a network. The client 110 can be implemented using a desktop terminal or a mobile terminal; the mobile terminal can be at least one of a mobile phone, tablet, or laptop. The data center system 120 is implemented using a server cluster consisting of multiple servers. Figure 2 As shown, the existing data center system contains multiple independent nodes, each of which is independent and physically isolated from each other. Each independent node has its own public network switch, load balancer, storage device, and internal network switch. In order to prevent service capacity from degrading due to equipment failure, each independent node also needs to add redundant backup equipment. However, most of the data on each independent node runs according to the minimum bandwidth, so there is no need to use backup equipment, which reduces equipment utilization and increases data center costs.

[0029] In one embodiment, such as Figure 3As shown, multiple independent nodes within the data center system 120 are merged together to form a merged node. Specifically, all independent nodes in the data center system 120 can be merged into one merged node, or only some independent nodes can be merged into one merged node. In this embodiment, all independent nodes within the data center system 120 are merged to form a merged node, therefore the data center system 120 can be considered as a merged node. The sum of the constituent devices in a preset number of virtual child nodes within the merged node is a first number. When each virtual child node within the merged node is split into mutually independent nodes, the sum of the constituent devices in the preset number of independent nodes is a second number, where the first number is less than the second number. That is, when each node is built independently, to ensure utilization, the equipment needs to be fully configured, and redundant equipment must be reserved, resulting in a large amount of equipment consumption and low effective equipment utilization. Merging multiple small nodes can improve the effective equipment utilization and eliminate the need for so much redundant equipment.

[0030] For example, refer to Figure 2 and Figure 3 The first approach involves merging three independent nodes into a single merged node. Each independent node has two load balancers, N storage devices, and two switches, resulting in a total of six load balancers, 3N storage devices, and six switches. However, by merging the three independent nodes into a single merged node, each independent node corresponds to a virtual child node within the merged node. Multiple virtual child nodes share one public network switch and one internal network switch. Each virtual child node requires only one load balancer. Since all storage devices within the merged node are shared, each virtual child node does not need N storage devices. Therefore, the merged node requires only two switches (one public network switch and one internal network switch), four load balancers (one of which serves as a backup), and P storage devices, where P < 3N. This reduces the number of switches, load balancers, and storage devices compared to three independent nodes. Consequently, the total number of components in the merged node (for the same number of virtual child nodes) is less than the total number of components in the same number of independent nodes. This allows for the reduction of redundant backup devices through the merged node, thereby improving equipment utilization and lowering data center costs.

[0031] In one embodiment, Figure 5 This is a flowchart illustrating a data processing method in one embodiment, with reference to... Figure 5 This provides a data processing method. This embodiment primarily applies this method to the aforementioned... Figure 1 Taking the data center system 120 (merging node) as an example, this data processing method specifically includes the following steps:

[0032] Step S210: When the first node in the merging nodes obtains multiple resource requests through the target communication port, the first node responds to each resource request obtained by the first node using each of its storage devices, wherein the first node is any virtual child node in the merging nodes.

[0033] Specifically, the merging nodes obtain resource requests corresponding to each communication port through different communication ports. That is, the resource request carries the domain name address of the corresponding communication port. The communication port refers to the switch port of a public network switch; different communication ports have different domain name addresses (IP addresses). For example, refer to... Figure 4 The IP address of switch port 1 is 123.6.106.0 / 25, the IP address of switch port 2 is 123.6.109.0 / 25, and the IP address of switch port 3 is 123.6.112.0 / 25. Different communication ports correspond to different lines. That is, different resource requests are accessed through the corresponding communication ports of the merging node. The resource request is initiated by client 110 to request resource data. Since there are no physically isolated independent nodes after the independent nodes are merged into a merged node, the virtual child nodes in the merged node are regarded as virtual nodes corresponding to the independent nodes. Each virtual child node includes at least one load balancer and one storage device. The number of public network switches and internal network switches is determined by the number of ports of the load balancer and the number of ports of the storage device.

[0034] When the first node receives multiple resource requests, it responds to each resource request using its various storage devices, that is, it queries the resource data requested by each resource request in the various storage devices of the first node.

[0035] Step S220: If the target resource requested by the target resource request is not found in any of the storage devices of the first node, the target resource is queried in each of the storage devices of the second node, wherein the second node is a virtual child node in the merged node that is different from the first node, and the target resource request is any resource request obtained by the first node.

[0036] Specifically, if the target resource is not found in any of the storage devices of the first node, it means that the first node failed to respond to the target resource request. If the first node is an independent node, it is necessary to retrieve the target resource by pulling from the origin. However, since the first node is a virtual child node in the merged node, the storage devices of different virtual child nodes in the merged node are shared with each other. Therefore, the target resource can continue to be queried in the storage devices of the second node without pulling from the origin, thereby reducing the number of times and frequency of pulling from the origin, and thus reducing the cost of pulling from the origin.

[0037] In step S230, when the target resource is found in the storage device of the second node, the target resource obtained from the storage device of the second node is fed back to the client 110 corresponding to the target resource request through the target communication port.

[0038] Specifically, if the target resource is found in the storage device of the second node, the target resource is sent back to the client 110 corresponding to the target resource request through the target communication port. This involves merging multiple virtual child nodes into a single merged node. Within the merged node, the storage devices of different virtual child nodes can be shared. Therefore, if the target resource cannot be found in the storage device of one virtual child node, it can be obtained by accessing the storage devices of other virtual child nodes, without needing to directly retrieve the target resource from the origin server. This reduces the number of origin server requests and thus lowers the cost, solving the problem of increased origin server costs due to a large number of small nodes within the same data center.

[0039] In one embodiment, before the first node in the merging nodes receives multiple resource requests through the target communication port and responds to each resource request received by the first node using its respective storage devices, the method further includes:

[0040] The system receives resource requests that match the domain name addresses of each communication port through multiple different communication ports.

[0041] Multiple resource requests received through all communication ports are evenly distributed to the load balancing devices of each virtual child node within the merged node, wherein the number of load balancing devices for each virtual child node is the same.

[0042] Specifically, the merging node receives resource requests with domain names from each communication port through different communication ports, and distributes the multiple resource requests evenly to the load balancing devices of each virtual child node. Since the load balancing devices and storage devices contained in each virtual child node can be shared, the multiple resource requests received through all communication ports are evenly distributed to the load balancing devices of each virtual child node within the merging node. Each virtual child node has the same number of load balancing devices, thereby achieving an even distribution of traffic among the load balancing devices within the merging node, avoiding imbalances where some load balancing devices have significantly higher or lower traffic, and improving request processing efficiency.

[0043] In one embodiment, when the first node in the merging nodes receives multiple resource requests through the target communication port, the first node responds to each resource request received by the first node using its respective storage devices, including:

[0044] When the load balancing device of the first node in the merged node obtains multiple resource requests through the target communication port, it distributes each resource request obtained by the load balancing device of the first node equally to each storage device in the first node.

[0045] The resource requests allocated to each storage device are responded to using the storage devices within the first node.

[0046] Specifically, the load balancer of the first node receives multiple resource requests through the target communication port. These resource requests are then evenly distributed among the load balancers of the first node's storage devices. Since all load balancers and storage devices within the merged node are shared, each virtual child node can be considered to have the same number of load balancers and storage devices. While the first node's load balancer distributes resource requests evenly among its storage devices, the load balancers of other virtual child nodes simultaneously distribute the same number of resource requests evenly among the same number of storage devices. In other words, the resource requests received by all load balancers within the merged node are then evenly distributed among all storage devices within the merged node. Each storage device responds to its received resource requests by querying the resource data requested by the received resource request, thus achieving traffic balancing across all storage devices.

[0047] Regardless of which communication port the traffic comes from, it will eventually be distributed evenly to each storage device. Each load balancer and storage device needs to be configured with the IP address of each communication port.

[0048] In one embodiment, utilizing each storage device of the first node to respond to each resource request obtained by the first node includes:

[0049] Obtain the operating bandwidth information of each virtual sub-node within the merged node, wherein the operating bandwidth information includes high bandwidth runtime, which is the cumulative runtime of the virtual sub-node's operating bandwidth within a preset bandwidth range, and the high bandwidth runtime of each virtual sub-node in the merged node is different;

[0050] The total high-bandwidth runtime of the merged node is determined by summing the high-bandwidth runtimes of each virtual sub-node.

[0051] When the total high-bandwidth operation time is less than the preset offset time, each storage device of the first node responds to each resource request obtained by the first node according to the first preset bandwidth, wherein the first preset bandwidth is any bandwidth value within the preset bandwidth range.

[0052] Specifically, the operating bandwidth information of each communication port is obtained. Since each communication port is mapped to a virtual child node, the operating bandwidth information of the communication port is the operating bandwidth information of the virtual child node mapped to that communication port. The operating bandwidth information includes high bandwidth runtime, which is the cumulative runtime of the virtual child node whose operating bandwidth is within a preset bandwidth range. The upper limit of the preset bandwidth range is the maximum allocated bandwidth of the virtual child node. That is, the preset bandwidth range is used to indicate the operating bandwidth close to the maximum allocated bandwidth of the virtual child node. For example, if the maximum allocated bandwidth of the virtual child node is 100G, and the preset bandwidth range is 90~100G, the virtual child node is considered to be operating at high bandwidth when its operating bandwidth is within the preset bandwidth range, and the duration of the virtual child node operating at high bandwidth is accumulated as the high bandwidth runtime.

[0053] Because the common IDC bandwidth billing rule used by operators is the 95 billing rule, which means that every 5 minutes of average bandwidth is counted as 1 billing point, there are 12 billing points per hour, 288 billing points per day, and a total of 8640 billing points in a 30-day month. The 433rd point is used as the billing bandwidth for the month, where 433 = 8640 * 0.05 + 1. This means that 5% of the billing points can be waived, which translates to 36 hours. If the month has 28 or 31 days, the calculation method remains the same, only the total number of points for the month changes, and the number of billing points waived changes as well. There is also a minimum guarantee payment rule, which means that regardless of bandwidth usage, at least 40% of the bandwidth cost must be paid to the operator. For a node with a maximum allocated bandwidth of 100G, the minimum guarantee payment is 40G. According to the 95% billing rule, the optimal CDN node utilization model is based on a 30-day month. For 36 hours, the node's bandwidth is maximized, and for the remaining time, it operates at a guaranteed 40% bandwidth. The final billed bandwidth is the guaranteed bandwidth. For example, a 100G node with a 40% guaranteed bandwidth, operating at over 90G for 36 hours and then at the guaranteed 40G bandwidth for the remaining time, will ultimately be billed to the operator for 40G. In other words, the guaranteed bandwidth is the product of the node's maximum allocated bandwidth and the guaranteed bandwidth. By rationally utilizing node reduction rules, the cost impact of sudden business surges can be mitigated, reducing CDN operating costs.

[0054] Assuming there are three virtual child nodes, each with a monthly (30-day) billing reduction period of 36 hours, and since different virtual child nodes operate at different times during peak hours (i.e., staggered operation), the total billing reduction period that the three virtual child nodes can offset is 108 hours. This 108 hours is considered the preset offsetting period for billing reduction. The total high-bandwidth operating time of the merged node is determined based on the sum of the high-bandwidth operating times of each virtual child node. This total high-bandwidth operating time is then compared with the preset offsetting period to determine if there are any remaining hours. If the total high-bandwidth operation time is less than the preset offset time, it means there is still a remaining billing reduction period. In this case, each storage device of the first node can respond to resource requests according to the first preset bandwidth. The first preset bandwidth is the maximum allocated bandwidth of the virtual child node. When the maximum allocated bandwidth of the virtual child node is 100G, each storage device of the first node can run at 100G bandwidth to achieve high-bandwidth operation. This improves the response speed of resource requests without increasing bandwidth costs, thereby optimizing the user experience on the client 110 side.

[0055] In one embodiment, the operating bandwidth information further includes the current operating bandwidth. When the total high-bandwidth operating time is less than a preset offsetting time, the storage devices of the first node respond to the resource requests obtained by the first node according to the first preset bandwidth, including:

[0056] When the total high-bandwidth operation time is less than the preset offset time, and the number of virtual child nodes whose current operating bandwidth is within the preset bandwidth range is less than the preset number, the storage devices of the first node respond to the resource requests obtained by the first node according to the first preset bandwidth, wherein the preset number is less than the number of all virtual child nodes in the merged node.

[0057] Specifically, to ensure that different virtual sub-nodes operate at high bandwidth during off-peak hours, it is necessary not only to ensure that there is remaining available billing exemption time (i.e., to ensure that the total high bandwidth operation time is less than the preset offset time), but also to ensure that the number of virtual sub-nodes whose current operating bandwidth is within the preset bandwidth range is less than the preset number, and the preset number is less than the total number of virtual sub-nodes in the merged node. In other words, it is necessary to ensure that all virtual sub-nodes in the merged node are not simultaneously operating at high bandwidth. Only then can the storage devices of the first node operate according to the first preset bandwidth, further ensuring that the virtual sub-nodes operate at high bandwidth during off-peak hours under the billing exemption.

[0058] In one embodiment, after determining the total high-bandwidth runtime of the merged node based on the sum of the high-bandwidth runtimes of each virtual child node, the method further includes:

[0059] When the total high-bandwidth operation time is equal to or greater than the preset hedging time, and / or the number of virtual child nodes whose current operating bandwidth is within the preset bandwidth range is greater than or equal to the preset number, the storage devices of the first node respond to the resource requests obtained by the first node according to the guaranteed minimum billing bandwidth, wherein the guaranteed minimum billing bandwidth is less than the lower limit of the preset bandwidth range threshold.

[0060] Specifically, if the total high-bandwidth operation time is equal to or greater than the preset offsetting time, it means that the billing exemption time for the merged node has been used up, and all virtual child nodes need to operate at the guaranteed minimum billing bandwidth for the remaining time. Alternatively, if the number of virtual child nodes whose current operating bandwidth is within the preset bandwidth range is greater than or equal to the preset number, it means that a large number of virtual child nodes are simultaneously operating at high bandwidth. To achieve peak-shaving operation, the storage devices of the first node will operate at the guaranteed minimum billing bandwidth. If at least one of the above situations occurs, the storage devices of the first node need to operate at the guaranteed minimum billing bandwidth to save bandwidth costs.

[0061] Figure 5 This is a flowchart illustrating a data processing method in one embodiment. It should be understood that, although... Figure 5 The steps in the flowchart are shown sequentially as indicated by the arrows, but these steps are not necessarily executed in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order in which these steps are executed, and they can be performed in other orders. Figure 5 At least some of the steps in the process may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these sub-steps or stages is not necessarily sequential, but can be executed in turn or alternately with other steps or at least some of the sub-steps or stages of other steps.

[0062] In one embodiment, such as Figure 6 As shown, a data processing apparatus is provided, comprising:

[0063] The response module 310 is used to respond to each resource request obtained by the first node by utilizing each storage device of the first node when the first node in the merging node obtains multiple resource requests through the target communication port, wherein the first node is any virtual child node in the merging node.

[0064] The query module 320 is used to query the target resource in each storage device of the second node when the target resource requested by the target resource request is not found in each storage device of the first node, wherein the second node is a virtual child node in the merging node that is different from the first node, and the target resource request is any resource request obtained by the first node.

[0065] The feedback module 330 is used to, when the target resource is found in the storage device of the second node, send the target resource obtained from the storage device of the second node back to the client 110 corresponding to the target resource request through the target communication port.

[0066] In one embodiment, the response module 310 is further configured to:

[0067] The system receives resource requests that match the domain name addresses of each communication port through multiple different communication ports.

[0068] Multiple resource requests received through all communication ports are evenly distributed to the load balancing devices of each virtual child node within the merged node, wherein the number of load balancing devices for each virtual child node is the same.

[0069] In one embodiment, the response module 310 is further configured to:

[0070] When the load balancing device of the first node in the merged node obtains multiple resource requests through the target communication port, it distributes each resource request obtained by the load balancing device of the first node equally to each storage device in the first node.

[0071] The resource requests allocated to each storage device are responded to using the storage devices within the first node.

[0072] In one embodiment, the response module 310 is further configured to:

[0073] Obtain the operating bandwidth information of each virtual sub-node within the merged node, wherein the operating bandwidth information includes high bandwidth runtime, which is the cumulative runtime of the virtual sub-node's operating bandwidth within a preset bandwidth range, and the high bandwidth runtime of each virtual sub-node in the merged node is different;

[0074] The total high-bandwidth runtime of the merged node is determined by summing the high-bandwidth runtimes of each virtual sub-node.

[0075] When the total high-bandwidth operation time is less than the preset offset time, each storage device of the first node responds to each resource request obtained by the first node according to the first preset bandwidth, wherein the first preset bandwidth is any bandwidth value within the preset bandwidth range.

[0076] In one embodiment, the operating bandwidth information further includes the current operating bandwidth, and the response module 310 is further configured to:

[0077] When the total high-bandwidth operation time is less than the preset offset time, and the number of virtual child nodes whose current operating bandwidth is within the preset bandwidth range is less than the preset number, the storage devices of the first node respond to the resource requests obtained by the first node according to the first preset bandwidth, wherein the preset number is less than the number of all virtual child nodes in the merged node.

[0078] In one embodiment, the response module 310 is further configured to:

[0079] When the total high-bandwidth operation time is equal to or greater than the preset hedging time, and / or the number of virtual child nodes whose current operating bandwidth is within the preset bandwidth range is greater than or equal to the preset number, the storage devices of the first node respond to the resource requests obtained by the first node according to the guaranteed minimum billing bandwidth, wherein the guaranteed minimum billing bandwidth is less than the lower limit of the preset bandwidth range threshold.

[0080] In one embodiment, the sum of the constituent devices in a preset number of virtual child nodes within the merged node is a first number. When each virtual child node within the merged node is split into independent nodes, the sum of the constituent devices in a preset number of independent nodes is a second number, and the first number is less than the second number.

[0081] like Figure 7 As shown, this application provides a computer device including a processor 711, a communication interface 712, a memory 713, and a communication bus 714, wherein the processor 711, the communication interface 712, and the memory 713 communicate with each other through the communication bus 714.

[0082] Memory 713 is used to store computer programs;

[0083] When the processor 711 executes the program stored in the memory 713, it implements the data processing method provided in any of the foregoing method embodiments.

[0084] Those skilled in the art will understand that Figure 7The 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.

[0085] In one embodiment, the data processing apparatus provided in this application can be implemented as a computer program, and the computer program can be implemented as follows: Figure 7 It runs on the computer device shown. The computer device's memory can store the various program modules that make up the data processing device, for example, Figure 6 The response module 310, query module 320, and feedback module 330 are shown. The computer program comprised of these modules causes the processor to execute the data processing methods of the various embodiments of this application described in this specification.

[0086] Figure 7 The computer device shown can be used as follows Figure 6 In the data processing device shown, the response module 310 executes the following: When the first node in the merging node obtains multiple resource requests through the target communication port, it utilizes each storage device of the first node to respond to each resource request obtained by the first node, wherein the first node is any virtual child node in the merging node. The computer device can execute the following: If the target resource requested by the target resource request is not found in the storage devices of the first node, the computer device can execute the following: If the target resource is not found in the storage devices of the first node, the computer device can execute the following: The computer device can execute the following: If the target resource is found in the storage devices of the second node, the computer device can execute the following: When the target resource is found in the storage devices of the second node, the computer device can execute the following: If the target resource is found in the storage devices of the second node, the computer device can execute the following: The ...

[0087] This application also provides a computer-readable storage medium storing a computer program thereon, which, when executed by a processor, implements the data processing method provided in any of the foregoing method embodiments.

[0088] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs.

[0089] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented using software plus a general-purpose hardware platform, or of course, using hardware. Based on this understanding, the above technical solutions, in essence or the parts that contribute to the related technology, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the data processing methods described in various embodiments or some parts of embodiments.

[0090] It should be understood that the terminology used herein is for the purpose of describing particular exemplary embodiments only and is not intended to be limiting. Unless the context clearly indicates otherwise, the singular forms “a,” “an,” and “described” as used herein may also mean including the plural forms. The terms “comprising,” “including,” “containing,” and “having” are inclusive and therefore indicate the presence of the stated features, steps, operations, elements, and / or components, but do not exclude the presence or addition of one or more other features, steps, operations, elements, components, and / or combinations thereof. The method steps, processes, and operations described herein are not construed as requiring them to be performed in a particular order described or illustrated unless the order of performance is explicitly indicated. It should also be understood that alternatives or substitutions may be used.

[0091] The above description is merely a specific embodiment of the present invention, enabling those skilled in the art to understand or implement the invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the invention. Therefore, the present invention is not to be limited to the embodiments shown herein, but is to be accorded the widest scope consistent with the principles and novel features claimed herein.

Claims

1. A data processing method, characterized by, The method comprises: When the first node in the merging node acquires multiple resource requests through a target communication port, each storage device of the first node is used to respond to each resource request acquired by the first node, wherein the first node is any virtual sub-node in the merging node; In the case that the target resource requested by the target resource request is not queried in each storage device of the first node, the target resource is queried in each storage device of a second node, wherein the second node is a virtual sub-node in the merging node different from the first node, and the target resource request is any one of the resource requests acquired by the first node; When the target resource is queried in the storage device of the second node, the target resource acquired from the storage device of the second node is fed back to the client corresponding to the target resource request through the target communication port.

2. The data processing method according to claim 1, characterized in that, Before the first node in the merging node acquires multiple resource requests through a target communication port, and each storage device of the first node is used to respond to each resource request acquired by the first node, the method further comprises: Receiving multiple resource requests matched with the domain name addresses of each communication port through multiple different communication ports; The multiple resource requests received through all communication ports are evenly distributed to the load balancing devices of each virtual sub-node in the merging node, wherein the number of load balancing devices of each virtual sub-node is the same.

3. The data processing method of claim 1, wherein, When the first node in the merging node acquires multiple resource requests through a target communication port, each storage device of the first node is used to respond to each resource request acquired by the first node, comprising: When the load balancing device of the first node in the merging node acquires multiple resource requests through a target communication port, each resource request acquired by the load balancing device of the first node is evenly distributed to each storage device in the first node; Each storage device in the first node is used to respond to the resource request distributed to each storage device.

4. The data processing method of claim 1, wherein, Each storage device of the first node is used to respond to each resource request acquired by the first node, comprising: Acquiring the running bandwidth information of each virtual sub-node in the merging node, wherein the running bandwidth information comprises a high bandwidth running time length, the high bandwidth running time length is the cumulative running time length when the running bandwidth of the virtual sub-node is within a preset bandwidth range, and the high bandwidth running time periods of each virtual sub-node in the merging node are different; According to the sum of the high bandwidth running time lengths of each virtual sub-node, the total high bandwidth running time length of the merging node is determined; When the total high bandwidth running time length is less than a preset hedging time length, each storage device of the first node is used to respond to each resource request acquired by the first node according to a first preset bandwidth, wherein the first preset bandwidth is any bandwidth value within the preset bandwidth range.

5. The data processing method according to claim 4, characterized in that, The running bandwidth information further comprises a current running bandwidth, and when the total high-bandwidth running time is less than a preset hedging time, each storage device of the first node responds to each resource request obtained by the first node according to a first preset bandwidth, comprising: When the total high-bandwidth running time is less than a preset hedging time, and the number of virtual sub-nodes with a current running bandwidth within the preset bandwidth range is less than a preset number, each storage device of the first node responds to each resource request obtained by the first node according to a first preset bandwidth, wherein the preset number is less than the number of all virtual sub-nodes in the merged node.

6. The data processing method according to claim 4, characterized in that, After determining the total high-bandwidth running time of the merged node according to the sum of the high-bandwidth running times of each virtual sub-node, the method further comprises: When the total high-bandwidth running time is equal to or greater than a preset hedging time, and / or the number of virtual sub-nodes with a current running bandwidth within the preset bandwidth range is greater than or equal to a preset number, each storage device of the first node responds to each resource request obtained by the first node according to a guaranteed billing bandwidth, wherein the guaranteed billing bandwidth is less than the threshold lower limit of the preset bandwidth range.

7. The data processing method of claim 1, wherein, The sum of the constituent devices in the preset number of virtual sub-nodes in the merged node is a first number, and when each virtual sub-node in the merged node is split as an independent node, the sum of the constituent devices in the preset number of independent nodes is a second number, and the first number is less than the second number.

8. A data processing apparatus, characterized by, The apparatus comprises: a response module configured to, when a first node in a merged node obtains a plurality of resource requests through a target communication port, respond to each resource request obtained by the first node using each storage device of the first node, wherein the first node is any virtual sub-node in the merged node; a query module configured to, when the target resource requested by a target resource request is not queried in each storage device of the first node, query the target resource in each storage device of a second node, wherein the second node is a virtual sub-node in the merged node different from the first node, and the target resource request is any one of the resource requests obtained by the first node; a feedback module configured to, when the target resource is queried in the storage device of the second node, feed back the target resource obtained from the storage device of the second node to a client corresponding to the target resource request through the target communication port.

9. A computer device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, The processor executes the computer program to implement the data processing method of any one of claims 1 to 7.

10. A computer-readable storage medium having stored thereon a computer program, characterized in that, The computer program is executed by the processor to implement the data processing method of any one of claims 1 to 7.

Images