Data processing method and apparatus, and computing node for updating container images
Summary by NHIP
Multi-cluster container image update
The method updates container images across multiple edge computing clusters by receiving instructions from a remote data center. Each cluster selects a specific agent node to distribute the image, reducing download time for all nodes.
Claim Score by NHIP
Abstract
A data processing method and apparatus are disclosed. The data processing method includes: receiving, by a first edge computing node in an edge computing cluster, a container image update instruction; obtaining, by the first edge computing node, a to-be-updated container image; and sending, by the first edge computing node, the to-be-updated container image to another edge computing node in the edge computing cluster. The first edge computing node is an edge computing node in the edge computing cluster, the edge computing cluster includes at least two edge computing nodes, and the container image update instruction is used to instruct the at least two edge computing nodes in the edge computing cluster to update a container image. In this way, the time required for downloading the container image is reduced.

Term
12.8 yearsleft in the term
Expires 1 July 2039.
- Priority
- Filed
- Granted
- Today
- Expires
21 claims: 3 independent, 18 dependent
- 1A data processing method performed by a plurality of edge computing clusters including a first edge computing cluster and a second edge computing cluster, the first edge computing cluster and the second edge computing cluster each including a plurality of edge computing nodes connected by a local area network, comprising:receiving, by a first edge computing node and a second edge computing node, a container image update instruction from a remote data center via a public network, wherein the first edge computing node is one of the plurality of edge computing nodes in the first edge computing cluster, the second edge computing node is one of the plurality of edge computing nodes in the second edge computing cluster, the container image update instruction instructs each of the plurality of edge computing nodes in the first edge computing cluster and each of the plurality of edge computing nodes in the second edge computing cluster to update a container image, and the container image is software deployed on each of the plurality of edge computing nodes in the first edge computing cluster and each of the plurality of edge computing nodes in the second edge computing cluster for processing data obtained by the respective edge computing node;in response to the container image update instruction received from the remote data center, selecting, by each of the first edge computing node and the second edge computing node, an edge computing node from the plurality of edge computing nodes in the respective edge computing cluster as an agent node for the respective edge computing cluster;obtaining, by the agent node for the first edge computing cluster, a to-be-updated container image from the remote data center via the public network;and sending, by the agent node for the first edge computing cluster, the obtained to-be-updated container image to another edge computing node in the first edge computing cluster via the local area network, wherein the agent node for the first edge computing cluster can be any edge computing node within the first edge computing cluster, and said another edge computing node can be any edge computing node within the first edge computing cluster that is not the agent node for the first edge computing cluster.
- 11A computing node, comprising at least one processor and a memory, wherein the memory is configured to store computer readable instructions that, when executed by the at least one processor, cause the computing node to perform operations comprising:receiving a container image update instruction from a remote data center via a public network, wherein the container image update instruction is sent from a remote data center to a plurality of edge computing clusters including a first edge computing cluster and a second edge computing cluster, the first edge computing cluster and the second edge computing cluster each includes a plurality of edge computing nodes connected by a local area network, the computing node is one of the plurality of edge computing nodes in the first edge computing cluster, the container image update instruction instructs each of the plurality of edge computing nodes in the first edge computing cluster and each of the plurality of edge computing nodes in the second edge computing cluster to update a container image, and the container image is software deployed on each of the plurality of edge computing nodes in the first edge computing cluster and each of the plurality of edge computing nodes in the second edge computing cluster for processing data obtained by the respective edge computing node;and in response to the container image update instruction received from the remote data center, selecting an edge computing node from the plurality of edge computing nodes in the first edge computing cluster as an agent node for the first edge computing cluster, wherein another agent node is selected by one of the plurality of edge computing nodes in the second edge computing cluster for the second edge computing cluster, wherein the agent node for the first edge computing cluster is configured to obtain a to-be-updated container image from the remote data center via the public network, and send the obtained to-be-updated container image to another edge computing node in the first edge computing cluster via the local area network, wherein the agent node for the first edge computing cluster can be any edge computing node within the first edge computing cluster, and said another edge computing node can be any edge computing node within the first edge computing cluster that is not the agent node for the first edge computing cluster.
- 17Broadest claimClaim Score 19, narrow(NHIP)A non-transitory computer-readable storage medium comprising instructions that, when executed by a computing node, cause the computing node to perform operations comprising:receiving a container image update instruction from a remote data center via a public network, wherein the container image update instruction is sent from a remote data center to a plurality of edge computing clusters including a first edge computing cluster and a second edge computing cluster, the first edge computing cluster and the second edge computing cluster each includes plurality of edge computing nodes connected by a local area network, the computing node is one of the plurality of edge computing nodes in the first edge computing cluster, the container image update instruction instructs each of the plurality of edge computing nodes in the first edge computing cluster and each of the plurality of edge computing nodes in the second edge computing cluster to update a container image, and the container image is software deployed on each of the plurality of edge computing nodes in the first edge computing cluster and each of the plurality of edge computing nodes in the second edge computing cluster for processing data obtained by the respective edge computing node;and in response to the container image update instruction received from the remote data center, selecting an edge computing node from the plurality of edge computing nodes in the first edge computing cluster as an agent node for the first edge computing cluster, wherein another agent node is selected by one of the plurality of edge computing nodes in the second edge computing cluster for the second edge computing cluster, wherein the agent node for the first edge computing cluster is configured to obtain a to-be-updated container image from the remote data center via the public network, and send the obtained to-be-updated container image to another edge computing node in the first edge computing cluster via the local area network, wherein the agent node for the first edge computing cluster can be any edge computing node within the first edge computing cluster, and said another edge computing node can be any edge computing node within the first edge computing cluster that is not the agent node for the first edge computing cluster.
Independent claims3
119 paragraphs in 6 sections, as filed
CROSS-REFERENCE TO RELATED APPLICATIONS
0001This application is a continuation of International Patent Application No. PCT/CN2019/094143, filed on Jul. 1, 2019, which claims priority to Chinese Patent Application No. 201811061918.1, filed on Sep. 12, 2018. The disclosures of the aforementioned applications are hereby incorporated by reference in their entireties.
TECHNICAL FIELD
0002This application relates to the communications field, and in particular, to a data processing method and apparatus, and a computing node.
BACKGROUND
0003In a network topology of an edge computing scenario, a plurality of edge computing nodes form an edge computing cluster. The edge computing cluster is connected to a remote data center through a network switching device, and each edge computing node in the edge computing cluster may be connected to one or more sensors. In this way, after collecting data, the sensor first transmits the data to the edge computing node, and the edge computing node processes the data and sends a processing result to the data center.
0004In the network topology, software used to process the data collected by the sensor runs on each edge computing node, and is deployed in a container in an image manner. The software may be referred to as a container image. The data center usually needs to upgrade container images running on some edge computing nodes in the network topology. During the upgrade, the data center sends, to an edge computing cluster that needs to be upgraded, a request message that includes an identifier of a to-be-upgraded container image. Each edge computing node in the edge computing cluster downloads, from the data center, the container image corresponding to the identifier, to upgrade the to-be-upgraded container image.
0005In a process of implementing this application, the inventor found that a conventional technology has at least the following problems.
0006Currently, when a network bandwidth between a network switching device and a data center is limited, and when a plurality of edge computing nodes connected to the network switching device need to download a container image, due to the limitation on the network bandwidth, the plurality of edge computing nodes may need a relatively long time to download the container image from the data center.
SUMMARY
0007To resolve a problem in a conventional technology that a process of downloading a container image consumes a long time because a network bandwidth between an edge computing node and a data center is limited, example embodiments of this application provide a data processing method and apparatus, and a computing node. The technical solutions are described as follows.
0008According to a first aspect, an embodiment of this application provides a data processing method. In the method, an edge computing cluster includes at least two edge computing nodes, and any edge computing node in the edge computing cluster is referred to as a first edge computing node for ease of description. The first edge computing node receives a container image update instruction, where the container image update instruction is used to instruct the at least two edge computing nodes in the edge computing cluster to update a container image, obtains a to-be-updated container image, and sends the to-be-updated container image to another edge computing node in the edge computing cluster. Because edge computing nodes in the edge computing cluster are located in a same local area network, a network bandwidth between any two nodes in the edge computing cluster is relatively large. In this way, the first edge computing node can quickly send the container image to another edge computing node, to reduce the time required by each edge computing node in the edge computing cluster to obtain the container image.
0009In an embodiment, after the first edge computing node receives the container image update instruction, the first edge computing node selects an edge computing node from the edge computing cluster as an agent node. After the agent node is selected, the container image may be downloaded from a data center by using the agent node, so that the agent node may exclusively occupy a network bandwidth between the edge computing cluster and the data center, to reduce the time required by the agent node to download the container image. Then, the agent node sends the container image to another agent node, to reduce the time required by each edge computing node in the edge computing cluster to obtain the container image.
0010In another embodiment, the first edge computing node obtains a performance parameter of each edge computing node in the edge computing cluster, where the performance parameter is used to indicate resource usage of each edge computing node, determines load of each edge computing node based on the performance parameter of each edge computing node, sorts edge computing nodes in the edge computing cluster based on the load of each edge computing node, and selects an edge computing node with the lowest load as the agent node. Because the edge computing node with the lowest load is selected as the agent node, the agent node has the fastest speed of downloading the container image from the data center, to minimize the time required by the agent node to download the container image.
0011In another embodiment, when the first edge computing node is used as the agent node in the edge computing cluster, obtaining the to-be-updated container image, where the first edge computing node is an edge computing node with the lowest load. Because the first edge computing node is the edge computing node with the lowest load, the first edge computing node has the fastest speed of obtaining the container image, to minimize the time required by the first edge computing node to obtain the container image.
0012In another embodiment, the first edge computing node randomly selects an edge computing node from the edge computing cluster as the agent node, or selects an edge computing node from the edge computing cluster as the agent node based on an identifier of the edge computing node.
0013In another embodiment, when the agent node is not the first edge computing node, the first edge computing node obtains the to-be-updated container image from the agent node, where the to-be-updated container image is obtained by the agent node from the data center. Because the first edge computing node and the agent node are located in a same local area network, a network bandwidth between the first edge computing node and the agent node is relatively large. In this way, the first edge computing node can quickly obtain the container image from the agent node, to reduce the time required for obtaining the container image.
0014In another embodiment, each edge computing node in the edge computing cluster is connected to the data center through a network switching device.
0015According to a second aspect, an embodiment of this application provides a data processing apparatus, configured to perform the method in the first aspect or any embodiment of the first aspect. Specifically, the apparatus includes units configured to perform the method in the first aspect or any embodiment of the first aspect.
0016According to a third aspect, an embodiment of this application provides a computing node, including a processor, a memory, a communications interface, and a bus, where the processor, the memory, and the communications interface are connected and communicate with each other through the bus, the memory is configured to store one or more computer readable instructions, and when the computing node runs, the processor executes the one or more computer readable instructions in the memory to perform the operation steps of the method in the first aspect or any embodiment of the first aspect by using a hardware resource in the computing node.
0017According to a fourth aspect, an embodiment of this application provides a data processing system, where the system includes a data center and at least one edge computing node, and the edge computing node and the data center are configured to perform operation steps of the method performed by the data center and the computing node when the data center and the computing node are execution bodies in the first aspect or any embodiment of the first aspect.
0018According to a fifth aspect, an embodiment of this application provides a computer program product, where the computer program product includes a computer program stored in a computer-readable storage medium, and the computer program is loaded by a processor to implement the method in the first aspect or any embodiment of the first aspect.
0019According to a sixth aspect, an embodiment of this application provides a non-volatile computer-readable storage medium, configured to store a computer program, where the computer program is loaded by a processor to execute one or more instructions in the first aspect or any embodiment of the first aspect.
0020According to a seventh aspect, an embodiment of this application provides a chip, where the chip includes a programmable logic circuit and/or one or more program instructions, and when running, the chip is configured to implement the method in the first aspect or any embodiment of the first aspect.
0021In this application, the implementations provided in the foregoing aspects may be further combined to provide more implementations.
BRIEF DESCRIPTION OF DRAWINGS
0022<figref idref="DRAWINGS">FIG. <b>1</b></figref> is a schematic diagram of a network architecture according to an embodiment of this application;
0023<figref idref="DRAWINGS">FIG. <b>2</b></figref> is a schematic diagram of a K8S architecture according to an embodiment of this application;
0024<figref idref="DRAWINGS">FIG. <b>3</b></figref> is a schematic diagram of a structure of a software stack of an edge computing node according to an embodiment of this application;
0025<figref idref="DRAWINGS">FIG. <b>4</b></figref> is a flowchart of a data processing method according to an embodiment of this application;
0026<figref idref="DRAWINGS">FIG. <b>5</b></figref> is a schematic diagram of a structure of a data processing apparatus according to an embodiment of this application; and
0027<figref idref="DRAWINGS">FIG. <b>6</b></figref> is a schematic diagram of a structure of a computing node according to an embodiment of this application.
DESCRIPTION OF EMBODIMENTS
0028The following further describes in detail the embodiments of this application with reference to accompanying drawings.
0029<figref idref="DRAWINGS">FIG. <b>1</b></figref> is a schematic diagram of a network architecture according to an embodiment of this application. The network architecture includes at least one edge computing cluster <b>10</b>, a network switching device <b>2</b> and a data center <b>3</b> that corresponds to each edge computing cluster <b>10</b>, and each edge computing cluster <b>10</b> includes at least two edge computing nodes <b>1</b>. For each edge computing cluster <b>10</b>, each edge computing node is connected to the network switching device <b>2</b> corresponding to the edge computing cluster <b>10</b>, to form a local area network. The network switching device <b>2</b> is connected to a public network <b>5</b>, and is connected to the remote data center <b>3</b> through the public network <b>5</b>. The public network <b>5</b> can be a wired or wireless network. The network switching device <b>2</b> includes a wireless router, a wired router, or the like. Any two edge computing nodes <b>1</b> in a same local area network are directly connected to each other or connected to each other through the switch, and the network bandwidth between any two edge computing nodes <b>1</b> is relatively large and is greater than the network bandwidth between the network switching device <b>2</b> and the data center <b>3</b>.
0030Each edge computing node <b>1</b> includes at least one container, a container image is deployed in the container, and the container image includes software, an application, a data analysis algorithm model, or the like that is used to process data.
0031Optionally, the container image in the edge computing node <b>1</b> may be deployed on the edge computing node <b>1</b> when the edge computing node <b>1</b> is delivered from a factory, or may be installed on the edge computing node <b>1</b> after the edge computing node <b>1</b> is delivered from a factory.
0032Optionally, referring to <figref idref="DRAWINGS">FIG. <b>1</b></figref>, the edge computing node <b>1</b> may further be connected to at least one collection device <b>4</b>. The edge computing node <b>1</b> may process, by using the container image included in the edge computing node <b>1</b>, data collected by the at least one collection device <b>4</b>, and then send a processing result to the data center <b>3</b>. Alternatively, the edge computing node <b>1</b> may process, by using the container image included in the edge computing node <b>1</b>, data that is received by the edge computing node <b>1</b> and that is sent by the data center, and then send a processing result to the data center <b>3</b>.
0033The network architecture shown in <figref idref="DRAWINGS">FIG. <b>1</b></figref> may be used in a current field of intelligent transportation or security protection. For example, in the field of security protection, the collection device <b>4</b> may be a camera, and the edge computing node <b>1</b> may include a container image used to extract a face model. In this way, the camera may shoot a frame of video picture, and each time a frame of video picture is shot, the video picture may be sent to the edge computing node <b>1</b> connected to the camera. The edge computing node <b>1</b> receives the video picture, detects, by using the container image included in the edge computing node <b>1</b>, whether the video picture includes a face image, and if the video picture includes the face image, extracts a face model corresponding to the face image, and sends the face model to the data center.
0034Maintenance personnel may periodically or aperiodically develop a new version of the container image. In this case, the container image in the edge computing node <b>1</b> needs to be upgraded to the new version. Currently, a user stores a new version of a developed container image in a data warehouse of the data center, and the edge computing node <b>1</b> that needs to be upgraded may download the new version of the container image from the data center, and upgrade a locally stored old version of the container image to the new version of the container image.
0035The network architecture shown in <figref idref="DRAWINGS">FIG. <b>1</b></figref> is a hardware topology structure. This application further provides a software architecture diagram shown in <figref idref="DRAWINGS">FIG. <b>2</b></figref>. The software architecture diagram describes in detail a software architecture of the data center <b>3</b> and a software architecture of the edge computing node <b>1</b> in the network architecture shown in <figref idref="DRAWINGS">FIG. <b>1</b></figref>. <figref idref="DRAWINGS">FIG. <b>2</b></figref> shows a software architecture. The software architecture is a schematic diagram of a K8S architecture. Referring to <figref idref="DRAWINGS">FIG. <b>2</b></figref>, in the K8S architecture, the data center <b>3</b> includes functional modules such as a server module <b>31</b>, a scheduling module <b>32</b>, and a data warehouse <b>33</b>, and each edge computing node <b>1</b> includes functional modules such as a client module <b>11</b> and a container <b>12</b>. The data center <b>3</b> and the edge computing node <b>1</b> may use a client/server (CS) working mode. The data center <b>3</b> interacts with the edge computing node <b>1</b> by running the server module <b>31</b>, and the edge computing node <b>1</b> interacts with the data center <b>3</b> by running the client module <b>11</b>. In an interaction process, the data center <b>3</b> functions as a server, and the edge computing node <b>1</b> functions as a client. The data warehouse is configured to store a new version of a container image developed by a user, and the scheduling module <b>32</b> is configured to schedule an edge computing cluster <b>10</b> whose container image needs to be upgraded. The edge computing node <b>1</b> in the scheduled edge computing cluster <b>10</b> may download the container image from the data warehouse <b>33</b> in the data center <b>3</b>, and deploy the container image in the container <b>12</b> in an image manner, to implement upgrade.
0036<figref idref="DRAWINGS">FIG. <b>3</b></figref> is a schematic diagram of a structure of a software stack of an edge computing node <b>1</b> based on the software architecture shown in <figref idref="DRAWINGS">FIG. <b>2</b></figref> according to an embodiment of this application. As shown in the figure, the edge computing node <b>1</b> includes a container, a software platform for running a container image, and a hardware platform for running the software platform. The container includes a container image, and the container image may be an algorithm, software, an application, or the like. The software platform includes functional modules such as a container engine, a K8S agent, and a lightweight operating system (OS). The hardware platform includes hardware resources such as a processor, a memory, and a network interface card.
0037The lightweight OS may be configured to allocate a hardware resource to the container engine and the K8S agent. The hardware resource may be a hardware resource such as a processor, a memory, and/or a network interface card of the hardware platform. The container engine may be configured to run the container image of the container, and obtain a processing result by processing data using the container image. The K8S agent is an instance of a client module, and may be configured to interact with the data center <b>3</b>. For example, the K8S agent may send the processing result to the data center <b>3</b>, or download a new version of a container image from the data center <b>3</b> and deploy the new version of the container image in the container, to implement operations such as upgrading the container image.
0038Because each edge computing node <b>1</b> in the edge computing cluster <b>10</b> is connected to the network switching device <b>2</b>, the time required by each edge computing node <b>1</b> in the edge computing cluster <b>10</b> to download the container image from the data center <b>3</b> depends on the network bandwidth between the network switching device <b>2</b> and the data center <b>3</b>. In other words, a larger network bandwidth between the network switching device <b>2</b> and the data center <b>3</b> indicates a shorter time required by each edge computing node <b>1</b> in the edge computing cluster <b>10</b> to download the container image. On the contrary, a smaller network bandwidth between the network switching device <b>2</b> and the data center <b>3</b> indicates a longer time required by each edge computing node <b>1</b> in the edge computing cluster <b>10</b> to download the container image. For example, a size of the container image that needs to be downloaded is 200 MB, the network bandwidth between the network switching device <b>2</b> and the data center <b>3</b> is 4 Mbps, and the edge computing cluster <b>10</b> includes four edge computing nodes <b>1</b>. In this way, the time required by the four edge computing nodes <b>1</b> to download the container image is T1=(200×8×4)/4=1600S. When a network switching device <b>2</b> corresponding to an edge computing cluster <b>10</b> is connected to the data center <b>3</b> through a wireless network, or when a network bandwidth of a wired connection between a network switching device <b>2</b> corresponding to an edge computing cluster <b>10</b> and the data center <b>3</b> is relatively small, the network bandwidth between the network switching device <b>2</b> and the data center <b>3</b> is limited, and the time required by each edge computing node <b>10</b> in the edge computing cluster <b>10</b> to download the container image is relatively long. To resolve this technical problem, any one of the following implementations may be used.
0039The following further describes, with reference to <figref idref="DRAWINGS">FIG. <b>4</b></figref>, a data processing method provided in this application. As shown in the figure, the method may be applied to the network architecture shown in <figref idref="DRAWINGS">FIG. <b>1</b></figref>, and includes the following steps.
0040Step <b>201</b>: A data center sends a container image update instruction to an edge computing cluster, where the container image update instruction includes an identifier of a to-be-updated container image.
0041A user may develop a new version of a container image, and store the new version of the container image in the data center. The new version of the container image is the to-be-updated container image. The container image may be software, an application, a data analysis algorithm model, or the like. Therefore, the to-be-updated container image may be a new version of software, an application, a data analysis algorithm model, or the like.
0042After developing the new version of the container image, the user stores the new version of the container image in a data warehouse in the data center. A server module of the data center may detect the container image stored in the data warehouse, use the container image as the to-be-updated container image, and send a scheduling instruction to a scheduling module of the data center. Alternatively, after storing the new version of the container image in the data warehouse of the data center, the user may input an upgrade command including the identifier of the container image to the server module of the data center. After receiving the upgrade command, the data center sends the scheduling instruction to the scheduling module of the data center.
0043Then, the scheduling module in the data center may schedule at least one edge computing cluster. The server module generates the container image instruction, and sends the container image instruction to each scheduled edge computing cluster. The container image instruction includes the identifier of the to-be-updated container image.
0044Optionally, the data center may send the container image instruction to the scheduled edge computing cluster in any one of the following manners.
0045In a first manner, the container image instruction may be simultaneously sent to each scheduled edge computing cluster.
0046In a second manner, the container image instruction may be sent to the scheduled edge computing cluster in batches based on a time sequence. Any two adjacent time intervals for sending the container image instruction may be equal or unequal.
0047For example, it is assumed that there are nine scheduled edge computing clusters and the container image update instruction is sent in three times. The container image update instruction is sent to three scheduled edge computing clusters for the first time, after a time period, the container image update instruction is sent to other three scheduled edge computing clusters for the second time, and after another time period, the container image update instruction is sent to remaining three scheduled edge computing clusters for the third time.
0048Optionally, a time length of the time period waited for each time may be equal or may be unequal. When the time length of the time period waited for each time is equal, the time length may be a preset time length or a time length set by the data center.
0049Compared with the first manner, in the second manner, a quantity of edge computing nodes that simultaneously request to download data from the data warehouse in the data center may be reduced, to reduce pressure on the data center, and reduce pressure on the data warehouse.
0050In a third manner, the container image instruction may be sent to the scheduled edge computing node based on a load size of the scheduled edge computing cluster.
0051For example, the container image instruction may be sent to the scheduled edge computing nodes in ascending order based on load sizes of the scheduled edge computing clusters. In other words, the container image instruction is first sent to an edge computing cluster with a low load. In this way, the edge computing cluster with the low load may first download the to-be-updated container image, and the edge computing cluster may quickly download the to-be-updated container image from the data center. When the data center sends the container image instruction to an edge computing cluster with a relatively high load, because the edge computing cluster with the relatively high load has processed its own load for a time period, the load of the edge computing cluster may become relatively low in this case, and the edge computing cluster can also quickly download the to-be-updated container image from the data center.
0052Optionally, each edge computing node may send a load size of the edge computing node to the data center when the load of the edge computing node changes. The data center determines edge computing nodes belonging to a same edge computing cluster, and obtains a load size of the edge computing cluster based on load sizes of the edge computing nodes belonging to the same edge computing cluster.
0053For each edge computing node belonging to the same edge computing cluster, the edge computing node sends a load size to a network switching device corresponding to the edge computing cluster. The network switching device sends a message to the data center, and the message includes an address of the network switching device and the load size of the edge computing node. Therefore, the data center may determine, based on the address of the network switching device, each edge computing node belonging to the edge computing cluster.
0054Optionally, the container image update instruction may further include an identifier of an edge computing node that has requested to download the to-be-updated container image from the data center.
0055For each scheduled edge computing cluster, the network switching device corresponding to the edge computing cluster receives the container image update instruction, and sends the container image update instruction to each edge computing node in the edge computing cluster.
0056A sending manner of the network switching device includes broadcast, unicast, and multicast. When the unicast is used, the network switching device sends the container image update instruction to each edge computing node one by one. When the multicast is used, the network switching device groups the edge computing nodes in the edge computing cluster into one or more groups, and multicasts the container image update instruction to each group of edge computing nodes.
0057Step <b>202</b>: A first edge computing node receives the container image update instruction, and obtains a performance parameter of each edge computing node in an edge computing cluster in which the first edge computing node is located, where the performance parameter of the edge computing node is used to indicate resource usage of the edge computing node.
0058The first edge computing node is any edge computing node in the edge computing cluster in which the first edge computing node is located. When receiving the container image update instruction, the first edge computing node may obtain a performance parameter of the first edge computing node, and then broadcast the performance parameter of the first edge computing node to another edge computing node in the edge computing cluster. Like the first edge computing node, another computing node in the edge computing cluster obtains a performance parameter of the edge computing node and broadcasts the performance parameter of the edge computing node after receiving the container image update instruction. Therefore, the first edge computing node may receive the performance parameter of another edge computing node in the edge computing cluster.
0059Optionally, the performance parameter of the first edge computing node includes at least one of a central processing unit (CPU) idle rate, a memory idle rate, or a delay of the data center of the first edge computing node.
0060Optionally, after receiving the container image update instruction, the first edge computing node continuously receives, within a time period, the performance parameter sent by another edge computing node in the edge computing cluster, and performs an operation of step <b>203</b> after the time period ends. A start moment of the time period is a moment at which the first edge computing node receives the container image update instruction, and a time length of the time period is equal to the preset time length. The first edge computing node may implement the time period by using a timer. During implementation, the first edge computing node starts a timer when receiving the container image update instruction. The timer starts timing from zero. When a timed time period reaches the preset time length, the first edge computing node determines that the time period ends, and performs an operation in the step <b>203</b>. After receiving the container image update instruction, the network switching device corresponding to the edge computing cluster sends the container image update instruction to each edge computing node in the edge computing cluster. In addition, because the edge computing cluster and the network switching device form a local area network, a network bandwidth between each edge computing node in the edge computing cluster and the network switching device is relatively high, and a time difference between receiving the container image update instruction by each edge computing node in the edge computing cluster is relatively small, which may be basically ignored. Therefore, it may be considered that each edge computing node in the edge computing cluster simultaneously receives the container image update instruction. In this way, each edge computing node in the edge computing cluster simultaneously starts the timer for timing, and simultaneously stop timing.
0061Step <b>203</b>: The first edge computing node determines load of each edge computing node based on the performance parameter of each edge computing node in the same edge computing cluster.
0062For example, for each edge computing node, assuming that the performance parameter of the edge computing node includes a CPU idle rate, a memory idle rate, and a delay between the edge computing node and the data center, the first edge computing node determines load of the edge computing node based on the CPU idle rate, the memory idle rate, and the delay between the edge computing node and the data center according to the following first formula.
0063<maths id="MATH-US-00001" num="00001"><math overflow="scroll"><mrow><mi>Score</mi><mo>=</mo><mrow><mrow><msub><mi>W</mi><mi>cpu</mi></msub><mo>×</mo><msub><mi>CPU</mi><mi>idle</mi></msub></mrow><mo>+</mo><mrow><msub><mi>W</mi><mrow><mi>m</mi><mo></mo><mi>e</mi><mo></mo><mi>m</mi></mrow></msub><mo>×</mo><msub><mi>MEM</mi><mi>idle</mi></msub></mrow><mo>+</mo><mrow><msub><mi>W</mi><mi>lat</mi></msub><mo></mo><mfrac><mn>1</mn><mrow><mi>L</mi><mo></mo><mi>A</mi><mo></mo><mi>T</mi></mrow></mfrac></mrow></mrow></mrow></math></maths><img file="US11558253B2_D0001.tif" />
0064In the first formula, Score is the load of the edge computing node, CPU<sub>idle </sub>is the CPU idle rate, MEM<sub>idle </sub>is the memory idle rate, LAT is the delay between the edge computing node and the data center, W<sub>cpu </sub>is a weight of the CPU idle rate, W<sub>mem </sub>is a weight of the memory idle rate, W<sub>lat </sub>is a weight of the delay, and x is a multiplication operation.
0065Step <b>204</b>: The first edge computing node sorts edge computing nodes in the same edge computing cluster based on the loads of the edge computing nodes, and selects an edge computing node with the lowest load as an agent node.
0066Optionally, the first edge computing node may sort the edge computing nodes in descending order based on the loads of the edge computing nodes, and select the last edge computing node as the agent node, in other words, select the edge computing node with the lowest at a current moment load as the agent node in the same cluster. Alternatively, the first edge computing node may sort the edge computing nodes in the edging computing cluster in ascending order based on the loads of edge computing nodes, and select the first edge computing node as the agent node.
0067Optionally, in addition to the manner of selecting the agent node described in the steps <b>202</b> to <b>204</b>, there may be another manner of selecting the agent node.
0068In an embodiment, the first edge computing node obtains an identifier of each edge computing node in the edge computing cluster, and selects an edge computing node as the agent node based on the identifier of each edge computing node. A detailed implementation process of this implementation is as follows: When receiving the container image update instruction, the first edge computing node obtains an identifier of the first edge computing node, and broadcasts the identifier of the first edge computing node to another edge computing node in the edge computing cluster. Like the first edge computing node, another edge computing node obtains and broadcasts an identifier of another edge computing node when receiving the container image update instruction. The first edge computing node receives the identifier of another edge computing node, and may select an edge computing node as the agent node based on the identifier of each edge computing node in the edge computing cluster.
0069In an embodiment, an edge computing node with a smallest identifier or an edge computing node with a largest identifier may be selected as the agent node. Other selection manners are not listed one by one.
0070In an embodiment, the first edge computing node also continuously receives for a time period after receiving the container image update instruction, and selects, before the first time period ends, an edge computing node as the agent node based on the identifier of each edge computing node in the edge computing cluster.
0071In an embodiment, when the first edge computing node selects the agent node, the first edge computing node does not belong to any edge computing cluster in the system shown in <figref idref="DRAWINGS">FIG. <b>1</b></figref> or <figref idref="DRAWINGS">FIG. <b>2</b></figref>, and the first edge computing node is an edge computing node that is in an edge computing cluster and that has a function of selecting the agent node. Another edge computing node in the edge computing cluster does not have the function of selecting the agent node. In this way, when receiving the image update instruction, the first edge computing node selects an edge computing node as the agent node. For example, the first edge computing node may randomly select an edge computing node as the agent node. In this implementation, when the first edge computing node is not the agent node, the first edge computing node further needs to send a notification message to the selected edge computing node, to notify the edge computing node that the edge computing node is selected as the agent node.
0072Step <b>205</b>: When the first edge computing node is the agent node, the first edge computing node obtains, from the data center, a container image corresponding to the identifier of the to-be-updated container image, and sends the container image to another edge computing node in the edge computing cluster.
0073Optionally, the first edge computing node may download the to-be-updated container image from the data warehouse in the data center. Alternatively, when the container image update instruction includes an identifier of a downloaded edge computing node, the first edge computing node may download the to-be-updated container image from the edge computing node corresponding to the identifier of the edge computing node.
0074Because the first edge computing node and another computing node are located in a same local area network, a bandwidth between the first edge computing node and another edge computing node is relatively large. Therefore, a time required by the first edge computing node to send the container image to another edge computing node in the edge computing cluster is relatively short.
0075Step <b>206</b> (optional): When the first edge computing node is not the agent node, the first edge computing node receives a container image sent by the agent node.
0076The agent node downloads, from the data center, the container image corresponding to the identifier of the to-be-updated container image, and sends the container image to another edge computing node in the edge computing cluster. Correspondingly, the first edge computing node receives the container image.
0077Because the first edge computing node and the agent computing node are located in a same local area network, bandwidth between the first edge computing node and the agent node is relatively large. Therefore, the time required by the first edge computing node to receive the container image sent by the agent node is relatively short.
0078For example, it is assumed that a size of a container image that needs to be downloaded is 200 MB, a network bandwidth between the network switching device and the data center is 4 Mbps, the edge computing cluster includes four edge computing nodes, and a network bandwidth between any two edge computing nodes in the edge computing cluster is 400 Mbps. In this way, the time required by the first edge computing node to download the container image from the data center is t1=(200×8)/4=400S, and a time period required by the first edge computing node to send the container image to the other three edge computing nodes is t2=(200×8)/400=4S. Therefore, a time required by each edge computing node in the edge computing cluster to obtain the container image is 404s, which is far less than 1600S.
0079After obtaining the container image, the first edge computing node and another edge computing node in the edge computing cluster may upgrade based on the container image.
0080Optionally, for another edge computing node other than the agent node in the edge computing cluster, after completing the update of the container image, another edge computing node may send an update complete message to the agent node. When the agent node receives the update complete message sent by another edge computing node and the agent node also completes the update of the container image, the agent node sends an update complete message to the data center. The data center receives the update complete message, to determine that the edge computing cluster completes the upgrade of the to-be-updated container image.
0081In this application, the agent node is selected, and the container image is obtained from the data center by using the agent node. In this way, the agent node can occupy all network bandwidth between the network switching device and the data center. Therefore, the time required for obtaining image data is relatively short. In addition, because the edge computing cluster in which the agent node is located is a local area network, and the bandwidth between the agent node and another edge computing node in the edge computing cluster is relatively large, the time required by the agent node to send the container image to another edge computing node is relatively short. In this way, the problem that a process of downloading the container image consumes a long time due to the limited network bandwidth of the edge computing node and the data center is resolved.
0082The foregoing describes in detail the data processing method according to embodiments of this application with reference to <figref idref="DRAWINGS">FIG. <b>1</b></figref> to <figref idref="DRAWINGS">FIG. <b>4</b></figref>. The following describes a data processing apparatus and an edge computing node according to embodiments of this application with reference to <figref idref="DRAWINGS">FIG. <b>5</b></figref> and <figref idref="DRAWINGS">FIG. <b>6</b></figref>.
0083<figref idref="DRAWINGS">FIG. <b>5</b></figref> is a schematic diagram of a structure of a data processing apparatus <b>300</b> according to an embodiment of this application. Referring to <figref idref="DRAWINGS">FIG. <b>3</b></figref>, this application provides the data processing apparatus <b>300</b>. The apparatus <b>300</b> includes:
0084a receiving unit <b>301</b>, configured to receive a container image update instruction, where the apparatus <b>300</b> is any edge computing node in an edge computing cluster, the edge computing cluster includes at least two edge computing nodes, and the container image update instruction is used to instruct the at least two edge computing nodes in the edge computing cluster to update a container image;
0085a processing unit <b>302</b>, configured to obtain a to-be-updated container image based on the container image update instruction received by the receiving unit <b>301</b>; and
0086a sending unit <b>303</b>, configured to send the to-be-updated container image to another edge computing node in the edge computing cluster based on the to-be-updated container image obtained by the processing unit <b>302</b>.
0087Optionally, the processing unit <b>302</b> is further configured to:
0088after the receiving unit <b>301</b> receives the container image update instruction, select an edge computing node from the edge computing cluster as an agent node.
0089Optionally, the processing unit <b>302</b> is configured to:
0090obtain a performance parameter of each edge computing node in the edge computing cluster, where the performance parameter is used to indicate resource usage of each edge computing node;
0091determine load of each edge computing node based on the performance parameter of each edge computing node; and
0092sort edge computing nodes in the edge computing cluster based on the loads of edge computing nodes; and select an edge computing node with the lowest load as the agent node.
0093Optionally, for detailed content of selecting the agent node by the processing unit <b>302</b>, refer to the related content of selecting the agent node by the first edge computing node in the step <b>202</b> to the step <b>204</b>. Details are not repeated herein.
0094Optionally, the processing unit <b>302</b> is configured to:
0095when the apparatus <b>300</b> is used as the agent node in the edge computing cluster, obtain the to-be-updated container image, where the apparatus <b>300</b> is the edge computing node with the lowest load.
0096Optionally, for detailed content of obtaining the container image by the processing unit <b>302</b>, refer to the related content of obtaining the container image by the first edge computing node in the step <b>205</b>. Details are not repeated herein.
0097Optionally, the processing unit <b>302</b> is configured to:
0098randomly select an edge computing node from the edge computing cluster as the agent node; or
0099select an edge computing node as the agent node from the edge computing cluster based on an identifier of the edge computing node.
0100Optionally, the processing unit <b>302</b> is configured to:
0101when the agent node is not the apparatus <b>300</b>, obtain the to-be-updated container image from the agent node, where the to-be-updated container image is obtained by the agent node from a data center.
0102Optionally, for detailed content of obtaining the container image by the processing unit <b>302</b> from the agent node, refer to the related content of obtaining the container image by the first edge computing node from the agent node in the step <b>206</b>. Details are not repeated herein.
0103Optionally, each edge computing node in the edge computing cluster is connected to the data center through a network switching device.
0104It should be understood that the apparatus <b>300</b> in this application may be implemented through an application-specific integrated circuit (ASIC), or may be implemented through a programmable logic device (PLD). The PLD may be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), generic array logic (GAL), or any combination thereof. Alternatively, when the data processing method shown in <figref idref="DRAWINGS">FIG. <b>4</b></figref> is implemented by software, the apparatus <b>300</b> and modules of the apparatus <b>300</b> may be software modules.
0105The apparatus <b>300</b> according to this embodiment may correspondingly perform the method described in the embodiments of the present disclosure. In addition, the foregoing and other operations and/or functions of the units in the apparatus <b>300</b> are separately used to implement a corresponding procedure of the method in <figref idref="DRAWINGS">FIG. <b>4</b></figref>. For brevity, details are not repeated herein.
0106In example embodiments of this application, the processing unit selects an agent node, and obtains the container image from the data center by using the agent node. Because the edge computing cluster in which the agent node is located is a local area network, and the bandwidth between the agent node and another edge computing node in the edge computing cluster is relatively large, the time required by the agent node to send the container image to another edge computing node is relatively short. In this way, a problem that a process of downloading the container image consumes a long time due to the limited network bandwidth of the edge computing node and the data center is resolved.
0107<figref idref="DRAWINGS">FIG. <b>6</b></figref> is a schematic diagram of a structure of a computing node <b>600</b> according to an embodiment of this application. As shown in the figure, the computing node <b>600</b> includes a processor <b>601</b>, a memory <b>602</b>, a communications interface <b>603</b>, and a bus <b>604</b>. The processor <b>601</b>, the memory <b>602</b>, and the communications interface <b>603</b> may implement communication through the bus <b>604</b>, or may implement communication in another manner such as wireless transmission. The memory <b>602</b> is configured to store one or more instructions. The processor <b>601</b> is configured to execute the one or more instructions stored in the memory <b>602</b>. The computing node <b>600</b> is any edge computing node <b>1</b> in the edge computing cluster <b>10</b> shown in <figref idref="DRAWINGS">FIG. <b>1</b></figref> or <figref idref="DRAWINGS">FIG. <b>2</b></figref>. The memory <b>602</b> stores program code, and the processor <b>601</b> may invoke the program code stored in the memory <b>602</b> to perform the following operations:
0108receiving a container image update instruction, where an edge computing cluster includes at least two edge computing nodes, and the container image update instruction is used to instruct the at least two edge computing nodes in the edge computing cluster to update the container image;
0109obtaining a to-be-updated container image; and
0110sending the to-be-updated container image to another edge computing node in the edge computing cluster through the communications interface <b>603</b>.
0111It should be understood that in this application, the processor <b>601</b> may be a CPU, or the processor <b>601</b> may be another general purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), or another programmable logic device, discrete gate or transistor logic device, discrete hardware component, or the like. The general purpose processor may be a microprocessor or any conventional processor or the like.
0112The memory <b>602</b> may include a read-only memory and a random access memory, and provide an instruction and data to the processor <b>601</b>. The memory <b>602</b> may further include a non-volatile random access memory. For example, the memory <b>602</b> may further store information of a device type.
0113The memory <b>602</b> may be a volatile memory or a nonvolatile memory, or may include a volatile memory and a nonvolatile memory. The nonvolatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), used as an external cache. In non-limiting example embodiments, many forms of RAMs may be used, for example, a static random access memory (SRAM), a dynamic random access memory (DRAM), a synchronous dynamic random access memory (SDRAM), a double data rate synchronous dynamic random access memory (double data rate SDRAM, DDR SDRAM), an enhanced synchronous dynamic random access memory (ESDRAM), a synchronous link dynamic random access memory (SLDRAM), and a direct rambus dynamic random access memory (DR RAM).
0114The bus <b>604</b> may further include a power bus, a control bus, a status signal bus, and the like, in addition to a data bus. However, for clear description, various types of buses in the figure are marked as the bus <b>604</b>.
0115In this application, the processor in the computing node obtains the to-be-updated container image. Because the edge computing cluster in which the computing node is located is a local area network, a bandwidth between the computing node and another edge computing node in the edge computing cluster is relatively large. In this way, the time required by the processor of the computing node to send the container image to another edge computing node through the communications interface is relatively short. In this way, a problem that a process of downloading the container image consumes a long time because network bandwidth of the edge computing node and a data center is limited is resolved.
0116This application provides a data processing system. The system includes the data center in <figref idref="DRAWINGS">FIG. <b>1</b></figref> or <figref idref="DRAWINGS">FIG. <b>2</b></figref> and at least one edge computing node. The edge computing node is configured to implement a function of the apparatus in <figref idref="DRAWINGS">FIG. <b>5</b></figref> or the computing node in <figref idref="DRAWINGS">FIG. <b>6</b></figref>. The data center and the edge computing node are configured to perform operation steps of a corresponding body in the data processing method in <figref idref="DRAWINGS">FIG. <b>4</b></figref>. For brevity, details are not repeated herein.
0117All or some of the foregoing embodiments may be implemented by software, hardware, firmware, or any combination thereof. When software is used to implement the embodiments, the foregoing embodiments may be implemented completely or partially in a form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded or executed on the computer, the procedure or functions according to the embodiments of the present disclosure are all or partially generated. The computer may be a general-purpose computer, a dedicated computer, a computer network, or other programmable apparatuses. The computer instructions may be stored in a computer-readable storage medium or may be transmitted from a computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from a website, computer, server, or data center to another website, computer, server, or data center in a wired (for example, a coaxial cable, an optical fiber, or a digital subscriber line (DSL)) or wireless (for example, infrared, radio, or microwave) manner. The computer-readable storage medium may be any usable medium accessible by a computer, or a data storage device, such as a server or a data center, integrating one or more usable media. The usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, or a magnetic tape), an optical medium (for example, a DVD), or a semiconductor medium. The semiconductor medium may be a solid-state drive (SSD).
0118A person of ordinary skill in the art may understand that all or some of the steps of the embodiments may be implemented by hardware or a program instructing related hardware. The program may be stored in a computer-readable storage medium. The storage medium may include: a read-only memory, a magnetic disk, or an optical disc.
0119The foregoing descriptions are merely non-limiting examples of implementations of this application, and are not intended to limit this application. Any modification, equivalent replacement, or improvement made without departing from the spirit and principle of this application should fall within the protection scope of this application.
Contents6
8 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US12229414B2 | Cited by | United States of America | Applicant |
| US10007509B1 | Cites | United States of America | Search report |
| US10095507B1 | Cites | United States of America | Search report |
| CN102265568A | Cites | China | Applicant |
| CN103095597A | Cites | China | Applicant |
| US10481896B2 | Cites | United States of America | Search report |
| CN105553737A | Cites | China | Applicant |
| CN105827678A | Cites | China | Applicant |
| CN106888254A | Cites | China | Applicant |
| CN107105029A | Cites | China | Applicant |
| CN107577475A | Cites | China | Applicant |
| CN107819802A | Cites | China | Applicant |
| US10841152B1 | Cites | United States of America | Search report |
| CN108509276A | Cites | China | Applicant |
| US2001037306A1 | Cites | United States of America | Search report |
| US2002078133A1 | Cites | United States of America | Search report |
| US2002152290A1 | Cites | United States of America | Search report |
| US2002156650A1 | Cites | United States of America | Search report |
| US2003046529A1 | Cites | United States of America | Search report |
| US2003110248A1 | Cites | United States of America | Search report |
| US2006085564A1 | Cites | United States of America | Search report |
| US2006159090A1 | Cites | United States of America | Search report |
| US2006190939A1 | Cites | United States of America | Search report |
| US2007143390A1 | Cites | United States of America | Search report |
| US2007168919A1 | Cites | United States of America | Search report |
| US2007300220A1 | Cites | United States of America | Search report |
| WO2008069439A1 | Cites | World Intellectual Property Organization (WIPO) | Applicant |
| US2009006421A1 | Cites | United States of America | Search report |
| US2009119177A1 | Cites | United States of America | Search report |
| US2009119655A1 | Cites | United States of America | Search report |
| US2009157797A1 | Cites | United States of America | Search report |
| US2010070962A1 | Cites | United States of America | Search report |
| US2010162036A1 | Cites | United States of America | Search report |
| US2011078675A1 | Cites | United States of America | Search report |
| US2011161468A1 | Cites | United States of America | Search report |
| US2011167154A1 | Cites | United States of America | Search report |
| US2011265082A1 | Cites | United States of America | Search report |
| US2011271275A1 | Cites | United States of America | Search report |
| US2012005346A1 | Cites | United States of America | Search report |
| US2012054734A1 | Cites | United States of America | Search report |
| US2012159469A1 | Cites | United States of America | Search report |
| US2012266170A1 | Cites | United States of America | Search report |
| US2013145367A1 | Cites | United States of America | Search report |
| US2013198343A1 | Cites | United States of America | Applicant |
| US2013263131A1 | Cites | United States of America | Search report |
| US2013290694A1 | Cites | United States of America | Search report |
| US2014089912A1 | Cites | United States of America | Search report |
| US2014181949A1 | Cites | United States of America | Search report |
| US2014298091A1 | Cites | United States of America | Search report |
| US2015120887A1 | Cites | United States of America | Search report |
| US2015236902A1 | Cites | United States of America | Search report |
| US2015236907A1 | Cites | United States of America | Search report |
| US2015271014A1 | Cites | United States of America | Search report |
| US2015277856A1 | Cites | United States of America | Search report |
| US2015331707A1 | Cites | United States of America | Search report |
| US2015341456A1 | Cites | United States of America | Search report |
| US2015363178A1 | Cites | United States of America | Search report |
| US2016103675A1 | Cites | United States of America | Search report |
| WO2016181462A1 | Cites | World Intellectual Property Organization (WIPO) | Applicant |
| US2016203008A1 | Cites | United States of America | Search report |
| US2016344582A1 | Cites | United States of America | Search report |
| US2017034309A1 | Cites | United States of America | Search report |
| US2017075892A1 | Cites | United States of America | Applicant |
| US2017123780A1 | Cites | United States of America | Search report |
| US2017142228A1 | Cites | United States of America | Search report |
| US2017195448A1 | Cites | United States of America | Search report |
| US2017208138A1 | Cites | United States of America | Search report |
| US2017220329A1 | Cites | United States of America | Search report |
| US2017230239A1 | Cites | United States of America | Search report |
| US2017249374A1 | Cites | United States of America | Search report |
| US2017257297A1 | Cites | United States of America | Search report |
| US2017264493A1 | Cites | United States of America | Search report |
| US2017279877A1 | Cites | United States of America | Search report |
| US2017279881A1 | Cites | United States of America | Search report |
| US2017310742A1 | Cites | United States of America | Search report |
| US2017329980A1 | Cites | United States of America | Search report |
| WO2018020610A1 | Cites | World Intellectual Property Organization (WIPO) | Applicant |
| US2018046457A1 | Cites | United States of America | Search report |
| US2018048545A1 | Cites | United States of America | Search report |
| US2018052675A1 | Cites | United States of America | Applicant |
| US2018145960A1 | Cites | United States of America | Search report |
| US2018150316A1 | Cites | United States of America | Search report |
| US2018173502A1 | Cites | United States of America | Search report |
| US2018173573A1 | Cites | United States of America | Search report |
| US2018270291A1 | Cites | United States of America | Search report |
| US2018276215A1 | Cites | United States of America | Search report |
| US2018293152A1 | Cites | United States of America | Search report |
| US2018324204A1 | Cites | United States of America | Search report |
| US2018331891A1 | Cites | United States of America | Search report |
| US2018349168A1 | Cites | United States of America | Search report |
| US2018373517A1 | Cites | United States of America | Search report |
| US2018375936A1 | Cites | United States of America | Search report |
| US2019037337A1 | Cites | United States of America | Search report |
| US2019087176A1 | Cites | United States of America | Search report |
| US2019095253A1 | Cites | United States of America | Search report |
| US2019102265A1 | Cites | United States of America | Search report |
| US2019140905A1 | Cites | United States of America | Search report |
| US2019155613A1 | Cites | United States of America | Search report |
| US2019171435A1 | Cites | United States of America | Search report |
| US2019171438A1 | Cites | United States of America | Search report |
10 members in 5 offices
Priority claims3
| Document | Office | Kind | Date |
|---|---|---|---|
| 2018110619181 | China | – | |
| 201811061918 | China | A | |
| 2019094143 | China | W |
Members10
| Document | Office | Kind | |
|---|---|---|---|
| WO2020052322A1 | World Intellectual Property Organization (WIPO) | A1 | |
| CN110896404A | China | A | |
| EP3840296A1 | European Patent Office (EPO) | A1 | |
| US2021203554A1 | United States of America | A1 | |
| CN110896404B | China | B | |
| EP3840296A4 | European Patent Office (EPO) | A4 | |
| JP2021536642A | Japan | A | |
| JP7192103B2 | Japan | B2 | |
| US11558253B2This record | United States of America | B2 | |
| EP3840296B1 | European Patent Office (EPO) | B1 |
82 transactions on the USPTO file
Allowed after 2 non-final rejections, 2 final rejections and 1 RCE.
- Non-final rejections
- 2
- Final rejections
- 2
- RCEs
- 1
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Patent Issue Date Used in PTA CalculationAllowedPTAC | PTAC | |
| Email NotificationEML_NTR | EML_NTR | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Dispatch to FDCD1935 | D1935 | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| After Final Consideration Program Additional Consideration and/or updated searchAFAC | AFAC | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Final ActionA.NE | A.NE | |
| PILOT- Request for After Final Consideration ProgramRAFC | RAFC | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Electronic Information Disclosure StatementEIDS. | EIDS. | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Disposal for a RCE / CPA / R129AbandonedABN9 | ABN9 | |
| Request for Continued Examination (RCE)RCEX | RCEX | |
| Workflow - Request for RCE - BeginBRCE | BRCE | |
| Email NotificationEML_NTR | EML_NTR | |
| Mail Advisory Action (PTOL - 303)MCTAV | MCTAV | |
| After Final Consideration Program Amendment too ExtensiveAFNE | AFNE | |
| Advisory Action (PTOL-303)CTAV | CTAV | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Correspondence Address ChangeC.AD | C.AD | |
| Response after Final ActionA.NE | A.NE | |
| PILOT- Request for After Final Consideration ProgramRAFC | RAFC | |
| PILOT- Request for After Final Consideration ProgramRAFC | RAFC | |
| Response after Final ActionA.NE | A.NE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Electronic Information Disclosure StatementEIDS. | EIDS. | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Email NotificationEML_NTR | EML_NTR | |
| Application ready for PDX access by participating foreign officesCCRDY | CCRDY | |
| PG-Pub Issue NotificationPG-ISSUE | PG-ISSUE | |
| Request for Foreign Priority (Priority Papers May Be Included)RQPR | RQPR | |
| Priority document has successfully retrieved via PDX/DASPD.RECVD | PD.RECVD | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Preliminary AmendmentA.PE | A.PE | |
| Incoming Letter Pertaining to the DrawingsLTDR | LTDR | |
| Substitute Specification FiledC604 | C604 | |
| Email NotificationEML_NTR | EML_NTR | |
| Application Is Now CompleteCOMP | COMP | |
| Filing ReceiptFLRCPT.O | FLRCPT.O | |
| Application Is Now CompleteCOMP | COMP | |
| Sent to Classification ContractorPGPC | PGPC | |
| FITF set to YES - revise initial settingFTFS | FTFS | |
| Patent Term Adjustment - Ready for ExaminationPTA.RFE | PTA.RFE | |
| Request from applicant for the USPTO to retrieve the Priority DocumentPDREQUST | PDREQUST | |
| PTO/SB/69-Authorize EPO Access to Search ResultsSREXR141 | SREXR141 | |
| Applicants have given acceptable permission for participating foreignAPPERMS | APPERMS | |
| Entity Status Set To Undiscounted (Initial Default Setting or Status Change)BIG. | BIG. | |
| Initial Exam Team nnIEXX | IEXX |
15 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Information on status: patent grantGrantedPATENTED CASESTCF | STCF | |
| Information on status: patent application and granting procedure in generalPUBLICATIONS -- ISSUE FEE PAYMENT VERIFIEDSTPP | STPP | |
| Information on status: patent application and granting procedure in generalNOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONSSTPP | STPP | |
| Information on status: application discontinuationFINAL REJECTION MAILEDSTCB | STCB | |
| Information on status: patent application and granting procedure in generalFINAL REJECTION MAILEDSTPP | STPP | |
| Information on status: patent application and granting procedure in generalRESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINERSTPP | STPP | |
| Information on status: patent application and granting procedure in generalNON FINAL ACTION MAILEDSTPP | STPP | |
| Information on status: patent application and granting procedure in generalADVISORY ACTION MAILEDSTPP | STPP | |
| Information on status: patent application and granting procedure in generalRESPONSE AFTER FINAL ACTION FORWARDED TO EXAMINERSTPP | STPP | |
| Information on status: application discontinuationFINAL REJECTION MAILEDSTCB | STCB | |
| Information on status: patent application and granting procedure in generalFINAL REJECTION MAILEDSTPP | STPP | |
| Information on status: patent application and granting procedure in generalNON FINAL ACTION MAILEDSTPP | STPP | |
| Information on status: patent application and granting procedure in generalDOCKETED NEW CASE - READY FOR EXAMINATIONSTPP | STPP | |
| AssignmentAS | AS | |
| Fee payment procedureENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP | FEPP |
Numbers
- Publication
- 11558253
- Application
- 17198367
Titles
- English
- Data processing method and apparatus, and computing node for updating container images
Patent term adjustment
- Applicant delay
- −21 days
- Net adjustment
- 0 days
Classification
- CPC, 15
- H04L41/0846
- H04L67/10
- H04L67/1008
- H04L67/1095
- H04L41/0826
- H04L41/0893
- H04L67/06
- H04L41/14
- H04L41/5003
- H04L67/1001
- G06F8/65
- H04L41/20
- H04L67/1019
- H04L67/34
- H04L41/082
- IPC, 7
- H04L41 084
- H04L41 0826
- G06F8 65
- H04L41 00
- H04L41 0893
- H04L41 14
- H04L41 5003