Method and apparatus for determining query line of content delivery network, and device and medium

By classifying and aggregating IP addresses from other operators in the IP database of the DNS server, the problem of cross-regional access under operator-aggregated line configuration is solved, achieving more efficient network access and reducing latency.

WO2024230515A1PCT designated stage expired Publication Date: 2024-11-14BEIJING VOLCANO ENGINE TECH CO LTD
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
PCT/CN2024/090047
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-05-06
Filing Date
2024-04-26
Publication Date
2024-11-14

AI Technical Summary

Technical Problem

In existing technologies, the network configuration method of operator aggregation cannot perform geographical location aggregation, which leads to cross-regional access problems, resulting in longer access latency and affecting network quality.

Method used

By adding a new field to the IP database of the DNS server, major operators are classified into other operators, and the IP addresses of other operators are aggregated into the same field for unified scheduling. Candidate query lines containing the target operator's node are filtered out and matched with reference query lines to ensure line consistency.

Benefits of technology

It reduces cross-regional access, improves network access speed, enhances the ability to schedule with operators, and reduces access latency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2024090047_14112024_PF_FP_ABST
    Figure CN2024090047_14112024_PF_FP_ABST
Patent Text Reader

Abstract

Provided in the present disclosure are a method and apparatus for determining a query line of a content delivery network, and a device and a medium. The method comprises: in response to a target domain name resolution request from a client, determining a reference query line of a target domain name, wherein a network operator of the client is a target operator; screening, from a plurality of query lines to be scheduled, out a plurality of candidate query lines including a node of the target operator; and if the candidate query lines match the reference query line, determining that the candidate query lines are target query lines.
Need to check novelty before this filing date? Find Prior Art

Description

Method, device, equipment and medium for determining content distribution network query lines

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to Chinese Patent Application No. 202310505065.0, filed on May 6, 2023, entitled “Method, Apparatus, Device and Medium for Determining Content Distribution Network Query Lines,” the disclosure of which is incorporated herein by reference in its entirety. Technical Field

[0003] The present disclosure relates to the field of network communications, and in particular to a method, apparatus, device, and medium for determining a content distribution network query line. Background Art

[0004] For domestic network configuration, the operator's limited line configuration is usually adopted. That is, during the domain name resolution process, if the client and the server belong to the same network operator, the network quality will be better. If the client and the server belong to different network operators, the network quality will be worse.

[0005] Summary of the Invention

[0006] According to one aspect of the present disclosure, a method for determining a content distribution network query route is provided, the method comprising:

[0007] In response to a target domain name resolution request from a client, determining a reference query route for the target domain name, wherein the network operator of the client is a target operator;

[0008] Screening out a plurality of candidate query routes including the target operator node from a plurality of query routes to be scheduled;

[0009] If the candidate query line matches the reference query line, the candidate query line is determined to be a target query line.

[0010] According to another aspect of the present disclosure, a device for determining a content distribution network query route is provided, the device comprising:

[0011] a determination module, configured to determine a reference query route for the target domain name in response to a target domain name resolution request from a client, wherein the network operator of the client is a target operator;

[0012] A screening module, configured to screen out a plurality of candidate query routes including the target operator node from a plurality of query routes to be scheduled;

[0013] A matching module is configured to determine that the candidate query line is a target query line if the candidate query line matches the reference query line.

[0014] According to another aspect of the present disclosure, there is provided an electronic device, comprising:

[0015] processor; and,

[0016] Memory for storing programs;

[0017] The program includes instructions, and when the instructions are executed by a processor, the processor executes the method according to the exemplary embodiment of the present disclosure.

[0018] According to another aspect of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to cause a computer to execute the method according to the exemplary embodiments of the present disclosure.

[0019] According to another aspect of the present disclosure, a computer program is provided. When the computer program is executed by a processor, the processor is caused to perform the method according to the exemplary embodiment of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] Further details, features and advantages of the present disclosure are disclosed in the following description of exemplary embodiments in conjunction with the accompanying drawings, in which:

[0021] FIG1 shows a schematic diagram of an example system in which various methods described herein may be implemented according to an exemplary embodiment of the present disclosure;

[0022] FIG2 shows a basic flow chart of a method for determining a query route according to an exemplary embodiment of the present disclosure;

[0023] FIG3 shows a schematic diagram of sorting multiple query lines to be scheduled according to the number of nodes and the priority of the nodes;

[0024] FIG4 shows a schematic block diagram of modules of an apparatus for determining a query route according to an exemplary embodiment of the present disclosure;

[0025] FIG5 shows a schematic block diagram of a chip according to an exemplary embodiment of the present disclosure;

[0026] FIG6 shows a block diagram of an exemplary electronic device that can be used to implement the embodiments of the present disclosure. DETAILED DESCRIPTION

[0027] The following describes embodiments of the present disclosure in more detail with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as limited to the embodiments described herein. Rather, these embodiments are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of protection of the present disclosure.

[0028] It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.

[0029] The term "including" and its variations used in this document are open inclusions, that is, "including but not limited to". The term "based on" means "based at least in part on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one other embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description. It should be noted that the concepts of "first", "second", etc. mentioned in this disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0030] It should be noted that the modifications of "one" and "multiple" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, they should be understood as "one or more".

[0031] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0032] Before introducing the embodiments of the present disclosure, the following definitions are given for the relevant terms involved in the embodiments of the present disclosure:

[0033] The Domain Name System (DNS) is a very important and commonly used system on the Internet. Its main function is to convert domain names that are easy for people to remember into IP addresses that are recognizable by machines, making it easier for people to access the Internet. The process of obtaining the corresponding IP address from a domain name is called domain name resolution.

[0034] The Border Gateway Protocol (BGP) is a routing protocol used to exchange Network Layer Reachability Information (NLRI) between routing domains. Because different administrative organizations control their own routing domains, routing domains are often referred to as Autonomous Systems (ASs). The current Internet is a large network composed of multiple interconnected ASs. BGP, as the de facto Internet external routing protocol standard, is widely used among Internet Service Providers (ISPs).

[0035] Content Delivery Network (CDN) is a distributed network built on and covered by the bearer network, consisting of edge node server clusters distributed in different regions.

[0036] In related technologies, DNS intelligent resolution is often used for refined scheduling. For example, DNS intelligent resolution typically maintains a local IP database. The DNS intelligent resolution system queries the IP database based on the client IP address and determines the route. DNS route configuration is generally divided according to the IP address corresponding to the domain name. However, in real life, there are many small operators who randomly match the optimal route. These optimal routes are often configured with national BGP IP addresses. This can lead to cross-regional access issues when these small operators select routes.

[0037] In related technologies, intelligent DNS resolution is often used for refined scheduling. Generally, DNS server line configuration is based on the IP addresses corresponding to domain names. For example, a domain name may have access IP addresses for Beijing Carrier A, Beijing Carrier B, Beijing Carrier C, Shanghai Carrier A, Shanghai Carrier B, and Shanghai Carrier C. For customers in Beijing and Shanghai, we would configure lines for Beijing Carrier A, Beijing Carrier B, Beijing Carrier C, Shanghai Carrier A, Shanghai Carrier B, and Shanghai Carrier C. However, in practice, in addition to the primary carriers A, B, and C, there are many other carriers, each of which has a large number of customer lines. However, most DNS server users do not have access IP addresses for all carriers other than the primary ones. Line configuration for these other carriers is more likely to be based on BGP multi-line selection.

[0038] In actual applications, there are two ways to configure lines: one is to configure lines based on geographic location aggregation, and the other is to configure lines based on operator aggregation. In China, most people choose the operator aggregation method, but geographic location aggregation cannot be performed under the operator aggregation method. If geographic location aggregation is forced to be performed under the operator aggregation method, the scheduling algorithm in the DNS server will need to be significantly modified, which will have a certain impact on business stability. Therefore, when BGP multiple lines are selected, cross-regional access issues may exist, resulting in longer access delays and other problems.

[0039] For example, a user is configured with seven lines: the default line, China Operator A, China Operator C, China Operator B, Beijing Operator A, Beijing Operator C, and Beijing Operator B. If the user is a user of Beijing Operator A, BGP multi-line automatically identifies the visiting user as a user of Beijing Operator A, and then prioritizes matching the lines of Beijing Operator A. If the user is a user of Jiangsu Operator A, BGP multi-line automatically identifies the visiting user as a user of Jiangsu Operator A, and then prioritizes matching the lines of Jiangsu Operator A. If the user is a user of other operators in Beijing, BGP multi-line automatically identifies the visiting user as a user of other operators in Beijing. Since there are no lines of other operators in Beijing, users of other operators in Beijing can only match the default line. This default line is usually configured with a national BGP IP, and other operators in Beijing may have problems with cross-regional access.

[0040] In response to the above problems, the present disclosure proposes a method for determining content distribution network query lines, which can classify major operators and other operators. Based on this, other operators except the major operators are uniformly scheduled, and other operators in different regions are aggregated into the same line, thereby avoiding cross-regional line access, enhancing the scheduling capabilities of operators, and reducing access delays.

[0041] One or more technical solutions provided in exemplary embodiments of the present disclosure can determine a reference query route for a target domain name in response to a target domain name resolution request from a client. Since the client's network operator can be the target operator, the reference query route essentially includes the target operator's node. Based on this, multiple candidate query routes containing the target operator's node can be screened from multiple query routes to be scheduled. When a candidate query route matches a reference query route, it indicates that the candidate query route and the reference query route not only contain the same target operator node but also have other matching nodes. Therefore, the candidate query route that matches the reference query route can maximize the satisfaction of high-quality network access requirements, thereby reducing access latency and improving scheduling capabilities for the target operator.

[0042] The query route method of the exemplary embodiment of the present disclosure can be applied in various query route scheduling scenarios. Figure 1 shows a schematic diagram of an example system in which the various methods described herein can be implemented according to the exemplary embodiment of the present disclosure. As shown in Figure 1, the application scenario 100 of the exemplary embodiment of the present disclosure includes a client 110, a DNS server 120, and a server 130.

[0043] In actual applications, as shown in Figure 1, client 110 can be configured with multiple BGP lines. It should be understood that the same client 110 is configured with at least one BGP line as an option. A user can send a request from client 110 to DNS server 120 from any internet device. DNS server 120 resolves the IP address of client 110, determines the IP address's location and carrier, and thus schedules user access to client 110. Clients 110 can be of the same or different device types, including at least one of a smartphone, tablet computer, laptop computer, and desktop computer.

[0044] As shown in FIG1 , the client 110 can communicate with the DNS server 120 via a communication network. In terms of communication methods, the communication network can be categorized as a wireless communication network, such as satellite communication and microwave communication, or a wired communication network, such as optical fiber communication and power line carrier communication. In terms of communication range, the communication network can be a local area communication network, such as Wi-Fi and Zigbee communication networks, or a wide area communication network, such as the Internet.

[0045] As shown in Figure 1, the above-mentioned DNS server 120 can be a server, a server cluster or a distributed system composed of multiple servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, as well as big data and artificial intelligence platforms.

[0046] In actual applications, a user sends a domain name request to DNS server 120 through client 110. DNS server 120 resolves the domain name and retrieves the corresponding IP address from its IP address database. CDN server 130 then allows the user to access the IP address at the nearest node. Client 110 connects to the corresponding operator based on the IP address. For example, customers of operator A in Beijing can obtain the access IP address of operator A in Beijing based on DNS server 120 and connect to the server of operator A in Beijing. Customers of operator B in Beijing can obtain the access IP address of operator B in Beijing based on DNS server 120 and connect to the server of operator B in Beijing. Customers of operator C in Beijing can obtain the access IP address of operator C in Beijing based on DNS server 120 and connect to the server of operator C in Beijing.

[0047] FIG2 shows a basic flow chart of a method for determining a content distribution network query line according to an exemplary embodiment of the present disclosure. As shown in FIG2 , the method for determining a content distribution network query line according to an exemplary embodiment of the present disclosure may include:

[0048] Step 201: In response to a target domain name resolution request from a client, a reference query route for the target domain name is determined. The network operator of the client is the target operator. The target domain name resolution request may contain a client address. The client address may reflect the current location of the client, which may be a country, a province, a county, or other location information, but is not limited thereto.

[0049] In actual applications, the browser installed on the client can respond to the user entering a domain name in the address bar or search box and send a target domain name resolution request to the DNS server. When the DNS server receives the target domain name resolution request, it can determine the reference query route for the target domain name based on the network interface of the target domain name resolution request. The DNS server can also perform a route query in the IP library of the DNS server in response to the target domain name resolution request from the client, thereby determining the reference query route corresponding to the target domain name after resolution.

[0050] Step 202: Filter multiple candidate query lines containing the target operator node from the multiple query lines to be scheduled. The DNS server's line configuration can be divided based on the IP address corresponding to the domain name, and a user can configure multiple access IP addresses for query lines to be scheduled. This can include multiple query lines to be scheduled for the same operator in different provinces, or multiple query lines to be scheduled for different operators in different provinces. In this case, for multiple query lines to be scheduled, different operator nodes can exist under the same regional node, and different regional nodes can exist under the same operator node.

[0051] In actual applications, in addition to the main operators, there are many other operators, and other operators also have a large number of user lines. However, most DNS server users do not have access IP addresses of all other operators. In addition, other operators are relatively scattered, which will result in cross-regional access when accessing lines, which has a significant impact on network quality. Based on this, the exemplary embodiments of the present disclosure can ensure that the aggregation strategies of multiple query lines to be scheduled are the same by configuring the aggregation strategy of each query line to be scheduled. In this case, based on the BGP server, other operators in the same region are aggregated into the same BGP line, thereby improving the scheduling capabilities for other operators and reducing access delays.

[0052] For example, the original operator aggregation line is "country->operator->province", and the corresponding field in the IP library of the DNS server is [country, isp, province]. The exemplary embodiment of the present disclosure adds a new field in the IP library of the DNS server. The new field changes the original corresponding operator field isp to new-isp. While retaining the characters of the original main operator, the characters of all other operators under the new-isp field are changed to "OTHER", and then the IP addresses in the IP library of the DNS server are refreshed to this new field, and the new field generated in the IP library of the DNS server is [country, new-isp, province], as shown in Table 1 for details.

[0053] Table 1 Comparison table before and after field update

[0054] As shown in Table 1, for the major operators, China Carrier A, China Carrier B, and China Carrier C, the characters remain unchanged before and after the field update. For the two smaller operators, Carrier D and Carrier E, the characters under the corresponding new-isp field are changed to "OTHER." This aggregates the IP addresses corresponding to the two smaller operators, Carrier D and Carrier E, into the IP address corresponding to the OTHER character. Based on this, the exemplary embodiments of the present disclosure uniformly mark other operators based on the field update, thereby facilitating unified scheduling of other operators, enhancing scheduling capabilities for other operators, and reducing access delays.

[0055] Therefore, after the target operator is determined, candidate query lines containing the target operator node can be screened out from multiple query lines to be scheduled, thereby ensuring that the target operators contained in the client and the server are consistent, thereby improving network access speed and reducing network latency.

[0056] In the exemplary embodiment of the present disclosure, for multiple query lines to be scheduled, different operator nodes may exist under the same region node, and different region nodes may exist under the same operator node. Table 2 shows a configuration table of query lines to be scheduled in the exemplary embodiment of the present disclosure.

[0057] Table 2 Configuration table of lines to be dispatched

[0058] As shown in Table 2, it is assumed that the user is an operator A user and is configured with access IP addresses for a total of 8 query lines to be scheduled, including China, China A operator, China C operator, other operator aggregation, Beijing other operator aggregation, Anhui A operator, Shanghai A operator, and Shanghai C operator, and the target operator is determined to be operator A based on the client's network operator. As can be seen from Table 2, for operator A, it contains multiple regional nodes such as Anhui and Shanghai. For the Shanghai node, it has multiple operator nodes such as operator A and operator C. Based on this, China A operator, Anhui A operator, and Shanghai A operator can be selected from the 8 query lines to be scheduled as candidate query lines, thereby ensuring that the target operator nodes of the candidate query lines and the reference query lines are the same. The province abbreviations such as CN and BJ in the line characters are regional nodes or regional reference nodes; YYSA, YYSC, and OTHER are operator nodes.

[0059] Step 203: If the candidate query route matches the reference query route, the candidate query route is determined to be the target query route. It should be understood that the reference query route may include a reference region node and a reference operator node. The reference region node may be the same as the region information included in the client address, and the reference operator node is the operator node corresponding to the target operator.

[0060] When obtaining candidate query lines with the same target operator node based on multiple query lines to be scheduled, if the reference query line includes a reference regional node and a reference operator node, the candidate query line includes not only the target operator node but also the regional node. The regional node may be the same as or different from the reference regional node. Therefore, it is necessary to determine whether the candidate query line matches the reference query line in order to find a candidate query line that matches the reference query line, thereby ensuring that the candidate query line and the reference query line not only include the same target operator node but also have other matching nodes. Therefore, the candidate query line that matches the reference query line can maximize the satisfaction of high-quality network access requirements, thereby reducing access delay issues and improving the scheduling capability for the target operator.

[0061] In an optional manner, if the candidate query route matches the reference query route, the region node included in the target query route is the same as the reference region node, or the reference region node is subordinate to the region node included in the target query route.

[0062] When the region node is the same as the reference region node, it means that the candidate query route matched by the reference query route not only has the same region node as the reference region node, but also has the same reference operator node as the target operator node. In this case, the candidate query route is determined to be the target query route.

[0063] For example, among the multiple query routes to be scheduled shown in Table 2, if the client's operator is another operator and the client's address is Beijing, the reference query route can be "CN; OTHER; BJ." Based on this, the eight query routes to be scheduled can be filtered out based on the target operator node OTHER included in the reference query route, and the candidate query routes "CN; *; *," "CN; OTHER; *," and "CN; OTHER; BJ" containing OTHER can then be selected. Based on the reference region node BJ included in the reference query route, the candidate query route "CN; OTHER; BJ" can be determined as the target query route, meaning that the target query route is the same as the reference query route.

[0064] In one optional approach, if a candidate query route matches a reference query route, the reference region node is subordinate to the region node included in the target query route. In this case, to include the candidate query route, the target query route may include a random region node. When selecting the candidate query route, the random node in the target query route containing the random node may be any region information.

[0065] Exemplarily, the regional nodes included in the candidate query line of the exemplary embodiment of the present disclosure may include multi-level regional nodes sorted in order from large to small according to the regional scope. At this time, the regional node with the smallest level in the multi-level regional nodes included in the target query line may be a random regional node.

[0066] For example, if the client's operator is another operator and the client address is Shanghai, the reference query line can be "CN; OTHER; SH". Based on this, the three candidate query lines containing OTHER, "CN; *; *", "CN; OTHER; *" and "CN; OTHER; BJ", can be screened out from the eight query lines to be scheduled based on the target operator node OTHER included in the reference query line. Then, the target query line can be queried from these three candidates based on the reference regional node SH included in the reference query line. It can be seen from these three candidate query lines that there is no candidate query line corresponding to "CN; OTHER; SH", but the "*" in "CN; OTHER; *" is a random regional node that can cover SH. Based on this, it can be determined that the candidate query line "CN; OTHER; *" is the target query line. At this time, it is considered that the reference regional node is subordinate to the regional node included in the target query line. It should be understood that “CN; OTHER; SH” contains two regional nodes, CN and SH. Since the geographical scope covered by CN is larger than the geographical scope covered by SH, for the “CN; OTHER; SH” line, the smallest regional node is SH.

[0067] In an optional manner, when a user is configured with multiple query lines to be scheduled, when screening candidate query lines, the screening process is very cumbersome and the screening cost is high in the face of multiple query lines to be scheduled. However, each query line to be scheduled can include multiple levels of nodes. Based on this, the multiple query lines to be scheduled are sorted based on the number of nodes, and the multiple query lines to be scheduled can also be sorted based on the priority of nodes at the same level. The multiple query lines to be scheduled can also be sorted according to the number of nodes and the priority of the nodes.

[0068] When sorting multiple query lines to be scheduled based on the number of nodes, they can be sorted in order from small to large according to the number of nodes. Since the fewer the number of nodes in the query line to be scheduled, the coarser the granularity of the query line to be scheduled, when sorting in order from small to large according to the number of nodes, they are also sorted in order from coarse to fine based on the granularity of the line.

[0069] For example, when a node represents a random node, * can be used to represent the random node. For such a random node, it can be considered that the node does not exist. Based on this, it can be sorted from the number of nodes to the number of nodes, or from the coarse to the fine granularity. Table 3 shows a reference table of query routes to be scheduled sorted by the number of random nodes.

[0070] Table 3 Reference table of query lines to be scheduled sorted by the number of nodes

[0071] When a user configures a default route, it contains three random nodes. This route is considered to have no fine-grained structure, and the characters corresponding to the default route can be "*; *; *," which can be considered to have a node count of 0. When a user configures a route for China, the corresponding characters can be "CN; *; *," which can be considered to have a node count of 1. When a user configures a route for China Carrier A, the corresponding characters can be "CN; YYSA; *," which can be considered to have a node count of 2. When a user configures a route for Beijing Carrier A, the corresponding characters can be "CN; YYSA; BJ," which can be considered to have a node count of 3. It should be understood that when sorting multiple routes based on the number of nodes, the order can be from most to least, or from least to most.

[0072] When sorting multiple query routes based on the same node priority level, for example, for operator nodes, you can define the operator node's initials and sort the operator nodes alphabetically to determine the priority. The sorting method for regional nodes and operator nodes is the same and will not be detailed here.

[0073] For example, when sorting multiple query lines to be scheduled based on the node priority of the same level, the multiple query lines to be scheduled can be identified based on "country; operator; province", and the multiple query lines to be scheduled can be identified accordingly according to the English nodes of the country, operator and province, among which the country is the highest level node, the operator is the second, and the province is the lowest level node. When sorting, first compare the first letters of the highest level corresponding nodes to sort the multiple query lines to be scheduled, and then compare the first letters of the operator corresponding nodes to sort the multiple query lines to be scheduled corresponding to the same country, and finally compare the first letters of the province corresponding nodes to sort the multiple query lines to be scheduled corresponding to the same country and the same operator. For example, for the corresponding routes "CN; YYSA; *" and "CN; YYSC; *" in Table 3, which have only two nodes, when the countries are the same, comparing the identifiers of different operators, operator A is YYSA and operator C is YYSC. By comparing the order of the first letters in the alphabet, it can be seen that M comes before T. Based on this, "CN; YYSC; *" can be sorted before "CN; YYSA; *" in ascending alphabetical order, or "CN; YYSC; *" can be sorted after "CN; YYSA; *" in descending alphabetical order.

[0074] The reference query line and each query line to be scheduled of the exemplary embodiment of the present disclosure include multiple levels of nodes, wherein the multiple query lines to be scheduled include multiple groups of query lines to be scheduled, each group of query lines to be scheduled includes multiple levels of query lines to be scheduled sorted in order from the smallest to the largest number of nodes, and the query lines to be scheduled at two adjacent levels include at least one identical node.

[0075] For example, the multiple query lines to be scheduled in Table 3 can be divided into three groups based on the different operators. The first group can be the multiple query lines to be scheduled corresponding to operator A; the second group can be the multiple query lines to be scheduled corresponding to operator C; and the third group can be the multiple query lines to be scheduled corresponding to other operators. The first group of lines includes four query lines to be scheduled, "*;*;*", "CN;*;*", "CN;YYSA;*" and "CN;YYSA;AH". When the nodes represent regional nodes and operator nodes, for "*;*;*", the number of nodes is 0; for "CN;*;*", the number of nodes is 1; for "CN;YYSA;*", the number of nodes is 2; for "CN;YYSA;AH", the number of nodes is 3. Based on this, the multiple query lines to be scheduled are sorted from small to large according to the number of nodes. As shown in Table 4, the sorting methods of the second and third groups refer to the first group. It should be understood that the line level can be set based on the number of nodes. For example, "*; *; *" is the line with the least number of nodes in the first group, but the line granularity is the coarsest. It can be considered that the highest line level is the high-level line, and the low-level lines in the same group of query lines to be scheduled are subordinate to the high-level lines.

[0076] Table 4 Sorts multiple query lines to be scheduled according to the node priority of the same level

[0077] Figure 3 shows the relationship between different line granularities and levels. As shown in Figure 3, combined with Table 4, it can be seen that "*; *; *" does not contain regional nodes and operator nodes. At this time, it is considered that the number of line nodes is 0 and is higher than the line level of "CN; *; *". Therefore, "*; *" is placed at the bottom layer; and the line with one node is only "CN; *; *". It is determined that "CN; *; *" and "CN; *; *" are adjacent lines and in a subordinate relationship. Therefore, "CN; *; *" and "*; *; *" have both adjacent and subordinate relationships; and the lines with two nodes include "CN; YYSC; *", "CN; YYSA; *" and "CN; OTHER; *", a total of 3 lines to be scheduled. Based on the order of the character table, YYSC, YYSA and OTHER are sorted accordingly, as shown in Figure 3. Based on Table 4, it can be seen that "CN; YYSC; *", "CN; YYSA; *" and "CN; OTH" The upper level lines of "ER;*" are all "CN;*;*", so "CN;*;*" has a subordinate relationship with "CN;YYSC;*", "CN;YYSA;*" and "CN;OTHER;*"; and the lines with three nodes include "CN;YYSC;BJ", "CN;YYSA;AH" and "CN;OTHER;BJ", a total of three lines to be scheduled and queried. Since the above three lines belong to different operators, it is only necessary to sort YYSC, YYSA and OTHER accordingly based on the order of the character table, as shown in Figure 3. Moreover, based on Table 4, it can be seen that the upper level of "CN;YYSC;BJ" is "CN;YYSC;*", the upper level of "CN;YYSA;AH" is "CN;YYSA;*" and the upper level of "CN;OTHER;BJ" is "CN;OTHER;*", and the subordinate relationship is marked in Figure 3.

[0078] After sorting multiple query routes to be scheduled, an exemplary embodiment of the present disclosure determines a candidate query route as a target query route based on matching the candidate query routes with a reference query route. This includes obtaining, from the multiple candidate query routes, a target candidate query route having the greatest number of nodes identical to the reference query route; if the target candidate query route includes the same nodes at multiple levels as the reference query route, determining the target query route based on the target candidate query route. If the target candidate query route includes different nodes at multiple levels than the reference query route, determining a candidate query route at a higher level adjacent to the target candidate query route based on the corresponding group of query routes to be scheduled to which the target candidate query route belongs, and determining the target query route based on the higher level candidate query route.

[0079] For example, when the target candidate query line includes multiple levels of nodes that are the same as the multiple levels of nodes included in the reference query line. For example, when the client IP belongs to Beijing D operator, D operator belongs to other operators, the target operator is determined to be other operators, and the string format corresponding to the reference query line is "CN; OTHER; BJ". For the multiple query lines to be scheduled included in Table 4, a binary search method is used to find candidate query lines from the multiple query lines to be scheduled, which are "CN; OTHER; *" and "CN; OTHER; BJ". Then, "CN; OTHER; BJ" with the largest number of identical nodes is determined to be the target candidate query line, and the string format corresponding to the aggregation of other operators in Beijing is "CN; OTHER; BJ", which is the same as the multiple levels of nodes included in the reference query line. Therefore, the line corresponding to the aggregation of other operators in Beijing is determined to be the target query line.

[0080] When the target candidate query line includes multiple levels of nodes that are different from the multiple levels of nodes included in the reference query line. For example, when the client IP belongs to Anhui D operator, and D operator belongs to other operators, the target operator is determined to be other operators, and the string format corresponding to the reference query line is. For the multiple query lines to be scheduled included in Figure 3, a binary search method is used to find candidate query lines from the multiple query lines to be scheduled, and it is found that "CN; OTHER; AH" does not exist in the multiple query lines to be scheduled, and then the upper-level candidate query line with a coarser line granularity than "CN; OTHER; AH" is queried, and "CN; OTHER; *" is queried. Based on this, "CN; OTHER; *" is determined to be the target query line. It should be understood that "CN; OTHER; *" is a higher-level candidate query line with a coarser line granularity than "CN; OTHER; AH".

[0081] Based on this, the exemplary embodiment of the present disclosure first classifies the major operators and other operators based on the update of the IP library field, and then sorts multiple query lines to be scheduled. Based on the line sorting results, the minimum line that is the same as or one level above the reference query line is obtained, and the minimum line that is the same as or one level above the reference query line is determined as the target query line. Based on this, a separate regional aggregation line can be configured for other operators through the DNS server, and the BGP IP address of the DNS server in the corresponding region is configured accordingly. In this case, the aggregation strategy of multiple query lines to be scheduled is the same. Then, based on the sorting results, connections are established between the multiple lines, and the target query line is determined based on this. This enhances the scheduling capabilities of small operators and reduces access delays.

[0082] One or more technical solutions provided in exemplary embodiments of the present disclosure can determine a reference query route for a target domain name in response to a target domain name resolution request from a client. Since the client's network operator can be the target operator, the reference query route essentially includes the target operator's node. Based on this, multiple candidate query routes containing the target operator's node can be screened from multiple query routes to be scheduled. When a candidate query route matches a reference query route, it indicates that the candidate query route and the reference query route not only contain the same target operator node but also have other matching nodes. Therefore, the candidate query route that matches the reference query route can maximize the satisfaction of high-quality network access requirements, thereby reducing access latency and improving scheduling capabilities for the target operator.

[0083] The above mainly introduces the solution provided by the embodiment of the present disclosure from the perspective of the interaction between the terminal and the server. It can be understood that, in order to realize the above functions, the terminal and the server include hardware structures and / or software modules corresponding to the execution of each function. It should be easy for those skilled in the art to realize that, in combination with the units and algorithm steps of each example described in the embodiments disclosed herein, the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this disclosure.

[0084] The embodiments of the present disclosure can divide the terminal and the server into functional units according to the above method examples. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing module. The above integrated modules can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of modules in the embodiments of the present disclosure is schematic and is only a logical functional division. In actual implementation, there may be other division methods.

[0085] In the case of dividing each functional module into corresponding functional modules, the exemplary embodiment of the present disclosure provides a device for determining a content distribution network query route. FIG4 shows a schematic block diagram of the modules of the device for determining a content distribution network query route of the exemplary embodiment of the present disclosure. As shown in FIG4, the device 400 includes:

[0086] Determination module 401, configured to determine a reference query route for a target domain name in response to a target domain name resolution request from a client, wherein the network operator of the client is a target operator;

[0087] A screening module 402 is configured to screen out a plurality of candidate query routes including the target operator node from a plurality of query routes to be scheduled;

[0088] The matching module 403 is configured to determine that the candidate query line is a target query line if the candidate query line matches the reference query line.

[0089] As a possible implementation method, the target domain name resolution request contains the client address, the reference query line includes a reference regional node and a reference operator node, and the candidate query line also includes a regional node, the reference regional node is determined by the client address, and the reference operator node is determined by the target operator.

[0090] As a possible implementation manner, the regional node included in the target query route is the same as the reference regional node.

[0091] As a possible implementation manner, the reference regional node is subordinate to the regional node included in the target query line.

[0092] As a possible implementation, the region nodes included in the candidate query line include multi-level region nodes sorted in descending order of region range, and the region node with the smallest level among the multi-level region nodes included in the target query line is a random region node.

[0093] As a possible implementation, each of the query lines to be scheduled includes multiple levels of nodes, and the device 400 includes: a sorting module 404, used to sort the multiple query lines to be scheduled based on the number of nodes; and / or, sort the multiple query lines to be scheduled based on the priority of nodes at the same level.

[0094] As a possible implementation, the reference query line and each of the query lines to be scheduled include multiple levels of nodes, the multiple query lines to be scheduled include multiple groups of query lines to be scheduled, each group of query lines to be scheduled includes multiple levels of scheduling query lines sorted in order from small to large in terms of the number of nodes, and the query lines to be scheduled at two adjacent levels include at least one identical node.

[0095] As a possible implementation method, if the candidate query line matches the reference query line, determining the candidate query line as the target query line includes: obtaining a target candidate query line with the largest number of nodes identical to those of the reference query line from multiple candidate query lines; if the multiple levels of nodes included in the target candidate query line are identical to the multiple levels of nodes included in the reference query line, determining the target query line based on the target candidate query line.

[0096] As a possible implementation method, the determination module 401 is further used to obtain a target candidate query line with the largest number of nodes identical to those of the reference query line from the multiple candidate query lines; if the multiple levels of nodes included in the target candidate query line are different from the multiple levels of nodes included in the reference query line, based on the corresponding group of to-be-scheduled query lines to which the target candidate query line belongs, determine the upper-level candidate query line adjacent to the target candidate query line, and determine the target query line based on the upper-level candidate query line.

[0097] As a possible implementation manner, the aggregation strategies of the multiple query lines to be scheduled are the same.

[0098] Figure 5 shows a schematic block diagram of a chip according to an exemplary embodiment of the present disclosure. As shown in Figure 5, the chip 500 includes one or more (including two) processors 501 and a communication interface 502. The communication interface 502 can support the server in executing the data sending and receiving steps in the above method, and the processor 501 can support the server in executing the data processing steps in the above method.

[0099] Optionally, as shown in FIG5 , the chip 500 further includes a memory 503 , which may include a read-only memory and a random access memory, and provides operating instructions and data to the processor. A portion of the memory may also include a non-volatile random access memory (NVRAM).

[0100] In some embodiments, as shown in FIG5 , the processor 501 performs corresponding operations by calling operation instructions stored in the memory (the operation instructions may be stored in the operating system). The processor 501 controls the processing operations of any one of the terminal devices, and the processor may also be referred to as a central processing unit (CPU). The memory 503 may include a read-only memory and a random access memory, and provides instructions and data to the processor 501. A portion of the memory 503 may also include NVRAM. For example, in an application, the memory, the communication interface, and the memory are coupled together through a bus system, wherein the bus system may include, in addition to the data bus, a power bus, a control bus, and a status signal bus, etc. However, for the sake of clarity, various buses are labeled as bus system 504 in FIG5 .

[0101] The methods disclosed in the above embodiments of the present disclosure can be applied to or implemented by a processor. The processor may be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method can be completed by hardware integrated logic circuits in the processor or by software instructions. The above processor may be a general-purpose processor, a digital signal processor (DSP), an ASIC, a field-programmable gate array (FPGA), or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component. The methods, steps, and logic block diagrams disclosed in the embodiments of the present disclosure can be implemented or executed. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in conjunction with the embodiments of the present disclosure can be directly implemented and executed by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium well-known in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, etc. The storage medium is located in the memory, and the processor reads the information in the memory and, in conjunction with its hardware, completes the steps of the above method.

[0102] The exemplary embodiments of the present disclosure further provide an electronic device, comprising: at least one processor; and a memory communicatively connected to the at least one processor. The memory stores a computer program executable by the at least one processor, the computer program being configured to cause the electronic device to perform a method according to an exemplary embodiment of the present disclosure when executed by the at least one processor.

[0103] Exemplary embodiments of the present disclosure further provide a non-transitory computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor of a computer, is used to cause the computer to perform a method according to an embodiment of the present disclosure.

[0104] Exemplary embodiments of the present disclosure further provide a computer program product, including a computer program, wherein when the computer program is executed by a processor of a computer, it is used to cause the computer to perform the method according to the embodiment of the present disclosure.

[0105] Exemplary embodiments of the present disclosure further provide a computer program, which, when executed by a processor, causes the processor to execute the method according to the embodiment of the present disclosure.

[0106] With reference to Figure 6, a block diagram of an electronic device 600 that can serve as a server or client of the present disclosure will now be described, which is an example of a hardware device that can be applied to various aspects of the present disclosure. The electronic device is intended to represent various forms of digital electronic computer equipment, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or required herein.

[0107] As shown in Figure 6, electronic device 600 includes a computing unit 601, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 602 or a computer program loaded from a storage unit 608 into a random access memory (RAM) 603. In RAM 603, various programs and data required for the operation of device 600 can also be stored. Computing unit 601, ROM 602, and RAM 603 are connected to each other via a bus 604. An input / output (I / O) interface 605 is also connected to bus 10204.

[0108] Multiple components within electronic device 600 are connected to I / O interface 605, including an input unit 606, an output unit 607, a storage unit 608, and a communication unit 609. Input unit 606 can be any type of device capable of inputting information into electronic device 600. Input unit 606 can receive input numeric or character information and generate key input signals related to user settings and / or function control of the electronic device. Output unit 1207 can be any type of device capable of presenting information and may include, but is not limited to, a display, a speaker, a video / audio output terminal, a vibrator, and / or a printer. Storage unit 1208 may include, but is not limited to, a magnetic disk or an optical disk. Communication unit 1209 allows electronic device 1200 to exchange information / data with other devices via a computer network such as the Internet and / or various telecommunication networks and may include, but is not limited to, a modem, a network card, an infrared communication device, a wireless communication transceiver and / or chipset, such as a Bluetooth™ device, a WiFi device, a WiMax device, a cellular communication device, and / or the like.

[0109] As shown in Figure 6, the computing unit 601 can be various general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 601 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units that run machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 601 performs the various methods and processes described above. For example, in some embodiments, the method of the exemplary embodiments of the present disclosure may be implemented as a computer software program, which is tangibly included in a machine-readable medium, such as a storage unit 608. In some embodiments, part or all of the computer program can be loaded and / or installed on the electronic device 600 via the ROM 602 and / or the communication unit 609. In some embodiments, the computing unit 601 can be configured to execute the method in any other appropriate manner (e.g., by means of firmware).

[0110] The program code for implementing the method of the present disclosure can be written in any combination of one or more programming languages. These program codes can be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device so that when the program code is executed by the processor or controller, the functions / operations specified in the flow chart and / or block diagram are implemented. The program code can be executed entirely on the machine, partially on the machine, as a stand-alone software package, partially on the machine and partially on a remote machine, or entirely on a remote machine or server.

[0111] In the context of the present disclosure, a machine-readable medium can be a tangible medium that can contain or store a program for use by an instruction execution system, device or equipment or used in combination with an instruction execution system, device or equipment. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared or semiconductor systems, devices or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium can include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0112] As used in this disclosure, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and / or device (e.g., a magnetic disk, an optical disk, a memory, a programmable logic device (PLD)) for providing machine instructions and / or data to a programmable processor, including machine-readable media that receive machine instructions as machine-readable signals. The term "machine-readable signal" refers to any signal used to provide machine instructions and / or data to a programmable processor.

[0113] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0114] The systems and techniques described herein can be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network (LAN), a wide area network (WAN), and the Internet.

[0115] Computer systems may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The client and server relationship arises through computer programs running on the respective computers and having a client-server relationship to each other.

[0116] In the above embodiments, they can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using software, they can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of the present disclosure are performed in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a terminal, a user device, or other programmable device. The computer program or instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer program or instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium, such as a floppy disk, a hard disk, or a tape; it can also be an optical medium, such as a digital video disc (DVD); it can also be a semiconductor medium, such as a solid state drive (SSD).

[0117] Although the present disclosure has been described with reference to specific features and embodiments thereof, it will be apparent that various modifications and combinations may be made thereto without departing from the spirit and scope of the present disclosure. Accordingly, this specification and the drawings are merely illustrative of the present disclosure as defined by the appended claims and are deemed to cover any and all modifications, variations, combinations or equivalents within the scope of the present disclosure. Obviously, those skilled in the art may make various modifications and variations to the present disclosure without departing from the spirit and scope of the present disclosure. Thus, the present disclosure is intended to include such modifications and variations if they fall within the scope of the claims of the present disclosure and their equivalents.

Claims

1. A method for determining a content distribution network query route, the method comprising: In response to a target domain name resolution request from a client, determining a reference query route for the target domain name, wherein the network operator of the client is a target operator; Screening out a plurality of candidate query lines including the target operator node from a plurality of query lines to be scheduled; If the candidate query line matches the reference query line, the candidate query line is determined to be a target query line.

2. The method according to claim 1, wherein: The target domain name resolution request contains a client address, the reference query line includes a reference regional node and a reference operator node, and the candidate query line further includes a regional node, the reference regional node is determined by the client address, and the reference operator node is determined by the target operator.

3. The method according to claim 2, wherein: The regional nodes included in the target query line are the same as the reference regional nodes.

4. The method according to claim 2, wherein: The reference regional node is subordinate to the regional node included in the target query line.

5. The method according to claim 4, wherein: The regional nodes included in the candidate query line include multi-level regional nodes sorted in order from large to small in terms of regional scope, and the regional node with the smallest level among the multi-level regional nodes included in the target query line is a random regional node.

6. The method according to any one of claims 1 to 5, wherein: Each of the query lines to be scheduled includes nodes at multiple levels, and the method further includes: Sorting the plurality of query lines to be scheduled based on the number of nodes; and / or, The plurality of query lines to be scheduled are sorted based on node priorities at the same level.

7. The method according to any one of claims 1 to 6, wherein: The reference query line and each of the query lines to be scheduled include nodes at multiple levels, the multiple query lines to be scheduled include multiple groups of query lines to be scheduled, each group of query lines to be scheduled includes multiple levels of scheduling query lines sorted in order from small to large in terms of the number of nodes, and the query lines to be scheduled at two adjacent levels include at least one identical node.

8. The method according to claim 7, wherein: If the candidate query line matches the reference query line, determining the candidate query line as a target query line includes: Acquire a target candidate query route having the largest number of nodes identical to those of the reference query route from the plurality of candidate query routes; If the nodes of multiple levels included in the target candidate query line are the same as the nodes of multiple levels included in the reference query line, the target query line is determined based on the target candidate query line.

9. The method according to claim 7, wherein: The method further comprises: Acquire a target candidate query route having the largest number of nodes identical to those of the reference query route from the plurality of candidate query routes; If the multiple levels of nodes included in the target candidate query line are different from the multiple levels of nodes included in the reference query line, based on the corresponding group of to-be-scheduled query lines to which the target candidate query line belongs, the upper-level candidate query line adjacent to the target candidate query line is determined, and the target query line is determined based on the upper-level candidate query line.

10. The method according to any one of claims 1 to 6, wherein: The aggregation strategies of the plurality of query lines to be scheduled are the same.

11. A device for determining a content distribution network query route, the device comprising: A determination module, configured to determine a reference query route of the target domain name in response to a target domain name resolution request from a client, wherein the network operator of the client is a target operator; A screening module, used to screen out a plurality of candidate query lines including the target operator node from a plurality of query lines to be scheduled; A matching module is used to determine that the candidate query line is a target query line if the candidate query line matches the reference query line.

12. An electronic device comprising: processor; as well as, A memory for storing programs; The program includes instructions, which, when executed by the processor, cause the processor to perform the method according to any one of claims 1 to 10.

13. A non-transitory computer-readable storage medium storing computer instructions for causing a computer to execute the method according to any one of claims 1 to 10.

14. A computer program, which, when executed by a processor, causes the processor to perform the method according to any one of claims 1 to 10.

Citation Information

Patent Citations

  • Network distribution device and method based on SDN architecture

    CN105704246A

  • Node scheduling method and device based on content distribution network, and storage medium

    CN114301990A

  • Client scheduling behavior analysis method and device based on BGP (Border Gateway Protocol) routing and DNS (Domain Name Server)

    CN115914043A

  • Content delivery network query line determination method and device, equipment and medium

    CN116743700A

  • Enhanced browsing using CDN routing capabilities

    US9871850B1