CDN back-to-source scheduling method, device, equipment, and medium

Abstract

The present disclosure provides a CDN back-to-source scheduling method and device, equipment, and medium, the method comprising: receiving a back-to-source request sent by any node in a content distribution network when there is no resource accessed by a user request; determining the target back-to-source node of any node according to the back-to-source request and based on the scheduling indication information associated with the tree structure where the any node is located; wherein all nodes in the same tree structure have the same level in the content distribution network, the scheduling indication information indicates that there is a back-to-source node, and the level of the indicated back-to-source node in the content distribution network is higher than the level of all nodes in the tree structure in the content distribution network, and the target back-to-source node is a back-to-source node indicated in the scheduling indication information; sending the identifier of the target back-to-source node to any node, wherein the identifier of the target back-to-source node is used by any node to go back to the source to obtain the resource accessed by the user request. Through this method, the stability of back-to-source can be improved.

Description

Technical Field

[0001] The present disclosure relates to the field of computer technology, and in particular to a CDN back-to-source scheduling method, device, equipment, and medium. Background Art

[0002] Various factors such as company business changes, new business, and traffic control require frequent adjustments to layered back-to-source. Layered back-to-source refers to the process of returning a content delivery network (CDN) node to the next hop. In a CDN network, content is usually cached on multiple nodes to speed up user access and reduce pressure on the source station. When the content cache on a node expires or misses, the node will request content from other nodes. This process is called back-to-source. How to improve the stability of the CDN network during the back-to-source process is one of the technical problems that need to be solved in the existing technology. Summary of the invention

[0003] The embodiments of the present disclosure provide a CDN back-to-source scheduling method, device, equipment, and medium, which can improve the stability of back-to-source.

[0004] The technical solution of the embodiment of the present disclosure is implemented as follows:

[0005] The present disclosure provides a CDN back-to-source scheduling method, including:

[0006] Receiving a back-to-origin request sent by any node in the content distribution network when there is no resource requested by the user;

[0007] According to the back-to-source request, based on the scheduling indication information associated with the tree structure where the any node is located, determining a target back-to-source node for the any node; wherein all nodes in the same tree structure have the same level in the content distribution network, the scheduling indication information indicates a back-to-source node, and the level of the indicated back-to-source node in the content distribution network is higher than the levels of all nodes in the tree structure in the content distribution network, and the target back-to-source node is a back-to-source node indicated in the scheduling indication information;

[0008] The identifier of the target back-to-source node is sent to any one of the nodes, wherein the identifier of the target back-to-source node is used by any one of the nodes to perform back-to-source acquisition of the resource requested to be accessed by the user.

[0009] In some embodiments, determining the target back-to-source node of any node based on the scheduling indication information associated with the tree structure where any node is located includes:

[0010] Based on the tree structure where any node is located, querying in the tree depth direction from any node in sequence until a target node configured with the scheduling indication information is found and the query is stopped;

[0011] The target back-to-source node of any one of the nodes is determined based on the back-to-source node indicated in the scheduling indication information configured by the target node.

[0012] In some embodiments, the determining the target back-to-source node of any node based on the back-to-source node indicated in the scheduling indication information configured by the target node includes:

[0013] In a case where there is only one back-to-source node indicated in the scheduling indication information, determining the one back-to-source node as the target back-to-source node;

[0014] In the case that there are multiple back-to-source nodes indicated in the scheduling indication information, the target back-to-source node is determined based on the preset priorities and weights of the back-to-source nodes.

[0015] In some embodiments, when there are multiple return-to-source nodes indicated in the scheduling indication information, determining the target return-to-source node based on preset priorities and weights of the return-to-source nodes includes:

[0016] Based on the priority of each of the multiple back-to-source nodes, determine a candidate node from the multiple back-to-source nodes; wherein the priority of the candidate node is higher than the priority of other back-to-source nodes in the multiple back-to-source nodes;

[0017] When a candidate node is determined, the candidate node is determined as the target back-to-source node;

[0018] When multiple candidate nodes are determined, the candidate node with the highest weight is determined as the target back-to-source node.

[0019] In some embodiments, determining the target back-to-source node of any node based on the scheduling indication information associated with the tree structure where any node is located includes:

[0020] In a case where the back-to-source node indicated by the scheduling indication information associated with the tree structure where any node is located is a source station in the content distribution network, the source station is determined as a target back-to-source node for any node.

[0021] In some embodiments, the method further comprises:

[0022] When the target back-to-source node of any node is determined based on the scheduling indication information configured by the root node in the tree structure where any node is located, the determined target back-to-source node is configured as the back-to-source node of all nodes between any node and the root node in the tree structure.

[0023] In some embodiments, the method further comprises:

[0024] Before determining the target back-to-source node of any node based on the scheduling indication information associated with the tree structure where any node is located, confirm that the back-to-source acceleration function of the access domain name configuration associated with the back-to-source request is turned on.

[0025] The present disclosure provides a CDN back-to-source scheduling device, including:

[0026] A receiving module, configured to receive a back-to-source request sent by any node in the content distribution network when there is no resource accessed by the user request;

[0027] a determination module configured to determine, according to the return-to-source request and based on the scheduling indication information associated with the tree structure in which the any node is located, a target return-to-source node of the any node; wherein all nodes in the same tree structure have the same level in the content distribution network, the scheduling indication information indicates a return-to-source node, and the level of the indicated return-to-source node in the content distribution network is higher than the level of all nodes in the tree structure in the content distribution network, and the target return-to-source node is a return-to-source node indicated in the scheduling indication information;

[0028] The sending module is configured to send the identifier of the target back-to-source node to any one of the nodes, wherein the identifier of the target back-to-source node is used by any one of the nodes to perform back-to-source acquisition of the resource requested to be accessed by the user.

[0029] In some embodiments, the determination module is also configured to query in the tree depth direction starting from any node based on the tree structure where any node is located, and stop querying until the target node configured with the scheduling indication information is found; and determine the target return source node of any node based on the return source node indicated in the scheduling indication information configured with the target node.

[0030] In some embodiments, the determination module is further configured to, when there is only one return-to-source node indicated in the scheduling indication information, determine the one return-to-source node as the target return-to-source node; and, when there are multiple return-to-source nodes indicated by the scheduling indication information, determine the target return-to-source node based on preset priorities and weights of each return-to-source node.

[0031] In some embodiments, the determination module is further configured to determine a candidate node from the multiple back-to-source nodes based on the priority of each back-to-source node in the multiple back-to-source nodes; wherein the priority of the candidate node is higher than the priority of other back-to-source nodes in the multiple back-to-source nodes; when one candidate node is determined, the candidate node is determined as the target back-to-source node; when multiple candidate nodes are determined, the candidate node with the highest weight is determined as the target back-to-source node.

[0032] In some embodiments, the determination module is further configured to determine the source station as the target source node of any node when the source node indicated by the scheduling indication information associated with the tree structure where any node is located is the source station in the content distribution network.

[0033] In some embodiments, the apparatus further comprises:

[0034] The setting module is configured to, when a target return-to-source node of any node is determined based on the scheduling indication information configured by the root node in the tree structure where any node is located, configure the determined target return-to-source node as the return-to-source node of all nodes between any node and the root node in the tree structure.

[0035] In some embodiments, the apparatus further comprises:

[0036] The confirmation module is configured to confirm that the back-to-source acceleration function configured in the access domain name associated with the back-to-source request is turned on before determining the target back-to-source node of any node based on the scheduling indication information associated with the tree structure where any node is located.

[0037] The present disclosure provides a device, including:

[0038] A memory for storing executable instructions;

[0039] The processor is used to implement the method provided by the embodiment of the present disclosure when executing the executable instructions stored in the memory.

[0040] An embodiment of the present disclosure provides a computer-readable storage medium having a computer program or executable instructions stored thereon, which is used to cause a processor to execute and implement the method provided by the embodiment of the present disclosure.

[0041] An embodiment of the present disclosure provides a computer program product, including a computer program or instructions. When the computer program or instructions are executed by a processor, the method provided by the embodiment of the present disclosure is implemented.

[0042] The embodiments of the present disclosure have the following beneficial effects:

[0043] In the disclosed embodiment, since scheduling indication information is configured for the node, and the level of the target return-to-source node determined by the scheduling indication information in the CDN is higher than the levels of all nodes in the tree structure where the node is located in the CDN, when returning to the source, only a higher level of the CDN will be searched, and the same or lower levels will not be searched, thereby causing a loop and crash. In this way, the stability of the CDN network can be improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] Figure 1 A flow chart of a CDN back-to-source scheduling method provided in an embodiment of the present disclosure;

[0045] Figure 2 This is an example diagram of a tree structure in an embodiment of the present disclosure;

[0046] Figure 3 This is an example diagram of scheduling indication information in an embodiment of the present disclosure;

[0047] Figure 4 This is a diagram of a page configuration example in an embodiment of the present disclosure;

[0048] Figure 5 This is an example diagram of a return line in an embodiment of the present disclosure;

[0049] Figure 6 A CDN back-to-source scheduling device diagram is provided for an embodiment of the present disclosure;

[0050] Figure 7 A schematic diagram of a hardware entity of an electronic device in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0051] In order to make the objectives, technical solutions and advantages of the present disclosure clearer, the present disclosure will be further described in detail below in conjunction with the accompanying drawings. The described embodiments should not be regarded as limiting the present disclosure. All other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of the present disclosure.

[0052] In the following description, reference is made to “some embodiments”, which describe a subset of all possible embodiments, but it will be understood that “some embodiments” may be the same subset or different subsets of all possible embodiments and may be combined with each other without conflict.

[0053] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art of the present disclosure. The terms used herein are only for the purpose of describing the embodiments of the present disclosure and are not intended to limit the present disclosure.

[0054] In related technologies, when nodes go back to the source, they usually use the Domain Name System (DNS) to resolve the domain name, and then go back to the source through the resolved Internet Protocol Address (IP address). DNS resolution requires the configuration of the area so that the correct IP address can be resolved. However, if an area has two nodes at different levels, the configuration needs to be particularly careful. If the configuration is wrong and the next hop of the central node is specified as the address of the edge node, a loop will occur, which may cause a crash.

[0055] In this regard, the present disclosure provides a CDN back-to-source scheduling method. Figure 1 A flow chart of a CDN back-to-source scheduling method provided in an embodiment of the present disclosure is shown in FIG. Figure 1 As shown, the following steps are included:

[0056] S11, receiving a back-to-origin request sent by any node in the content distribution network when there is no resource requested to be accessed by the user;

[0057] S12. Determine, according to the back-to-source request, a target back-to-source node of any node based on the scheduling indication information associated with the tree structure in which any node is located; wherein all nodes in the same tree structure have the same level in the content distribution network, the scheduling indication information indicates a back-to-source node, and the level of the indicated back-to-source node in the content distribution network is higher than the levels of all nodes in the tree structure in the content distribution network, and the target back-to-source node is a back-to-source node indicated in the scheduling indication information;

[0058] S13: Send the identifier of the target back-to-source node to any one of the nodes, wherein the identifier of the target back-to-source node is used by any one of the nodes to perform back-to-source acquisition of the resource requested by the user.

[0059] In the disclosed embodiment, the CDN back-to-source scheduling method can be applied to the back-to-source server. The back-to-source server can refer to a server that can provide back-to-source services, that is, a server that can receive a back-to-source request sent by any node, determine the path to return to the source, and return to any node. Among them, any node can be an edge node, or a central node located between the edge node and the source station, etc. The edge node can refer to an edge server deployed in various places in the content distribution network, providing user access capabilities in the content distribution network; the source station is the data source of the CDN, that is, the top-level back-end server, and each computer room node must obtain data from the source station for user access and distribution. When a user requests to access a resource, the CDN will obtain data from the source station and cache it on multiple edge nodes around the world, thereby speeding up the loading speed of the content and reducing the load on the source station. However, if the edge node does not have the required resources, it needs to request resources from the central node or even the source station at the upper level step by step until the resource requested by the user can be returned. This process is called back-to-source.

[0060] In step S11, the back-to-source server will receive a back-to-source request sent by any node in the content distribution network when the resource accessed by the user request does not exist. The back-to-source request may carry the identifier of any node and the identifier of the resource accessed by the access request, so that the back-to-source server can return a path to obtain the resource to any node.

[0061] It should be noted that the edge node usually responds after receiving the user's access request. If the edge node does not cache the resource requested by the user, the edge node sends a back-to-source request to the back-to-source server to determine the target back-to-source node of the edge node. If the target back-to-source node still does not cache the resource requested by the user, the target back-to-source node continues to send a back-to-source request to the back-to-source server until the target back-to-source node that stores the resource requested by the user is finally found.

[0062] In step S12, the back-to-source server determines the target back-to-source node of any node according to the back-to-source request and based on the back-to-source node indicated in the scheduling indication information associated with the tree structure where any node is located. The back-to-source node indicated in the scheduling indication information has a higher level in the content distribution network than the level of all nodes in the tree structure in the content distribution network. Exemplarily, each node in the tree structure may be an edge node located at the edge layer of the CDN, and the back-to-source node indicated in the scheduling indication information may be a center node located at the center layer of the CDN.

[0063] In the disclosed embodiment, the scheduling indication information associated with the tree structure may be one scheduling indication information associated with the complete tree, or may be multiple scheduling indication information associated with different tree nodes in the tree structure. One scheduling indication information may include the identifiers of one or more back-to-source nodes.

[0064] In some embodiments, if the complete tree is associated with only one piece of scheduling indication information, the target back-to-source node may be determined based on one or more back-to-source nodes in the one piece of scheduling indication information.

[0065] In other embodiments, if there are multiple nodes in the tree structure that are respectively associated with scheduling indication information, the scheduling indication information of the target node can be determined based on the depth of the node in the tree structure, and the target return source node can be further determined; it can also be determined by combining the actual access conditions of each return source node in multiple scheduling indication information, for example, the return source node with the least current access volume is determined as the target return source node.

[0066] In the disclosed embodiment, the tree structure can be a structure based on regional division, or it can be any customized tree structure. The tree structure may contain elements such as ID, Name, IsLeaf, LEVEL, and ParentId, among which ID is a database auto-increment field used to associate data; Name is the node name used for display; IsLeaf is used to mark whether it is a leaf node. If it is a leaf node, a cluster can be mounted on the node. LEVEL is used to indicate the level of the tree structure in the CDN. Each node in the tree structure has a level, and the level of each node is consistent with the level of the tree structure; ParendId is used to mark the ID of the parent.

[0067] It should be noted that, in the embodiment of the present disclosure, each node in the tree structure can mount a cluster, the cluster can be a collection of multiple cache devices, and the tree node can represent clusters of multiple regions.

[0068] Figure 2 is an example diagram of a tree structure in an embodiment of the present disclosure, such as Figure 2 As shown, in the part shown in 21, level1 is the root node, China Telecom, Radio and Television, Great Wall Broadband, etc. are second-level nodes, North and South under China Telecom are third-level nodes, and the ParendId of North and South points to Telecom. The Guangzhou region under the South is a fourth-level node, and Guangdong under the Guangzhou region is a fifth-level node. Guangdong is also a leaf node. In the part shown in 22, the South and the North have their own ID numbers, and both are intermediate nodes, not leaf nodes. The levels of the South and the North are the same as the levels of the tree structure, both are LEVEL1. For example, LEVEL1 corresponds to the edge layer in the CDN. It should be noted that in the embodiments of the present disclosure, the level of the nodes inside the tree structure and the level of the nodes in the tree structure in the CDN network are different concepts.

[0069] by Figure 2For example, assuming that any node is "South", if "South" in the tree structure is associated with scheduling indication information, and the scheduling indication information indicates the cluster address "1.1.1.1" in LEVEL2, then the cluster address "1.1.1.1" in LEVEL2 can be determined as the target back-to-source node, where LEVEL2 can correspond to the central layer in the CDN.

[0070] It should be noted that the embodiments of the present disclosure only take any node as an edge node, based on the edge layer and the center layer as examples. In addition, if any node is a center node of the center layer, the back-to-source node can refer to the source station. Moreover, when the CDN is divided into more layers, scheduling between other divided layers is also possible, but the level of the back-to-source node indicated by the scheduling indication information in the content distribution network must be higher than the level of all nodes in the tree structure in the content distribution network.

[0071] In the embodiment of the present disclosure, the scheduling indication information may include the identifier of the return-to-source node, and may also include additional information of the return-to-source node, such as weight, level, resource retention time (Time To Live, TTL), etc., which is not limited in the embodiment of the present disclosure.

[0072] In the disclosed embodiment, after determining the target retrieval node of any node, the retrieval server sends the identifier of the target retrieval node to any node, so that any node performs retrieval to obtain the resource requested by the user.

[0073] It can be understood that in the embodiment of the present disclosure, since scheduling indication information is configured for the node, and the level of the target return-to-source node determined by the scheduling indication information in the CDN is higher than the levels of all nodes in the tree structure in the CDN, then when returning to the source, only a higher level of the CDN will be searched, and the same or lower levels will not be searched, resulting in a loop and crash. In this way, the stability of the CDN network can be improved.

[0074] In some embodiments, determining the target back-to-source node of any node based on the scheduling indication information associated with the tree structure where any node is located includes:

[0075] Based on the tree structure where any node is located, querying in the tree depth direction from any node in sequence until a target node configured with the scheduling indication information is found and the query is stopped;

[0076] The target back-to-source node of any one of the nodes is determined based on the back-to-source node indicated in the scheduling indication information configured by the target node.

[0077] In the disclosed embodiment, the scheduling indication information is configured in advance, but not all nodes may be configured, so the source server can start from any node and query in the direction of the tree root in sequence until the target node configured with the scheduling indication information is found and the query stops. It should be noted that starting from any node and querying in the direction of the tree root in sequence includes querying the same level nodes of any node and querying the nodes of all levels from any node to the tree root.

[0078] For example, Figure 2 In the tree structure shown, assuming that any node is "South", if the query starts from "South" along the root of the tree and the scheduling indication information associated with "China Telecom" is found, the back-to-source server stops the query and determines the target back-to-source node based on the back-to-source node indicated by the scheduling indication information associated with "China Telecom".

[0079] It can be understood that the embodiment of the present disclosure searches along the tree root direction until a target node configured with scheduling indication information is found and then stops searching. This is simple and does not require consuming much memory of the source server.

[0080] In some embodiments, the determining the target back-to-source node of any node based on the back-to-source node indicated in the scheduling indication information configured by the target node includes:

[0081] In a case where there is only one back-to-source node indicated in the scheduling indication information, determining the one back-to-source node as the target back-to-source node;

[0082] In the case that there are multiple back-to-source nodes indicated in the scheduling indication information, the target back-to-source node is determined based on the preset priorities and weights of the back-to-source nodes.

[0083] In an embodiment of the present disclosure, one or more return-to-source nodes may be indicated in the scheduling indication information. When one return-to-source node is indicated, the one node is determined as the target return-to-source node. If multiple return-to-source nodes are indicated, one may be determined as the target return-to-source node from the multiple return-to-source nodes based on the pre-configured priorities and weights of the return-to-source nodes.

[0084] Figure 3 is an example diagram of scheduling indication information in an embodiment of the present disclosure, such as Figure 3 As shown, the back-to-source node "Great Wall Broadband" is configured with two scheduling indication information, one of which indicates the "back-to-source domain name" 31, and the other indicates the "back-to-source IP address" 32. The two scheduling indication information have different corresponding priorities, and the weights and TTLs are the same.

[0085] In the related technology, any return to the source may return one or more return to the source address, but when there are multiple return to the source address, a return to the source address is randomly selected or returned based on a simple load balancing. Among them, the random return method may not be the best; in addition, because the traditional DNS configuration method is often roughly divided based on geographical location, such as by country, province or city, however, in the same region, there may be multiple data centers or server nodes distributed, and the performance, load and response time between these nodes may vary significantly. Due to the generality of regional division, it is difficult for DNS to accurately distribute traffic to the most suitable node, which may cause some nodes to be overloaded while other nodes are idle, making it impossible to achieve ideal load balancing and traffic distribution.

[0086] In contrast, in the embodiment of the present disclosure, based on the preset priority and weight of each back-to-source node, a target back-to-source node is selected, which can improve the accuracy of back-to-source.

[0087] In some embodiments, when there are multiple return-to-source nodes indicated in the scheduling indication information, determining the target return-to-source node based on preset priorities and weights of the return-to-source nodes includes:

[0088] Based on the priority of each of the multiple back-to-source nodes, determine a candidate node from the multiple back-to-source nodes; wherein the priority of the candidate node is higher than the priority of other back-to-source nodes in the multiple back-to-source nodes;

[0089] When a candidate node is determined, the candidate node is determined as the target back-to-source node;

[0090] When multiple candidate nodes are determined, the candidate node with the highest weight is determined as the target back-to-source node.

[0091] In the embodiment of the present disclosure, the back-to-source server first screens based on priority and then based on weight. Figure 3 For example, the smaller the priority value, the higher the priority. Then, based on the priority screening, there is only one candidate node "back-to-source IP address" 32, and the back-to-source server can use the "back-to-source IP address" 32 as the target back-to-source node.

[0092] In the disclosed embodiment, if there are multiple candidate nodes with the highest priority, they are further screened based on weights. For example, address A: priority 1, weight 30; address B: priority 1, weight 70. The traffic ratio allocated to address A and address B can be 30:70, which means that address B can be used as the target back-to-source node.

[0093] It can be understood that the method of determining the target back-to-source node based on the priority and weight in the embodiment of the present disclosure can more accurately determine the target back-to-source node, thereby improving the accuracy of back-to-source.

[0094] In some embodiments, determining the target back-to-source node of any node based on the scheduling indication information associated with the tree structure where any node is located includes:

[0095] In a case where the back-to-source node indicated by the scheduling indication information associated with the tree structure where any node is located is a source station in the content distribution network, the source station is determined as a target back-to-source node for any node.

[0096] In the embodiment of the present disclosure, if the scheduling indication information associated with the tree structure where any node is located indicates that the return-to-source node is the source station of the CDN, the source station is determined as the target return-to-source node. In this case, the tree structure where any node is located corresponds to the central layer of the CDN network, for example, because the central layer belongs to the highest layer of the CDN network, then the target return-to-source node of the central layer is the source station.

[0097] Exemplarily, the scheduling indication information associated with the central layer may be marked as "origin", where "origin" indicates the source station of the CDN network, and the back-to-origin server determines the source station as the target back-to-origin node of any node in the central layer.

[0098] It can be understood that in the embodiment of the present disclosure, the source station indicated by the scheduling indication information is used as the target back-to-source node, so that any node can eventually still go back to the source to obtain the resources requested by the user.

[0099] In some embodiments, the method further comprises:

[0100] When the target back-to-source node of any node is determined based on the scheduling indication information configured by the root node in the tree structure where any node is located, the determined target back-to-source node is configured as the back-to-source node of all nodes between any node and the root node in the tree structure.

[0101] In the embodiment of the present disclosure, Figure 2 For example, if any node currently sending a back-to-source request is "South", when querying along the root direction of the tree, only the root node "level1" of the tree structure has scheduling indication information, and the back-to-source address indicated by the scheduling indication information of "level1" is "2.2.2.2", then the back-to-source address of all nodes between "South" and the root node "level1" in the tree structure can be set to "2.2.2.2". In addition, the back-to-source address of the node "North" at the same level (level in the exponential structure) as "South" can also be set to "2.2.2.2". Among them, "2.2.2.2" is, for example, the cluster address under LEVEL2.

[0102] It should be noted that in the above example, if there are multiple return-to-source nodes indicated in the scheduling indication information of the root node or non-root node, the corresponding target return-to-source node can also be determined based on the aforementioned priority and weight, which is not given here.

[0103] It can be understood that, based on the properties of the tree structure in the embodiments of the present disclosure, it is possible to implement backhaul to the upper layer of the CDN network without configuring scheduling indication information for each node in the tree structure, and the solution is highly intelligent.

[0104] In some embodiments, the method further comprises:

[0105] Before determining the target back-to-source node of any node based on the scheduling indication information associated with the tree structure where any node is located, confirm that the back-to-source acceleration function of the access domain name configuration associated with the back-to-source request is turned on.

[0106] In the embodiment of the present disclosure, the back-to-source scheduling function of the CDN can be enabled through page configuration, and the access domain name is used to point to the resource to be accessed. Only when the back-to-source scheduling function configured with the access domain name associated with the back-to-source request is enabled, the back-to-source server determines the target back-to-source node based on the back-to-source request of any node and the scheduling indication information associated with the tree structure where any node is located. Since in the back-to-source scheduling method of the present disclosure, scheduling indication information is configured for the node, and the level of the back-to-source node indicated by the scheduling indication information in the CDN is higher than the level of all nodes in the tree structure in the CDN, so that no loop is caused, and thus the speed of back-to-source can be accelerated (i.e., the speed of accessing resources is accelerated), the back-to-source scheduling function of the present disclosure can also be called a back-to-source acceleration function.

[0107] Figure 4 This is a diagram of a page configuration example in an embodiment of the present disclosure, such as Figure 4 As shown, the control of "Whether to use layered service" shown in 41 is a control for controlling whether the back-to-source acceleration function is turned on. The network administrator can turn on or off the back-to-source acceleration function by operating the control on the page.

[0108] It can be understood that in the embodiment of the present disclosure, the back-to-source acceleration function of the present disclosure is turned on or off by means of page configuration, which is highly intelligent.

[0109] It should be noted that in the embodiment of the present disclosure, since the tree structure is associated with the scheduling indication information, the source return line of each node can be drawn according to the original address of the node in the tree structure and the address of the source return node indicated in the scheduling indication information. Figure 5 FIG. 1 is an example diagram of a return line in an embodiment of the present disclosure, such as Figure 5 As shown, the solid line shown at 51 is the preferred return line, and the dotted line shown at 52 is the backup line.

[0110] Figure 6 A CDN back-to-source scheduling device diagram is provided for an embodiment of the present disclosure, such as Figure 6 As shown, the device 600 includes:

[0111] The receiving module 601 is configured to receive a back-to-source request sent by any node in the content distribution network when there is no resource accessed by the user request;

[0112] The determination module 602 is configured to determine, according to the back-to-source request, a target back-to-source node of any node based on the scheduling indication information associated with the tree structure in which the any node is located; wherein all nodes in the same tree structure have the same level in the content distribution network, the scheduling indication information indicates a back-to-source node, and the level of the indicated back-to-source node in the content distribution network is higher than the level of all nodes in the tree structure in the content distribution network, and the target back-to-source node is a back-to-source node indicated in the scheduling indication information;

[0113] The sending module 603 is configured to send the identifier of the target back-to-source node to any one of the nodes, wherein the identifier of the target back-to-source node is used by any one of the nodes to perform back-to-source acquisition of the resource requested to be accessed by the user.

[0114] In some embodiments, the determination module 602 is also configured to query in the tree depth direction starting from any node based on the tree structure where the any node is located, and stop querying until the target node configured with the scheduling indication information is found; and determine the target return source node of any node based on the return source node indicated in the scheduling indication information configured with the target node.

[0115] In some embodiments, the determination module 602 is further configured to, when there is only one return-to-source node indicated in the scheduling indication information, determine the one return-to-source node as the target return-to-source node; and, when there are multiple return-to-source nodes indicated in the scheduling indication information, determine the target return-to-source node based on preset priorities and weights of each return-to-source node.

[0116] In some embodiments, the determination module 602 is further configured to determine a candidate node from the multiple back-to-source nodes based on the priority of each back-to-source node in the multiple back-to-source nodes; wherein the priority of the candidate node is higher than the priority of other back-to-source nodes in the multiple back-to-source nodes; when one candidate node is determined, the candidate node is determined as the target back-to-source node; when multiple candidate nodes are determined, the candidate node with the highest weight is determined as the target back-to-source node.

[0117] In some embodiments, the determination module 602 is further configured to determine the source station as the target source node of any node when the source node indicated by the scheduling indication information associated with the tree structure where any node is located is the source station of the content distribution network.

[0118] In some embodiments, the apparatus further comprises:

[0119] The setting module is configured to, when a target return-to-source node of any node is determined based on the scheduling indication information configured by the root node in the tree structure where any node is located, configure the determined target return-to-source node as the return-to-source node of all nodes between any node and the root node in the tree structure.

[0120] In some embodiments, the apparatus further comprises:

[0121] The confirmation module is configured to confirm that the back-to-source acceleration function configured in the access domain name associated with the back-to-source request is turned on before determining the target back-to-source node of any node based on the scheduling indication information associated with the tree structure where any node is located.

[0122] Regarding the device in the above embodiment, the specific manner in which each module performs operations has been described in detail in the embodiment of the method, and will not be elaborated here.

[0123] Figure 7 is a schematic diagram of a hardware entity of an electronic device in an embodiment of the present disclosure, such as Figure 7 As shown, the hardware entity of the computer device 700 includes: a processor 701, a communication interface 702 and a memory 703, wherein:

[0124] Processor 701 generally controls the overall operation of computer device 700 .

[0125] The communication interface 702 enables the computer device to communicate with other terminals or servers through a network.

[0126] The memory 703 is configured to store instructions and applications executable by the processor 701, and can also cache data to be processed or processed by the processor 701 and each module in the computer device 700 (for example, image data, audio data, voice communication data, and video communication data), which can be implemented by flash memory (FLASH) or random access memory (Random Access Memory, RAM). Data can be transmitted between the processor 701, the communication interface 702, and the memory 703 through the bus 704. Among them, the processor 701 is used to execute some or all of the steps in the above method.

[0127] Correspondingly, an embodiment of the present disclosure provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, part or all of the steps in the above method are implemented.

[0128] The embodiment of the present disclosure provides a computer program product, which includes: a computer program or an executable instruction, which is stored in a computer-readable storage medium. The processor of the computer device reads the computer program or the executable instruction from the computer-readable storage medium, and the processor executes the computer program or the executable instruction, so that the computer device executes any one of the CDN back-to-source scheduling methods described above in the embodiment of the present disclosure.

[0129] It should be noted that the description of the above storage medium and device embodiments is similar to the description of the above method embodiments, and has similar beneficial effects as the method embodiments. For technical details not disclosed in the storage medium and device embodiments of the present disclosure, please refer to the description of the method embodiments of the present disclosure for understanding.

[0130] It should be understood that in various embodiments of the present disclosure, the size of the sequence number of each process does not mean the order of execution, and the execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present disclosure. The sequence numbers of the embodiments of the present disclosure are only for description and do not represent the advantages and disadvantages of the embodiments.

[0131] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element.

[0132] In the several embodiments provided in the present disclosure, it should be understood that the disclosed devices and methods can be implemented in other ways. The device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as: multiple units or components can be combined, or can be integrated into another system, or some features can be ignored, or not executed. In addition, the coupling, direct coupling, or communication connection between the components shown or discussed can be through some interfaces, and the indirect coupling or communication connection of the devices or units can be electrical, mechanical or other forms.

[0133] The units described above as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units; they may be located in one place or distributed on multiple network units; some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0134] In addition, all functional units in the embodiments of the present disclosure may be integrated into one processing unit, or each unit may be separately configured as a unit, or two or more units may be integrated into one unit; the above-mentioned integrated units may be implemented in the form of hardware or in the form of hardware plus software functional units.

[0135] A person skilled in the art can understand that all or part of the steps of implementing the above method embodiment can be completed by hardware related to program instructions, and the aforementioned program can be stored in a computer-readable storage medium. When the program is executed, it executes the steps of the above method embodiment; and the aforementioned storage medium includes: mobile storage devices, read-only memories (ROM), magnetic disks or optical disks, etc., various media that can store program codes.

[0136] Alternatively, if the above-mentioned integrated unit of the present disclosure is implemented in the form of a software function module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present disclosure can essentially or in other words, the part that contributes to the relevant technology can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the methods described in each embodiment of the present disclosure. The aforementioned storage medium includes: various media that can store program codes, such as mobile storage devices, ROMs, magnetic disks, or optical disks.

[0137] The above description is only an embodiment of the present disclosure and is not intended to limit the protection scope of the present disclosure. Any modification, equivalent replacement and improvement made within the spirit and scope of the present disclosure are included in the protection scope of the present disclosure.

Claims

1. A CDN back-to-source scheduling method, characterized in that: include: Receiving a back-to-origin request sent by any node in the content distribution network when there is no resource requested by the user; According to the back-to-source request, based on the scheduling indication information associated with the tree structure where the any node is located, determining a target back-to-source node for the any node; wherein all nodes in the same tree structure have the same level in the content distribution network, the scheduling indication information indicates a back-to-source node, and the level of the indicated back-to-source node in the content distribution network is higher than the levels of all nodes in the tree structure in the content distribution network, and the target back-to-source node is a back-to-source node indicated in the scheduling indication information; The identifier of the target back-to-source node is sent to any one of the nodes, wherein the identifier of the target back-to-source node is used by any one of the nodes to perform back-to-source acquisition of the resource requested to be accessed by the user.

2. The method according to claim 1, characterized in that The determining, based on the scheduling indication information associated with the tree structure where the any node is located, a target back-to-source node of the any node includes: Based on the tree structure where any node is located, querying in the direction of the tree root from any node in sequence until a target node configured with the scheduling indication information is found and the query is stopped; The target back-to-source node of any one of the nodes is determined based on the back-to-source node indicated in the scheduling indication information configured by the target node.

3. The method according to claim 2, characterized in that The determining the target back-to-source node of any node based on the back-to-source node indicated in the scheduling indication information configured by the target node includes: In a case where there is only one back-to-source node indicated in the scheduling indication information, determining the one back-to-source node as the target back-to-source node; In the case that there are multiple back-to-source nodes indicated in the scheduling indication information, the target back-to-source node is determined based on the preset priorities and weights of the back-to-source nodes.

4. The method according to claim 3, characterized in that When there are multiple return-to-source nodes indicated in the scheduling indication information, determining the target return-to-source node based on preset priorities and weights of the return-to-source nodes includes: Based on the priority of each of the multiple back-to-source nodes, determine a candidate node from the multiple back-to-source nodes; wherein the priority of the candidate node is higher than the priority of other back-to-source nodes in the multiple back-to-source nodes; When a candidate node is determined, the candidate node is determined as the target back-to-source node; When multiple candidate nodes are determined, the candidate node with the highest weight is determined as the target back-to-source node.

5. The method according to claim 1, characterized in that The determining, based on the scheduling indication information associated with the tree structure where the any node is located, a target back-to-source node of the any node includes: In a case where the back-to-source node indicated by the scheduling indication information associated with the tree structure where any node is located is a source station in the content distribution network, the source station is determined as a target back-to-source node for any node.

6. The method according to any one of claims 1 to 5, characterized in that The method further comprises: When the target back-to-source node of any node is determined based on the scheduling indication information configured by the root node in the tree structure where any node is located, the determined target back-to-source node is configured as the back-to-source node of all nodes between any node and the root node in the tree structure.

7. The method according to any one of claims 1 to 5, characterized in that The method further comprises: Before determining the target back-to-source node of any node based on the scheduling indication information associated with the tree structure where any node is located, confirm that the back-to-source acceleration function of the access domain name configuration associated with the back-to-source request is turned on.

8. A CDN back-to-source scheduling device, characterized in that: The device comprises: A receiving module, configured to receive a back-to-source request sent by any node in the content distribution network when there is no resource accessed by the user request; a determination module configured to determine, according to the return-to-source request and based on the scheduling indication information associated with the tree structure in which the any node is located, a target return-to-source node of the any node; wherein all nodes in the same tree structure have the same level in the content distribution network, the scheduling indication information indicates a return-to-source node, and the level of the indicated return-to-source node in the content distribution network is higher than the level of all nodes in the tree structure in the content distribution network, and the target return-to-source node is a return-to-source node indicated in the scheduling indication information; The sending module is configured to send the identifier of the target back-to-source node to any one of the nodes, wherein the identifier of the target back-to-source node is used by any one of the nodes to perform back-to-source acquisition of the resource requested to be accessed by the user.

9. An electronic device, characterized in that: The electronic device comprises: Memory for storing computer programs or executable instructions; A processor, configured to implement the method according to any one of claims 1 to 7 when executing the computer program or executable instructions stored in the memory.

10. A computer-readable storage medium having a computer program or executable instructions stored thereon, characterized in that: When the computer program or the executable instructions are executed by a processor, the method according to any one of claims 1 to 7 is implemented.

Images