CN114598701A - CDN scheduling method, system, computing device and storage medium - Google Patents
CDN scheduling method, system, computing device and storage medium Download PDFInfo
- Publication number
- CN114598701A CN114598701A CN202210141632.4A CN202210141632A CN114598701A CN 114598701 A CN114598701 A CN 114598701A CN 202210141632 A CN202210141632 A CN 202210141632A CN 114598701 A CN114598701 A CN 114598701A
- Authority
- CN
- China
- Prior art keywords
- edge node
- information
- request
- client
- resource
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
Abstract
The embodiment of the application provides a CDN scheduling method, a CDN scheduling system, computing equipment and a storage medium. In the embodiment of the application, a resource access request sent by a client is received through a first edge node, and a query request is sent to a scheduling center according to the resource access request; determining load information of the first edge node according to the query request through the scheduling center, determining whether the load capacity of the first edge node exceeds a capacity threshold value according to the load information, and if the load capacity exceeds the capacity threshold value, returning access information of a second edge node in the CDN, wherein the second edge node is used as a substitute node of the first edge node; and sending the access information of the second edge node and the resource response information responding to the resource access request to the client through the first edge node, so that the client performs subsequent access through the second edge node according to the access information of the second edge node. Enabling the edge nodes to be loaded for decompression. And simultaneously, the access experience of the user is ensured not to be reduced.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a CDN scheduling method, system, computing device, and storage medium.
Background
A Content Delivery Network (CDN) acceleration service has become an internet industry infrastructure, internet traffic is gradually increasing, traffic bursts are likely to occur during a non-working time period of a user according to behavior habits of internet users, monthly cost of the CDN is reduced in a bandwidth peak-eliminating manner to reduce bandwidth cost, the traffic bursts may cause higher load of some nodes of the CDN, and it is very important to reduce the node load and ensure that user access experience is not reduced.
Disclosure of Invention
Aspects of the present application provide a CDN scheduling method, system, computing device, and storage medium, so as to reduce a load of an edge node and ensure that a user access experience is not degraded.
The embodiment of the application provides a CDN scheduling method, wherein the CDN comprises a plurality of edge nodes and a scheduling center, and the method comprises the following steps: receiving a resource access request sent by a client through a first edge node; sending a query request to the scheduling center through a first edge node according to the resource access request so as to request the scheduling center to determine whether scheduling is needed; determining, by the scheduling center, load information of the first edge node according to the query request, determining whether load capacity of the first edge node exceeds a capacity threshold according to the load information, and if so, returning access information of a second edge node in the CDN, where the second edge node is used as a substitute node for the first edge node; and sending the access information of a second edge node and the resource response information responding to the resource access request to the client through the first edge node, so that the client performs subsequent access through the second edge node according to the access information of the second edge node.
The embodiment of the present application further provides a CDN scheduling method, including: receiving a resource access request sent by a client; sending a query request to a scheduling center according to the resource access request so that the scheduling center determines load information of a first edge node according to the query request, determines whether the load capacity of the first edge node exceeds a capacity threshold according to the load information, and returns access information of a second edge node in the CDN if the load capacity of the first edge node exceeds the capacity threshold, wherein the second edge node is used as a substitute node of the first edge node; and receiving access information of a second edge node sent by the dispatching center, and sending the access information of the second edge node and resource response information responding to the resource access request to the client so that the client performs subsequent access through the second edge node according to the access information of the second edge node.
An embodiment of the present application further provides a CDN scheduling system, including: the system comprises a first edge node, a second edge node and a dispatching center; the first edge node receives a resource access request sent by a client; the first edge node sends a query request to the scheduling center according to the resource access request so as to request the scheduling center to determine whether scheduling is needed; the scheduling center determines load information of the first edge node according to the query request, determines whether the load capacity of the first edge node exceeds a capacity threshold according to the load information, and returns access information of a second edge node in the CDN if the load capacity of the first edge node exceeds the capacity threshold, wherein the second edge node is used as a substitute node of the first edge node; and the first edge node sends the access information of a second edge node and the resource response information responding to the resource access request to the client so that the client performs subsequent access through the second edge node according to the access information of the second edge node.
An embodiment of the present application further provides a computing device, including: a memory, a processor; the memory for storing a computer program; the processor executing the computer program to: receiving a resource access request sent by a client; sending a query request to a scheduling center according to the resource access request so that the scheduling center determines load information of a first edge node according to the query request, determines whether the load capacity of the first edge node exceeds a capacity threshold according to the load information, and returns access information of a second edge node in the CDN if the load capacity of the first edge node exceeds the capacity threshold, wherein the second edge node is used as a substitute node of the first edge node; and receiving the access information of the second edge node sent by the dispatching center, and sending the access information of the second edge node and the resource response information responding to the resource access request to the client so that the client performs subsequent access through the second edge node according to the access information of the second edge node.
Embodiments of the present application also provide a computer-readable storage medium storing a computer program, which when executed by one or more processors causes the one or more processors to implement the steps of the above-mentioned method.
In the embodiment of the application, a resource access request sent by a client is received through a first edge node; sending a query request to a scheduling center through a first edge node according to a resource access request so as to request the scheduling center to determine whether scheduling is needed; determining load information of a first edge node according to the query request through a scheduling center, determining whether the load capacity of the first edge node exceeds a capacity threshold according to the load information, and if so, returning access information of a second edge node in the CDN, wherein the second edge node is used as a substitute node of the first edge node; and sending the access information of the second edge node and the resource response information responding to the resource access request to the client through the first edge node, so that the client performs subsequent access through the second edge node according to the access information of the second edge node.
The first edge node sends the access information of the second edge node and the resource response information responding to the resource access request to the client, so that the client can receive the resource response information to be accessed and can perform subsequent access according to the access information of the second edge node, the load of the first edge node can be reduced, and the load of the edge node is reduced. Meanwhile, the time consumption of access is not excessively increased, and the access experience of the user is not reduced.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
fig. 1 is a schematic flowchart of a CDN scheduling method according to an exemplary embodiment of the present application;
fig. 2 is a schematic diagram of a CDN scheduling process according to an exemplary embodiment of the present application;
fig. 3 is a schematic structural diagram of a CDN scheduling system according to an exemplary embodiment of the present application;
fig. 4 is a schematic flowchart of a CDN scheduling method according to an exemplary embodiment of the present application;
fig. 5 is a schematic structural diagram of a CDN scheduling device according to an exemplary embodiment of the present application;
fig. 6 is a schematic structural diagram of a computing device according to an exemplary embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions of the present application will be described in detail and completely with reference to the following specific embodiments of the present application and the accompanying drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
According to the foregoing, according to the behavior habits of users of the internet, traffic bursts easily occur in the non-working time periods of the users, and meanwhile, in order to reduce the bandwidth cost, the monthly cost of the users can be reduced in a bandwidth peak-eliminating manner, and it is very important to reduce the node load of the CDN, how to reduce the node load is caused by the traffic bursts, and meanwhile, it is ensured that the user access experience is not reduced.
In view of the foregoing problems, embodiments of the present application provide a CDN scheduling method, a CDN scheduling system, a computing device, and a storage medium, so that edge node load is reduced, and it is ensured that user access experience is not degraded.
The CDN scheduling process is described in detail below with reference to the method embodiment.
Fig. 1 is a flowchart illustrating a CDN scheduling method according to an exemplary embodiment of the present application. The method 100 provided by the embodiment of the present application is applied to a CDN network including a plurality of edge nodes and a scheduling center. The method 100 comprises the steps of:
101: and receiving a resource access request sent by a client through the first edge node.
102: and sending a query request to a scheduling center through the first edge node according to the resource access request so as to request the scheduling center to determine whether scheduling is needed.
103: through the dispatching center, determining load information of the first edge node according to the query request, determining whether the load capacity of the first edge node exceeds a capacity threshold according to the load information, and if so, returning access information of a second edge node in the CDN, wherein the second edge node is used as a substitute node of the first edge node.
104: and sending the access information of the second edge node and the resource response information responding to the resource access request to the client through the first edge node, so that the client performs subsequent access through the second edge node according to the access information of the second edge node.
It should be noted that, as shown in fig. 2, the CDN network 202 may have a plurality of nodes, and an edge node among the plurality of nodes, where the edge node may include a first edge node, such as the edge node a2021, and a second edge node, such as the edge node B2022. In addition, there may be a dispatch center 2023. There may also be upper nodes 2024 and source stations 2025.
In addition, other networks than the CDN network may be used as long as the network includes a plurality of nodes and a scheduling center. It is sufficient that the network architecture is similar to a CDN network.
The following is set forth in detail with respect to the above steps:
101: and receiving a resource access request sent by a client through the first edge node.
The first edge node refers to a node for providing resource information, such as an edge node in a CDN network. The physical form may be a server.
For example, a user may log in a video website through a web browser installed in a computer, and send a movie resource acquisition request, i.e., a resource access request, to the video website. Such as a user may enter a movie name on a page of a video website and click on a query. That is, the web browser sends the request through the computer. Before sending the request, an IP (Internet Protocol) address of a node that receives the request needs to be determined. The IP address of the edge node a in the CDN network, that is, the IP address of the first edge node, which may be a server having a relatively short physical distance, may be determined by a scheduling manner of a DNS (Domain Name System). And then, sending the request to an edge node A in the CDN network through the IP address.
As shown in fig. 2, the client 201, i.e. the web browser installed in the computer, executes step 211 to send a resource access request to the edge node a2021, i.e. the first edge node.
102: and sending a query request to a scheduling center through the first edge node according to the resource access request so as to request the scheduling center to determine whether scheduling is needed.
The scheduling center is a center for determining a scheduling policy. When a first edge node or a second edge node in the CDN network receives a normal request, it needs to access a scheduling center to determine a scheduling policy.
For example, according to the foregoing, after receiving the request, the edge node a may send an inquiry request to a scheduling center in the CDN network, and request whether to perform scheduling, that is, determine a corresponding scheduling policy.
As shown in fig. 2, the edge node a2021 performs step 212: sends a query request to the dispatch center 2023.
103: through the dispatching center, determining load information of the first edge node according to the query request, determining whether the load capacity of the first edge node exceeds a capacity threshold value according to the load information, and if the load capacity exceeds the capacity threshold value, returning access information of a second edge node in the CDN, wherein the second edge node is used as a substitute node of the first edge node.
Wherein, the load information may include: bandwidth, CPU (central processing unit), QPS (query rate per second), and other indicators.
The load capacity may be determined directly by load information, such as directly bandwidth, CPU, QPS. Or, a calculation may be performed according to the load information, such as a calculation of a weighting algorithm to obtain a capability value.
The access information may include an IP address or a domain name, etc.
For example, according to the foregoing, after receiving the request, the scheduling center may first query current load information of the edge node a, such as bandwidth, CPU, QPS, and the like, then may directly determine the corresponding load capacity, determine whether the current edge node a exceeds the capacity threshold according to the corresponding threshold, and if the current edge node a exceeds the capacity threshold, find out a substitute node from the load information recorded with other edge nodes, as a substitute node of the edge node a. The load capacity of the replacement node may not exceed the capacity threshold. And acquiring the recorded IP address or domain name of the substitute node, and returning to the edge node A.
As shown in fig. 2, the scheduling center 2023 returns the access information of the substitute node (e.g., the edge node B2022) to the edge node a2021 as the scheduling policy, that is, step 213 is executed: and sending the scheduling strategy.
In addition, in order to better determine the load information of the edge node, the node is also required to report the information at regular time.
Specifically, the method 100 further includes: sending the load information of the current first edge node to a dispatching center through the first edge node; and sending the load information of the current second edge node to the dispatching center through the second edge node.
For example, according to the foregoing, the edge node a may periodically obtain its own load information and send the information to the scheduling center. Similarly, the edge node B may also obtain its own load information at regular time and send it to the scheduling center. The dispatching center can record after receiving the message.
It should be noted that, the node may obtain the corresponding load information by itself after receiving the access request, then determine whether the load capacity of itself exceeds the threshold, and if so, may send an inquiry request to the scheduling center to request the corresponding scheduling policy. If not, the time to send the query request can be saved. However, it is still necessary to report its own load information to the scheduling center at regular time.
In addition, the method 100 further comprises: through the dispatching center, if the load capacity of the first edge node is determined not to exceed the capacity threshold, returning prompt information for not dispatching; and directly sending resource response information responding to the resource access request through the first edge node.
For example, according to the foregoing, if the scheduling center determines that the load capacity of the edge node a does not exceed the capacity threshold, the scheduling center may return a prompt message for not performing scheduling as the scheduling policy. After receiving the prompt message, the edge node a may directly respond to the request to query the corresponding movie information, and return the movie information to the client of the user, such as a web browser.
In addition, when the load capacity of the first edge node exceeds the capacity threshold, the method 100 further includes: and selecting a corresponding second edge node with the load capacity not exceeding the capacity threshold from a plurality of second edge nodes in the CDN as a substitute node of the first edge node through the scheduling center.
Since the foregoing has been set forth, further description is omitted herein. Only the description is as follows: when selecting the substitute node, the node with the good load capacity, i.e., the node with the minimum load capacity value, may be selected. Or to select the one that is the closest physical distance from the first edge node. Or randomly selecting an alternate node.
104: and sending the access information of the second edge node and the resource response information responding to the resource access request to the client through the first edge node, so that the client performs subsequent access through the second edge node according to the access information of the second edge node.
For example, according to the foregoing, after receiving the access information of the substitute node returned by the scheduling center, the edge node a may send the access information and the above-mentioned queried movie information to the client via the same data packet, so that the client can access through the substitute node in the subsequent access process.
As shown in fig. 2, the edge node a2021 sends the access information of the edge node B2022 and the queried movie information to the client 201. Step 214 is executed: and sending the resource response information and the access information.
In addition, the first edge node may not need to wait for the scheduling center to return the scheduling policy to perform the information response. After receiving the access request, the client may respond to the request, for example, returning the queried movie information to the client. And then receiving the scheduling strategy sent by the scheduling center. If the scheduling policy is to select an alternative node, a message may be sent to the corresponding client to inform the access information of the alternative node.
Specifically, the sending, by the first edge node, the access information of the second edge node and the resource response information in response to the resource access request to the client includes: and sending a preset response head, the access information of the second edge node and the resource response information responding to the resource access request to the client through the first edge node.
The preset response head is used for prompting the client to take the second edge node as a substitute node of the first edge node, so that the client caches the preset response head. I.e. prompt for an "alternative service" response header, such as the alt-svc response header.
For example, according to the foregoing, after receiving the access information of the substitute node, the edge node a uses the alt-svc response header as a response header of a data packet or a packet, and sends the access information of the edge node B and the queried movie information to the client, where the access information of the edge node B is carried in the data packet or the packet.
Since the request may include an http (hypertext Transfer Protocol) request and an https (hypertext Transfer Protocol over secure Layer) request. The transmission of different access information for different requests is performed in the following manner.
It should be noted that, the current mainstream browser already supports recognition of the alt-svc response header by default, and although the function of prompting "substitute service" can be implemented by using other custom response headers, modification adaptation needs to be performed on a client (such as a browser), and the modification amount of the client is large, which is not convenient enough.
Specifically, the sending, by the first edge node, the preset response header, the access information of the second edge node, and the resource response information in response to the resource access request to the client includes: and when the resource access request is an http request, sending a preset response header, the IP address of the second edge node and resource response information responding to the resource access request to the client through the first edge node.
For example, according to the foregoing, when the request is an http request, the edge node a uses the alt-svc response header as a response header of a data packet or a packet, and sends the IP address of the edge node B and the queried movie information to the client in the data packet or the packet. The packet or message may respond as follows: alt-svc: h2 ═ ip-B: 443; and ma is 300, wherein IP-B indicates that the edge node B corresponds to an IP address. Where ma in the response header alt-svc value refers to the substitute service validity period, i.e., the available time.
Specifically, the sending, by the first edge node, the preset response header, the access information of the second edge node, and the resource response information in response to the resource access request to the client includes: and when the resource access request is an https request, sending a preset response header, a domain name of the second edge node and resource response information responding to the resource access request to the client through the first edge node, so that the client obtains a corresponding IP address according to the domain name.
For example, according to the foregoing, when the request is an https request, the edge node a uses the alt-svc response header as a response header of a data packet or a packet, and sends the data packet or the packet with the domain name of the edge node B and the queried movie information to the client. The packet or message may respond as follows: alt-svc: h2 ═ ip-b.gslb.com: 443; and ma is 300, wherein the IP-b.gslb.com address represents a domain name corresponding to the IP address of the edge node B. The domain name may be resolved to the IP address of the edge node B through DNS. Where ma in the response header alt-svc value refers to the substitute service validity period, i.e., the time of availability.
It should be noted that the IP address or domain name of the alt-svc response header value indicates that the edge node B can be used as a substitute service node for the current resource, i.e., a substitute node for the edge node a. If the load of the edge node A is normal, the content of the current request resource can be directly responded without carrying a response header alt-svc. Therefore, node scheduling can be directly carried out by replacing the service response header alt-svc, and a scheduling request can be carried out while an access request is responded, so that the time consumption of the received access request is less increased, and the user experience is improved.
If there is no available time or when there is no time needed, the corresponding time information may not be carried by the corresponding request.
The client can perform caching after receiving the response header. In addition, other response heads can be customized to realize the method, but modification adaptation needs to be carried out on the client side, and the modification amount of the client side is large.
In order not to cause excessive load stress to the substitute node, the corresponding scheduling policy of the scheduling center is preset time once, that is, each time the corresponding scheduling policy has valid time, such as 300 s. The first edge node also needs to prompt the corresponding client for the validity time.
Specifically, the method 100 further includes: and sending the available time of the second edge node as the substitute node through the first edge node so that the client sends the corresponding resource access request to the second edge node at the available time, wherein the available time corresponds to the duration of one-time scheduling strategy of the scheduling center.
For example, as described above, when the request is an http request, the response alt-svc: h2 ═ ip-B:443 ″; ma is 300. When the request is an https request, responding alt-svc: h2 ═ ip-b.gslb.com:443 "; ma is 300. The ma in the response header alt-svc value refers to a substitute service validity period, that is, available time, and is defined according to the scheduling policy response time of the current scheduling center, so that real-time traffic scheduling can be realized according to the edge node load, and stable change of the node load can be realized, for example, if the current scheduling center generates a scheduling policy every 1 minute, the ma is 300s, and can be kept consistent with the scheduling policy change time (that is, duration).
After the client receives the access information of the second edge node, subsequent access can be performed according to the access information.
Specifically, after the client receives the access information of the second edge node, the method 100 further includes: and receiving a resource access request sent by the client through the second edge node, and responding to the resource access request and returning resource response information according to information which is carried by the resource access request and indicates that the second edge node is used as a substitute node.
For example, according to the foregoing, after receiving a packet or data packet sent by the edge node a, the client records the response header according to the response header alt-svc header therein, and when initiating the next request, if the client clicks to play the movie according to the queried movie information, that is, sends a request to play the movie, the client may initiate a request to the edge node B according to the IP of the edge node B specified in the alt-svc header in the response header. Here, the IP address may be directly specified, or may be a corresponding IP address resolved from the DNS according to the domain name. When a play request is sent, when the request is an http request, the request can simultaneously carry a request header alt-used: IP-B in a request header, and when the request is an https request, the request can simultaneously carry a request header alt-used: ipxxx.gslb.com in a request header, so as to identify that an IP address or a domain name of the substitute service edge node B is currently used, that is, to indicate that the edge node B node serves as a substitute node.
As can be seen from the above, as shown in fig. 2, the client 201 executes step 215: a resource access request is sent to the edge node B2022.
It should be noted that, when the request of the client arrives at the first edge node, the first edge node may add the "substitute service" response header alt-svc while giving priority to the response content, the current mainstream browser may already support to identify the preset response header by default, the browser may cache the current response header, and directly request other destination nodes specified in the alt-svc header, such as the second edge node, before the client cache service fails and at the time of initiating the next request within the available time.
After the second edge node receives the access request, it needs to determine whether the request is already scheduled, so as to respond to the request.
Specifically, the method 100 further includes: and receiving a resource access request sent by the client through the second edge node, sending a query request to the scheduling center according to the resource access request when the resource access request does not carry information indicating that the second edge node is taken as a substitute node, so as to request the scheduling center to determine whether scheduling is needed, and sending resource response information according to a scheduling result.
For example, according to the foregoing, after the edge node B receives the access request, when the request is an http request, a request header in the request carries alt-used: ip-B, or when the request is an https request, a request header in the request carries the alt-used: ipxxx.gslb.com, which indicates that the currently used address is already an alternative service address, that is, the currently used address is already an alternative node, the edge node B does not request the scheduling center any more, and does not return an alt-svc response header, and directly responds to the request and returns corresponding resource response information, for example, a video stream of a movie, and step 216 is executed: and sending the resource response information. Otherwise, the scheduling center is requested according to the above-mentioned manner, which is not described again.
It should be noted that, a location may also be returned for each request of the client through the scheduling center. However, the client does not respond to the request first, and the client skips to the destination node to make the request following the location, so that the response information of the request can be obtained, and thus, the time consumption of each request is increased, and the user experience is influenced. In addition, although the node may also determine whether to return the location according to its own pressure, when the node load is high, the client may increase time consumption of a part of requests due to the jump of the location, which affects user experience.
Fig. 3 is a schematic structural diagram of a CDN scheduling system according to an exemplary embodiment of the present application. As shown in fig. 3, the system 300 may include: a first edge node 301, a second edge node 302, and a dispatch center 303.
The first edge node 301, the second edge node 302, and the dispatch center 303 may be deployed in the CDN network. The first edge node 301 and the second edge node 302 belong to edge nodes, which may be implemented by server devices. The dispatch center 303 may also be implemented by a server device or a service cluster.
In addition, the system 300 may further include: a client deployed on the intelligent terminal 304.
Specifically, the first edge node 301 receives a resource access request sent by a client. The first edge node 301 sends a query request to the scheduling center 303 according to the resource access request, so as to request the scheduling center 303 to determine whether scheduling is required.
The scheduling center 303 determines load information of the first edge node 301 according to the query request, determines whether the load capacity of the first edge node 301 exceeds a capacity threshold according to the load information, and returns access information of a second edge node 302 in the CDN if the load capacity of the first edge node 301 exceeds the capacity threshold, where the second edge node 302 serves as a substitute node of the first edge node 301.
The first edge node 301 sends the access information of the second edge node 302 and the resource response information responding to the resource access request to the client, so that the client performs subsequent access through the second edge node 302 according to the access information of the second edge node 302.
In addition, after the client receives the access information of the second edge node 302, the second edge node 302 receives the resource access request sent by the client, and responds to the resource access request and returns resource response information according to the information indicating that the second edge node 302 is taken as a substitute node and carried by the resource access request.
In addition, the second edge node 302 receives the resource access request sent by the client, and when the resource access request does not carry information indicating that the second edge node 302 is used as a substitute node, sends a query request to the scheduling center 303 according to the resource access request, so as to request the scheduling center 303 to determine whether scheduling is needed, and sends resource response information according to a scheduling result.
In addition, the scheduling center 303 returns a prompt message for not performing scheduling if determining that the load capacity of the first edge node 301 does not exceed the capacity threshold; the resource response information in response to the resource access request is directly transmitted through the first edge node 301.
Specifically, the first edge node 301 sends a preset response header, access information of the second edge node 302, and resource response information in response to the resource access request to the client, where the preset response header is used to prompt the client to use the second edge node 302 as a substitute node for the first edge node 301, so that the client caches the preset response header.
Specifically, when the resource access request is an http request, the first edge node 301 sends a preset response header, an IP address of the second edge node 302, and resource response information in response to the resource access request to the client.
Specifically, when the resource access request is an https request, the first edge node 301 sends a preset response header, a domain name of the second edge node 302, and resource response information in response to the resource access request to the client, so that the client obtains a corresponding IP address according to the domain name.
In addition, the first edge node 301 sends the second edge node 302 as the available time of the substitute node, so that the client sends the corresponding resource access request to the second edge node 302 at the available time, and the available time corresponds to the duration of the primary scheduling policy of the scheduling center.
In addition, the first edge node 301 sends the current load information of the first edge node 301 to the dispatch center 303. The second edge node 302 sends the current load information of the second edge node 302 to the dispatch center 303.
In addition, when the load capacity of the first edge node 301 exceeds the capacity threshold, the dispatch center 303 selects a corresponding second edge node 302 whose load capacity does not exceed the capacity threshold from a plurality of second edge nodes 302 in the CDN network as a substitute node for the first edge node 301.
For the detailed description, please refer to the above description.
In a scenario of access scheduling in a CDN network, a user may log in a video website through an intelligent terminal 304, such as a web browser installed in a computer, and send a movie resource acquisition request, that is, a resource access request, to the video website. Such as a user may enter a movie name on a page of a video website and click on a query. That is, the web browser sends the request through the computer. Step 311 is executed: a resource access request is sent to the first edge node 301. Before sending the request, an IP (Internet Protocol) address of a node corresponding to the request needs to be determined. The IP address of the edge node a in the CDN network, that is, the IP address of the first edge node 301, may be determined by a scheduling manner of a DNS (Domain Name System ), and the first edge node 301 may be a server with a closer physical distance. And then, the request is sent to the edge node A in the CDN network through the IP address.
After receiving the request, the edge node a may send an inquiry request to the scheduling center 303 in the CDN network, to request whether to perform scheduling, that is, determine a corresponding scheduling policy, that is, execute step 313: sends a query request to dispatch center 303. After receiving the request, the scheduling center 303 may first query current load information of the edge node a, such as bandwidth, CPU, QPS, and the like, then may directly determine a corresponding load capacity, determine whether the current edge node a exceeds a capacity threshold according to the corresponding threshold, and if the current edge node a exceeds the capacity threshold, find out a substitute node from the load information recorded with other edge nodes, as a substitute node of the edge node a, that is, the second edge node 302. The load capacity of the replacement node may not exceed the capacity threshold. And acquiring the recorded IP address or domain name of the substitute node, and returning the IP address or domain name to the edge node a as a scheduling policy, that is, performing step 314: and sending the scheduling strategy to the edge node A.
After receiving the access information of the substitute node returned by the dispatching center, the edge node A can send the access information and the inquired movie information to the web browser through the same data packet, so that the web browser can access through the substitute node in the subsequent access process.
When the request is an http request, responding alt-svc: h2 ═ ip-B:443 "; ma is 300. When the request is an https request, responding alt-svc: h2 ═ ip-b.gslb.com:443 "; ma is 300. Step 312 is executed: and sending the resource response information and the access information of the second edge node.
After receiving the message or data packet sent by the edge node a, the web browser records the response header according to the alt-svc header therein, and when initiating the next request, if clicking to play the movie according to the inquired movie information, that is, sending a request for playing the movie, the web browser may initiate a request to the edge node B according to the IP of the edge node B specified in the alt-svc header in the response header or the IP address corresponding to the domain name. Step 315 is executed: a resource access request is sent. Here, the IP address may be directly specified, or may be a corresponding IP address resolved from the DNS according to the domain name. When a play request is sent, when the request is an http request, the request can simultaneously carry a request header alt-used: IP-B in a request header, and when the request is an https request, the request can simultaneously carry a request header alt-used: ipxxx.gslb.com in a request header, so as to identify that an IP address or a domain name of the substitute service edge node B is currently used, that is, to indicate that the edge node B node serves as a substitute node.
After receiving the access request, the edge node B carries the alt-used ip-B in the request header when the request is an http request, or carries the alt-used ipxxx. gslb. com when the request is an https request, which indicates that the currently used substitute service address is already an alternative node, that is, the edge node B does not request the scheduling center 303 any more, and does not return an alt-svc response header, and directly responds to the request to return corresponding resource response information, such as a video stream of a movie. Step 316 is executed: and sending the resource response information.
For the content not described in detail herein, reference may be made to the content described above, and thus, the description thereof is omitted.
In the present embodiment described above, the first edge node 301, the second edge node 302, and the scheduling center 303 perform network connection. If the first edge node 301, the second edge node 302 and the dispatch center 303 are communicatively connected, the network format of the mobile network may be any one of 2G (gsm), 2.5G (gprs), 3G (WCDMA, TD-SCDMA, CDMA2000, UTMS), 4G (LTE), 4G + (LTE +), WiMax, 5G, and the like.
Fig. 4 is a flowchart illustrating a CDN scheduling method according to an exemplary embodiment of the present application. The method 400 provided by the embodiment of the present application is applied to a server, which may belong to a first edge node (corresponding to the edge node described above) in a CDN network. The method 400 includes the steps of:
401: and receiving a resource access request sent by a client.
402: according to the resource access request, sending a query request to a scheduling center so that the scheduling center determines load information of a first edge node according to the query request, determines whether the load capacity of the first edge node exceeds a capacity threshold value according to the load information, and if the load capacity of the first edge node exceeds the capacity threshold value, returns access information of a second edge node in the CDN, and the second edge node serves as a substitute node of the first edge node.
403: and receiving the access information of the second edge node sent by the dispatching center, and sending the access information of the second edge node and the resource response information responding to the resource access request to the client so that the client performs subsequent access through the second edge node according to the access information of the second edge node.
It should be noted that the above steps 401-403 have been described in detail in the foregoing, and are not described herein again. For the content of failure, please refer to the above content, and will not be described again.
Fig. 5 is a schematic structural framework diagram of a CDN scheduling device according to an exemplary embodiment of the present application. The apparatus 500 may be applied to a computing device, such as a server. The apparatus 500 comprises: a receiving module 501 and a sending module 502; the following detailed description is directed to the functions of the various modules:
a receiving module 501, configured to receive a resource access request sent by a client.
A sending module 502, configured to send a query request to a scheduling center according to a resource access request, so that the scheduling center determines load information of a first edge node according to the query request, determines whether load capacity of the first edge node exceeds a capacity threshold according to the load information, and returns access information of a second edge node in the CDN if the load capacity of the first edge node exceeds the capacity threshold, where the second edge node serves as a substitute node for the first edge node.
The sending module 502 is configured to receive the access information of the second edge node sent by the scheduling center, send the access information of the second edge node and the resource response information responding to the resource access request to the client, so that the client performs subsequent access through the second edge node according to the access information of the second edge node.
For the content of the apparatus 500 that is not detailed above, reference is made to the above description, and thus, the description is not repeated.
While the internal functionality and structure of the apparatus 500 shown in FIG. 5 are described above, in one possible design, the structure of the apparatus 500 shown in FIG. 5 may be implemented as a computing device, such as a server. As shown in fig. 6, the apparatus 600 may include: a memory 601, a processor 602;
the memory 601 is used for storing computer programs.
A processor 602 for executing a computer program for: receiving a resource access request sent by a client; sending a query request to a scheduling center according to a resource access request so that the scheduling center can determine load information of a first edge node according to the query request, determine whether the load capacity of the first edge node exceeds a capacity threshold value according to the load information, and if the load capacity of the first edge node exceeds the capacity threshold value, return access information of a second edge node in the CDN, wherein the second edge node serves as a substitute node of the first edge node; and receiving the access information of the second edge node sent by the dispatching center, and sending the access information of the second edge node and the resource response information responding to the resource access request to the client so that the client performs subsequent access through the second edge node according to the access information of the second edge node.
For the content that is not detailed in the apparatus 600, reference is made to the foregoing description, and thus, the description is not repeated.
Embodiments of the present invention provide a computer storage medium, and when executed by one or more processors, cause the one or more processors to implement the steps of a CDN scheduling method in the method embodiment of fig. 4. Will not be redundantly described.
In addition, in some of the flows described in the above embodiments and the drawings, a plurality of operations are included in a specific order, but it should be clearly understood that the operations may be executed out of the order presented herein or in parallel, and the sequence numbers of the operations, such as 101, 102, 103, etc., are merely used for distinguishing different operations, and the sequence numbers do not represent any execution order per se. Additionally, the flows may include more or fewer operations, and the operations may be performed sequentially or in parallel. It should be noted that, the descriptions of "first", "second", etc. in this document are used for distinguishing different messages, devices, modules, etc., and do not represent a sequential order, nor limit the types of "first" and "second" to be different.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by adding a necessary general hardware platform, and of course, can also be implemented by a combination of hardware and software. With this understanding in mind, the above-described aspects and portions of the present technology which contribute substantially or in part to the prior art may be embodied in the form of a computer program product, which may be embodied on one or more computer-usable storage media having computer-usable program code embodied therein, including without limitation disk storage, CD-ROM, optical storage, and the like.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable multimedia data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable multimedia data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable multimedia data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable multimedia data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both permanent and non-permanent, removable and non-removable media, may implement the information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (14)
1. A CDN scheduling method is characterized in that the CDN comprises a plurality of edge nodes and a scheduling center, and the method comprises the following steps:
receiving a resource access request sent by a client through a first edge node;
sending a query request to the scheduling center through a first edge node according to the resource access request so as to request the scheduling center to determine whether scheduling is needed;
determining, by the scheduling center, load information of the first edge node according to the query request, determining whether load capacity of the first edge node exceeds a capacity threshold according to the load information, and if so, returning access information of a second edge node in the CDN, where the second edge node is used as a substitute node for the first edge node;
and sending access information of a second edge node and resource response information responding to the resource access request to the client through the first edge node, so that the client performs subsequent access through the second edge node according to the access information of the second edge node.
2. The method of claim 1, wherein after the client receives the access information of the second edge node, the method further comprises:
and receiving a resource access request sent by the client through a second edge node, and responding to the resource access request and returning resource response information according to information which represents that the second edge node is taken as a substitute node and is carried by the resource access request.
3. The method according to claim 1 or 2, characterized in that the method further comprises:
and receiving a resource access request sent by the client through a second edge node, sending a query request to the scheduling center according to the resource access request when the resource access request does not carry information indicating that the second edge node is used as a substitute node, so as to request the scheduling center to determine whether scheduling is needed, and sending resource response information according to a scheduling result.
4. The method of claim 1, further comprising:
through the dispatching center, if the load capacity of the first edge node is determined not to exceed the capacity threshold, returning prompt information for not dispatching;
and directly sending resource response information responding to the resource access request through the first edge node.
5. The method according to claim 1, wherein the sending, by the first edge node, the access information of the second edge node and the resource response information in response to the resource access request to the client comprises:
and sending a preset response head, access information of a second edge node and resource response information responding to the resource access request to the client through the first edge node, wherein the preset response head is used for prompting the client to take the second edge node as a substitute node of the first edge node, so that the client caches the preset response head.
6. The method of claim 5, wherein sending, by the first edge node, a preset response header, access information of a second edge node, and resource response information in response to the resource access request to the client comprises:
and when the resource access request is an http request, sending a preset response header, an IP address of a second edge node and resource response information responding to the resource access request to the client through the first edge node.
7. The method of claim 5, wherein sending, by the first edge node, a preset response header, access information of a second edge node, and resource response information in response to the resource access request to the client comprises:
and when the resource access request is an https request, sending a preset response header, a domain name of a second edge node and resource response information responding to the resource access request to the client through the first edge node, so that the client acquires a corresponding IP address according to the domain name.
8. The method of claim 5, further comprising:
and sending, by the first edge node, an available time of the second edge node as a substitute node, so that the client sends a corresponding resource access request to the second edge node at the available time, where the available time corresponds to a duration of a primary scheduling policy of a scheduling center.
9. The method of claim 1, further comprising:
sending load information of the current first edge node to the dispatching center through the first edge node;
and sending the load information of the current second edge node to the dispatching center through the second edge node.
10. The method of claim 1, wherein when the load capacity of the first edge node exceeds a capacity threshold, the method further comprises:
and selecting a corresponding second edge node with the load capacity not exceeding a capacity threshold from a plurality of second edge nodes in the CDN as a substitute node of the first edge node through the scheduling center.
11. A CDN scheduling method is characterized by comprising the following steps:
receiving a resource access request sent by a client;
sending a query request to a scheduling center according to the resource access request so that the scheduling center determines load information of a first edge node according to the query request, determines whether the load capacity of the first edge node exceeds a capacity threshold according to the load information, and returns access information of a second edge node in the CDN if the load capacity of the first edge node exceeds the capacity threshold, wherein the second edge node is used as a substitute node of the first edge node;
and receiving access information of a second edge node sent by the dispatching center, and sending the access information of the second edge node and resource response information responding to the resource access request to the client so that the client performs subsequent access through the second edge node according to the access information of the second edge node.
12. A CDN scheduling system is characterized by comprising a first edge node, a second edge node and a scheduling center;
the first edge node receives a resource access request sent by a client;
the first edge node sends a query request to the scheduling center according to the resource access request so as to request the scheduling center to determine whether scheduling is needed;
the scheduling center determines load information of the first edge node according to the query request, determines whether the load capacity of the first edge node exceeds a capacity threshold according to the load information, and returns access information of a second edge node in the CDN if the load capacity of the first edge node exceeds the capacity threshold, wherein the second edge node is used as a substitute node of the first edge node;
and the first edge node sends the access information of a second edge node and the resource response information responding to the resource access request to the client so that the client performs subsequent access through the second edge node according to the access information of the second edge node.
13. A computing device, comprising: a memory, a processor;
the memory for storing a computer program;
the processor executing the computer program to:
receiving a resource access request sent by a client;
sending a query request to a scheduling center according to the resource access request so that the scheduling center determines load information of a first edge node according to the query request, determines whether the load capacity of the first edge node exceeds a capacity threshold according to the load information, and returns access information of a second edge node in the CDN if the load capacity of the first edge node exceeds the capacity threshold, wherein the second edge node is used as a substitute node of the first edge node;
and receiving access information of a second edge node sent by the dispatching center, and sending the access information of the second edge node and resource response information responding to the resource access request to the client so that the client performs subsequent access through the second edge node according to the access information of the second edge node.
14. A computer-readable storage medium storing a computer program, wherein the computer program, when executed by one or more processors, causes the one or more processors to perform the steps of the method of claim 11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210141632.4A CN114598701B (en) | 2022-02-16 | 2022-02-16 | CDN scheduling method, CDN scheduling system, computing device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210141632.4A CN114598701B (en) | 2022-02-16 | 2022-02-16 | CDN scheduling method, CDN scheduling system, computing device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114598701A true CN114598701A (en) | 2022-06-07 |
| CN114598701B CN114598701B (en) | 2023-08-22 |
Family
ID=81805601
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210141632.4A Active CN114598701B (en) | 2022-02-16 | 2022-02-16 | CDN scheduling method, CDN scheduling system, computing device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114598701B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103297472A (en) * | 2012-03-01 | 2013-09-11 | 上海盛霄云计算技术有限公司 | Redirection method and content distribution node applied to content distribution network |
| CN103873497A (en) * | 2012-12-11 | 2014-06-18 | 中国电信股份有限公司 | Method, device and system for scheduling information |
| CN105763628A (en) * | 2016-04-12 | 2016-07-13 | 上海帝联信息科技股份有限公司 | Data access request processing method and device, edge node server and edge cluster |
| US20170171344A1 (en) * | 2015-12-15 | 2017-06-15 | Le Holdings (Beijing) Co., Ltd. | Scheduling method and server for content delivery network service node |
| CN110336848A (en) * | 2019-04-23 | 2019-10-15 | 网宿科技股份有限公司 | A kind of dispatching method and scheduling system, equipment of access request |
| CN111355731A (en) * | 2020-02-28 | 2020-06-30 | 北京奇艺世纪科技有限公司 | Resource access method, device, resource access system, equipment and storage medium |
| US20200304555A1 (en) * | 2019-03-18 | 2020-09-24 | Beijing Baidu Netcom Science And Technology Co., Ltd. | Method and apparatus for determining access path of content delivery network |
| CN113037878A (en) * | 2021-05-26 | 2021-06-25 | 北京拓课网络科技有限公司 | CDN data access method, system and electronic equipment |
| CN113497817A (en) * | 2020-03-20 | 2021-10-12 | 北京金山云网络技术有限公司 | Traffic scheduling method and device, edge node of CDN (content delivery network) and server |
| US20210368239A1 (en) * | 2018-05-14 | 2021-11-25 | Wangsu Science & Technology Co., Ltd. | Distributing method, system, edge node, and central scheduling system for streaming media resource |
| WO2022001732A1 (en) * | 2020-06-29 | 2022-01-06 | 中兴通讯股份有限公司 | Cdn scheduling method, access device, cdn scheduler, and storage medium |
| CN113973136A (en) * | 2020-07-07 | 2022-01-25 | 中国移动通信集团广东有限公司 | Traffic scheduling method, device and system |
-
2022
- 2022-02-16 CN CN202210141632.4A patent/CN114598701B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103297472A (en) * | 2012-03-01 | 2013-09-11 | 上海盛霄云计算技术有限公司 | Redirection method and content distribution node applied to content distribution network |
| CN103873497A (en) * | 2012-12-11 | 2014-06-18 | 中国电信股份有限公司 | Method, device and system for scheduling information |
| US20170171344A1 (en) * | 2015-12-15 | 2017-06-15 | Le Holdings (Beijing) Co., Ltd. | Scheduling method and server for content delivery network service node |
| CN105763628A (en) * | 2016-04-12 | 2016-07-13 | 上海帝联信息科技股份有限公司 | Data access request processing method and device, edge node server and edge cluster |
| US20210368239A1 (en) * | 2018-05-14 | 2021-11-25 | Wangsu Science & Technology Co., Ltd. | Distributing method, system, edge node, and central scheduling system for streaming media resource |
| US20200304555A1 (en) * | 2019-03-18 | 2020-09-24 | Beijing Baidu Netcom Science And Technology Co., Ltd. | Method and apparatus for determining access path of content delivery network |
| CN110336848A (en) * | 2019-04-23 | 2019-10-15 | 网宿科技股份有限公司 | A kind of dispatching method and scheduling system, equipment of access request |
| CN111355731A (en) * | 2020-02-28 | 2020-06-30 | 北京奇艺世纪科技有限公司 | Resource access method, device, resource access system, equipment and storage medium |
| CN113497817A (en) * | 2020-03-20 | 2021-10-12 | 北京金山云网络技术有限公司 | Traffic scheduling method and device, edge node of CDN (content delivery network) and server |
| WO2022001732A1 (en) * | 2020-06-29 | 2022-01-06 | 中兴通讯股份有限公司 | Cdn scheduling method, access device, cdn scheduler, and storage medium |
| CN113973136A (en) * | 2020-07-07 | 2022-01-25 | 中国移动通信集团广东有限公司 | Traffic scheduling method, device and system |
| CN113037878A (en) * | 2021-05-26 | 2021-06-25 | 北京拓课网络科技有限公司 | CDN data access method, system and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114598701B (en) | 2023-08-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20180205976A1 (en) | Method and apparatus of obtaining video fragment | |
| US10404790B2 (en) | HTTP scheduling system and method of content delivery network | |
| TWI657682B (en) | Method and system for realizing precise dispatch request on content distribution network (CDN) | |
| CN107707943B (en) | A kind of method and system for realizing cloud service fusion | |
| CN102301682B (en) | Method and system for network caching, domain name system redirection sub-system thereof | |
| CN111966289B (en) | Partition optimization method and system based on Kafka cluster | |
| CN101645928A (en) | Content resource caching method, device and system | |
| JP2017037666A (en) | Sending category information | |
| EP2493191B1 (en) | Method, device and system for realizing hierarchically requesting content in http streaming system | |
| CN101540775A (en) | Method and device for distributing contents and network system for distributing contents | |
| JP2013525931A (en) | Dynamic binding used for content delivery | |
| CN107105013B (en) | File processing method, server, terminal and system | |
| US20220353314A1 (en) | Network data scheduling method and edge node thereof | |
| CN110838932A (en) | Network current limiting method and device and electronic equipment | |
| EP3338409B1 (en) | Method for dynamically managing a network service in a communication network | |
| EP1627500B1 (en) | Service management using multiple service location managers | |
| CN113641505B (en) | Resource allocation control method and device for server cluster | |
| CN110958279B (en) | Data processing method and device | |
| CN106209952B (en) | Service node distribution method and device, CDN management server and system | |
| CN113301079B (en) | Data acquisition method, system, computing device and storage medium | |
| CN112311826B (en) | Method, device and system for processing access request in content distribution system | |
| CN114598701B (en) | CDN scheduling method, CDN scheduling system, computing device and storage medium | |
| CN112019604A (en) | Edge data transmission method and system | |
| CN112579639A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN111090818A (en) | Resource management method, resource management system, server, and computer storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |