CN111338752A

CN111338752A - Container adjusting method and device

Info

Publication number: CN111338752A
Application number: CN202010093153.0A
Authority: CN
Inventors: 赵贝; 李希伟; 矫恒浩
Original assignee: Qingdao Hisense Media Network Technology Co Ltd
Current assignee: Qingdao Hisense Media Network Technology Co Ltd; Juhaokan Technology Co Ltd
Priority date: 2020-02-14
Filing date: 2020-02-14
Publication date: 2020-06-26
Anticipated expiration: 2040-02-14
Also published as: CN111338752B

Abstract

The application discloses a container adjusting method and device, and belongs to the technical field of networks. In the application, a server can obtain the number of containers deployed on each node in a plurality of nodes, and search a first node with the number of deployed containers smaller than a first number and a second node with the number of deployed containers larger than the first number from the plurality of nodes, wherein the first number is the preset number of containers expected to be deployed by each node; and then, creating a plurality of newly added containers according to the number m of the first nodes and the first number, deploying the newly added containers in the m first nodes, and deleting a plurality of target containers from the containers deployed on the n second nodes, so that the number of the containers deployed on each second node is not less than the first number. Therefore, the problem that when only one container is left on a node and the container is the container which is currently upgraded, the request sent to the node is interrupted can be solved, and the processing efficiency of the reverse proxy network service is guaranteed.

Description

Container adjusting method and device

Technical Field

The present application relates to the field of network technologies, and in particular, to a method and an apparatus for adjusting a container.

Background

Many services are now configured with a reverse proxy network server that can receive requests from clients and send the requests to one of a plurality of backend servers in a balanced manner. Currently, an NLB (Network Load Balancer) and a plurality of nodes for providing a reverse proxy Network service may be configured in a cloud computing platform. The NLB may equally distribute the received client's request to a plurality of nodes for providing a reverse proxy network service.

After configuring a plurality of nodes for providing the reverse proxy network service in the cloud computing platform, a plurality of containers may be created and deployed on the plurality of nodes, and the business request is processed through the plurality of containers. Wherein the containers may need to be upgraded sequentially during use. When a container is upgraded, since the container can not be processed any more, a new container can be additionally created to balance the number of available containers. After creating a new container, the new container may be deployed on any one of the plurality of nodes, and one container may be selected from among a plurality of old containers previously deployed to be deleted, so as to ensure that the total number of containers is unchanged.

However, since the new container and the deleted container may not be deployed on the same node, if only one container is left on the node where the deleted container is located after the container is deleted, and the container is the container currently being upgraded, the request sent to the node may be interrupted, thereby affecting the processing efficiency of the reverse proxy network service.

Disclosure of Invention

The embodiment of the application provides a container adjusting method, a container adjusting device and a storage medium. The technical scheme is as follows:

in one aspect, a method of container adjustment is provided, the method comprising:

acquiring the number of deployed containers on each node in a plurality of nodes;

searching a first node and a second node from the plurality of nodes according to the number of deployed containers on each node in the plurality of nodes, wherein the first node refers to a node with the number of deployed containers smaller than a first number, the second node refers to a node with the number of deployed containers larger than the first number, the first number is the preset number of containers expected to be deployed by each node, and the first number is larger than 1;

creating a plurality of newly added containers according to the number m of the found first nodes and the first number, and deploying the newly added containers in the m first nodes;

and deleting a plurality of target containers from the searched containers deployed on the n second nodes, so that the number of the containers deployed on each second node is not less than the first number.

In another aspect, a server is provided, including:

an obtaining module, configured to obtain the number of containers deployed on each node in the plurality of nodes;

the searching module is used for searching a first node and a second node from the plurality of nodes according to the number of containers deployed on each node in the plurality of nodes, wherein the first node refers to a node with the number of deployed containers smaller than a first number, the second node refers to a node with the number of deployed containers larger than the first number, the first number is the preset number of containers expected to be deployed on each node, and the first number is larger than 1;

a first creating module, configured to create a plurality of newly added containers according to the number m of the found first nodes and the first number, and deploy the newly added containers in m first nodes;

and the deleting module is used for deleting a plurality of target containers from the searched containers deployed on the n second nodes, so that the number of the containers deployed on each second node is not less than the first number.

In another aspect, a server is provided, the server comprising a processor, a communication interface, a memory, and a communication bus;

the processor, the communication interface and the memory complete mutual communication through the communication bus;

the memory is used for storing computer programs;

the processor is used for executing the program stored in the memory so as to realize the container adjusting method.

In another aspect, a computer-readable storage medium is provided, in which a computer program is stored, which, when being executed by a processor, carries out the steps of the container adjustment method provided in the foregoing.

The beneficial effects brought by the technical scheme provided by the embodiment of the application at least comprise:

in the embodiment of the present application, a plurality of newly added containers are deployed in a first node, and a plurality of target containers are deleted from containers deployed on a second node, where the first node refers to a node whose number of deployed containers is smaller than the first number, the second node refers to a node whose number of deployed containers is greater than the first number, and the number of containers deployed after each second node deletes the target node is not less than the first number, it can be seen that, for a node that deletes a container, even if a part of containers are deleted, more than 1 container is still guaranteed to be deployed on a node, thereby avoiding a problem that only one container remains on a node, and when the container is a container that is currently being upgraded, a request to the node is interrupted, and ensuring the processing efficiency of the reverse proxy network service.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

Fig. 1 is a system architecture diagram according to an embodiment of the present disclosure, illustrating a container adjustment method;

fig. 2 is a flowchart of a container adjustment method provided in an embodiment of the present application;

fig. 3 is a schematic structural diagram of a server provided in an embodiment of the present application;

fig. 4 is a schematic structural diagram of another server provided in the embodiment of the present application.

Detailed Description

To make the objects, technical solutions and advantages of the exemplary embodiments of the present application clearer, the technical solutions in the exemplary embodiments of the present application will be clearly and completely described below with reference to the drawings in the exemplary embodiments of the present application, and it is obvious that the described exemplary embodiments are only a part of the embodiments of the present application, but not all the embodiments.

All other embodiments, which can be derived by a person skilled in the art from the exemplary embodiments shown in the present application without inventive effort, shall fall within the scope of protection of the present application. Moreover, while the disclosure herein has been presented in terms of exemplary one or more examples, it is to be understood that each aspect of the disclosure can be utilized independently and separately from other aspects of the disclosure to provide a complete disclosure.

It should be understood that the terms "first," "second," "third," and the like in the description and in the claims of the present application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used are interchangeable under appropriate circumstances and can be implemented in sequences other than those illustrated or otherwise described herein with respect to the embodiments of the application, for example.

Furthermore, the terms "comprises" and "comprising," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a product or device that comprises a list of elements is not necessarily limited to those elements explicitly listed, but may include other elements not expressly listed or inherent to such product or device.

The term "module," as used herein, refers to any known or later developed hardware, software, firmware, artificial intelligence, fuzzy logic, or combination of hardware and/or software code that is capable of performing the functionality associated with that element.

Next, a system architecture related to the container adjustment method provided in the embodiment of the present application is described.

Fig. 1 is a diagram of a system architecture related to container adjustment according to an embodiment of the present disclosure. As shown in fig. 1, the system 100 includes a plurality of clients 101, an NLB102, a management server 103, a plurality of nodes 104, and a plurality of backend servers 105. The plurality of clients 101, the NLB102 and the plurality of nodes 104 can communicate with each other in a wired or wireless manner, the management server 103 and the plurality of nodes 104 can communicate with each other in a wired or wireless manner, and the plurality of nodes 104 and the plurality of background servers 105 can communicate with each other in a wired or wireless manner.

The management server 103 may allocate a plurality of nodes 104 for reverse proxy network service and add node labels to the plurality of nodes 104, and then the management server 103 may create a plurality of containers and add container labels corresponding to the node labels to the plurality of containers. Wherein the number of the plurality of containers is not less than the product of the number of the plurality of nodes 104 and the first number stored in the management server 103. Then, the management server 103 may match the container labels of the multiple containers with the node labels of the multiple nodes, and deploy the containers successfully matched on the corresponding nodes 104, where the number of containers deployed on each node 104 is not less than the first number.

The management server 103 may further obtain the number of containers deployed on each node 104, and when there is a case where the number of containers deployed on the node 104 is smaller than the first number, the management server 103 may create a new container and deploy the new container on the node 104 whose number of containers is smaller than the first number. Thereafter, the management server 103 may delete the target container from the nodes 104 having the number of containers deployed greater than the first number.

Multiple clients 101 may send service requests to multiple nodes 104 through NLB102 for processing of the service requests by the multiple nodes 104. Accordingly, the plurality of clients 101 may receive the processing result of the service request returned by the plurality of nodes 104.

The NLB102 may receive service requests sent by a plurality of clients 101 and send the service requests to a plurality of nodes 104 in a balanced manner.

The node 104 is a node for reverse proxy network service, a plurality of containers for reverse proxy network service are deployed on the node 104, and the node 104 may receive a resource acquisition request sent by the NLB load balancer 102 through a specific port, process the received resource acquisition request, send the resource acquisition request to the background server 105, receive a resource sent by the background server 105, and further send the resource to the client 101.

Backend server 105 is used to store a large amount of resources. The background server may receive resource acquisition requests sent by the plurality of nodes 104 and send corresponding resources to the nodes 104.

Next, a container adjustment method provided in an embodiment of the present application will be described.

Fig. 2 is a flowchart of a container adjustment method provided in an embodiment of the present application, where the method may be applied to a server, and the server may be the management server 103 in fig. 1. As shown in fig. 2, the method comprises the steps of:

step 201: the number of deployed containers on each of the plurality of nodes is obtained.

In this embodiment of the present application, before obtaining the number of deployed containers on each node of the plurality of nodes, the server may determine the plurality of nodes, and add a node label to each node of the plurality of nodes, where the node label is used to indicate that the corresponding node is used to provide a reverse proxy network service; creating a plurality of containers according to the number of the plurality of nodes and the first number, and adding a container label to each container in the plurality of containers, wherein the container label is used for indicating that the corresponding container is used for providing the reverse proxy network service; the plurality of containers are deployed in the plurality of nodes according to the container labels of the plurality of containers and the node labels of the plurality of nodes, each node deploying at least a first number of containers.

The first number is a preset number of containers expected to be deployed by each node, and in order to guarantee the availability of the nodes, at least two containers are deployed on each node, that is, the first number is greater than 1.

It should be noted that the server may determine the number of nodes required by the reverse proxy network service, the memory size of the node used to provide the reverse proxy network service, and the processor type according to the historical traffic of the service to be provided, that is, the historical traffic of the reverse proxy network service, and then, the server may allocate a plurality of nodes to the reverse proxy network service according to the determined number of nodes, memory size, and processor type.

In some embodiments, the server may display a node configuration interface and display configuration items in the node configuration interface, which may include node tags. The server may then obtain the node label entered by the user and add the node label to the assigned plurality of nodes.

For example, the node tag may be a tenant-project-reverse proxy network service, where a tenant refers to a tenant served by a node corresponding to the node tag, a project refers to a project to which the node corresponding to the node tag belongs, and the reverse proxy network service is used for declaring that the node corresponding to the node tag is used for providing a reverse proxy network service. For example, the node label of a certain node is: tenant 1-project 1-reverse proxy network service, it may be determined that the node is for providing reverse proxy network service to project 1 of tenant 1.

Optionally, the configuration item may further include the assigned tenant and item of each node, so that the server may obtain the tenant and item of each node input in the configuration item, and generate a corresponding relationship between each node and the tenant and item of each node according to the tenant and item of each node, for the user to view or use in other scenarios.

Optionally, the server may further add a taint label to the node, where the taint label is used to instruct the corresponding node to prohibit the deployment of the container of the non-reverse proxy network service, so that it may be implemented that the plurality of nodes are only used for providing the reverse proxy network service.

It should be noted that the plurality of nodes allocated by the server may be nodes with the same memory size and the same processor type, and optionally, may also be nodes with the memory size and the different processor type, which is not limited herein in the embodiment of the present application. The same type of processor means that the processors have the same operation capability.

It should be noted that, when a plurality of nodes are allocated, an access port common to the plurality of nodes may be provided. The subsequent NLB may access multiple nodes through the access port, that is, the multiple nodes may receive the request sent by the NLB through the access port.

After the server allocates the plurality of nodes and adds the node labels to the nodes, the server may create a plurality of containers and deploy the plurality of containers on the plurality of nodes.

As an example, the server may display a container configuration interface, and the configuration items in the container configuration interface may include the number of containers created and the container label. The server may then obtain the configuration information entered by the user in each configuration item, create a corresponding number of containers from the configuration information, and add a container label to each container.

It should be noted that, when creating the container, the server may display an optimal container creation number below the number configuration item to prompt the user to create a corresponding number of containers, where the optimal container creation number is a product of the first number and the number of nodes. Then, the server may obtain the value input by the user in the number configuration item, compare the value with the optimal container creation number, and when the value is equal to or greater than the optimal container creation number, create a container corresponding to the value input by the user. When the value is less than the optimal container creation number, the container cannot be created, and at this time, a prompt message of failed creation due to the small number of containers may be displayed in the container configuration interface until the value re-input by the user is equal to or greater than the optimal container creation number.

Illustratively, the first number stored in the server is 2, and the server creates 3 nodes, it may be determined that the optimal number of container creations is 2 × 3 — 6. In this way, the server can display the optimal container creation number of 6 under the number configuration item. Thereafter, when the server acquires that the value input by the user is 6, 6 containers are created. When the server acquires that the numerical value input by the user is 7, 7 containers are created, and when the server acquires that the numerical value input by the user is 5, prompt information of failed creation due to the fact that the number of the containers is small is displayed until the user modifies the input numerical value to be a numerical value equal to or larger than 6.

It should be noted that the numerical value input by the user is not too large, and if the input numerical value is too large and the number of containers deployed on the node is too large, the excessive memory capacity and processor resources of the node are occupied, and even the normal operation of the node may be affected.

After creating a plurality of containers, the server may obtain the container labels input by the user and add the container labels to the plurality of containers. Illustratively, the container tag may be a tenant-item-reverse proxy network service, where a tenant refers to a tenant served by a container corresponding to the container tag, an item refers to an item to which the container corresponding to the container tag belongs, and the reverse proxy network service is used for declaring the container corresponding to the container tag for providing the reverse proxy network service.

After the server creates a plurality of containers and adds container labels, the container labels of the containers can be matched with the node labels of the nodes, and then the containers can be deployed on the nodes which are successfully matched.

The container and the node of the project-tenant-reverse proxy network service included in the container label and the project-tenant-reverse proxy network service included in the node label are the same as each other, and the container and the node are a pair of the node and the container successfully matched with each other, that is, the container can be deployed on the node.

It should be noted that, because the server does not only provide services to the reverse proxy network service, the server may also create a plurality of nodes for other services, and in order to ensure that the container for the reverse proxy network service is deployed on the node for the reverse proxy network service, a container label matching the node label may be added to the container, so that the container can only be deployed on the node successfully matched, thereby ensuring that the container for the reverse proxy network service is necessarily deployed on the node for the reverse proxy network service.

Optionally, the server may also add a tolerance label on the container, the tolerance label indicating that the container is a container served by the reverse proxy network. Because the node is added with the taint label for indicating that the container only receiving the reverse proxy network service is deployed, after the container is added with the tolerant label, the tolerant label can be matched with the taint label on the node, so that only the container for the reverse proxy network service can be deployed on a plurality of nodes, and the container of the non-reverse proxy network service is prevented from being deployed on the node of the reverse proxy network service.

Optionally, the server may further add a deployment label to the container, where the deployment label is used to specify that the container is to be deployed on a certain node.

After allocating the plurality of nodes and creating the plurality of containers, the server may deploy the plurality of containers in the plurality of nodes by two different methods as follows.

In some embodiments, the server may automatically deploy the container, in which case the server may determine a number of nodes that may match the container based on the container label and the tolerance label on the container. The server may then deploy the container on the plurality of nodes. The server can obtain the remaining memory capacity and the idle processor resources of each node in the plurality of nodes, and deploy the container on the plurality of nodes according to the remaining memory capacity and the idle processor resources of each node. Alternatively, the server may randomly deploy the created containers to multiple nodes on average.

Alternatively, when the container includes a deployment label, the server may directly deploy the container on the node indicated by its deployment label according to the deployment label on the container.

Optionally, the server may also be configured with multiple policies to improve the availability and reliability of reverse proxy network services.

Illustratively, the server may obtain a parameter value of the explicit trafficpolicy input by the user, and when the obtained parameter value of the explicit trafficpolicy is Local, it indicates that only the node served by the reverse proxy network may be accessed through the access port set as described above, and the source address of the client in the service request may be reserved. When the server acquires maxSurge of 1, when upgrading containers on multiple nodes, a new container may be created first, and when acquiring maxUnavailable of 0, after creating a new container, an old container may be deleted.

When the server deploys a plurality of containers to a plurality of nodes, the server may detect the states of the deployed plurality of containers. Illustratively, the server may pull an image of the newly added container and test whether the container port is available and communication is possible. After the tests are passed, the newly added container is determined to be in a ready state, that is, can be used.

After detecting that the deployed containers are all in a ready state, the server may obtain the container identifier of each container and the node identifier of the node where the container identifier is deployed, and generate and store a corresponding relationship between the node identifier and the container identifier. Then, the server may search whether there is a recorded total number of containers deployed by the multiple nodes, and when the recorded total number of containers deployed by the multiple nodes is not found, the server may continue to detect whether the number of containers deployed on each current node is balanced through

steps

201 and 202.

In addition, after the corresponding relationship between the node identifier and the container identifier is generated and stored by the above method, in this step, the server may obtain, according to the node identifier of each node, the container identifier corresponding to the node identifier of each node from the stored corresponding relationship between the node identifier and the container identifier; and taking the number of the container identifications corresponding to the acquired node identification of each node as the number of the containers deployed on the corresponding node.

For example, if the correspondence obtained by the server is table 1 below, it may be determined that two containers with container identifiers of container 1 and container 2 are deployed on the node with the node identifier of node 1, two containers with container identifiers of container 3 and container 4 are deployed on the node with the node identifier of node 2, and two containers with container identifiers of container 5 and container 6 are deployed on the node with the node identifier of node 3.

TABLE 1

Node identification	Container label
		Node 1	Container 1, container 2
Node 2	Container 3, 4
		Node 3	Container 5, 6

In other embodiments, the server may obtain, according to the container identifier of each container, a node identifier corresponding to each container identifier from the stored correspondence between the container identifier and the node identifier of the deployed node. Then, the number of containers with the same node identifier of the deployed nodes may be calculated, so that the number of containers corresponding to the node identifier of each node, that is, the number of containers deployed on the node corresponding to the node identifier, may be obtained.

For example, if the correspondence obtained by the server is table 2 below, it may be determined that a container with a container identifier of container 1 is deployed on the node with the node identifier of node 1, a container with a container identifier of container 2 is deployed on the node with the node identifier of node 1, a container with a container identifier of container 3 is deployed on the node with the node identifier of node 2, a container with a container identifier of container 4 is deployed on the node with the node identifier of node 2, a container with a container identifier of container 5 is deployed on the node with the node identifier of node 3, and a container with a container identifier of container 6 is deployed on the node with the node identifier of node 3. Thus, it can be determined that two containers are deployed on the node with the node identifier of node 1, two containers are also deployed on the node with the node identifier of node 2, and two containers are also deployed on the node with the node identifier of node 3.

TABLE 2

Container label	Node identification
		Container 1	Node 1
Container 2	Node 1
		Container 3	Node 2
Container 4	Node 2
		Container 5	Node 3
Container 6	Node 3

Step 202: the first node and the second node are searched from the plurality of nodes according to the number of containers deployed on each node in the plurality of nodes.

The first node refers to a node with the number of deployed containers smaller than the first number, and the second node refers to a node with the number of deployed containers larger than the first number.

After the server determines the number of deployed containers on each node in the plurality of nodes, the number of deployed containers on each node may be compared with the first number, the node whose number of deployed containers is less than the first number is used as the first node, and the node whose number of deployed containers is greater than the first number is used as the second node.

It should be noted that, a plurality of containers deployed on a plurality of nodes need to be upgraded, and when a container is upgraded, a new container is created first, and the new container is deployed on any node in the plurality of nodes, and then one container is deleted from a plurality of old containers deployed before until all the old containers have been replaced with new containers. Since the server may deploy a new container on any one of the nodes, the new container and the deleted container may not be deployed on the same node, which may result in a change in the number of containers deployed on the nodes.

Illustratively, taking table 1 as an example, when a plurality of containers are updated, the server creates a container with container identification of container 7, deploys the container on the node with node identification of node 2, and deletes the container with container identification of container 1. Next, after the server creates a container with a container identifier of container 8, deploys the container on the node with a node identifier of node 2, and deletes the container with the container identifier of container 2 … …, that is, after updating of all the containers is completed, the server obtains the correspondence between the containers and the nodes as shown in table 3 below.

TABLE 3

Node identification	Container label
		Node 1	Container 9
Node 2	Container 7, container 8, container 10, container 12
		Node 3	Container 10

Thus, the server may determine that 1 container is deployed on node 1, 4 containers are deployed on node 2, and 1 container is deployed on node 3. Assuming that the first number is 2, the server compares the numbers of containers deployed on node 1, node 2, and node 3 with the first number, respectively, so that node 1 and node 3 can be regarded as the first node, and node 2 can be regarded as the second node.

Optionally, in some possible cases, the server may not find the first node from the plurality of nodes, that is, there is no node with a deployed container number smaller than the first number, and at this time, it is indicated that the container numbers on the nodes are balanced. In this case, the server may not process containers deployed on multiple nodes.

Step 203: and creating a plurality of newly added containers according to the number m of the found first nodes and the first number, and deploying the newly added containers in the m first nodes.

If the server finds m first nodes from the plurality of nodes through step 202, the server may determine the number of newly added containers to be created according to the number m of the first nodes and the first number, create a corresponding number of newly added containers, and deploy the created newly added containers in the first nodes.

In this embodiment of the application, the server may determine a difference between the number of containers deployed on each node of the m first nodes and the first number, to obtain m first values; determining the sum of the m first values to obtain a second value; a number of newly added containers of a second value is created. .

Illustratively, continuing with the example of step 202 above, node 1 and node 3 are first nodes, and each of node 1 and node 3 has only one container deployed thereon, with the first number being 2. In this way, the server may determine the difference between node 1 and the first number, that is, the first value 1 is 1, and the difference between node 3 and the first number, that is, the first value 2 is 1, and then add the first value 1 and the first value 2 to obtain the second value 1+1 — 2, at which time, the server may create 2 new containers.

It should be noted that, when creating a plurality of containers in the foregoing step 201, after adding tolerance labels and container labels to the plurality of containers, a container template may be generated, where the container template includes the tolerance labels and the container labels. Therefore, in the step, when the server creates the newly added container, the newly added container can be directly created based on the container template, and a tolerance label and a container label do not need to be specially added to each newly added container.

In addition, in this embodiment of the application, after the server finds the first node and before the newly added container is deployed on the plurality of first nodes, the server may record the total number of containers already deployed on the plurality of nodes, that is, when the newly added container that is created is not deployed on the plurality of nodes, the server may record the total number of containers that are deployed on the plurality of nodes. For convenience of the following description, the total number of the containers deployed by the plurality of nodes recorded before the newly added containers are not deployed may be used as the second number.

After the server creates the new container, the new container may be deployed on the first node, where a method for deploying the new container on the first node is the same as the method described above, and is not described herein again.

For example, continuing the foregoing example, after the server creates 2 newly added containers, the 2 newly added containers may be respectively deployed on the node identified as node 1 and the node identified as node 3 according to the remaining memory and processor capacity of the 3 nodes. Optionally, the server may further add a container label 1 to one newly added container, and add a container label 2 to another newly added container, where the container label 1 is used to indicate that the container carrying the label is deployed on the node whose node identifier is the node 1, and the container label 2 is used to indicate that the container carrying the label is deployed on the node whose node identifier is the node 3. Then, the server may deploy 2 newly added containers on the node whose node is identified as node 1 and the node whose node is identified as node 3, respectively, according to the container labels.

It should be noted that, as can be seen from the foregoing, the memory size of the plurality of nodes and the computing capability of the processor may be the same or different. When the memory size of the nodes and the processing capacity of the processor are the same, the server can automatically deploy the newly added container, and because the number of the containers deployed on the first node is smaller than the first number, the memory occupation size and the processor resource occupation amount of the first node are smaller than those of other nodes, namely the remaining memory size of the first node and the resources of the idle processor are more, so that when the server deploys the newly added container according to the remaining amount of the memory and the processor, the newly added container can be deployed in the first node. When the memory sizes of the nodes are different from the processor types, the newly added container can be assigned to be deployed on the first node by adding a deployment tag on the newly added container.

It is noted that after the server creates the new container and deploys the new container to the first node, the server may detect the status of all containers, and when all containers are in the ready state, the following step 204 may be performed. The method for detecting whether all containers are in the ready state may refer to the foregoing method, and will not be described herein again.

Step 204: and deleting a plurality of target containers from the searched containers deployed on the n second nodes, so that the number of the containers deployed on each second node is not less than the first number.

After the server detects that the deployed node containers are all in a ready state, it can look up whether there is a second number of records. Since the second number is recorded before the newly added containers are deployed in the plurality of first nodes in step 203, the corresponding second number can be found here. In this case, the server may delete a plurality of target containers according to the found second number.

In some embodiments, the server may determine a difference between the second number and a total number of currently deployed containers on the plurality of nodes after the newly added container, to obtain a third value; determining a difference between the number of containers deployed on each second node and the first number to obtain a number of redundant containers on the corresponding second node; adding target labels to containers, the number of which is equal to the number of the redundant containers of the corresponding second node, in the containers deployed on each second node to obtain target containers on the corresponding second nodes; and deleting a plurality of target containers on the n second nodes, wherein the number of the plurality of target containers is equal to the third numerical value.

Wherein the second number is equal to the total number of the initially created containers, and the target label is used for indicating that the container carrying the target label is preferentially deleted when the container is deleted. The target tag may be any tag capable of indicating preferential deletion, and the embodiment of the present application is not limited herein.

In this embodiment of the present application, the server may subtract the second number from the total number of the currently deployed containers on the multiple nodes after the new container is added, so as to obtain a third value, where the third value is the total number of the target containers that need to be deleted currently. Then, the server may subtract the first number from the number of containers deployed on each second node to obtain the number of redundant containers on the corresponding second node, that is, the number of target containers that need to be deleted on each second node.

Illustratively, continuing with the foregoing example, if the total number of containers currently deployed on the plurality of nodes after the new container is added is 8, and the second number is 6, then it may be determined that the third value is 8-6 — 2. Thereafter, the server may subtract the first number 2 from the number 4 of containers deployed on the node whose node identifier is node 2, to obtain that the number of redundant containers on the node whose node identifier is node 2 is 2.

The server, after determining the number of redundant containers on each second node, may determine a corresponding number of redundant containers from the plurality of containers deployed on each second node and add a target label to each of the containers. Then, the server may randomly select a third number of target containers from the plurality of target containers to which the target labels are added on the second nodes, and delete the third number of target containers, so as to ensure that the total final number of containers on the plurality of nodes is equal to the total number of initially created containers.

When the number of containers corresponding to the number of redundant containers is determined from the plurality of containers deployed on each second node, the selection may be arbitrary, or optionally, the selection may also be performed according to a certain rule, for example: the number of containers with redundant containers may be sequentially selected according to the order of container creation time, and this embodiment of the present application is not limited herein.

Illustratively, continuing with the foregoing example, the server may arbitrarily select 2 containers from 4 containers deployed on the node whose node is identified as node 2, for example, 2 containers whose containers are identified as container 7 and container 10, and add the target labels to the 2 containers, and then, when the server deletes the containers again, preferentially delete 2 containers whose container identifications are container 7 and container 10 from the plurality of containers whose deployed containers are identified as container 7, container 8, container 9, container 10, container 11, and container 12.

Optionally, the server may delete the second number of records after deleting the plurality of target containers, so as to avoid the records from affecting subsequent adjustments to the containers.

In the embodiment of the present application, a plurality of newly added containers are deployed in a first node, and a plurality of target containers are deleted from containers deployed on a second node, where the first node refers to a node whose number of deployed containers is smaller than a first number, the second node refers to a node whose number of deployed containers is greater than the first number, and the number of containers deployed after the target node is deleted by each second node is not smaller than the first number, therefore, the first number of containers can be deployed on both the first node and the second node, so that a problem that a request to the node is interrupted when the container is a container currently being upgraded is avoided, and the processing efficiency of the reverse proxy network service is ensured. In addition, after the node label is added on the node and the container label is added on the container, the node can be only used for the reverse proxy network service, and the container can be ensured to be deployed on the corresponding node, so that the processing efficiency of the reverse proxy network service is further improved.

Referring to fig. 3, an embodiment of the present application provides a server 300, where the server 300 includes:

an obtaining module 301, configured to obtain the number of containers deployed on each node in the multiple nodes;

a searching module 302, configured to search, according to the number of containers deployed on each node of the multiple nodes, a first node and a second node from the multiple nodes, where the first node is a node whose number of containers deployed is smaller than a first number, the second node is a node whose number of containers deployed is greater than the first number, the first number is a preset number of containers expected to be deployed by each node, and the first number is greater than 1;

a first creating module 303, configured to create a plurality of newly added containers according to the number m and the first number of the found first nodes, and deploy the plurality of newly added containers in the m first nodes;

a deleting module 304, configured to delete multiple target containers from the found containers deployed on the n second nodes, so that the number of containers deployed on each second node is not less than the first number.

Optionally, the obtaining module 301 is specifically configured to:

according to the node identification of each node, acquiring a container identification corresponding to the node identification of each node from the corresponding relation between the stored node identification and the container identification;

and taking the number of the container identifications corresponding to the acquired node identification of each node as the number of the containers deployed on the corresponding node.

Optionally, the first creating module 303 is specifically configured to:

determining a difference value between the number of containers deployed on each node in m first nodes and the first number to obtain m first numerical values;

determining the sum of the m first values to obtain a second value;

a number of newly added containers of a second value is created.

Optionally, the deleting module 304 is specifically configured to:

determining a difference value between the second number and the total number of the containers which are deployed on the nodes after the newly added containers to obtain a third numerical value, wherein the second number is equal to the total number of the containers which are deployed on the nodes before the newly added containers are deployed on the first nodes;

determining a difference between the number of containers deployed on each second node and the first number to obtain a number of redundant containers on the corresponding second node;

adding target labels to containers, the number of which is equal to the number of the redundant containers of the corresponding second node, in the containers deployed on each second node to obtain target containers on the corresponding second nodes;

and deleting a plurality of target containers on the n second nodes, wherein the number of the target containers is equal to the third numerical value.

Optionally, the server 300 further includes:

a second creating module, configured to create a plurality of nodes, and add a node label to each node in the plurality of nodes, where the node label is used to indicate that a corresponding node is used to provide a reverse proxy service;

a third creating module, configured to create a plurality of containers according to the number of the plurality of nodes and the first number, and add a container label to each of the plurality of containers, where the container label is used to indicate that the corresponding container is used to provide the reverse proxy service;

the deployment module is used for deploying the containers in the nodes according to the container labels of the containers and the node labels of the nodes, and each node deploys at least a first number of containers.

In summary, in the embodiment of the present application, a plurality of newly added containers are deployed in a first node, and a plurality of target containers are deleted from containers deployed on a second node, where the first node refers to a node whose number of deployed containers is smaller than the first number, the second node refers to a node whose number of deployed containers is greater than the first number, and the number of containers deployed after each second node deletes a target node is not smaller than the first number, therefore, the first number of containers can be deployed on both the first node and the second node, so that a problem that a request to the node is interrupted when the container is a container currently being upgraded is avoided, and the processing efficiency of the reverse proxy network service is ensured. In addition, after the node label is added on the node and the container label is added on the container, the node can be only used for the reverse proxy network service, and the container can be ensured to be deployed on the corresponding node, so that the processing efficiency of the reverse proxy network service is further improved.

It should be noted that: in the container adjustment server provided in the above embodiment, when adjusting the container, only the division of the above function modules is exemplified, and in practical applications, the function distribution may be completed by different function modules according to needs, that is, the internal structure of the device is divided into different function modules to complete all or part of the functions described above. In addition, the container adjustment server and the container adjustment method provided by the above embodiments belong to the same concept, and specific implementation processes thereof are detailed in the method embodiments and are not described herein again.

Fig. 4 shows a schematic structural diagram of a server 400 for container adjustment according to an exemplary embodiment of the present application. The functions of the server in the embodiment shown in fig. 2 can be implemented by the server shown in fig. 4. The server may be a server in a cluster of background servers. Specifically, the method comprises the following steps:

the server 400 includes a Central Processing Unit (CPU)401, a system memory 404 including a Random Access Memory (RAM)402 and a Read Only Memory (ROM)403, and a system bus 405 connecting the system memory 404 and the central processing unit 401. The server 400 also includes a basic input/output system (I/O system) 406, which facilitates the transfer of information between devices within the computer, and a mass storage device 407 for storing an operating system 413, application programs 414, and other program modules 415.

The basic input/output system 406 includes a display 408 for displaying information and an input device 409 such as a mouse, keyboard, etc. for user input of information. Wherein a display 408 and an input device 409 are connected to the central processing unit 401 through an input output controller 410 connected to the system bus 405. The basic input/output system 406 may also include an input/output controller 410 for receiving and processing input from a number of other devices, such as a keyboard, mouse, or electronic stylus. Similarly, input/output controller 410 may also provide output to a display screen, a printer, or other type of output device.

The mass storage device 407 is connected to the central processing unit 401 through a mass storage controller (not shown) connected to the system bus 405. The mass storage device 407 and its associated computer-readable media provide non-volatile storage for the server 400. That is, the mass storage device 407 may include a computer-readable medium (not shown) such as a hard disk or CD-ROM drive.

Without loss of generality, computer readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes RAM, ROM, EPROM, EEPROM, flash memory or other solid state memory technology, CD-ROM, DVD, or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices. Of course, those skilled in the art will appreciate that computer storage media is not limited to the foregoing. The system memory 404 and mass storage device 407 described above may be collectively referred to as memory.

According to various embodiments of the present application, the server 400 may also operate as a remote computer connected to a network through a network, such as the Internet. That is, the server 400 may be connected to the network 412 through the network interface unit 411 connected to the system bus 405, or may be connected to other types of networks or remote computer systems (not shown) using the network interface unit 411.

The memory further includes one or more programs, and the one or more programs are stored in the memory and configured to be executed by the CPU. The one or more programs include instructions for performing the container adjustment method provided by the embodiments of the present application.

Embodiments of the present application further provide a non-transitory computer-readable storage medium, where instructions in the storage medium, when executed by a processor of a server, enable the server to perform the container adjustment method provided in the embodiment shown in fig. 2.

Embodiments of the present application further provide a computer program product containing instructions, which when run on a computer, cause the computer to execute the container adjustment method provided in the embodiment shown in fig. 2.

It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, where the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.

The above description is only exemplary of the present application and should not be taken as limiting, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the protection scope of the present application.

Claims

1. A method of container conditioning, the method comprising:

2. The method of claim 1, wherein obtaining the number of deployed containers on each of the plurality of nodes comprises:

3. The method according to claim 1, wherein the creating a plurality of newly added containers according to the number m of the found first nodes and the first number comprises:

determining a difference value between the number of containers deployed on each node in the m first nodes and the first number to obtain m first numerical values;

determining the sum of the m first values to obtain a second value;

creating a plurality of newly added containers with the number of the second numerical value.

4. The method according to claim 1, wherein the deleting a plurality of target containers from the found containers deployed on the n second nodes comprises:

determining a difference between a second number and a total number of containers deployed on the plurality of nodes after the newly added containers to obtain a third value, wherein the second number is equal to the total number of containers deployed on the plurality of nodes before the newly added containers are deployed on the plurality of first nodes;

5. The method of claim 1, wherein prior to obtaining the number of deployed containers on each of the plurality of nodes, further comprising:

determining the plurality of nodes, and adding a node label for each node in the plurality of nodes, wherein the node label is used for indicating that the corresponding node is used for providing reverse proxy network service;

creating a plurality of containers according to the number of the plurality of nodes and the first number, adding a container label to each container in the plurality of containers, the container label indicating that the corresponding container is used for providing reverse proxy network services;

deploying the plurality of containers in the plurality of nodes according to the container labels of the plurality of containers and the node labels of the plurality of nodes, each node deploying at least the first number of containers.

6. A server, characterized in that the server comprises:

7. The server according to claim 6, wherein the obtaining module is specifically configured to:

8. The server according to claim 6, wherein the first creation module is specifically configured to:

determining the sum of the m first values to obtain a second value;

9. The server according to claim 6, wherein the deletion module is specifically configured to:

adding target labels to containers which are not more than the number of the redundant containers of the corresponding second node in the containers deployed on each second node to obtain target containers on the corresponding second nodes;

and deleting a plurality of target containers on the n second nodes, wherein the number of the plurality of target containers is equal to the third numerical value.

10. The server of claim 6, further comprising:

a second creating module, configured to create the plurality of nodes, and add a node label to each node in the plurality of nodes, where the node label is used to indicate that the corresponding node is used to provide a reverse proxy network service;

a third creating module, configured to create a plurality of containers according to the number of the plurality of nodes and the first number, and add a container label to each container in the plurality of containers, where the container label is used to indicate that the corresponding container is used to provide a reverse proxy network service;

a deployment module to deploy the plurality of containers in the plurality of nodes according to the container labels of the plurality of containers and the node labels of the plurality of nodes, each node deploying at least the first number of containers.