Node resource refresh methods, devices, equipment and computer program products

Abstract

This application relates to the field of communications, providing a node resource refresh method, apparatus, device, and computer program product. The node resource refresh method includes: parsing the resource information to be refreshed to obtain domain name configuration information; obtaining node group information corresponding to each domain name in the domain name configuration information; determining a set of nodes to be refreshed based on the domain name configuration information and the node group information; constructing a node tree based on the set of nodes to be refreshed; and sequentially refreshing the resources corresponding to each node in the node tree based on the resource information to be refreshed. This application reduces invalid refresh operations for useless nodes within node groups, avoids missed refreshes and duplicate refreshes caused by node group adjustments, and improves the refresh efficiency of the CDN network.

Description

Technical Field

[0001] This application relates to the field of communications, specifically to a node resource refresh method, apparatus, device, and computer program product. Background Technology

[0002] In CDN (Content Delivery Network) operation, operations personnel typically maintain a resource mapping table that maps domain name resources to distributed edge nodes. They categorize edge nodes into groups based on node level, node region, and business scope. Each domain name configuration corresponds to a node group. When the CDN receives a user's refresh request, it parses the domain name information in the request and uses this information to retrieve the corresponding domain name's configured node group information and the edge node information within that group. The CDN then converts the user's refresh request into refresh commands that it can recognize and sequentially distributes these commands to the corresponding edge node hosts to refresh the resources.

[0003] When there are many edge nodes and many node grouping levels, the operation and maintenance team needs to spend a lot of effort maintaining the relationship information between each node group and between groups and nodes. When edge nodes migrate between groups or the node hierarchy is adjusted, problems such as untimely or missing updates of group nodes can easily occur, leading to missed or repeated updates.

[0004] Furthermore, CDN exposes edge nodes to external customers through a CDN scheduling system. When configuring the CDN scheduling system, not all nodes in the node group will provide services. When the target network reads a user's refresh request to obtain the node group configuration for that domain name, it will also obtain a large number of useless nodes to be refreshed, resulting in a large number of invalid refresh commands, which affects the refresh quality and efficiency of the CDN network. Summary of the Invention

[0005] This application provides a node resource refresh method, apparatus, device, and computer program product to solve the technical problems of low resource refresh efficiency and inaccurate refresh of existing CDN edge nodes.

[0006] In a first aspect, embodiments of this application provide a node resource refresh method, including:

[0007] The domain name configuration information is obtained by parsing the resource information to be refreshed, and the node grouping information corresponding to each domain name in the domain name configuration information is obtained.

[0008] Based on the domain name configuration information and the node grouping information, determine the set of nodes to be refreshed;

[0009] Construct a node tree based on the set of nodes to be refreshed;

[0010] Based on the resource information to be refreshed, the resources corresponding to each node in the node tree are refreshed sequentially.

[0011] In one embodiment, resolving the resource information to be refreshed to obtain the domain name configuration information includes:

[0012] Receive a resource refresh request and read the resource information to be refreshed from the resource refresh request;

[0013] The domain name configuration information is obtained by parsing the resource information to be refreshed.

[0014] In one embodiment, determining the set of nodes to be refreshed based on the domain name configuration information and the node grouping information includes:

[0015] Obtain the node information in the scheduling configuration of each domain name based on the domain name configuration information;

[0016] Based on the node grouping information and the node information in the scheduling configuration, the set of nodes to be refreshed is determined.

[0017] In one embodiment, determining the set of nodes to be refreshed based on the node grouping information and the node information in the scheduling configuration includes:

[0018] The first set of nodes in the scheduling configuration is determined based on the node information in the scheduling configuration;

[0019] Determine the second node set based on the node grouping information;

[0020] The intersection of the first set of nodes and the second set is determined as the set of nodes to be refreshed.

[0021] In one embodiment, constructing a node tree based on the set of nodes to be refreshed includes:

[0022] Based on the preset node region communication cost and the scheduling region information in the scheduling configuration, a weighted undirected graph is constructed.

[0023] Construct a node tree based on the set of nodes to be refreshed and the weighted undirected graph.

[0024] In one embodiment, sequentially refreshing the resources corresponding to each node in the node tree based on the resource information to be refreshed includes:

[0025] The resource refresh request is sent to the node tree, and the resources corresponding to each node in the node tree are refreshed in turn.

[0026] In one embodiment, sending the resource refresh request to the node tree and sequentially refreshing the resources corresponding to each node in the node tree includes:

[0027] The target refresh instruction, converted from the resource refresh request, is sequentially sent to each level of the node tree until the sent node is a leaf node of the node tree. The target refresh instruction carries node tree information with each level of the node as the parent node.

[0028] The resources corresponding to each layer node are refreshed based on the target refresh command.

[0029] Secondly, embodiments of this application provide a node resource refresh device, comprising:

[0030] The node grouping information acquisition module is used to parse the resource information to be refreshed to obtain the domain name configuration information, and to obtain the node grouping information corresponding to each domain name in the domain name configuration information;

[0031] The module for determining the set of nodes to be refreshed is used to determine the set of nodes to be refreshed based on the domain name configuration information and the node grouping information.

[0032] The node tree construction module is used to construct a node tree based on the set of nodes to be refreshed;

[0033] The node resource refresh module is used to refresh the resources corresponding to each node in the node tree sequentially based on the resource information to be refreshed.

[0034] Thirdly, embodiments of this application provide an apparatus including a processor and a memory storing a computer program, wherein the processor executes the computer program to implement the steps of the node resource refresh method described in the first aspect.

[0035] Fourthly, embodiments of this application provide a computer program product, including a computer program that, when executed by a processor, implements the steps of the node resource refresh method described in the first aspect.

[0036] The node resource refresh method, apparatus, device, and computer program product provided in this application first parses the resource information to be refreshed to obtain domain name configuration information, and then obtains the node group information corresponding to each domain name in the domain name configuration information. Then, based on the domain name configuration information and the node group information, a set of nodes to be refreshed is determined. A node tree for refresh operations is constructed using the set of nodes to be refreshed, and the resources corresponding to each node in the node tree are refreshed sequentially based on the resource information to be refreshed. This reduces invalid refresh operations on useless nodes within a group, avoids missed refreshes and duplicate refreshes caused by node group adjustments, and improves the refresh efficiency of the CDN network. Attached Figure Description

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

[0038] Figure 1 This is one of the flowcharts illustrating the node resource refresh method provided in the embodiments of this application;

[0039] Figure 2 This is a second flowchart illustrating the node resource refresh method provided in this application embodiment;

[0040] Figure 3 This is the third flowchart illustrating the node resource refresh method provided in this application embodiment;

[0041] Figure 4 This is a schematic diagram of the node resource refresh device provided in the embodiments of this application;

[0042] Figure 5 This is a schematic diagram of the structure of the electronic device provided in the embodiments of this application. Detailed Implementation

[0043] To make the objectives, technical solutions, and advantages of this application clearer, the technical solutions of this application will be clearly and completely described below with reference to the accompanying drawings of the embodiments. 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.

[0044] Reference Figure 1 , Figure 1 This is one of the flowcharts illustrating the node resource refresh method in this application. The node resource refresh method provided in this application may include:

[0045] Step 100: Parse the resource information to be refreshed to obtain the domain name configuration information, and obtain the node grouping information corresponding to each domain name in the domain name configuration information;

[0046] Specifically, the node resource refresh method provided in this embodiment is applied to a CDN network. A CDN network is an intelligent virtual network built on top of existing networks. Relying on edge servers deployed in various locations, and through the load balancing, content distribution, and scheduling modules of a central platform, it allows users to obtain the content they need from the nearest location, reducing network congestion and improving the speed and hit rate of responding to user access. The key technologies of CDN mainly include content storage and distribution technologies. When the CDN network receives a user's resource refresh request, it reads the URL (uniform resource locator) information of the resource to be refreshed from the user's resource refresh request.

[0047] The URL information of the resource to be refreshed is parsed to obtain the domain name configuration information of the resource. A domain name is a string of names separated by dots, representing the name of a computer or group of computers on the internet, used to identify the computer during data transmission. Based on the explanation of domain names, the domain name configuration information can be understood as the domain names configured for each node in the CDN network. Based on the domain name configuration information, the grouping information of the nodes corresponding to the domain name configuration is obtained.

[0048] Step 200: Based on the domain name configuration information and the node grouping information, determine the set of nodes to be refreshed;

[0049] Specifically, as described in the background section, operations and maintenance personnel categorize edge nodes into groups based on information such as node level, node region, and business scope. After obtaining the node grouping information configured for each domain name, the node information in the scheduling configuration of each domain name is obtained from the CDN scheduling system according to the domain name configuration information. The intersection between the node set in the scheduling configuration of each domain name and the node set in the node grouping information corresponding to each domain name is taken as the total set of nodes to be refreshed, which is the set of nodes to be refreshed in this embodiment.

[0050] Step 300: Construct a node tree based on the set of nodes to be refreshed;

[0051] After obtaining the set of nodes to be refreshed, a weighted undirected graph is constructed based on the scheduling region information in the scheduling configuration of each domain name, the communication cost between node regions in the CDN, and the total set of nodes to be refreshed. The most basic graph is usually defined as an undirected graph, as opposed to a directed graph. The difference between undirected and directed graphs is that edges in a directed graph have direction, while edges in an undirected graph do not. The weight of an edge (or its value, cost, and length, etc.) is a value corresponding to each edge in the graph. For example, when the points in the graph represent physical locations, the weight of the edge between two points can be set as the driving distance in a road network.

[0052] Based on the set of nodes to be refreshed for each domain and the weighted undirected graph, construct the node tree for the refresh operation (i.e., the node tree in this example) as follows: Obtain the N highest-level nodes in the set of nodes to be refreshed as parent nodes. Based on the weight values ​​in the weighted undirected graph, partition the set of nodes to be refreshed according to K-nearest neighbors (the idea of ​​the K-nearest neighbor algorithm is: in the feature space, if the majority of the K nearest samples to a sample belong to a certain category, then the sample also belongs to that category). After removing the N parent nodes, divide the set of nodes to be refreshed into N subsets, which serve as the child node sets of these N parent nodes. Repeat the K-nearest neighbor partitioning operation for each child node set until there are no more nodes in the child node set, then stop partitioning. This completes the construction of a node tree that executes the refresh order, i.e., the node tree in this example.

[0053] Step 400: Based on the resource information to be refreshed, refresh the resources corresponding to each node in the node tree sequentially.

[0054] Specifically, the user's refresh request is converted into a refresh instruction that the CDN network can recognize. This refresh instruction is then sent to the first-level nodes in the node tree. Each refresh instruction carries node tree information with the refresh node (first-level node) as its parent node. The first-level nodes execute the refresh instructions, refreshing the resources corresponding to them. Next, the first-level nodes read the node tree information from the refresh instructions and then send the refresh instructions to the next level of child nodes (second-level nodes). Each refresh instruction carries the node tree information with the refresh node (second-level node) as its parent node. The second-level nodes execute the refresh instructions, refreshing the resources corresponding to them. This process is repeated until the node sending the refresh instruction is a leaf node in the node tree, and the refresh instruction no longer contains node tree information to be refreshed, thus completing the refresh of resources corresponding to each node in the node tree.

[0055] In this embodiment, firstly, the domain name configuration information is obtained by parsing the resource information to be refreshed, and then the node grouping information corresponding to each domain name in the domain name configuration information is obtained. Then, based on the domain name configuration information and the node grouping information, a set of nodes to be refreshed is determined. A node tree for the refresh operation is constructed using the set of nodes to be refreshed, and the resources corresponding to each node in the node tree are refreshed sequentially based on the resource information to be refreshed. This reduces invalid refresh operations on useless nodes within a group, avoids missed refreshes and duplicate refreshes caused by node group adjustments, and improves the refresh efficiency of the CDN network.

[0056] In one embodiment, the node resource refresh method provided in this application may further include:

[0057] Step 110: Receive a resource refresh request and read the resource information to be refreshed from the resource refresh request;

[0058] Step 120: The resource information to be refreshed is parsed to obtain the domain name configuration information.

[0059] Specifically, such as Figure 2 As shown, when the CDN network receives a user's resource refresh request, it reads the URL information of the resource to be refreshed from the request. The URL information is then parsed to obtain the domain name configuration information of the resource to be refreshed.

[0060] This embodiment obtains the domain name configuration information by reading and parsing the resource information to be refreshed.

[0061] In one embodiment, the node resource refresh method provided in this application may further include:

[0062] Step 210: Obtain node information in the scheduling configuration of each domain name based on the domain name configuration information;

[0063] Step 220: Based on the node grouping information and the node information in the scheduling configuration, determine the set of nodes to be refreshed.

[0064] Reference Figure 3 , Figure 3 This is a second flowchart illustrating the node resource refresh method in this application embodiment. The node resource refresh method provided in this application embodiment may further include:

[0065] Step 221: Determine the first set of nodes in the scheduling configuration based on the node information in the scheduling configuration;

[0066] Step 222: Determine the second node set based on the node grouping information;

[0067] Step 223: Determine that the intersection of the first set of nodes and the second set is the set of nodes to be refreshed.

[0068] Specifically, such as Figure 2 As shown, after obtaining the grouping information of the nodes configured for the corresponding domain name, the domain name scheduling configuration is further obtained. The intersection between the nodes in the grouping information and the nodes in the domain name scheduling configuration is taken, and the intersection is used as the set of nodes to be refreshed. This includes: obtaining the node information in the scheduling configuration of each domain name based on the domain name configuration information; determining the set of nodes to be refreshed based on the node grouping information and the node information in the scheduling configuration. Determining the set of nodes to be refreshed based on the node grouping information and the node information in the scheduling configuration includes: determining the first set of nodes in the scheduling configuration (i.e., the nodes in the scheduling configuration) based on the node information in the scheduling configuration; determining the second set of nodes (i.e., the nodes in the node grouping information) based on the node grouping information; and determining the intersection of the first set of nodes and the second set as the set of nodes to be refreshed.

[0069] This embodiment obtains the set of CDN nodes in the schedule from the CDN scheduling system and takes the intersection of the set of CDN nodes in the node group as the set of nodes to be refreshed for the domain name. This replaces the direct use of manually maintained node group configurations as nodes to be refreshed, reducing the operational risks of missed refreshes and duplicate refreshes caused by node group migration and group adjustment, and greatly reducing the refresh operations of useless group nodes.

[0070] In one embodiment, the node resource refresh method provided in this application may further include:

[0071] Step 310: Construct a weighted undirected graph based on the preset node region communication cost and the scheduling region information in the scheduling configuration;

[0072] Step 320: Construct a node tree based on the set of nodes to be refreshed and the weighted undirected graph.

[0073] Specifically, after obtaining the set of nodes to be refreshed, a weighted undirected graph is constructed based on the scheduling region information in the scheduling configuration of each domain name and the communication cost between the regions of each node. The weight of an edge in the graph is the value corresponding to each edge. Based on the set of nodes to be refreshed and the weighted undirected graph for each domain name, the refresh node tree is constructed according to the following steps: 1. Obtain the N highest-level nodes in the set of nodes to be refreshed as parent nodes. Based on the weight values ​​in the weighted undirected graph, divide the set of nodes to be refreshed according to the K nearest neighbors. After removing the N parent nodes, divide the set of nodes to be refreshed into N subsets, which are the child node sets of these N parent nodes. 2. Repeat the K nearest neighbor division operation for each child node set until there are no more nodes in the child node set, then stop the division. A node tree that executes the refresh order is constructed, which is the node tree in this example.

[0074] This embodiment constructs a node tree using a set of nodes to be refreshed and a weighted undirected graph.

[0075] In one embodiment, the node resource refresh method provided in this application may further include:

[0076] Step 410: Send the resource refresh request to the node tree, and refresh the resources corresponding to each node in the node tree in sequence.

[0077] The node resource refresh method provided in this application embodiment may further include:

[0078] Step 411: The target refresh instruction converted from the resource refresh request is sequentially sent to each layer of the node tree until the sent node is a leaf node of the node tree. The target refresh instruction carries the node tree information with each layer of nodes as the parent node.

[0079] Step 412: Refresh the resources corresponding to each layer node based on the target refresh instruction.

[0080] Specifically, the user's refresh request is converted into a refresh instruction. First, the refresh instruction is sent to the first-level nodes in the node tree. At this point, each refresh instruction carries the node tree information with the first-level node as its parent node. Then, the first-level nodes execute the refresh instruction, refreshing the resources corresponding to the first-level nodes, and the refresh of the first-level nodes is complete. The first-level nodes read the node tree information from the refresh instruction and then send the refresh instruction to the second-level nodes in the node tree. Each refresh instruction carries the node tree information with the second-level node as its parent node, and the second-level nodes execute the refresh instruction, refreshing the resources corresponding to the second-level nodes, and the refresh of the second-level nodes is complete. The above operation steps are repeated to refresh the resources of each level of the node tree in turn, until the node that sends the refresh instruction is a leaf node of the node tree, and the refresh instruction has no node tree information to be refreshed, thus completing the refresh of the resources corresponding to each node in the node tree.

[0081] This embodiment reduces the communication cost between the front-end and back-end systems and improves refresh efficiency by changing the original serial refresh from the front-end system to the back-end edge node system to a parallel refresh based on the node tree.

[0082] refer to Figure 4 , Figure 4 This is a schematic diagram of the node resource refresh device in the embodiments of this application. The node resource refresh device provided in the embodiments of this application is described below. The node resource refresh device described below and the node resource refresh method described above can be referred to in correspondence.

[0083] The node grouping information acquisition module 401 is used to parse the resource information to be refreshed to obtain the domain name configuration information and to obtain the node grouping information corresponding to each domain name in the domain name configuration information.

[0084] The node set to be refreshed determination module 402 is used to determine the node set to be refreshed based on the domain name configuration information and the node grouping information;

[0085] Node tree construction module 403 is used to construct a node tree based on the set of nodes to be refreshed;

[0086] The node resource refresh module 404 is used to refresh the resources corresponding to each node in the node tree sequentially based on the resource information to be refreshed.

[0087] Optionally, the node grouping information acquisition module includes:

[0088] The resource information refresh unit is used to receive a resource refresh request and read the resource information to be refreshed from the resource refresh request.

[0089] The resource information parsing unit is used to parse the resource information to be refreshed to obtain domain name configuration information.

[0090] Optionally, the module for determining the set of nodes to be refreshed includes:

[0091] A node information acquisition unit is used to acquire node information in the scheduling configuration of each domain name based on the domain name configuration information.

[0092] The node set to be refreshed determination unit is used to determine the node set to be refreshed based on the node grouping information and the node information in the scheduling configuration.

[0093] Optionally, the unit for determining the set of nodes to be refreshed includes:

[0094] The first node set determination unit is used to determine the first node set in the scheduling configuration based on the node information in the scheduling configuration;

[0095] The second node set determination unit is used to determine the second node set based on the node grouping information.

[0096] The intersection determination unit is used to determine that the intersection of the first set of nodes and the second set is the set of nodes to be refreshed.

[0097] Optionally, the node tree construction module includes:

[0098] The weighted undirected graph construction unit is used to construct a weighted undirected graph based on the preset node region communication cost and the scheduling region information in the scheduling configuration.

[0099] A node tree construction unit is used to construct a node tree based on the set of nodes to be refreshed and the weighted undirected graph.

[0100] Optionally, the node resource refresh module includes:

[0101] The node resource refresh unit is used to send the resource refresh request to the node tree and refresh the resources corresponding to each node in the node tree in sequence.

[0102] Optionally, the node resource refresh unit includes:

[0103] The refresh instruction issuing unit is used to sequentially issue the target refresh instruction obtained by converting the resource refresh request to each layer of the node tree until the issued node is a leaf node of the node tree. The target refresh instruction carries the node tree information with each layer of nodes as the parent node.

[0104] The resource refresh unit is used to refresh the resources corresponding to each layer node based on the target refresh instruction.

[0105] Figure 5 An example is a schematic diagram of the physical structure of a device, such as... Figure 5 As shown, the device may include a processor 510, a communication interface 520, a memory 530, and a communication bus 540, wherein the processor 510, the communication interface 520, and the memory 530 communicate with each other through the communication bus 540. The processor 510 can call the computer program in the memory 530 to execute the steps of the node resource refresh method.

[0106] Furthermore, the logical instructions in the aforementioned memory 530 can be implemented as software functional units and, when sold or used as independent products, can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0107] On the other hand, this application also provides a computer program product, which includes a computer program that can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can perform the steps of the node resource refresh method provided in the above embodiments.

[0108] 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. Those skilled in the art can understand and implement this without any creative effort.

[0109] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, 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., including several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the node resource refresh method described in various embodiments or some parts of embodiments.

[0110] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of this application, and are not intended to limit them. Although this application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of this application.

Claims

1. A method for refreshing node resources, characterized in that, include: The domain name configuration information is obtained by parsing the resource information to be refreshed, and the node grouping information corresponding to each domain name in the domain name configuration information is obtained. Based on the domain name configuration information and the node grouping information, determine the set of nodes to be refreshed; Construct a node tree based on the set of nodes to be refreshed; Based on the resource information to be refreshed, the resources corresponding to each node in the node tree are refreshed sequentially. The process of determining the set of nodes to be refreshed based on the domain name configuration information and the node grouping information includes: Obtain the node information in the scheduling configuration of each domain name based on the domain name configuration information; Based on the node grouping information and the node information in the scheduling configuration, determine the set of nodes to be refreshed; The step of determining the set of nodes to be refreshed based on the node grouping information and the node information in the scheduling configuration includes: The first set of nodes in the scheduling configuration is determined based on the node information in the scheduling configuration; Determine the second node set based on the node grouping information; The intersection of the first set of nodes and the second set of nodes is determined as the set of nodes to be refreshed.

2. The node resource refresh method according to claim 1, characterized in that, The domain name configuration information obtained by resolving the resource information to be refreshed includes: Receive a resource refresh request and read the resource information to be refreshed from the resource refresh request; The domain name configuration information is obtained by parsing the resource information to be refreshed.

3. The node resource refresh method according to claim 1, characterized in that, The process of constructing a node tree based on the set of nodes to be refreshed includes: Based on the preset node region communication cost and the scheduling region information in the scheduling configuration, a weighted undirected graph is constructed. Construct a node tree based on the set of nodes to be refreshed and the weighted undirected graph.

4. The node resource refresh method according to claim 2, characterized in that, The step of sequentially refreshing the resources corresponding to each node in the node tree based on the resource information to be refreshed includes: The resource refresh request is sent to the node tree, and the resources corresponding to each node in the node tree are refreshed in turn.

5. The node resource refresh method according to claim 4, characterized in that, The step of sending the resource refresh request to the node tree and sequentially refreshing the resources corresponding to each node in the node tree includes: The target refresh instruction, converted from the resource refresh request, is sequentially sent to each level of the node tree until the sent node is a leaf node of the node tree. The target refresh instruction carries node tree information with each level of the node as the parent node. The resources corresponding to each layer node are refreshed based on the target refresh command.

6. A node resource refresh device, characterized in that, include: The node grouping information acquisition module is used to parse the resource information to be refreshed to obtain the domain name configuration information, and to obtain the node grouping information corresponding to each domain name in the domain name configuration information; The module for determining the set of nodes to be refreshed is used to determine the set of nodes to be refreshed based on the domain name configuration information and the node grouping information. The node tree construction module is used to construct a node tree based on the set of nodes to be refreshed; The node resource refresh module is used to refresh the resources corresponding to each node in the node tree sequentially based on the resource information to be refreshed. The module for determining the set of nodes to be refreshed includes: a node information acquisition unit, used to acquire node information in the scheduling configuration of each domain name according to the domain name configuration information; and a node set determination unit, used to determine the set of nodes to be refreshed based on the node grouping information and the node information in the scheduling configuration. The node set determination unit includes: a first node set determination unit, used to determine a first node set in the scheduling configuration based on node information in the scheduling configuration; a second node set determination unit, used to determine a second node set based on node grouping information; and an intersection determination unit, used to determine that the intersection of the first node set and the second node set is the node set to be refreshed.

7. An electronic device comprising a processor and a memory storing a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the node resource refresh method according to any one of claims 1 to 5.

8. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by the processor, it implements the steps of the node resource refresh method according to any one of claims 1 to 5.

Images