CN113364895B - Method, device, electronic equipment and storage medium for resource scheduling - Google Patents
Method, device, electronic equipment and storage medium for resource scheduling Download PDFInfo
- Publication number
- CN113364895B CN113364895B CN202110726565.8A CN202110726565A CN113364895B CN 113364895 B CN113364895 B CN 113364895B CN 202110726565 A CN202110726565 A CN 202110726565A CN 113364895 B CN113364895 B CN 113364895B
- Authority
- CN
- China
- Prior art keywords
- node
- address
- domain name
- regional
- analysis
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/09—Mapping addresses
- H04L61/10—Mapping addresses of different types
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/45—Network directories; Name-to-address mapping
- H04L61/4505—Network directories; Name-to-address mapping using standardised directories; using standardised directory access protocols
- H04L61/4511—Network directories; Name-to-address mapping using standardised directories; using standardised directory access protocols using domain name system [DNS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
- H04L61/5007—Internet protocol [IP] addresses
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The disclosure provides a method, an apparatus, an electronic device and a storage medium for resource scheduling. The method comprises the following steps: acquiring an analysis request, wherein the analysis request comprises an IP address of terminal equipment and a domain name of a target website; determining the area where the IP address of the terminal equipment is located; determining an entry node of a region hierarchical tree corresponding to the region; analyzing the analysis request according to the domain name analysis library of the entry node; if the resolution result is not obtained, inquiring a domain name resolution library of a father node of the entry node; and analyzing the analysis request according to the domain name analysis library of the father node of the entry node to obtain an analysis result. The method can solve the problems of large configuration amount and huge memory consumption, and is convenient for more accurately scheduling network and communication resources in the follow-up process.
Description
Technical Field
The present disclosure relates to the field of cloud computing technologies, and in particular, to a method and an apparatus for resource scheduling, an electronic device, and a storage medium.
Background
With the increasing demand of 5G and large videos, the requirements of users on high bandwidth and low delay are higher and higher, and the transmission rate and the response delay of internet content have close relation with the distance. Content convergence is a necessary requirement to provide high-rate, low-latency services, which can accurately schedule users to convergence nodes. However, as the development of the nationwide areas is unbalanced, different provinces have different sinking requirements, some provinces need to sink to counties, and some provinces need to sink to cities; in addition, different services have different requirements on convergence, traditional page segment videos and the like do not need convergence, and large videos such as VR (virtual reality), 4k and the like need convergence, so that different customers and different provinces have great requirements on CDN (content delivery network) scheduling areas.
A CDN region in the related art is a single-layer architecture, and when scheduling, the region is split into the finest granularity (for example, all the regions are split according to an access network), so that each province is split into tens or hundreds of small regions, and thousands of regions exist in the whole country. This approach results in a large number of duplicate configurations and consumes a large amount of memory.
It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.
Disclosure of Invention
The present disclosure aims to provide a method, an apparatus, an electronic device, and a storage medium for resource scheduling, which can solve the problems of large configuration amount and huge memory consumption, and facilitate more accurate subsequent network and communication resource scheduling.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.
The embodiment of the present disclosure provides a method for resource scheduling, including: acquiring an analysis request, wherein the analysis request comprises an IP address of terminal equipment and a domain name of a target website; determining the area where the IP address of the terminal equipment is located; determining an entry node of a region hierarchical tree corresponding to the region; analyzing the analysis request according to the domain name analysis library of the entry node; if the resolution result is not obtained, inquiring a domain name resolution library of a father node of the entry node; and analyzing the analysis request according to the domain name analysis library of the father node of the entry node to obtain an analysis result.
In some exemplary embodiments of the present disclosure, determining an area where an IP address of the terminal device is located includes: inquiring and obtaining a regional address node including the IP address of the terminal equipment in an IP address tree; and determining the node with the lowest level in the area address nodes as the area where the IP address of the terminal equipment is located.
In some exemplary embodiments of the present disclosure, the IP address tree includes a plurality of area address nodes, each area address node configures an address bank of each area and an entry node of each area in the area hierarchical tree, wherein the address bank of the parent area address node in the IP address tree includes an address bank of a sub-area address node.
In some exemplary embodiments of the present disclosure, resolving the resolution request according to a domain name resolution library of the ingress node includes: inquiring whether the domain name resolution library of the entry node has the IP address of a target server corresponding to the target website; and if the IP address of the target server corresponding to the target website exists, returning the IP address of the target server to the terminal equipment.
In some exemplary embodiments of the present disclosure, the resolution result includes an IP address of the target server; the method further comprises the following steps: and sending a content acquisition request of the target website to the target server according to the IP address of the target server. In some exemplary embodiments of the present disclosure, the zone hierarchical tree includes a plurality of zone nodes, each zone node including a pointer to a parent node of each zone node and a domain name resolution library of each zone.
In some exemplary embodiments of the present disclosure, querying a domain name resolution repository of a parent node of the ingress node comprises: determining a parent node of the entry node according to a pointer of the parent node of the entry node in the entry nodes; and inquiring to obtain a domain name resolution library of the father node of the entry node.
The embodiment of the present disclosure provides an apparatus for resource scheduling, including: the request acquisition module is used for acquiring an analysis request, wherein the analysis request comprises an IP address of the terminal equipment and a domain name of a target website;
the area determining module is used for determining the area where the IP address of the terminal equipment is located; an entry node determining module, configured to determine an entry node of a region hierarchical tree corresponding to the region; the request analysis module is used for analyzing the analysis request according to the domain name analysis library of the entry node; the father node query module is used for querying a domain name resolution library of the father node of the entry node if the resolution result is not obtained; and the result obtaining module is used for analyzing the analysis request according to the domain name analysis library of the father node of the entry node to obtain an analysis result.
An embodiment of the present disclosure provides an electronic device, including: at least one processor; a storage means for storing at least one program which, when executed by at least one processor, causes the at least one processor to carry out any one of the above-mentioned methods for resource scheduling.
The embodiment of the present disclosure provides a computer-readable storage medium, on which a computer program is stored, wherein the computer program is implemented by a processor, and when executed by the processor, the computer program implements any one of the above methods for resource scheduling.
According to the method for resource scheduling provided by the embodiment of the disclosure, an entry node of a regional hierarchical tree is determined according to a region where an IP address of a terminal device is located, an analysis request is analyzed according to a domain name analysis library of the entry node, and if an analysis result is not obtained, the analysis request is analyzed according to a domain name analysis library of a father node of the entry node until the analysis result is obtained. The domain name resolution of the method can be searched step by step from a low-level region node to a high-level region node, the problems of large configuration amount and huge memory consumption can be solved, the success rate of domain name resolution is improved, and network and communication resources can be conveniently and accurately scheduled subsequently. In addition, the IP address tree and the area hierarchy tree are set according to specific conditions, so that the requirements of different services and different regions on network or communication resources can be met, and the network and the communication resources can be more accurately scheduled.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty.
Fig. 1 shows a schematic diagram of an exemplary system architecture to which the method for resource scheduling of the embodiments of the present disclosure may be applied.
FIG. 2 is a flow chart illustrating a method for resource scheduling in accordance with an exemplary embodiment.
Fig. 3 is a schematic diagram of an IP address tree shown according to an example.
FIG. 4 is a schematic diagram of a region level tree shown according to an example.
Fig. 5 is a schematic diagram of an IP address segment association zone hierarchical tree entry node shown according to an example.
FIG. 6 illustrates attributes of a zone node in a zone hierarchy tree according to an example.
Fig. 7 illustrates a parsing flow when a scheduling region is not layered in the related art and a parsing flow when a scheduling region is layered in the present disclosure.
Fig. 8 is a block diagram illustrating an apparatus for resource scheduling in accordance with an example embodiment.
Fig. 9 is a schematic structural diagram of an electronic device according to an example embodiment.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
Fig. 1 shows a schematic diagram of an exemplary system architecture to which the method for resource scheduling of the embodiments of the present disclosure may be applied.
As shown in fig. 1, the system architecture may include a server 101, a network 102, and a terminal device 103. Network 102 is the medium used to provide communication links between terminal devices 103 and server 101. Network 102 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The server 101 may be a server that provides various services, such as a background management server that provides support for devices operated by the user using the terminal apparatus 103. The background management server can analyze and process the received data such as the request and feed back the processing result to the terminal equipment.
The terminal device 103 may send a resolution request to the server 101, which may include an IP address of the terminal device and a domain name of a target website to be accessed by the user; the server 101 may receive the analysis request, and determine the area where the terminal device 103 is located according to the IP address of the terminal device 103 in the analysis request; the server 101 may parse the parsing request to obtain a parsing result, and return the parsing result to the terminal device 103; the terminal device 103 can access the target website according to the parsing result.
It should be understood that the number of the terminal devices, the networks, and the servers in fig. 1 is only illustrative, and the server 101 may be a physical server, a server cluster formed by a plurality of servers, and a cloud server, and may have any number of terminal devices, networks, and servers according to actual needs.
Hereinafter, each step of the method for resource scheduling in the exemplary embodiment of the present disclosure will be described in more detail with reference to the drawings and the embodiment.
FIG. 2 is a flow chart illustrating a method for resource scheduling in accordance with an exemplary embodiment. The method provided by the embodiment of the present disclosure may be executed by a server as shown in fig. 1, but the present disclosure is not limited thereto.
As shown in fig. 2, a method for resource scheduling provided by an embodiment of the present disclosure may include the following steps.
In step S202, a resolution request is obtained, where the resolution request includes the IP address of the terminal device and the domain name of the target website.
The method for resource scheduling provided by the embodiment of the disclosure can be used for a Content Delivery Network (CDN) to solve the problem of node sinking and accurate scheduling in the CDN.
In the embodiment of the present disclosure, a user may send an analysis request through a terminal device, where the analysis request may include an IP (Internet Protocol) address of the terminal device and a domain name of a target website to be accessed by the user.
The domain name of the target website may be, for example, a.com, b.com, etc., which is not limited by this disclosure.
In step S204, the area where the IP address of the terminal device is located is determined.
In the embodiment of the present disclosure, the area where the terminal device is located may be determined according to the IP address of the terminal device.
For example, an IP address tree (or an IP address bank) may be established in advance, and an area to which an internet user belongs may be distinguished by the IP address tree.
The embodiment of the disclosure can reduce the colleagues with repeated configuration, and meet the following requirements: some provinces need layering, and some provinces do not need layering; for example, as: the remote provinces have few users and no requirement of accurate scheduling; the provinces and the provinces sink differently, some sink to the city and some sink to the district; some cities in the same province have sinking nodes, and some cities have no sinking nodes; different services have different requirements for area convergence.
In an exemplary embodiment, the IP address tree includes a plurality of regional address nodes, each regional address node configuring an address bank of each region and an entry node of each region in a regional hierarchical tree, wherein the address bank of a parent regional address node in the IP address tree includes an address bank of a sub-regional address node.
Fig. 3 is a schematic diagram of an IP address tree shown according to an example.
In the embodiment of the present disclosure, a regional hierarchical model may be established in advance, a plurality of hierarchies are set according to actual situations, regional hierarchies of different operators and different provinces may be different, and all geographic regions of a certain hierarchy may not need to be added to the regional hierarchy.
For example, referring to fig. 3, only two counties, rean and le qing, may have sinking nodes under the wenzhou region, while other counties have no sinking nodes.
Referring to fig. 3, the IP address tree may include a plurality of levels, such as an operator, a large district, a province, a place, a prefecture, and the like, the operator level may include an operator regional address node, the operator regional address node may include a east China regional address node and a North China regional address node, the east China regional address node may include a Zhejiang regional address node, a Shanghai regional address node, and a Jiangsu regional address node, the Zhejiang regional address node may include a Wenzhou regional address node and a Ningbo regional address node, the Wenzhou regional address node may include a Reian regional address node and a Leqing regional address node, wherein the Rekana regional address node, the Leqing regional address node, the Ningbo regional address node, the Jiangsu regional address node, and the Shanghai regional address node may be leaf nodes, and the rest are non-leaf nodes.
Each hierarchy may include a plurality of regional address nodes, e.g., a province hierarchy includes regional address nodes of zhejiang, shanghai, junior, etc.
Each area address node can configure its own address library, and each area address node can configure the corresponding entry node of the area address node in the area hierarchical tree.
The address banks for parent zone address nodes in the IP address tree may include address banks for sub-zone address nodes, for example, the address banks for the wenzhou zone address nodes may include address banks for the rana and the le qing zone address nodes.
In the embodiment of the present disclosure, the smaller the area of the node in the IP address tree is, the higher the resolution priority may be set.
In the embodiment of the present disclosure, the IP address tree (or address library) may be loaded into the memory in the form of an address tree, which may be a radix tree, a B + tree, or a multi-way tree, and the present disclosure does not limit this. Each node in the address tree may represent an address segment, and the node attribute of the address segment may include an entry node of the regional hierarchical tree to which the node corresponds.
Referring to fig. 3, a bold IP address segment may indicate that the present region is the minimum region of the IP segment.
In an exemplary embodiment, a query is made to obtain a regional address node including an IP address of a terminal device in an IP address tree; and determining the node with the lowest level in the area address nodes as the area where the IP address of the terminal equipment is located.
For example, the IP address of the terminal device of the user is 10.10.10.0/24, the regional address nodes which are queried in the IP address tree and include the IP address of the terminal device include the rana, the wenzhou, the zhejiang, the east of china, the first operator and the heel node, and the lowest rana in the regional address nodes is determined as the region where the IP address of the terminal device is located.
Compared with a single-level framework in the related technology, the multi-level regional hierarchical model provided by the embodiment of the disclosure can more flexibly and accurately level the region, and facilitates subsequent flexible and accurate resource scheduling.
In step S206, an entry node of the area hierarchical tree corresponding to the area is determined.
In the embodiment of the present disclosure, an area hierarchical tree may be preset, where nodes in the area hierarchical tree and nodes in the IP address tree may be the same or different.
The regional hierarchical tree provided by the embodiment of the present disclosure may include a plurality of entry nodes, which are bottom-to-top trees, and each regional address node in the IP address tree corresponds to an entry node in the regional hierarchical tree.
In an exemplary embodiment, the zone hierarchy tree includes a plurality of zone nodes, each zone node including a pointer to a parent node of each zone node and a domain name resolution library of each zone.
FIG. 4 is a schematic diagram of a region level tree shown according to an example.
Fig. 5 is a schematic diagram of an IP address segment association zone hierarchical tree entry node shown according to an example.
Referring to fig. 4, the regional hierarchical tree includes a plurality of entry nodes: ruian, leqing, wenzhou, ningbo, zhejiang, jiangsu, huadong and the like.
In the embodiment of the present disclosure, the entry node of each IP address segment association area tree is the minimum area address node to which the address segment belongs.
Referring to fig. 5, if the IP address of the terminal device of the user is 10.10.10.0/24, the entry node in the corresponding area level tree is a dean node, that is, the resolution is performed from the domain name resolution library of dean; if the IP address of the terminal device of the user is 13.13.0/16, the entry node in the corresponding zone level tree is a wenzhou node, i.e., the domain name resolution library in wenzhou is used for resolution.
FIG. 6 illustrates attributes of a region node in a region-level tree, according to an example.
In this embodiment of the present disclosure, the attribute of the region node in the region hierarchical tree may include: pointer of upper node (also named father node), name of local area, domain name resolution tree (resolution library) of local area (resolution tree is not in the protection scope of the invention)
The attributes of the region node may be:
struct view_attr_s{
struct view_attr*parent；
char view_name[64]；
zonetree*z；
}view_node_attr
wherein, struct view _ attr parent represents the upper node pointer, char view _ name [64] represents the area name, and zonete _ z represents the domain name resolution tree of the area.
Referring to fig. 6, the attributes of the rana zone node may include a parent node pointer of rana, a name of the rana node, and a resolution library of rana, wherein the parent node pointer of rana points to the wenzhou zone node; the Wenzhou regional node attributes may include a Wenzhou parent node pointer, a Wenzhou node name, and a Wenzhou parse library, wherein the Wenzhou parent node pointer points to the Zhejiang regional node; the Zhejiang region node attributes may include a parent node pointer for Zhejiang, the name of the Zhejiang node, and a resolution library for Zhejiang.
In step S208, the resolution request is resolved according to the domain name resolution library of the ingress node.
In the embodiment of the present disclosure, a domain name resolution library of the entry node may be obtained, the resolution request is resolved according to the domain name resolution library of the entry node, and if a resolution result is obtained, the resolution result is returned to the terminal device.
In an exemplary embodiment, the resolution result includes an IP address of the target server.
In the exemplary embodiment, whether the IP address of a target server corresponding to a target website exists in a domain name resolution library of an entry node is inquired; and if the IP address of the target server corresponding to the target website exists, returning the IP address of the target server to the terminal equipment.
The resolution request may include a domain name of the target website, and may query whether a resolution record exists in a domain name resolution library of the entry node, or whether a server IP address corresponding to the domain name of the target website exists, and if so, may return the server IP address to the terminal device.
In step S210, if no resolution result is obtained, the domain name resolution library of the parent node of the entry node is queried.
In an exemplary embodiment, a parent node of an entry node is determined from a pointer of the parent node of the entry node; and querying to obtain a domain name resolution library of the parent node of the entry node.
If the resolution result is not obtained, the father node of the entry node can be determined according to the father node pointer in the entry node, and the domain name resolution library of the father node is obtained.
In step S212, the resolution request is resolved according to the domain name resolution library of the parent node of the entry node, and a resolution result is obtained.
If the analysis result is obtained, returning the analysis result to the terminal equipment; if the resolution result is not obtained, obtaining a domain name resolution library of the father node according to the father node pointer of the father node, and resolving the resolution request according to the domain name resolution library of the father node until the resolution result is obtained or the top layer (root node) when the regional hierarchy is reached.
As can be seen from this, if any domain name has an analysis configuration in any one of a plurality of hierarchical levels from the minimum area to the entire network, an analysis result can be obtained.
In an exemplary embodiment, the above method further comprises: and sending a content acquisition request of the target website to the target server according to the IP address of the target server.
After obtaining the IP address of the target server, the terminal device may send a content obtaining request of the target website to the target server according to the IP address of the target server, and the target server may provide website resources or service content of the target website to the terminal device.
The method for resource scheduling provided by the embodiment of the disclosure can be used for accurate scheduling of the DNS based on EDNS extension according to the IP address of the client source.
According to the method for resource scheduling provided by the embodiment of the disclosure, an entry node of a regional hierarchical tree is determined according to a region where an IP address of a terminal device is located, an analysis request is analyzed according to a domain name analysis library of the entry node, and if an analysis result is not obtained, the analysis request is analyzed according to a domain name analysis library of a father node of the entry node until the analysis result is obtained. The domain name resolution of the method can be searched step by step from a low-level region node to a high-level region node, the problems of large configuration amount and huge memory consumption can be solved, the success rate of domain name resolution is improved, and network and communication resources can be conveniently and accurately scheduled subsequently. In addition, the IP address tree and the area hierarchy tree are set according to specific conditions, so that the requirements of different services and different regions on network or communication resources can be met, and the network and the communication resources can be more accurately scheduled.
Fig. 7 shows a parsing flow when the scheduling region is not layered in the related art and a parsing flow when the scheduling region is layered in the present disclosure.
Referring to fig. 7, fig. 7 (a) is a parsing flow when the scheduling area is not layered, which includes:
s701: receiving a new analysis request;
s702: inquiring provinces of users;
s703: inquiring a domain name resolution library of the province;
s704: judging whether the analysis configuration exists; when the parsing configuration exists, obtaining a parsing result, and executing step S705; when there is no parsing configuration, step S706 is performed;
s705: sending the analysis result back to the user;
s706: an error is returned to the user.
Fig. 7 (b) is a parsing procedure when scheduling regions are layered, which includes:
s701: receiving a new analysis request;
s707: inquiring the minimum area where the user is located;
s708: inquiring a domain name resolution library of the region;
s704: judging whether the analysis configuration exists; when the parsing configuration exists, obtaining a parsing result, and executing step S705; when there is no parsing configuration, execute step S709;
s709: judging whether the area has a father area; if yes, go to step S710; if not, go to step S706;
s710: changing the area to be a father area;
s706: an error is returned to the user.
The following are embodiments of the disclosed apparatus that may be used to perform embodiments of the disclosed methods. For details not disclosed in the embodiments of the apparatus of the present disclosure, refer to the embodiments of the method of the present disclosure.
Fig. 8 is a block diagram illustrating an apparatus for resource scheduling in accordance with an example embodiment.
As shown in fig. 8, an apparatus 800 for resource scheduling may comprise: a request acquisition module 802, a region determination module 804, an entry node determination module 806, a request parsing module 808, a parent node query module 810, and a result acquisition module 812.
The request obtaining module 802 is configured to obtain an analysis request, where the analysis request includes an IP address of a terminal device and a domain name of a target website; the area determining module 804 is configured to determine an area where the IP address of the terminal device is located; the entry node determining module 806 is configured to determine an entry node of the area hierarchical tree corresponding to the area; the request resolution module 808 is configured to resolve the resolution request according to the domain name resolution library of the entry node; the father node query module 810 is configured to query a domain name resolution library of a father node of the entry node if a resolution result is not obtained; the result obtaining module 812 is configured to analyze the analysis request according to the domain name analysis library of the parent node of the entry node, so as to obtain an analysis result.
In an exemplary embodiment, the region determination module 804 includes: a node query unit, configured to query and obtain a regional address node including the IP address of the terminal device in an IP address tree; and the area determining unit is used for determining the node with the lowest level in the area address nodes as the area where the IP address of the terminal equipment is located.
In an exemplary embodiment, the IP address tree includes a plurality of area address nodes, each area address node configuring an address bank of each area and an entry node of each area in the area hierarchy tree, wherein the address bank of a parent area address node in the IP address tree includes an address bank of a sub-area address node.
In an exemplary embodiment, the request parsing module 808 may include: the address query unit is used for querying whether the domain name resolution library of the entry node has the IP address of the target server corresponding to the target website; and the address returning unit is used for returning the IP address of the target server to the terminal equipment if the IP address of the target server corresponding to the target website exists.
In an exemplary embodiment, the resolution result includes an IP address of the target server; the above-mentioned device still includes: and the request sending module is used for sending the content acquisition request of the target website to the target server according to the IP address of the target server.
In an exemplary embodiment, the zone hierarchy tree includes a plurality of zone nodes, each zone node including a pointer to a parent node of each zone node and a domain name resolution library of each zone.
In an exemplary embodiment, the parent query module 810 includes: a parent node determining unit configured to determine a parent node of the entry node according to a pointer of the parent node of the entry node; and the resolution library query unit is used for querying and obtaining the domain name resolution library of the father node of the entry node.
It is noted that the block diagrams shown in the above figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
Fig. 9 is a schematic structural diagram of an electronic device according to an example embodiment. It should be noted that the electronic device shown in fig. 9 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 9, the electronic apparatus 900 includes a Central Processing Unit (CPU) 901 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM) 902 or a program loaded from a storage section 908 into a Random Access Memory (RAM) 903. In the RAM903, various programs and data necessary for the operation of the system 900 are also stored. The CPU 901, ROM902, and RAM903 are connected to each other via a bus 904. An input/output (I/O) interface 905 is also connected to bus 904.
The following components are connected to the I/O interface 905: an input portion 906 including a keyboard, a mouse, and the like; an output portion 907 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 908 including a hard disk and the like; and a communication section 909 including a network interface card such as a LAN card, a modem, or the like. The communication section 909 performs communication processing via a network such as the internet. The drive 910 is also connected to the I/O interface 905 as necessary. A removable medium 911 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 910 as necessary, so that a computer program read out therefrom is mounted into the storage section 908 as necessary.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication section 909 and/or installed from the removable medium 911. The above-described functions defined in the system of the present disclosure are executed when the computer program is executed by a Central Processing Unit (CPU) 901.
It should be noted that the computer readable medium shown in the present disclosure may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present disclosure, a computer-readable signal medium may include a propagated data signal with computer-readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present disclosure may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes a transmitting unit, an obtaining unit, a determining unit, and a first processing unit. The names of these units do not in some cases constitute a limitation to the unit itself, and for example, the sending unit may also be described as a "unit sending a picture acquisition request to a connected server".
As another aspect, the present disclosure also provides a computer-readable medium, which may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: acquiring an analysis request, wherein the analysis request comprises an IP address of terminal equipment and a domain name of a target website; determining the area where the IP address of the terminal equipment is located; determining an entry node of a region hierarchical tree corresponding to the region; analyzing the analysis request according to the domain name analysis library of the entry node; if the resolution result is not obtained, inquiring a domain name resolution library of a father node of the entry node; and analyzing the analysis request according to the domain name analysis library of the father node of the entry node to obtain an analysis result.
Exemplary embodiments of the present disclosure are specifically illustrated and described above. It is to be understood that the disclosure is not limited to the precise arrangements, instrumentalities, or instrumentalities described herein; on the contrary, the disclosure is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
Claims (9)
1. A method for resource scheduling, comprising:
acquiring an analysis request, wherein the analysis request comprises an IP address of terminal equipment and a domain name of a target website;
determining the area where the IP address of the terminal equipment is located;
determining an entry node of a region level tree corresponding to the region; the regional hierarchical tree is of a bottom-up tree structure and comprises a plurality of regional nodes, and each regional node comprises a pointer of a father node of each regional node and a domain name resolution library of each region;
analyzing the analysis request according to the domain name analysis library of the entry node;
if the resolution result is not obtained, inquiring a domain name resolution library of a father node of the entry node;
and analyzing the analysis request according to the domain name analysis library of the father node of the entry node to obtain an analysis result.
2. The method of claim 1, wherein determining the area where the IP address of the terminal device is located comprises:
inquiring and obtaining a regional address node including the IP address of the terminal equipment in an IP address tree;
and determining the node with the lowest level in the area address nodes as the area where the IP address of the terminal equipment is located.
3. The method of claim 2, wherein the IP address tree comprises a plurality of regional address nodes, each regional address node configuring an address bank for each region and an entry node for each region in the regional hierarchical tree, wherein the address bank for a parent regional address node in the IP address tree comprises an address bank for a sub-region address node.
4. The method of claim 3, wherein resolving the resolution request according to a domain name resolution repository of the ingress node comprises:
inquiring whether the domain name resolution library of the entry node has the IP address of a target server corresponding to the target website;
and if the IP address of the target server corresponding to the target website exists, returning the IP address of the target server to the terminal equipment.
5. The method of claim 1, wherein the resolution result comprises an IP address of a target server; the method further comprises the following steps:
and sending a content acquisition request of the target website to the target server according to the IP address of the target server.
6. The method of claim 1, wherein querying a domain name resolution library of a parent node of the ingress node comprises:
determining a parent node of the entry node according to a pointer of the parent node of the entry node in the entry nodes;
and inquiring to obtain a domain name resolution library of the father node of the entry node.
7. An apparatus for resource scheduling, comprising:
the request acquisition module is used for acquiring an analysis request, wherein the analysis request comprises an IP address of the terminal equipment and a domain name of a target website;
the area determining module is used for determining the area where the IP address of the terminal equipment is located;
an entry node determining module, configured to determine an entry node of the area hierarchical tree corresponding to the area; the regional hierarchical tree is of a bottom-up tree structure and comprises a plurality of regional nodes, and each regional node comprises a pointer of a father node of each regional node and a domain name resolution library of each region;
the request analysis module is used for analyzing the analysis request according to the domain name analysis library of the entry node;
the father node query module is used for querying a domain name resolution library of the father node of the entry node if the resolution result is not obtained;
and the result obtaining module is used for analyzing the analysis request according to the domain name analysis library of the father node of the entry node to obtain an analysis result.
8. An electronic device, comprising:
at least one processor;
storage means for storing at least one program which, when executed by the at least one processor, causes the at least one processor to carry out the method of any one of claims 1 to 6.
9. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110726565.8A CN113364895B (en) | 2021-06-29 | 2021-06-29 | Method, device, electronic equipment and storage medium for resource scheduling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110726565.8A CN113364895B (en) | 2021-06-29 | 2021-06-29 | Method, device, electronic equipment and storage medium for resource scheduling |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113364895A CN113364895A (en) | 2021-09-07 |
| CN113364895B true CN113364895B (en) | 2023-01-13 |
Family
ID=77537116
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110726565.8A Active CN113364895B (en) | 2021-06-29 | 2021-06-29 | Method, device, electronic equipment and storage medium for resource scheduling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113364895B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115037720B (en) * | 2022-07-28 | 2024-07-05 | 北京有竹居网络技术有限公司 | Domain name resolution request processing method and device, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107438115A (en) * | 2017-09-11 | 2017-12-05 | 深圳市茁壮网络股份有限公司 | A kind of domain name analytic method, apparatus and system |
| WO2018112944A1 (en) * | 2016-12-23 | 2018-06-28 | 深圳前海达闼云端智能科技有限公司 | Domain name resolution method and apparatus |
| CN111385369A (en) * | 2018-12-28 | 2020-07-07 | 华为技术有限公司 | Domain name server distribution method and device |
| CN111404975A (en) * | 2019-01-02 | 2020-07-10 | 中国移动通信集团终端有限公司 | Message transmission method, device, equipment and computer storage medium |
-
2021
- 2021-06-29 CN CN202110726565.8A patent/CN113364895B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018112944A1 (en) * | 2016-12-23 | 2018-06-28 | 深圳前海达闼云端智能科技有限公司 | Domain name resolution method and apparatus |
| CN107438115A (en) * | 2017-09-11 | 2017-12-05 | 深圳市茁壮网络股份有限公司 | A kind of domain name analytic method, apparatus and system |
| CN111385369A (en) * | 2018-12-28 | 2020-07-07 | 华为技术有限公司 | Domain name server distribution method and device |
| CN111404975A (en) * | 2019-01-02 | 2020-07-10 | 中国移动通信集团终端有限公司 | Message transmission method, device, equipment and computer storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113364895A (en) | 2021-09-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110019350A (en) | Data query method and apparatus based on configuration information | |
| CN111597148B (en) | Distributed metadata management method for distributed file system | |
| CN109194714B (en) | File pushing method and device, terminal device and storage medium | |
| CN110866029B (en) | sql statement construction method, device, server and readable storage medium | |
| CN111680799B (en) | Method and device for processing model parameters | |
| CN110895534A (en) | Data splicing method, device, medium and electronic equipment | |
| CN114116065A (en) | Method and device for acquiring topological graph data object and electronic equipment | |
| CN109756584A (en) | Domain name analytic method, domain name mapping device and computer readable storage medium | |
| CN113760948A (en) | Data query method and device | |
| CN113886485A (en) | Data processing method, device, electronic equipment, system and storage medium | |
| CN113364895B (en) | Method, device, electronic equipment and storage medium for resource scheduling | |
| CN113190517B (en) | Data integration method and device, electronic equipment and computer readable medium | |
| CN116204428A (en) | Test case generation method and device | |
| CN116069725A (en) | File migration method, device, apparatus, medium and program product | |
| CN111026629A (en) | Method and device for automatically generating test script | |
| CN114765599B (en) | Subdomain name acquisition method and device | |
| CN117009430A (en) | Data management method, device, storage medium and electronic equipment | |
| US10114864B1 (en) | List element query support and processing | |
| CN110851561A (en) | Matching method and device for distribution sites | |
| CN112988857A (en) | Service data processing method and device | |
| CN111400623A (en) | Method and apparatus for searching information | |
| CN111475742A (en) | Address extraction method and device | |
| US12086183B2 (en) | Graph data structure edge profiling in MapReduce computational framework | |
| CN116305288B (en) | Method, device, equipment and storage medium for isolating database resources | |
| US11392662B1 (en) | Attribute inheritance of related objects for a digital object architecture |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20220129 Address after: 100007 room 205-32, floor 2, building 2, No. 1 and No. 3, qinglonghutong a, Dongcheng District, Beijing Applicant after: Tianyiyun Technology Co.,Ltd. Address before: No.31, Financial Street, Xicheng District, Beijing, 100033 Applicant before: CHINA TELECOM Corp.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |