CN116668296B - Gateway node scheduling method, system, equipment and storage medium - Google Patents
Gateway node scheduling method, system, equipment and storage medium Download PDFInfo
- Publication number
- CN116668296B CN116668296B CN202310956547.8A CN202310956547A CN116668296B CN 116668296 B CN116668296 B CN 116668296B CN 202310956547 A CN202310956547 A CN 202310956547A CN 116668296 B CN116668296 B CN 116668296B
- Authority
- CN
- China
- Prior art keywords
- bare metal
- metal soft
- availability group
- node
- soft gateway
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 239000002184 metal Substances 0.000 claims abstract description 325
- 229910052751 metal Inorganic materials 0.000 claims abstract description 325
- 238000001514 detection method Methods 0.000 claims abstract description 17
- 230000004044 response Effects 0.000 claims description 53
- 238000012216 screening Methods 0.000 claims description 26
- 238000012544 monitoring process Methods 0.000 claims description 22
- 238000012217 deletion Methods 0.000 claims description 11
- 230000037430 deletion Effects 0.000 claims description 11
- 238000004590 computer program Methods 0.000 claims description 9
- 230000005856 abnormality Effects 0.000 claims description 4
- 230000008859 change Effects 0.000 description 11
- 238000013461 design Methods 0.000 description 9
- 238000004891 communication Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 4
- 230000002159 abnormal effect Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000014509 gene expression Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005538 encapsulation Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 150000002739 metals Chemical class 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0895—Configuration of virtualised networks or elements, e.g. virtualised network function or OpenFlow elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/66—Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/40—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using virtualisation of network functions or resources, e.g. SDN or NFV entities
Abstract
The invention discloses a gateway node scheduling method, a system, equipment and a storage medium, which relate to the field of servers, and the method comprises the following steps: acquiring a plurality of configured bare metal soft gateway nodes and selecting a plurality of bare metal soft gateway nodes from the plurality of bare metal soft gateway nodes; responding to the number of the selected bare metal soft gateway nodes as a first preset number, acquiring a network where a bare metal server corresponding to a high-availability group to be created is located, and searching whether a virtual machine exists or not under the network; and responding to the virtual machine under the network, taking a computing node corresponding to the virtual machine as a reference node and establishing a high-availability group with the plurality of bare metal soft gateway nodes, wherein the reference node is used for providing heartbeat detection references for other members in the high-availability group. According to the scheme provided by the invention, the reference nodes are arranged, so that even if the number of bare metal soft gateway nodes cannot meet the high availability requirement, the real high availability can be realized.
Description
Technical Field
The present invention relates to the field of servers, and in particular, to a gateway node scheduling method, system, device, and storage medium.
Background
In the current high availability design of the bare metal soft gateway, a hajpassis_group (a resource type in ovn for storing a high availability group) implementation in ovn (Open Virtual Network, open virtual network, a software system supporting virtual network abstraction) is adopted. ha_channels_group may bind multiple gateway nodes. However, the existing scheme generally focuses on which nodes are selected, but does not care about the influence of quantity, capacity expansion and the like, so the following problems exist:
1. if the number of currently bonded mesh nodes is less than 3, there is no high availability. The actual environment does not have as many gateway nodes, and even if the number of bare metal soft gateway nodes is expanded later, the old bare metal is still bound to be original, and cannot have high available functions.
2. Each bare metal soft gateway needs to configure one ha_channels_group, and many ha_channels_group resources may be created.
Disclosure of Invention
In view of this, in order to overcome at least one aspect of the above-mentioned problems, an embodiment of the present invention proposes a gateway node scheduling method, including the following steps:
acquiring a plurality of configured bare metal soft gateway nodes and selecting a plurality of bare metal soft gateway nodes from the plurality of bare metal soft gateway nodes;
Responding to the number of the selected bare metal soft gateway nodes as a first preset number, acquiring a network where a bare metal server corresponding to a high-availability group to be created is located, and searching whether a virtual machine exists or not under the network;
and responding to the virtual machine under the network, taking a computing node corresponding to the virtual machine as a reference node and establishing a high-availability group with the plurality of bare metal soft gateway nodes, wherein the reference node is used for providing heartbeat detection references for other members in the high-availability group.
In some embodiments, further comprising:
and in response to no virtual machine under the network, selecting one computing node as a reference node by adopting a preset algorithm and creating a high-availability group with the plurality of bare metal soft gateway nodes.
In some embodiments, the step of creating a high availability group further comprises:
acquiring the priority of each bare metal soft gateway node in the high-availability group to be created;
forming a first character string from the name of each bare metal soft gateway node according to the priority order;
carrying out hash operation on the first character string and the ID of the network to obtain a hash value, and taking the hash value as the name of the high-availability group to be created;
Judging whether the name exists or not;
in response to the name not being present, the high availability group is created.
In some embodiments, further comprising:
binding the created high-availability group to a network port corresponding to the bare metal server and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
In some embodiments, further comprising:
responding to the existence of the name, acquiring the created high-availability group based on the name and binding the created high-availability group to a network port corresponding to the bare metal server;
and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
In some embodiments, further comprising:
creating a high availability group with the plurality of bare metal soft gateway nodes in response to the selected number of bare metal soft gateway nodes being a second preset number greater than the first preset number;
binding the created high-availability group to a network port corresponding to the bare metal server and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
In some embodiments, the step of creating a high availability group using the number of bare metal soft gateway nodes further comprises:
Acquiring the priority of each bare metal soft gateway node;
forming a second character string by the name of each bare metal soft gateway node according to the priority order;
carrying out hash operation on the second character string to obtain a hash value, and taking the hash value as the name of the high-availability group to be created;
judging whether the name exists or not;
in response to the name not being present, the high availability group is created.
In some embodiments, further comprising:
binding the created high-availability group to a network port corresponding to the bare metal server and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
In some embodiments, further comprising:
responding to the existence of the name, acquiring the created high-availability group based on the name and binding the created high-availability group to a network port corresponding to the bare metal server;
and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
In some embodiments, further comprising:
performing heartbeat detection on every two members in the high-availability group;
and responding to the heartbeat detection abnormality of the bare metal soft gateway node with the highest priority, and providing service for the bare metal server by using the bare metal soft gateway node with the next priority.
In some embodiments, further comprising:
in response to monitoring that the bare metal soft gateway node is deleted, searching for a first high availability group associated with the deleted bare metal soft gateway node;
traversing each of the first high availability groups and rescheduling the bare metal soft gateway node or reference node based on the number of members included in each of the first high availability groups.
In some embodiments, the step of rescheduling the bare metal soft gateway node or the reference node based on the number of members included in each of the first high availability groups further comprises:
searching network ports bound by the first high-availability group in response to the first high-availability group comprising less than the first preset number of bare metal soft gateway nodes;
new highly available groups are rebindd for the network port.
In some embodiments, the step of rescheduling the bare metal soft gateway node or the reference node based on the number of members included in each of the first high availability groups further comprises:
setting the priority of the bare metal soft gateway nodes left after deletion as the highest priority in response to the first preset number of bare metal soft gateway nodes included in the first high availability group;
A new bare metal soft gateway node is rescheduled for the first high availability group.
In some embodiments, the step of rescheduling the bare metal soft gateway node or the reference node based on the number of members included in each of the first high availability groups further comprises:
responding to the first high-availability group comprising a second preset number of the bare metal soft gateway nodes, and keeping the priority of the remaining bare metal soft gateway nodes after deletion unchanged;
a new one of the bare metal soft gateway node or the reference node is rescheduled for the first high availability group.
In some embodiments, further comprising:
in response to monitoring that the reference node is deleted, searching for a second high availability group associated with the deleted reference node;
traversing each of said second high availability groups and rescheduling a new one of said bare metal soft gateway node or said reference node for each of said second high availability groups.
In some embodiments, further comprising:
in response to monitoring that a new bare metal soft gateway node is added, screening third high-availability groups, wherein the number of the bare metal soft gateway nodes in each third high-availability group is smaller than a second preset number;
And dispatching the newly added bare metal soft gateway nodes into each third high-availability group, and keeping the priority of the current bare metal soft gateway node in each third high-availability group unchanged.
In some embodiments, further comprising:
in response to monitoring that the computing node adds virtual machines, screening a fourth high-availability group, wherein the screening condition is that a bare metal server corresponding to the high-availability group and the added virtual machines are in the same network, the high-availability group comprises reference nodes, and the reference nodes do not have virtual machines under the network;
and replacing the reference node in each fourth high available group with the computing node of the added virtual machine.
In some embodiments, further comprising:
in response to monitoring that the computing node deletes the virtual machine, judging whether the computing node further comprises a virtual machine which is in the same network with the deleted virtual machine;
in response to the lack, screening a fifth high-availability group, wherein the screening condition is that a bare metal server corresponding to the high-availability group and the deleted virtual machine are in the same network, the high-availability group comprises a reference node, and the reference node is the computing node of the deleted virtual machine;
Searching whether other virtual machines exist under the network;
and in response to other virtual machines under the network, adding computing nodes corresponding to the other virtual machines into each fifth high-availability group to replace the original reference nodes.
Based on the same inventive concept, according to another aspect of the present invention, an embodiment of the present invention further provides a gateway node scheduling system, including:
the acquisition module is configured to acquire the configured plurality of bare metal soft gateway nodes and select a plurality of bare metal soft gateway nodes from the plurality of bare metal soft gateway nodes;
the searching module is configured to respond to the first preset number of the selected bare metal soft gateway nodes, acquire a network where a bare metal server corresponding to a high-availability group to be created is located, and search whether a virtual machine exists or not under the network;
the creation module is configured to respond to the existence of a virtual machine under the network, take a computing node corresponding to the virtual machine as a reference node and create a high availability group with the plurality of bare metal soft gateway nodes, wherein the reference node is used for providing heartbeat detection references for other members in the high availability group.
Based on the same inventive concept, according to another aspect of the present invention, an embodiment of the present invention further provides a computer apparatus, including:
At least one processor; and
a memory storing a computer program executable on the processor, the processor executing steps of any of the gateway node scheduling methods described above.
Based on the same inventive concept, according to another aspect of the present invention, there is also provided a computer readable storage medium storing a computer program which, when executed by a processor, performs the steps of any of the gateway node scheduling methods as described above.
The invention has one of the following beneficial technical effects: according to the scheme provided by the invention, the reference nodes are arranged, so that even if the number of bare metal soft gateway nodes cannot meet the high availability requirement, the real high availability can be realized.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are necessary for the description of the embodiments or the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention and that other embodiments may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flow chart of a gateway node scheduling method according to an embodiment of the present invention;
fig. 2 is a flow chart of a gateway node scheduling method according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a gateway node scheduling system according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a computer device according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a computer-readable storage medium according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the following embodiments of the present invention will be described in further detail with reference to the accompanying drawings.
It should be noted that, in the embodiments of the present invention, all the expressions "first" and "second" are used to distinguish two entities with the same name but different entities or different parameters, and it is noted that the "first" and "second" are only used for convenience of expression, and should not be construed as limiting the embodiments of the present invention, and the following embodiments are not described one by one.
In the embodiment of the invention, the meanings of the related technical terms are as follows:
bare metal soft gateway node: and a pure soft implementation is adopted to provide various network function agents, such as overlay encapsulation, qos, security groups and the like, for the bare metal server.
High availability node: when providing proxy services for bare metal, each bare metal server may bind multiple bare metal soft gateway nodes, which are high availability nodes to each other, in order to ensure that proxy services are available.
ha_channels_group: ovn, a resource type for storing a high availability group, each high availability group may store a plurality of high availability nodes with priority among the high availability nodes.
According to an aspect of the present invention, an embodiment of the present invention proposes a gateway node scheduling method, as shown in fig. 1, which may include the steps of:
s1, acquiring a plurality of configured bare metal soft gateway nodes and selecting a plurality of bare metal soft gateway nodes from the plurality of bare metal soft gateway nodes;
s2, responding to the first preset number of the selected bare metal soft gateway nodes, acquiring a network where a bare metal server corresponding to a high-availability group to be created is located, and searching whether a virtual machine exists or not under the network;
and S3, responding to the virtual machine under the network, taking a computing node corresponding to the virtual machine as a reference node and establishing a high availability group with the plurality of bare metal soft gateway nodes, wherein the reference node is used for providing heartbeat detection references for other members in the high availability group.
According to the scheme provided by the invention, the reference nodes are arranged, so that even if the number of bare metal soft gateway nodes cannot meet the high availability requirement, the real high availability can be realized.
In some embodiments, as shown in fig. 2, when a plurality of bare metal soft gateway nodes are selected from a plurality of configured bare metal soft gateway nodes, a plurality of nodes may be selected according to a minimum load algorithm or a random algorithm, and if the number of selected nodes cannot meet a high availability requirement (for example, the number of bare metal soft gateway nodes is 2), one reference node may be set, so that a high availability group is formed by the reference node and the selected plurality of bare metal soft gateway nodes to realize true high availability. The bare metal soft gateway node is generally in communication with other bare metal soft gateway nodes or virtual machines, so that the virtual machines can be searched under the network where the bare metal server is located, and the first type computing nodes bound by the virtual machines are used as reference nodes. If there are multiple virtual machines, one may be chosen randomly or by other algorithms.
In some embodiments, further comprising:
and in response to no virtual machine under the network, selecting one computing node as a reference node by adopting a preset algorithm and creating a high-availability group with the plurality of bare metal soft gateway nodes.
Specifically, as shown in fig. 2, if there is no virtual machine under the network where the bare metal server is located, one may be selected from all the second class computing nodes by adopting a random or other algorithm. The second type of reference node is lower in reliability as a high-availability node than the first type of computing node because the second type of reference node cannot directly or indirectly communicate with the bare metal soft gateway node.
In some embodiments, the step of creating a high availability group further comprises:
acquiring the priority of each bare metal soft gateway node in the high-availability group to be created;
forming a first character string from the name of each bare metal soft gateway node according to the priority order;
carrying out hash operation on the first character string and the ID of the network to obtain a hash value, and taking the hash value as the name of the high-availability group to be created;
judging whether the name exists or not;
in response to the name not being present, the high availability group is created.
In some embodiments, further comprising:
binding the created high-availability group to a network port corresponding to the bare metal server and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
In some embodiments, further comprising:
responding to the existence of the name, acquiring the created high-availability group based on the name and binding the created high-availability group to a network port corresponding to the bare metal server;
and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
Specifically, as shown in fig. 2, the name of each bare metal soft gateway node may be formed into a first string according to the priority order of each bare metal soft gateway node, then a hash value is calculated by adding the ID of the network, and a fixed prefix (for example, bm-hcg-) + hash value is used as the name of the high availability group (ha_establishment_group) to be created. The method comprises the steps of checking whether a high available group with the same name exists or not before creation, if so, using the existing high available group and binding the high available group to a network port of a bare metal server, then using a bare metal soft gateway node with the highest priority to provide service for the bare metal server, and if not, creating the high available group. Multiplexing by high available group names can ensure that there are at most 2m (m is the number of networks where bare metal is located) high available groups. And the repeated scheduling of bare metal servers under the same network is avoided. The design can ensure that the gateway node selected according to the expectation is bound with the bare metal soft gateway by utilizing the characteristic of hash, and also avoid creating too many high-availability groups and wasting resources.
It should be noted that, the bare metal soft gateway node has a higher priority than the reference node, and when the trigger is high available, the reference node is only switched between the real bare metal soft gateway nodes, and the reference node is not really switched to, but only the reference function.
In some embodiments, further comprising:
creating a high availability group with the plurality of bare metal soft gateway nodes in response to the selected number of bare metal soft gateway nodes being a second preset number greater than the first preset number;
binding the created high-availability group to a network port corresponding to the bare metal server and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
Specifically, as shown in fig. 2, when the number of the selected bare metal soft gateway nodes can achieve high availability (for example, 3), the reference nodes may not be set, and of course, the reference nodes may also be set, so as to assist in judging whether other bare metal soft gateways are normal when the bare metal soft gateway nodes are switched.
In some embodiments, the step of creating a high availability group using the number of bare metal soft gateway nodes further comprises:
acquiring the priority of each bare metal soft gateway node;
Forming a second character string by the name of each bare metal soft gateway node according to the priority order;
carrying out hash operation on the second character string to obtain a hash value, and taking the hash value as the name of the high-availability group to be created;
judging whether the name exists or not;
in response to the name not being present, the high availability group is created.
In some embodiments, further comprising:
binding the created high-availability group to a network port corresponding to the bare metal server and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
In some embodiments, further comprising:
responding to the existence of the name, acquiring the created high-availability group based on the name and binding the created high-availability group to a network port corresponding to the bare metal server;
and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
Specifically, as shown in fig. 2, the names of the bare metal soft gateway nodes are formed into a string according to the priority order, and hash operation is performed (for example, sha1 algorithm is adopted). A string is formed with a fixed prefix (e.g., bm-hcg-) + hash value as the name of the created high availability group. Before creation, it can check if the high availability group of the same name exists, if so, it uses the existing high availability group and binds it to the network port of the bare metal server, then uses the bare metal soft gateway node with the highest priority to provide service for the bare metal server, if not, it creates the high availability group. The design can ensure that the gateway node selected according to the expectation is bound with the bare metal soft gateway by utilizing the characteristic of hash, and also avoid creating too many high-availability groups and wasting resources. Without this design, the number of highly available groups would increase linearly with the number of bare metal, and after this design, the highly available group data is at most (n by the number of bare metal soft gateways) n (n-1) n (n-2).
In some embodiments, as shown in fig. 2, if the number of bare metal soft gateway nodes selected is 1, it is not possible to switch between high availability, nor is it possible to form 3 high availability nodes by adding 2 reference nodes, as in this case it is possible to cut to computing nodes that are not truly serviced. Therefore, when the bare metal soft gateway nodes are only 1, only 1 in the high available group can be configured. The naming of the high availability group adopts direct hash of the name of the node, and ensures that at most 1 high availability group exists in the environment. Avoiding high available group resources as the number of bare metals increases.
In some embodiments, further comprising:
performing heartbeat detection on every two members in the high-availability group;
and responding to the heartbeat detection abnormality of the bare metal soft gateway node with the highest priority, and providing service for the bare metal server by using the bare metal soft gateway node with the next priority.
Specifically, heartbeat detection can be performed between every two members in the high-availability group, and if the bare metal soft gateway node with the highest priority is abnormal, namely, the bare metal soft gateway node which provides service for the bare metal server currently is abnormal, the bare metal soft gateway node with the next priority is switched to provide service for the bare metal server. For example, if a reference node exists in the high availability group, a heartbeat cannot be established between the bare metal soft gateway node currently serving the bare metal server and other nodes, and the heartbeat between the other bare metal soft gateway node and the reference node is normal, if the bare metal soft gateway node currently serving the bare metal server is considered abnormal, the bare metal soft gateway node of the next priority is switched to serve the bare metal server.
In some embodiments, further comprising:
in response to monitoring that the bare metal soft gateway node is deleted, searching for a first high availability group associated with the deleted bare metal soft gateway node;
traversing each of the first high availability groups and rescheduling the bare metal soft gateway node or reference node based on the number of members included in each of the first high availability groups.
Specifically, the high availability nodes in the high availability group can be dynamically updated according to different scenes (capacity expansion nodes and capacity shrinkage nodes). The change of the passis table in the snoop ovn-sb for recording the bare metal soft gateway node can be added, for example, by the ovsdb (open vSwitch database, open source virtual switch database) protocol. After node deletion is monitored, searching a first high-availability group associated with the deleted bare metal soft gateway node, and rescheduling the bare metal soft gateway node or the reference node according to the number of members included in each high-availability group.
In some embodiments, the step of rescheduling the bare metal soft gateway node or the reference node based on the number of members included in each of the first high availability groups further comprises:
Searching network ports bound by the first high-availability group in response to the first high-availability group comprising less than the first preset number of bare metal soft gateway nodes;
new highly available groups are rebindd for the network port.
Specifically, if the high availability group is a high availability node, searching the network port of the bare metal server associated with the high availability group, and carrying out scheduling binding again.
In some embodiments, the step of rescheduling the bare metal soft gateway node or the reference node based on the number of members included in each of the first high availability groups further comprises:
setting the priority of the bare metal soft gateway nodes left after deletion as the highest priority in response to the first preset number of bare metal soft gateway nodes included in the first high availability group;
a new bare metal soft gateway node is rescheduled for the first high availability group.
Specifically, if the high availability group binds a first preset number (e.g., 2) of gateway nodes, 0 or 1 reference nodes are bound. Searching the bare metal ports associated with the high-availability group, enabling the priority of the remaining bare metal soft gateway nodes after deletion to be highest, and then scheduling other nodes, wherein the priority scheduling forms a new bare metal soft gateway node to form a new high-availability group. The specific scheduling logic is consistent with the newly bound bare metal soft gateway. And the original bare metal soft gateway node is rescheduled with the highest priority, so that the original service communication condition is ensured not to change.
In some embodiments, the step of rescheduling the bare metal soft gateway node or the reference node based on the number of members included in each of the first high availability groups further comprises:
responding to the first high-availability group comprising a second preset number of the bare metal soft gateway nodes, and keeping the priority of the remaining bare metal soft gateway nodes after deletion unchanged;
a new one of the bare metal soft gateway node or the reference node is rescheduled for the first high availability group.
Specifically, if the high available group binds a second preset number (e.g., 3) of bare metal soft gateway nodes, the bare metal ports associated with the high available group are searched to leave the bare metal soft gateway node with the highest priority, the priority is the same as the priority, a new bare metal soft gateway node or the reference node is scheduled to form a new high available group, and specific scheduling logic is consistent with the newly bound bare metal soft gateway. And the original bare metal soft gateway node is rescheduled with the highest priority, so that the original service communication condition is ensured not to change.
In some embodiments, further comprising:
In response to monitoring that the reference node is deleted, searching for a second high availability group associated with the deleted reference node;
traversing each of said second high availability groups and rescheduling a new one of said bare metal soft gateway node or said reference node for each of said second high availability groups.
Specifically, all high-availability groups binding the reference node are searched, the associated bare metal server network port is searched according to the high-availability groups, the priority of the original bare metal soft gateway node is highest, the priority is consistent with that of the original bare metal soft gateway node, and a new bare metal soft gateway node or the reference node is rescheduled to form a new high-availability group. The specific scheduling logic is consistent with the newly bound bare metal soft gateway. Thus, the original service communication condition is ensured not to change.
In some embodiments, further comprising:
in response to monitoring that a new bare metal soft gateway node is added, screening third high-availability groups, wherein the number of the bare metal soft gateway nodes in each third high-availability group is smaller than a second preset number;
and dispatching the newly added bare metal soft gateway nodes into each third high-availability group, and keeping the priority of the current bare metal soft gateway node in each third high-availability group unchanged.
Specifically, the change in the passis table in snoop ovn-sb may be increased by the ovsdb protocol. After the bare metal soft gateway node creation is monitored, all high availability groups with the number of the bound bare metal soft gateway nodes less than a second preset number (e.g., 3) are searched. And searching the associated bare metal ports according to the high-availability group, and forming a new high-availability group by using the gateway node currently bound with the highest priority, keeping the priority of the existing nodes consistent with that of the original nodes, and scheduling other nodes. The specific scheduling logic is consistent with the newly bound bare metal soft gateway. The original service communication condition can be ensured not to change.
In some embodiments, further comprising:
in response to monitoring that the computing node adds virtual machines, screening a fourth high-availability group, wherein the screening condition is that a bare metal server corresponding to the high-availability group and the added virtual machines are in the same network, the high-availability group comprises reference nodes, and the reference nodes do not have virtual machines under the network;
and replacing the reference node in each fourth high available group with the computing node of the added virtual machine.
Specifically, when the number of bare metal soft gateway nodes is a first preset number (for example, two), the computing nodes are added as reference nodes. When selecting a computing node, a computing node bound by a virtual machine under a network to which a bare metal server belongs is preferred, but the virtual machine on the computing node may change at any time, and a reference node bound by a high availability group may not be the most suitable. By monitoring the change of the binding virtual machine of the computing node, it is most suitable to keep all the reference nodes as far as possible.
Therefore, the port_binding table change for recording the virtual machine in ovn-sb can be monitored through the ovsdb protocol, and event processing is performed after the virtual machine creation, deletion and update are monitored. The method comprises the steps of creating a corresponding computing node adding virtual machine, deleting the corresponding computing node deleting virtual machine, updating the corresponding computing node deleting virtual machine, and adding the virtual machine to the corresponding computing node.
And if the virtual machine is not present, screening a high-availability group according to the network where the virtual machine is present, wherein the screening condition is that the bare metal server corresponding to the high-availability group and the added virtual machine are in the same network, the high-availability group comprises a reference node, and the reference node does not have the virtual machine under the network.
And searching the bound bare metal server port according to the high-availability group obtained by screening, and forming a new high-availability group by using the bare metal soft gateway node with the highest priority of the current binding, keeping the priority of the existing bare metal soft gateway node consistent with that of the original bare metal soft gateway node, and scheduling other nodes. The specific scheduling logic is consistent with the newly-bound bare metal soft gateway, so that the original service communication condition is ensured not to change.
In some embodiments, further comprising:
in response to monitoring that the computing node deletes the virtual machine, judging whether the computing node further comprises a virtual machine which is in the same network with the deleted virtual machine;
in response to the lack, screening a fifth high-availability group, wherein the screening condition is that a bare metal server corresponding to the high-availability group and the deleted virtual machine are in the same network, the high-availability group comprises a reference node, and the reference node is the computing node of the deleted virtual machine;
searching whether other virtual machines exist under the network;
and in response to other virtual machines under the network, adding computing nodes corresponding to the other virtual machines into each fifth high-availability group to replace the original reference nodes.
Specifically, for the computing node deleting the virtual machine, whether the computing node has other virtual machines in the network where the deleted virtual machine is located is judged, and if so, the computing node does not process. If not, searching and screening a high-availability group according to the network, wherein the bare metal server corresponding to the high-availability group with the screening condition and the deleted virtual machine are in the same network, the high-availability group comprises a reference node, and the reference node is the computing node of the deleted virtual machine.
And searching the bound bare metal server port according to the high-availability group obtained by screening, and forming a new high-availability group by using the bare metal soft gateway node with the highest priority of the current binding, keeping the priority of the existing bare metal soft gateway node consistent with that of the original bare metal soft gateway node, and scheduling other nodes. The specific scheduling logic is consistent with the newly-bound bare metal soft gateway, so that the original service communication condition is ensured not to change.
The invention can realize real high availability even if the number of bare metal soft gateway nodes can not meet the high availability requirement by referring to the design of the high availability nodes. And by the reuse design of the names of the high availability groups, the high availability groups can be reused, and the creation of ovn resources is reduced. Through reasonable monitoring design, rescheduling is realized, high-availability groups are guaranteed to be in an optimal state, and meanwhile, the existing service communication condition is not changed.
Based on the same inventive concept, according to another aspect of the present invention, there is further provided a gateway node scheduling system 300, as shown in fig. 3, including:
an obtaining module 301, configured to obtain configured multiple bare metal soft gateway nodes and select a plurality of bare metal soft gateway nodes from the configured multiple bare metal soft gateway nodes;
The searching module 302 is configured to respond to the first preset number of the selected bare metal soft gateway nodes, acquire a network where a bare metal server corresponding to a high-availability group to be created is located, and search whether a virtual machine exists under the network;
the creating module 303 is configured to respond to the existence of a virtual machine under the network, and use a computing node corresponding to the virtual machine as a reference node and create a high availability group with the plurality of bare metal soft gateway nodes, wherein the reference node is used for providing heartbeat detection references for other members in the high availability group.
In some embodiments, the creation module 303 is further configured to:
and in response to no virtual machine under the network, selecting one computing node as a reference node by adopting a preset algorithm and creating a high-availability group with the plurality of bare metal soft gateway nodes.
In some embodiments, the creation module 303 is further configured to:
acquiring the priority of each bare metal soft gateway node in the high-availability group to be created;
forming a first character string from the name of each bare metal soft gateway node according to the priority order;
carrying out hash operation on the first character string and the ID of the network to obtain a hash value, and taking the hash value as the name of the high-availability group to be created;
Judging whether the name exists or not;
in response to the name not being present, the high availability group is created.
In some embodiments, the creation module 303 is further configured to:
binding the created high-availability group to a network port corresponding to the bare metal server and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
In some embodiments, the creation module 303 is further configured to:
responding to the existence of the name, acquiring the created high-availability group based on the name and binding the created high-availability group to a network port corresponding to the bare metal server;
and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
In some embodiments, the creation module 303 is further configured to:
creating a high availability group with the plurality of bare metal soft gateway nodes in response to the selected number of bare metal soft gateway nodes being a second preset number greater than the first preset number;
binding the created high-availability group to a network port corresponding to the bare metal server and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
In some embodiments, the creation module 303 is further configured to:
acquiring the priority of each bare metal soft gateway node;
forming a second character string by the name of each bare metal soft gateway node according to the priority order;
carrying out hash operation on the second character string to obtain a hash value, and taking the hash value as the name of the high-availability group to be created;
judging whether the name exists or not;
in response to the name not being present, the high availability group is created.
In some embodiments, the creation module 303 is further configured to:
binding the created high-availability group to a network port corresponding to the bare metal server and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
In some embodiments, the creation module 303 is further configured to:
responding to the existence of the name, acquiring the created high-availability group based on the name and binding the created high-availability group to a network port corresponding to the bare metal server;
and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
In some embodiments, the apparatus further comprises a detection module configured to:
performing heartbeat detection on every two members in the high-availability group;
And responding to the heartbeat detection abnormality of the bare metal soft gateway node with the highest priority, and providing service for the bare metal server by using the bare metal soft gateway node with the next priority.
In some embodiments, the system further comprises a listening module configured to:
in response to monitoring that the bare metal soft gateway node is deleted, searching for a first high availability group associated with the deleted bare metal soft gateway node;
traversing each of the first high availability groups and rescheduling the bare metal soft gateway node or reference node based on the number of members included in each of the first high availability groups.
In some embodiments, the listening module is further configured to:
searching network ports bound by the first high-availability group in response to the first high-availability group comprising less than the first preset number of bare metal soft gateway nodes;
new highly available groups are rebindd for the network port.
In some embodiments, the listening module is further configured to:
setting the priority of the bare metal soft gateway nodes left after deletion as the highest priority in response to the first preset number of bare metal soft gateway nodes included in the first high availability group;
A new bare metal soft gateway node is rescheduled for the first high availability group.
In some embodiments, the listening module is further configured to:
responding to the first high-availability group comprising a second preset number of the bare metal soft gateway nodes, and keeping the priority of the remaining bare metal soft gateway nodes after deletion unchanged;
a new one of the bare metal soft gateway node or the reference node is rescheduled for the first high availability group.
In some embodiments, the listening module is further configured to:
in response to monitoring that the reference node is deleted, searching for a second high availability group associated with the deleted reference node;
traversing each of said second high availability groups and rescheduling a new one of said bare metal soft gateway node or said reference node for each of said second high availability groups.
In some embodiments, the listening module is further configured to:
in response to monitoring that a new bare metal soft gateway node is added, screening third high-availability groups, wherein the number of the bare metal soft gateway nodes in each third high-availability group is smaller than a second preset number;
and dispatching the newly added bare metal soft gateway nodes into each third high-availability group, and keeping the priority of the current bare metal soft gateway node in each third high-availability group unchanged.
In some embodiments, the listening module is further configured to:
in response to monitoring that the computing node adds virtual machines, screening a fourth high-availability group, wherein the screening condition is that a bare metal server corresponding to the high-availability group and the added virtual machines are in the same network, the high-availability group comprises reference nodes, and the reference nodes do not have virtual machines under the network;
and replacing the reference node in each fourth high available group with the computing node of the added virtual machine.
In some embodiments, the listening module is further configured to:
in response to monitoring that the computing node deletes the virtual machine, judging whether the computing node further comprises a virtual machine which is in the same network with the deleted virtual machine;
in response to the lack, screening a fifth high-availability group, wherein the screening condition is that a bare metal server corresponding to the high-availability group and the deleted virtual machine are in the same network, the high-availability group comprises a reference node, and the reference node is the computing node of the deleted virtual machine;
searching whether other virtual machines exist under the network;
and in response to other virtual machines under the network, adding computing nodes corresponding to the other virtual machines into each fifth high-availability group to replace the original reference nodes.
Based on the same inventive concept, according to another aspect of the present invention, as shown in fig. 4, an embodiment of the present invention further provides a computer apparatus 401, including:
at least one processor 420; and
the memory 410, the memory 410 stores a computer program 411 executable on a processor, and the processor 420 performs the steps of any of the gateway node scheduling methods described above when executing the program.
According to another aspect of the present invention, as shown in fig. 5, based on the same inventive concept, an embodiment of the present invention further provides a computer readable storage medium 501, where the computer readable storage medium 501 stores a computer program 510, and the computer program 510 performs the steps of any of the gateway node scheduling methods described above when executed by a processor.
Finally, it should be noted that, as will be appreciated by those skilled in the art, all or part of the procedures in implementing the methods of the embodiments described above may be implemented by a computer program for instructing relevant hardware, and the program may be stored in a computer readable storage medium, and the program may include the procedures of the embodiments of the methods described above when executed.
Further, it should be appreciated that the computer-readable storage medium (e.g., memory) herein can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory.
Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the disclosure herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as software or hardware depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.
The foregoing is an exemplary embodiment of the present disclosure, but it should be noted that various changes and modifications could be made herein without departing from the scope of the disclosure as defined by the appended claims. The functions, steps and/or actions of the method claims in accordance with the disclosed embodiments described herein need not be performed in any particular order. Furthermore, although elements of the disclosed embodiments may be described or claimed in the singular, the plural is contemplated unless limitation to the singular is explicitly stated.
It should be understood that as used herein, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly supports the exception. It should also be understood that "and/or" as used herein is meant to include any and all possible combinations of one or more of the associated listed items.
The foregoing embodiment of the present invention has been disclosed with reference to the number of embodiments for the purpose of description only, and does not represent the advantages or disadvantages of the embodiments.
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 for instructing relevant hardware, and the program may be stored in a computer readable storage medium, where the storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
Those of ordinary skill in the art will appreciate that: the above discussion of any embodiment is merely exemplary and is not intended to imply that the scope of the disclosure of embodiments of the invention, including the claims, is limited to such examples; combinations of features of the above embodiments or in different embodiments are also possible within the idea of an embodiment of the invention, and many other variations of the different aspects of the embodiments of the invention as described above exist, which are not provided in detail for the sake of brevity. Therefore, any omission, modification, equivalent replacement, improvement, etc. of the embodiments should be included in the protection scope of the embodiments of the present invention.
Claims (15)
1. A gateway node scheduling method, comprising the steps of:
acquiring a plurality of configured bare metal soft gateway nodes and selecting a plurality of bare metal soft gateway nodes from the plurality of bare metal soft gateway nodes;
responding to the number of the selected bare metal soft gateway nodes as a first preset number, acquiring a network where a bare metal server corresponding to a high-availability group to be created is located, and searching whether a virtual machine exists or not under the network;
responding to the virtual machine under the network, taking a computing node corresponding to the virtual machine as a reference node and establishing a high-availability group with the plurality of bare metal soft gateway nodes, wherein the reference node is used for providing heartbeat detection references for other members in the high-availability group;
wherein the step of creating a high availability group further comprises:
acquiring the priority of each bare metal soft gateway node in the high-availability group to be created;
forming a first character string from the name of each bare metal soft gateway node according to the priority order;
carrying out hash operation on the first character string and the ID of the network to obtain a hash value, and taking the hash value as the name of the high-availability group to be created;
Judging whether the name exists or not;
creating the high availability group in response to the name not being present;
binding the created high-availability group to a network port corresponding to the bare metal server and providing service for the bare metal server by using a bare metal soft gateway node with the highest priority;
responding to the existence of the name, acquiring the created high-availability group based on the name and binding the created high-availability group to a network port corresponding to the bare metal server;
and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
2. The method as recited in claim 1, further comprising:
and in response to no virtual machine under the network, selecting one computing node as a reference node by adopting a preset algorithm and creating a high-availability group with the plurality of bare metal soft gateway nodes.
3. The method as recited in claim 1, further comprising:
creating a high availability group with the plurality of bare metal soft gateway nodes in response to the selected number of bare metal soft gateway nodes being a second preset number greater than the first preset number;
binding the created high-availability group to a network port corresponding to the bare metal server and providing service for the bare metal server by using a bare metal soft gateway node with the highest priority;
The step of creating a high availability group by using the plurality of bare metal soft gateway nodes further comprises:
acquiring the priority of each bare metal soft gateway node;
forming a second character string by the name of each bare metal soft gateway node according to the priority order;
carrying out hash operation on the second character string to obtain a hash value, and taking the hash value as the name of the high-availability group to be created;
judging whether the name exists or not;
creating the high availability group in response to the name not being present;
binding the created high-availability group to a network port corresponding to the bare metal server and providing service for the bare metal server by using a bare metal soft gateway node with the highest priority;
responding to the existence of the name, acquiring the created high-availability group based on the name and binding the created high-availability group to a network port corresponding to the bare metal server;
and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
4. A method as claimed in claim 1 or 3, further comprising:
performing heartbeat detection on every two members in the high-availability group;
And responding to the heartbeat detection abnormality of the bare metal soft gateway node with the highest priority, and providing service for the bare metal server by using the bare metal soft gateway node with the next priority.
5. The method as recited in claim 1, further comprising:
in response to monitoring that the bare metal soft gateway node is deleted, searching for a first high availability group associated with the deleted bare metal soft gateway node;
traversing each of the first high availability groups and rescheduling the bare metal soft gateway node or reference node based on the number of members included in each of the first high availability groups.
6. The method of claim 5, wherein the step of rescheduling the bare metal soft gateway node or reference node based on the number of members included in each of the first high availability groups further comprises:
searching network ports bound by the first high-availability group in response to the first high-availability group comprising less than the first preset number of bare metal soft gateway nodes;
new highly available groups are rebindd for the network port.
7. The method of claim 5, wherein the step of rescheduling the bare metal soft gateway node or reference node based on the number of members included in each of the first high availability groups further comprises:
Setting the priority of the bare metal soft gateway nodes left after deletion as the highest priority in response to the first preset number of bare metal soft gateway nodes included in the first high availability group;
a new bare metal soft gateway node is rescheduled for the first high availability group.
8. The method of claim 5, wherein the step of rescheduling the bare metal soft gateway node or reference node based on the number of members included in each of the first high availability groups further comprises:
responding to the first high-availability group comprising a second preset number of the bare metal soft gateway nodes, and keeping the priority of the remaining bare metal soft gateway nodes after deletion unchanged;
a new one of the bare metal soft gateway node or the reference node is rescheduled for the first high availability group.
9. The method as recited in claim 1, further comprising:
in response to monitoring that the reference node is deleted, searching for a second high availability group associated with the deleted reference node;
traversing each of said second high availability groups and rescheduling a new one of said bare metal soft gateway node or said reference node for each of said second high availability groups.
10. The method as recited in claim 1, further comprising:
in response to monitoring that a new bare metal soft gateway node is added, screening third high-availability groups, wherein the number of the bare metal soft gateway nodes in each third high-availability group is smaller than a second preset number;
and dispatching the newly added bare metal soft gateway nodes into each third high-availability group, and keeping the priority of the current bare metal soft gateway node in each third high-availability group unchanged.
11. The method as recited in claim 2, further comprising:
in response to monitoring that the computing node adds virtual machines, screening a fourth high-availability group, wherein the screening condition is that a bare metal server corresponding to the high-availability group and the added virtual machines are in the same network, the high-availability group comprises reference nodes, and the reference nodes do not have virtual machines under the network;
and replacing the reference node in each fourth high available group with the computing node of the added virtual machine.
12. The method as recited in claim 2, further comprising:
in response to monitoring that the computing node deletes the virtual machine, judging whether the computing node further comprises a virtual machine which is in the same network with the deleted virtual machine;
In response to the lack, screening a fifth high-availability group, wherein the screening condition is that a bare metal server corresponding to the high-availability group and the deleted virtual machine are in the same network, the high-availability group comprises a reference node, and the reference node is the computing node of the deleted virtual machine;
searching whether other virtual machines exist under the network;
and in response to other virtual machines under the network, adding computing nodes corresponding to the other virtual machines into each fifth high-availability group to replace the original reference nodes.
13. A gateway node scheduling system, comprising:
the acquisition module is configured to acquire the configured plurality of bare metal soft gateway nodes and select a plurality of bare metal soft gateway nodes from the plurality of bare metal soft gateway nodes;
the searching module is configured to respond to the first preset number of the selected bare metal soft gateway nodes, acquire a network where a bare metal server corresponding to a high-availability group to be created is located, and search whether a virtual machine exists or not under the network;
the creation module is configured to respond to the existence of a virtual machine under the network, take a computing node corresponding to the virtual machine as a reference node and create a high-availability group with the plurality of bare metal soft gateway nodes, wherein the reference node is used for providing heartbeat detection references for other members in the high-availability group;
The creation module is further configured to:
acquiring the priority of each bare metal soft gateway node in the high-availability group to be created;
forming a first character string from the name of each bare metal soft gateway node according to the priority order;
carrying out hash operation on the first character string and the ID of the network to obtain a hash value, and taking the hash value as the name of the high-availability group to be created;
judging whether the name exists or not;
creating the high availability group in response to the name not being present;
binding the created high-availability group to a network port corresponding to the bare metal server and providing service for the bare metal server by using a bare metal soft gateway node with the highest priority;
responding to the existence of the name, acquiring the created high-availability group based on the name and binding the created high-availability group to a network port corresponding to the bare metal server;
and providing service for the bare metal server by using the bare metal soft gateway node with the highest priority.
14. A computer device, comprising:
at least one processor; and
a memory storing a computer program executable on the processor, wherein the processor performs the steps of the method of any one of claims 1-12 when the program is executed.
15. A computer readable storage medium storing a computer program, characterized in that the computer program when executed by a processor performs the steps of the method according to any one of claims 1-12.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310956547.8A CN116668296B (en) | 2023-08-01 | 2023-08-01 | Gateway node scheduling method, system, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310956547.8A CN116668296B (en) | 2023-08-01 | 2023-08-01 | Gateway node scheduling method, system, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116668296A CN116668296A (en) | 2023-08-29 |
| CN116668296B true CN116668296B (en) | 2023-11-03 |
Family
ID=87721038
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310956547.8A Active CN116668296B (en) | 2023-08-01 | 2023-08-01 | Gateway node scheduling method, system, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116668296B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114157569A (en) * | 2020-08-17 | 2022-03-08 | 中国电信股份有限公司 | Cluster system and construction method and construction device thereof |
| CN114168261A (en) * | 2021-11-17 | 2022-03-11 | 浪潮云信息技术股份公司 | OpenStack-based high availability method and device for managing bare metal instances |
| WO2022148291A1 (en) * | 2021-01-08 | 2022-07-14 | 苏州浪潮智能科技有限公司 | Method and system for configuring bmc ip addresses of bare metal servers, medium and device |
| CN115720181A (en) * | 2022-11-18 | 2023-02-28 | 济南浪潮数据技术有限公司 | Control method and system of bare metal node, electronic device and readable storage medium |
| CN116208483A (en) * | 2022-11-17 | 2023-06-02 | 中国建设银行股份有限公司 | Method for realizing high-availability bare metal service, related device and storage medium |
-
2023
- 2023-08-01 CN CN202310956547.8A patent/CN116668296B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114157569A (en) * | 2020-08-17 | 2022-03-08 | 中国电信股份有限公司 | Cluster system and construction method and construction device thereof |
| WO2022148291A1 (en) * | 2021-01-08 | 2022-07-14 | 苏州浪潮智能科技有限公司 | Method and system for configuring bmc ip addresses of bare metal servers, medium and device |
| CN114168261A (en) * | 2021-11-17 | 2022-03-11 | 浪潮云信息技术股份公司 | OpenStack-based high availability method and device for managing bare metal instances |
| CN116208483A (en) * | 2022-11-17 | 2023-06-02 | 中国建设银行股份有限公司 | Method for realizing high-availability bare metal service, related device and storage medium |
| CN115720181A (en) * | 2022-11-18 | 2023-02-28 | 济南浪潮数据技术有限公司 | Control method and system of bare metal node, electronic device and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116668296A (en) | 2023-08-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10511506B2 (en) | Method and device for managing virtualized network function | |
| CN109639572A (en) | Route management method, device and micro services system | |
| CN104935672B (en) | Load balancing service high availability implementation method and equipment | |
| EP2795849B1 (en) | Method and apparatus for messaging in the cloud | |
| CN112003961A (en) | Resource exposure method, system, equipment and medium in kubernets | |
| CN108427619B (en) | Log management method and device, computing equipment and storage medium | |
| CN108881066A (en) | A kind of method of route requests, access server and storage equipment | |
| CN106209943A (en) | The system of selection of communication node and device | |
| CN108566291A (en) | A kind of method of event handling, server and system | |
| CN107508700B (en) | Disaster recovery method, device, equipment and storage medium | |
| CN106911769B (en) | Cloud platform routing data processing method and physical server of cloud platform | |
| CN113268308A (en) | Information processing method, device and storage medium | |
| EP3974960A1 (en) | Method and system for automated testing of web service apis | |
| US20100218202A1 (en) | Method and Apparatus for Case-Based Service Composition | |
| CN116668296B (en) | Gateway node scheduling method, system, equipment and storage medium | |
| US20210133170A1 (en) | Historical graph database | |
| CN109617779A (en) | Routing table maintenance method and device based on VTEP | |
| CN113038394B (en) | Session binding relationship processing method and device, electronic equipment and readable medium | |
| CN114911577A (en) | Method, device, equipment and storage medium for setting network isolation rule | |
| CN111698142B (en) | Message forwarding method and device, electronic equipment and storage medium | |
| US10708221B1 (en) | Generating a natural name data structure to prevent duplicate network data associated with an asynchronous distributed network operating system | |
| CN113918326A (en) | Request processing method and device | |
| CN112131201A (en) | Method, system, equipment and medium for high availability of network additional storage | |
| CN108809916B (en) | Service processing method and device | |
| CN106230657A (en) | A kind of data push method and supplying system thereof |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |