CN113965578B - Election method, device, equipment and storage medium of master node in cluster - Google Patents
Election method, device, equipment and storage medium of master node in cluster Download PDFInfo
- Publication number
- CN113965578B CN113965578B CN202111260095.7A CN202111260095A CN113965578B CN 113965578 B CN113965578 B CN 113965578B CN 202111260095 A CN202111260095 A CN 202111260095A CN 113965578 B CN113965578 B CN 113965578B
- Authority
- CN
- China
- Prior art keywords
- master node
- cluster
- message
- node
- election
- 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 61
- 238000003860 storage Methods 0.000 title claims abstract description 16
- 230000002159 abnormal effect Effects 0.000 claims description 44
- 230000000977 initiatory effect Effects 0.000 claims description 41
- 238000011084 recovery Methods 0.000 claims description 17
- 230000000903 blocking effect Effects 0.000 claims description 11
- 238000004590 computer program Methods 0.000 claims description 2
- 230000005856 abnormality Effects 0.000 abstract description 9
- 230000008569 process Effects 0.000 description 9
- 230000003111 delayed effect Effects 0.000 description 5
- 230000010076 replication Effects 0.000 description 5
- 230000008859 change Effects 0.000 description 3
- 230000001360 synchronised effect Effects 0.000 description 3
- 238000013500 data storage Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000005304 joining Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004140 cleaning Methods 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 238000005520 cutting process Methods 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 230000002085 persistent effect Effects 0.000 description 1
- 230000008707 rearrangement Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
- H04L67/1051—Group master selection mechanisms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/25—Integrating or interfacing systems involving database management systems
-
- 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/06—Management of faults, events, alarms or notifications
- H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
- H04L41/0668—Management of faults, events, alarms or notifications using network fault recovery by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Signal Processing (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Mathematical Physics (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Hardware Redundancy (AREA)
Abstract
The invention discloses a method, a device, equipment and a storage medium for electing a master node in a cluster. Wherein the method is performed by a computer device in a cluster as a node, comprising: the method comprises the steps that an original master node in a cluster sends message messages to slave nodes, receives message reply messages fed back by the slave nodes relative to the message messages, and when the original master node receives at least one target message reply message containing a expired period, updates any period number of the cluster based on the target message reply messages, and initiates election and executes election operation in a consistency protocol algorithm. In the embodiment of the invention, when the original master node receives at least one target message reply message containing the expiration of the period, the random period number of the cluster is updated based on each target message reply message, and the election is initiated, so that the probability of abnormality of the master node is reduced, and the master node in the cluster is effectively prevented from being frequently switched to the slave node, thereby improving the cluster performance and user experience.
Description
Technical Field
The embodiment of the invention relates to the field of databases, in particular to a method, a device, equipment and a storage medium for electing a master node in a cluster.
Background
RAFT is a consistency algorithm that manages log replication, and the only requirement when electing a leader is that the selected leader node has a newer, or at least as newer, log than each of the other nodes in the cluster. The RAFT requires that the current leader still be valid and nodes without timeout refuses to vote to other nodes so as to avoid other nodes from electing to be the master node, so that the leader node switching in the cluster caused by the network failure of the follower and the like can be avoided to a great extent, but the original master node still needs to be reelected to be the leader through the mode switching process of 'leader- > follower- > leader', thereby leading the master node to frequently switch.
The RAFT protocol may be applied to a conventional datadaemon cluster. In a database system, the cost of switching a primary library node to a backup library in a cluster is quite high. For the database system itself, the mode switch requires termination and rollback of the current transaction, cleaning of the rollback page, and truncation of the log, which can take a long time in the case of a data system under significant pressure. Since the node (master node) providing the service to the outside is switched to the state (slave node) not providing the service to the outside, the switching process also causes disconnection of the current session and failure of the current operation, and a large amount of data which is not submitted is likely to be discarded completely, so that the fluency and reliability of the database service are affected.
Disclosure of Invention
The invention provides an invention name to realize the infrequent switching of master and slave nodes in various fault scenes.
In a first aspect, an embodiment of the present invention provides a method for electing a master node in a cluster, where the method is performed by a computer device serving as a node in the cluster, including:
an original master node in a cluster sends message messages to slave nodes and receives message reply messages fed back by the slave nodes relative to the message messages, wherein the original master node is determined by adopting a given consistency protocol algorithm in advance;
when the original master node receives at least one target message reply message with expired period, updating the own cluster period number based on each target message reply message, and initiating election and executing the election operation in the consistency protocol algorithm.
In a second aspect, an embodiment of the present invention further provides an election apparatus for a master node in a cluster, where the apparatus is executed by a computer device serving as a node in the cluster, including:
the message receiving module is used for sending message messages to all slave nodes by an original master node in the cluster and receiving message reply messages fed back by all the slave nodes relative to the message messages, wherein the original master node is determined by adopting a given consistency protocol algorithm in advance;
And the election and execution module is used for updating the own cluster optional period number based on each target message reply message when the original master node receives at least one target message reply message with the expired optional period, and initiating and executing the election operation in the consistency protocol algorithm.
In a third aspect, an embodiment of the present invention further provides a computer device, where the device is a node in a cluster, and includes:
one or more of the processors of the present invention,
storage means for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method of electing a master node in a cluster as described in the first aspect above.
In a fourth aspect, an embodiment of the present invention further provides a computer readable storage medium, on which a computer program is stored, which when executed by a processor implements a method for electing a master node in a cluster as described in the first aspect above.
In the technical scheme provided by the embodiment of the invention, an original master node in a cluster sends a message to each slave node and receives a message reply message fed back by each slave node relative to the message, wherein the original master node is determined by adopting a given consistency protocol algorithm in advance; and then when the original master node receives at least one target message reply message with expired period, updating the own cluster period number based on each target message reply message, and initiating election and executing the election operation in the consistency protocol algorithm. According to the technical scheme, when the original master node receives at least one target message reply message containing the expiration of the period, the random number of the cluster is updated based on each target message reply message, and the election is initiated, so that the master node in the cluster is effectively prevented from being frequently switched to the slave node, the fluency and the reliability of database service are improved, and the cluster performance and the user experience are improved. Compared with the prior art that the nodes of the main library in the cluster are switched to the standby library, the method for selecting the nodes of the main library in the cluster reduces the switching times of the main library in various fault scenes, and even if the selection occurs, the original main library is successfully selected again as much as possible without being switched to the standby library, so that the cluster performance and the user experience are improved. In addition, the above technical scheme of the embodiment effectively avoids frequent switching times of the master node and the slave node, thereby avoiding the loss of a large amount of data in the database, improving the fluency and reliability of the database service, and improving the performance of the cluster and the experience of users to a certain extent.
Drawings
Fig. 1 is a flowchart of a method for electing a master node in a cluster according to a first embodiment of the present invention;
fig. 2 is a flowchart of an election device of a master node in a cluster according to a second embodiment of the present invention;
fig. 3 is a schematic structural diagram of a computer device according to a third embodiment of the present invention.
Detailed Description
The invention is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting thereof. It should be further noted that, for convenience of description, only some, but not all of the structures related to the present invention are shown in the drawings.
In order to facilitate verification of application of an election method of a master node in a cluster in the prior art, a related flow of the election method of the master node in the cluster in the prior art is provided as follows: the slave node network is abnormal, the master node message is not received, and the self-increment period number initiates election. After the slave node network is recovered, receiving the message sent by the master node at regular time, and replying the message to inform the master node that the master node period number is expired. And the master node receives the message reply, updates the random number to the random number in the message reply and switches to the slave node. In the method, the slave node is switched into the slave node before the slave node initiates the election, waits for the election to be overtime, and initiates the election again. The normal master node must be switched to the slave node, so that the normal master node performs unnecessary switching of the master node and the slave node, and the switching frequency of the master node and the slave node is increased.
In order to facilitate verification of the application of the election method of the master node in the cluster in the prior art, the related flow of the election method of the master node in another cluster in the prior art is provided as follows: when the network of the original master node is abnormal, the new master node is updated and selected in the period of the cluster. And after the network is restored, the original master node sends a message to other nodes according to the own random number. And the other nodes receive the message of the original master node and then reply the message. And the original master node receives the message reply with a larger optional number, updates the optional number, and cuts the optional number into slave nodes. If the original master node receives the message of the new master node, the original master node directly adds back the cluster; and if the election is initiated by the original master node, performing the election between the original master node and the new master node. The new master node in this method will also switch to the slave node here.
Example 1
Fig. 1 is a flowchart of a method for electing a master node in a cluster according to a first embodiment of the present invention, where the method may be performed by an electing device of a master node in a cluster, where the device may be configured in a computer device, where the master node and the slave node are frequently switched.
A cluster is a group of mutually independent computer devices interconnected by a high-speed network, which form a group and are managed in a single system mode. The cluster as a whole provides services to the users. When a user interacts with a cluster, the cluster appears as an independent server. Cluster configuration is used to increase availability and scalability. The computer equipment is equivalent to the nodes in the cluster, the nodes in the cluster can be understood as a server, the nodes in the cluster are all equivalent, and a user can log in any node in the cluster to obtain complete database service. It is equipped with a set of database system, and one node is the whole system of the database. The database system is a database for data storage, analysis and transaction processing, and can store some data, such as some log data on business.
The election method of the master node in the cluster specifically comprises the following steps:
s110, an original master node in the cluster sends message messages to all slave nodes and receives message reply messages fed back by all slave nodes relative to the message messages, wherein the original master node is determined by a preset consistency protocol algorithm.
Wherein the original master node may be understood as an original leader in the cluster. A slave node may be understood as all followers of the original master node in the cluster. The original master node is determined by a given consistency protocol algorithm in advance.
In this embodiment, the message is a message sent from an original master node to each slave node in the cluster. Typically, the message is sent from the original master node in the cluster when started until the original master node in the cluster is turned off, during which the original master node in the cluster may send periodic or repeated messages continuously. When each slave node does not receive the message in a certain message receiving period, each slave node may consider that the original master node in the cluster has the problems of shutdown, failure, or current unavailability.
It should be noted that, the original master node in the cluster may send a message to each node, which may include a heartbeat message, a log packet, or a message waiting for completion of application of the log packet, which is not limited in this embodiment. The log packet is divided into two types, one is a synchronous log packet, and the master node sends the current log record to the slave node in real time; the other is an asynchronous log packet, and the master node finds out the log record needed by the slave node from the log archiving and sends the log record to the slave node for recovering the log missing from the fault of the slave node.
It should be noted that, the heartbeat message may be understood as a log that does not include an operation step, where the heartbeat message includes an optional number of the original master node, a current submitted log packet sequence number, a written log packet sequence number, and the like, which are used to avoid the election timeout of the original master node. Every time each slave node receives the message of the original master node, the original master node needs to be subjected to message reply message, and the message reply message contains the current optional number of each slave node. The log may be specifically a REDO log, where the REDO log (i.e., the REDO log) may be understood as adding, deleting, modifying objects in the DM database, or changing data, where the DM writes the results of performing these operations into the current REDO log according to a specific format. The redo log is mainly used for backup and recovery of the database. The data page in the database buffer will not be as fast as the data file is written, and when the DM instance is restarted, the state of the database can be restored to the state when an accident occurs by redoing the information in the log. And in the cluster, the slave node receives the log of the master node and then applies the same change to the local machine through replay to ensure that the data of the local machine are consistent with the host machine through the change of the log synchronous data.
It should be noted that, the reply message may include a heartbeat reply, a log packet reply, a request voting reply, and the like, which is not limited in this embodiment. The message reply messages received in different scenarios may be different. Illustratively, when sending the heartbeat message, a reply of the heartbeat message is performed; after the voting message is sent, a voting reply is requested; when asynchronous recovery is required, a series of replies to the asynchronous recovery are made. This embodiment is not limited thereto.
It will be appreciated that in a normal database cluster, the logs of the master node and the other slave nodes are synchronized and remain in a consistent state. If a node fails, the logs of the node and other nodes are inconsistent, and whether to truncate redundant logs or complement missing logs needs to be determined according to the situation.
It should be noted that, if the original master node generates network abnormality and other slave nodes are in normal state, the original master node cannot send message to each slave node, and after the network is restored, the original master node can send message to each slave node again; if the original master node is in a normal state of the network and the other slave node or a plurality of slave nodes have network abnormality, the slave node of the abnormal network cannot receive the message sent by the original master node, and after the network is restored, the message of the original master node is received again. The reasons for the network abnormality may be that the network card fails, that the network congestion is serious, that the network hardware fails, and the like, which is not limited in this embodiment.
In this embodiment, the message reply message may be understood as that each slave node needs to make feedback to the message after receiving the message sent by the original master node. The message reply message contains the current optional number of each slave node. The message reply message may be a message whose period has expired, which is not limited in this embodiment.
It can be known that the master node in the cluster is responsible for receiving the request command of the client, generating log entry copy according to the command modification data and sending the log entry copy to other slave node servers, and submitting and persisting the log data to change when the security is confirmed.
In this embodiment, the coherence protocol algorithm includes three aspects of leader election, log replication and security, and after a new master node is selected, the new master node manages log replication of the entire cluster. The consistency protocol algorithm may cause servers of a cluster to form a replication state machine. The replication state machine can be thought of as a set of servers, one for each server, the running state of the servers being changeable only by commands of a row. Each state machine stores a log containing a series of instructions, which are executed in strict order from log to log, and if all state machines can execute instructions in the same log, they will eventually reach the same state.
And S120, when the original master node receives at least one target message reply message with expired period, updating the own cluster period number based on each target message reply message, and initiating election and executing election operation in a consistency protocol algorithm.
Wherein, expiration of the tenure can be understood as that the original master node can not act as the master node any more, and the new master node needs to be reselected or acknowledged to be cut into slave nodes to be added back to the cluster by electing.
In this embodiment, the target message reply message may be understood as a message that the original master node has expired in any period of time contained in each message that the original master node receives from each slave node. The number of the target message reply messages with expired periods may be two or three, which is not limited in this embodiment.
It should be noted that, when the original master node receives at least one reply message containing a target message whose period has expired, it can be understood that one or more slave nodes in each slave node at this time have network anomalies. The network anomaly may be understood as network card failure, relatively large network fluctuation, network congestion, network attack, surge interference, website hardware failure, etc., which is not limited in this embodiment.
It should be noted that the cluster anytime number may be understood as an anytime number of each node in the cluster, including the original master node and each slave node. When the original master node receives at least one target message reply message with expired period, the original master node updates the own cluster period number based on each target message reply message, and then initiates election and executes election operation in the consistency protocol algorithm.
It should be noted that, the manner in which the original master node updates the own cluster period number based on the reply message of each target message may be: firstly, extracting a cluster period number carried in a target message reply message with an expired period from a message reply message fed back by each slave node, adding 1 to the maximum cluster period number to determine the maximum cluster period number as the own cluster period number, and then initiating election.
In this embodiment, election may be understood as a process of generating a new master node by the original master node in the cluster, where the process is used to enable the cluster to generate the new master node in time after the old master node fails. The election is divided into nodes and periods, and one node can only initiate the election once in one period. The nodes here include the original master node and the individual slave nodes.
Further, updating the cluster period number based on each target message reply message includes:
extracting a cluster optional number carried in a target message reply message;
the largest cluster period number plus 1 is determined as the own cluster period number.
The maximum cluster period number may be understood as a maximum node period number in a target message reply message that at least one of the slave nodes in the cluster feeds back that the period has expired.
In this embodiment, the update period number of the cluster based on the reply message of each target message is the update period number independently performed by the original master node. The update period number can be understood as that the original master node adds 1 to the period number of the original master node in the memory of the database on the basis of the period number of the largest cluster in the reply message of the target message, and then persists the period number and writes the period number into the hard disk for storage. For example, when the cluster period number carried in the extracted target message reply message is 5, the original master node adds 1 to determine that the original master node is the own cluster period number on the basis of the maximum cluster period number 5, that is, the own cluster period number is 6 at the moment.
It should be noted that, when a certain slave node or a plurality of slave nodes with abnormal network is recovered to normal, so that the message sent by the original master library is received again, at this time, a message reply message is fed back to the original master node, which indicates that the period of the original master node has expired at this time, so that when the original master node receives the message reply message, the cluster period number carried in the target message reply message is extracted, and then the largest cluster period number in the target message reply message is updated immediately to be added with 1, and is used as the own cluster period number.
In the technical scheme provided by the embodiment of the invention, an original master node in a cluster sends a message to each slave node and receives a message reply message fed back by each slave node relative to the message, wherein the original master node is determined by adopting a given consistency protocol algorithm in advance; and then when the original master node receives at least one target message reply message with expired period, updating the own cluster period number based on each target message reply message, and initiating election and executing the election operation in the consistency protocol algorithm. According to the technical scheme, the original master node in the cluster sends the message to each slave node, so that the master node in the cluster is effectively prevented from being frequently switched to the slave node based on the sent message, the fluency and the reliability of database service are improved, and therefore the cluster performance and the user experience are improved. Compared with the prior art that the nodes of the main library in the cluster are switched to the standby library, the method for selecting the nodes of the main library in the cluster reduces the switching times of the main library in various fault scenes, and even if the selection occurs, the original main library is successfully selected again as much as possible without being switched to the standby library, so that the cluster performance and the user experience are improved. In addition, the above technical scheme of the embodiment effectively avoids frequent switching times of the master node and the slave node, thereby avoiding the loss of a large amount of data in the database, improving the smoothness and reliability of the service of the database, and improving the performance of the cluster and the experience of users to a certain extent.
Optionally, after the election is initiated and the election operation in the consistency protocol algorithm is executed, the method further includes:
when the original master node is elected to become a new master node, asynchronous recovery of data information is carried out on the abnormal slave nodes feeding back the reply message of each target message;
when the original master node is not elected to be a new master node, the new master node performs data information synchronization operation on the original master node and other slave nodes.
In this embodiment, the new master node may be understood as a new master node that is reselected after initiating election and executing an election operation in a coherence protocol algorithm, and is used as a new leader in the cluster to send a message to each node, and receive a message reply message fed back by each slave node with respect to the message.
In this embodiment, when receiving at least one reply message containing a target message whose period has expired, the original master node initiating the election updates its own cluster period number based on each target message reply message, then sends a voting request message to all other nodes, and the other nodes determine whether the voting request is met according to the current state of the received message, then send a voting request reply notification voting result, and at this time, the original master node initiating the election determines according to the received voting request reply, and votes to the original master node at other master nodes and slave nodes with half or more of the period numbers being older, and at this time, the original master node is considered to be successful again.
It should be noted that, the election is a message that the node initiating the election sends to each other node individually. In the election process, the original master node initiating the election can send a voting request, and each slave node can send a voting request reply to the original master node initiating the election. And after each other slave node receives the voting request of the original master node initiating the election, sending a voting request reply to the original master node initiating the election. The voting request of the original master node initiating the voting at this time comprises the current tenure number, the tenure number of the last log, the packet sequence number and other information, and according to the information, each slave node receiving the voting request judges whether to cast the voting to the original master node according to the tenure number, the last packet sequence number and the packet tenure number of the current moment of the voting request. The judging condition is that the period number of the original master node initiating the election is larger than or equal to the period number of the current slave node, the period number of the last log of the original master node initiating the election is newer or as newer than the last log packet of the current slave node, and the slave node meeting the condition votes to the original master node initiating the election; if the condition is not satisfied, the original master node initiating the election is not voted.
It should be noted that, in the election process of each period, each slave node has only one ticket.
It can be known that after voting, when the original master node initiating the voting successfully reselects as a new master node, asynchronous recovery of data information is performed on the abnormal slave node feeding back the reply message of each target message, and then when the message or voting request with a larger random number of the new master node is recovered from the network, the abnormal slave node updates its random number as the random number in the current message and adds back to the cluster.
In this embodiment, an abnormal slave node may be understood as each slave node in which a network abnormality occurs. The number of abnormal slave nodes may be 1, 2, or three. This embodiment is not limited thereto. When the abnormal slave node network is abnormal, the abnormal slave node network can not receive the message of the original master node, and then initiates election from the wilting period number, but at the moment, the abnormal slave node initiates election only acts as self, increases the wilting period number of the abnormal slave node by 1, and tries to send the message. At this time, the message sent by the abnormal slave node is not received by the original master node and other slave nodes, so that the abnormal slave node is a failed election. For example, when the original period number of the abnormal slave node is 4 and the abnormal slave node network is abnormal, the abnormal slave node cannot receive the message of the original master node, the self-increasing period number is increased by 1 to be changed into 5 on the basis of the original period number 4, and election is started.
In this embodiment, asynchronous recovery may be understood as a process of recovering an abnormal slave node to a normal slave node. After asynchronous recovery is executed, the abnormal slave node is a normal slave node, and then the flow of the related protocol is executed.
It should be noted that, the asynchronous recovery process may send a related message to the new master node to inform the abnormal slave node that asynchronous recovery is needed, then the abnormal slave node starts to scan its own log file after receiving the message, finds out the current log entry information from the log file, then feeds back the current log entry information to the new master node, after receiving the current log entry information of the abnormal slave node, the new master node compares the current log entry information of the abnormal slave node with the log information of the new master node, then repeats the process of the abnormal slave node scanning its own log file log, and then the new master node compares the current log entry information of the abnormal slave node with the log information of the new master node after receiving the current log entry information of the abnormal slave node until finding out a log information of the new master node consistent with the log information of the abnormal slave node, and starting to obtain the same log information, the new master node sends the later inconsistent log information to the abnormal slave node one by one after another, so as to perform asynchronous recovery.
It can be known that after voting, when the original master node initiating the voting does not elect to become a new master node, other nodes can be considered to be successfully selected as the new master node, the original master node can be selected, and the new master node can be understood as other nodes except the original master node. And the new master node synchronously operates the data information of the original master node and other slave nodes. The original master node and the slave nodes newer than the new master node log need to cut off the log, and the nodes older than the new master node log need to be recovered asynchronously. Among other things, truncating a log may be understood as the process of deleting log records to reduce the size of the redo log.
In this embodiment, the synchronization operation may be understood as that when the original master node is not elected to be a new master node, the new master node performs synchronization of data information on the original master node and other slave nodes.
Optionally, after the election is initiated and the election operation in the consistency protocol algorithm is executed, the method further includes:
and the abnormal slave nodes feeding back the reply message of each target message update the respective cluster period numbers according to the cluster period numbers carried in the message sent by the new master node, and rejoin the clusters.
In this embodiment, when the original master node reselects to be a new master node successfully, the period of the new master node may be regarded as the latest period number, and the period number of the abnormal slave node is smaller than the period number of the new master node. And the abnormal slave node updates the respective cluster anytime number to the latest anytime number of the new master node according to the cluster anytime number carried in the message sent by the new master node after receiving the message sent by the new master node.
Optionally, the election method of the master node in the cluster further includes:
when the slave nodes in the cluster do not receive the message sent by the original master node within a given election time, initiating an election and determining a new master node by executing an election operation in a consistency protocol algorithm;
and each slave node except the original master node in the cluster prevents the original master node from reinitiating the election through a set election blocking strategy.
The given election duration may be understood as an election duration configured for each node in the cluster in advance.
It should be noted that the election duration given by each node in the cluster is not fixed. The election duration given by each node in the cluster may be the same configuration duration, or may be different configuration durations, or may be the same configuration duration or different configuration durations in each node, which is not limited in this embodiment. Illustratively, the election duration of one slave node in the cluster is configured to be 1500ms, the election duration of another slave node in the cluster is configured to be 1500ms, and the election duration of another slave node in the cluster is configured to be 1500ms; the election duration of one slave node in the cluster is configured to be 1000ms, the election duration of the other slave node in the cluster is configured to be 1200ms, and the election duration of the other slave node in the cluster is configured to be 1400ms; the election duration of one slave node in the cluster is configured to be 1000ms, the election duration of another slave node in the cluster is configured to be 1000ms, and the election duration of another slave node in the cluster is configured to be 1300ms.
It should be noted that, when the slave node in the cluster does not receive the message sent by the original master node within the given election duration, it can be understood that the original master node may have a network abnormality. The network anomaly may be understood as occurrence of network card failure, network fluctuation, machine failure, network hang-up of an operator, and the like. The message at this time allows the slave node to determine if and when the original master node failed or terminated.
In this embodiment, the random number of the original master node during the network anomaly is kept unchanged, and after the network is restored, the original master node sends a message to each node according to the random number of the original master node.
In this embodiment, when a slave node in the cluster does not receive a message sent by an original master node within a given election duration, an tenure update is automatically performed in the cluster, and an election is initiated and a new master node is determined by executing an election operation in a consistency protocol algorithm.
It should be noted that, the period update is automatically performed in the cluster, before the election is initiated and the election operation in the consistency protocol algorithm is executed to determine the new master node, an election mechanism exists, each slave node of the cluster waits for an election timeout, that is, when the network abnormality occurs in the original master node, other slave nodes cannot receive the message sent by the original master node within the given election duration. Each node in the cluster automatically detects, and when one or more slave nodes in the cluster do not receive the message sent by the original master node within a given election duration, the slave nodes re-initiate election. At this time, other slave nodes except the original master node can receive the election information of the initiating election node. And then, the original master node is prevented from reinitiating the election by an election blocking strategy set for each slave node except the original master node in the cluster. The election blocking policy may be understood as that the original master node cannot initiate an election here through a set election blocking policy.
In this embodiment, the manner of preventing the original master node from reinitiating elections by each slave node except the original master node in the cluster through the set election blocking policy may be: if each slave node except the original master node in the cluster receives the delay message sent by the original master node after determining the new master node and the cluster period number carried in the delay message is smaller than the current cluster period number of each slave node, ignoring the delay message and not sending a message reply message to the original master node; and when the original master node does not receive the message reply message of the relatively delayed message, the execution of election initiation is forbidden, so that the old master library is prevented from initiating election again.
Optionally, each slave node except the original master node in the cluster prevents the original master node from reinitiating election through a set election blocking policy, including:
if each slave node except the original master node in the cluster receives the delay message sent by the original master node after determining the new master node and the cluster period number carried in the delay message is smaller than the current cluster period number of each slave node, ignoring the delay message and not sending a message reply message to the original master node;
And when the original master node does not receive the message reply message of the relatively delayed message, forbidding executing election initiation.
The delayed message may be understood as a message sent to each slave node after the network of the original master node is abnormally recovered.
It should be noted that the delayed message may be a delay in time or a delay in a network. The original master node is disconnected from a part of slave node networks including the new master node, and when the other part of slave node networks are connected normally, the original master node can not receive the message of the new master node, still considers itself as the master node, and after the new master node becomes the master node of all slave nodes except the original master node, the original master node still can send the message of the own time period to a library connected normally with itself.
It should be noted that, when each slave node except the original master node in the cluster receives the delay message sent by the original master node after determining the new master node, then checks the correctness of the received delay message, then analyzes the content of the delay message, compares the cluster arbitrary number carried in the analyzed original master node delay message with the cluster arbitrary number carried in the memory of each slave node except the original master node, and compares the two to obtain that the cluster arbitrary number carried in the analyzed original master node delay message is smaller than the current cluster arbitrary number of each slave node at this moment, ignores the original master node delay message, and does not send the message reply message to the original master node any more, thereby avoiding the original master node from initiating election again, and simultaneously avoiding the new master node from cutting into slave nodes again and accelerating the fault recovery of the old master library.
Optionally, after preventing the original master node from reinitiating the election, the method further includes:
the new master node sends new message to the original master node and other slave nodes;
after receiving the new message, the original master node updates the own cluster random number and changes the cluster random number into the slave node to be added into the cluster;
and the new master node performs the synchronization operation of the data information on each slave node in the cluster.
The new message may be understood as a message sent by the new master node to the original master node and other slave nodes.
In this embodiment, after the original master node is prevented from reinitiating election, the new master node sends a new message to the original master node and other slave nodes at this time, and then the original master node updates its own cluster period number and changes the cluster period number to a slave node to join the cluster after receiving the new message sent by the new master node, and then the new master node performs a data information synchronization operation on each slave node in the cluster.
For example, in order to better understand the election method of the master node in the cluster, when the original master node receives at least one reply message containing the target message whose period has expired, the following steps may be:
a1, an original master node in the cluster sends message messages to all slave nodes and receives message reply messages fed back by all slave nodes relative to the message messages.
a2, the original master node receives at least one target message reply message containing the expiration of the period, at the moment, the condition that network abnormality can occur to one or more slave nodes is explained, the message of the original master node cannot be received, the self-increasing period number initiates election, and the election is invalid at the moment.
and a3, after the abnormal recovery of one or more slave node networks, receiving a message sent by the original master node, and carrying out a message reply message to inform the original master node that the period of the original master node has expired.
and a4, when the original master node receives at least one target message reply message with expired period, extracting a cluster period number carried in the target message reply message, adding 1 to the maximum cluster period number to determine the maximum cluster period number as the own cluster period number, and then initiating election and executing election operation in a consistency protocol algorithm.
and a5, the original master node initiating the election can send a voting request, and each slave node can send a voting request reply to the original master node initiating the election. And after each other slave node receives the voting request of the original master node initiating the election, sending a voting request reply to the original master node initiating the election. When the original master node is elected to become a new master node, asynchronous recovery of data information is carried out on the abnormal slave nodes feeding back the reply message of each target message; when the original master node is not elected to be a new master node, the new master node performs data information synchronization operation on the original master node and other slave nodes.
and a6, the abnormal slave node receives a voting request or a message with a larger random number of the new master node, and feeds back the abnormal slave node of each target message reply message to update the random number of each cluster according to the random number of the cluster carried in the message sent by the new master node, and rejoin the cluster.
For example, in order to better understand the election method of the master node in the cluster, the following provides an election method of the master node in the cluster when the slave node in the cluster does not receive the message sent by the original master node within a given election duration, which includes the following steps:
b1, the original master node in the cluster sends message messages to all the slave nodes and receives message reply messages fed back by all the slave nodes relative to the message messages.
And b2, when the slave nodes in the cluster do not receive the message sent by the original master node within the given election duration, the fact that the original master node is possibly abnormal in network is indicated, and the slave nodes in the cluster initiate election. At this time, other slave nodes except the original master node can receive the election information of the new master node.
b3, after the network abnormality of the original master node is recovered, sending a delay message to other nodes according to the own period number.
b4, if each slave node except the original master node in the cluster receives the delay message sent by the original master node after determining the new master node, and the cluster period number carried in the delay message is smaller than the current cluster period number of each slave node, ignoring the delay message, and not sending a message reply message to the original master node; and when the original master node does not receive the message reply message of the relatively delayed message, forbidding executing election initiation.
b5, the new master node sends new message to the original master node and other slave nodes; after receiving the new message, the original master node updates own cluster arbitrary period number and changes the cluster arbitrary period number into the slave node to join the cluster.
And b6, the new master node performs data information synchronization operation on each slave node in the cluster.
Example two
Fig. 2 is a flowchart of an election device for a master node in a cluster according to a second embodiment of the present invention, where the election device for a master node in a cluster according to the present invention may be implemented by software and/or hardware, and may be configured in a server to implement the election method for a master node in a cluster according to the second embodiment of the present invention. As shown in fig. 2, the apparatus may specifically include: a message receiving module 210 and an election and execution module 220.
The message receiving module 210 is configured to send a message to each slave node by using an original master node in the cluster, and receive a message reply message fed back by each slave node relative to the message, where the original master node is determined by using a given consistency protocol algorithm in advance;
and the election and execution module 220 is configured to update, when the original master node receives at least one target message reply message including a period that has expired, an own cluster period number based on each target message reply message, and initiate an election and execute an election operation in the coherence protocol algorithm.
In the technical scheme provided by the embodiment of the invention, an original master node in a message receiving module cluster sends a message to each slave node and receives a message reply message fed back by each slave node relative to the message, wherein the original master node is determined by adopting a given consistency protocol algorithm in advance; and then, when the original master node receives at least one target message reply message with expired period, the election and execution module updates the own cluster period number based on each target message reply message, and initiates the election and executes the election operation in the consistency protocol algorithm. According to the technical scheme, the original master node in the cluster sends the message to each slave node, so that the master node in the cluster is effectively prevented from being frequently switched to the slave node based on the sent message, the fluency and the reliability of database service are improved, and therefore the cluster performance and the user experience are improved. Compared with the prior art that the nodes of the main library in the cluster are switched to the standby library, the method for selecting the nodes of the main library in the cluster reduces the switching times of the main library in various fault scenes, and even if the selection occurs, the original main library is successfully selected again as much as possible without being switched to the standby library, so that the cluster performance and the user experience are improved. In addition, the above technical scheme of the embodiment effectively reduces the frequent switching times of the master node and the slave node, thereby avoiding the loss of a large amount of data in the database, improving the fluency and reliability of the database service, and improving the performance of the cluster and the experience of users to a certain extent.
Alternatively, based on the above embodiments, the election and execution module 220 may include:
an optional number extracting unit, configured to extract a cluster optional number carried in the reply message of the target message;
and the period number determining unit is used for adding 1 to the maximum cluster period number to determine the maximum cluster period number as the own cluster period number.
Optionally, on the basis of the above embodiments, the method further includes:
the information recovery unit is used for asynchronously recovering the data information of the abnormal slave nodes feeding back the reply message of each target message when the original master node is elected to be a new master node;
and the information synchronization unit is used for performing data information synchronization operation on the original master node and other slave nodes by the new master node when the original master node is not elected to be the new master node.
Optionally, on the basis of the above embodiments, the method further includes:
the cluster joining unit is used for feeding back the abnormal slave nodes of the target message reply messages, updating the respective cluster anytime numbers according to the cluster anytime numbers carried in the messages sent by the new master node, and re-joining the cluster.
Optionally, the method further comprises:
the new master node determining module is used for initiating election and determining a new master node by executing the election operation in the consistency protocol algorithm when the slave nodes in the cluster do not receive the message sent by the original master node within a given election time;
And the primary master node election blocking module is used for blocking each slave node except the primary master node in the cluster from reinitiating the election by the primary master node through a set election blocking strategy.
Optionally, the primary master node election preventing module includes:
the information neglecting unit is used for neglecting the delay message and not sending a message reply message to the original master node if each slave node except the original master node in the cluster receives the delay message sent by the original master node after determining a new master node and the cluster arbitrary number carried in the delay message is smaller than the current cluster arbitrary number of each slave node;
and the election prohibition unit is used for prohibiting the execution of election initiation when the original master node does not receive the message reply message relative to the delay message.
Optionally, on the basis of the above embodiments, the method further includes:
the message sending module is used for sending a new message to the original master node and other slave nodes by the new master node;
the period number updating module is used for updating the period number of the own cluster and changing the period number into the period number of the slave node to be added into the cluster after the original master node receives the new message;
And the data recovery module is used for carrying out data synchronization of data information on each slave node in the cluster by the new master node.
The election device of the master node in the cluster provided by the embodiment of the invention can execute the election method of the master node in the cluster provided by any embodiment of the invention, and has the corresponding functional modules and beneficial effects of the execution method.
Example III
FIG. 3 is a schematic structural diagram of a computer device provided in a third embodiment of the present invention, and as shown in FIG. 3, the device includes a processor 310, a memory 320, an input device 330 and an output device 340; the number of processors 310 in the device may be one or more, one processor 310 being taken as an example in fig. 3; the processor 310, memory 320, input 330 and output 340 in the device may be connected by a bus or other means, for example in fig. 3.
The memory 320 is used as a computer readable storage medium, and may be used to store a software program, a computer executable program, and a module, such as program instructions/modules corresponding to an election method of a master node in a cluster (e.g., a message receiving module 210 and an election and execution module 220 in an election device of a master node in a cluster) according to an embodiment of the present invention. The processor 310 executes various functional applications of the device and data processing by running software programs, instructions and modules stored in the memory 320, i.e. implements a method of electing a master node in a cluster as described above.
Memory 320 may include primarily a program storage area and a data storage area, wherein the program storage area may store an operating system, at least one application program required for functionality; the storage data area may store data created according to the use of the terminal, etc. In addition, memory 320 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device. In some examples, memory 320 may further include memory located remotely from processor 310, which may be connected to the device/terminal/server via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The input means 330 may be used to receive input numeric or character information and to generate key signal inputs related to user settings of the device/terminal/server and function control. The output device 340 may include a display device such as a display screen.
Example IV
A fourth embodiment of the present invention also provides a storage medium containing computer-executable instructions, which when executed by a computer processor, are configured to perform a method of electing a master node in a cluster, the method being performed by a computer device in the cluster as a node, comprising:
An original master node in a cluster sends message messages to slave nodes and receives message reply messages fed back by the slave nodes relative to the message messages, wherein the original master node is determined by adopting a given consistency protocol algorithm in advance;
when the original master node receives at least one target message reply message with expired period, updating the own cluster period number based on each target message reply message, and initiating election and executing the election operation in the consistency protocol algorithm.
Of course, the storage medium containing the computer executable instructions provided in the embodiments of the present invention is not limited to the above-described method operations, and may also perform the related operations in the election method of the master node in the cluster provided in any embodiment of the present invention.
From the above description of embodiments, it will be clear to a person skilled in the art that the present invention may be implemented by means of software and necessary general purpose hardware, but of course also by means of hardware, although in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as a floppy disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a FLASH Memory (FLASH), a hard disk or an optical disk of a computer, etc., and include several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method according to the embodiments of the present invention.
It should be noted that, in the above-mentioned embodiments of the search apparatus, each unit and module included are only divided according to the functional logic, but not limited to the above-mentioned division, as long as the corresponding functions can be implemented; in addition, the specific names of the functional units are also only for distinguishing from each other, and are not used to limit the protection scope of the present invention.
Note that the above is only a preferred embodiment of the present invention and the technical principle applied. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, while the invention has been described in connection with the above embodiments, the invention is not limited to the embodiments, but may be embodied in many other equivalent forms without departing from the spirit or scope of the invention, which is set forth in the following claims.
Claims (8)
1. A method of electing a master node in a cluster, performed by a computer device in the cluster as a node, comprising:
an original master node in a cluster sends message messages to slave nodes and receives message reply messages fed back by the slave nodes relative to the message messages, wherein the original master node is determined by adopting a given consistency protocol algorithm in advance;
When the original master node receives at least one target message reply message with expired period, updating the own cluster period number based on each target message reply message, and initiating election and executing the election operation in the consistency protocol algorithm;
the updating of the cluster anyperiod number based on each target message reply message comprises the following steps:
extracting a cluster period number carried in the target message reply message;
adding 1 to the maximum cluster period number to determine the maximum cluster period number as the own cluster period number; wherein, the maximum cluster period number is a maximum node period number in a target message reply message with expired period, which is fed back by each slave node in the cluster;
after the election is initiated and the election operation in the consistency protocol algorithm is executed, the method further comprises the following steps:
when the original master node is elected to be a new master node, asynchronous recovery of data information is carried out on the abnormal slave nodes feeding back the reply message of each target message;
and when the original master node is not elected to be a new master node, the new master node performs data information synchronization operation on the original master node and other slave nodes.
2. The method of claim 1, further comprising, after the initiating the election and performing the election operation in the coherence protocol algorithm:
And the abnormal slave nodes feeding back the reply messages of the target messages update the respective cluster period numbers according to the cluster period numbers carried in the messages sent by the new master node, and rejoin the clusters.
3. The method as recited in claim 1, further comprising:
when the slave nodes in the cluster do not receive the message sent by the original master node within a given election time, initiating an election and determining a new master node by executing an election operation in the consistency protocol algorithm;
and each slave node except the original master node in the cluster prevents the original master node from reinitiating elections through a set election blocking strategy.
4. A method according to claim 3, wherein each slave node in the cluster except the original master node blocks the original master node from reinitiating elections by a set election blocking policy, comprising:
if each slave node except the original master node in the cluster receives the delay message sent by the original master node after determining a new master node, and the cluster period number carried in the delay message is smaller than the current cluster period number of each slave node, ignoring the delay message, and not sending a message reply message to the original master node;
And the original master node forbids to execute election initiation when the original master node does not receive the message reply message corresponding to the delay message.
5. The method of claim 3, further comprising, after preventing the original master node from reinitiating elections:
the new master node sends new message to the original master node and other slave nodes;
after receiving the new message, the original master node updates the own cluster period number and changes the cluster period number into the slave node to be added into the cluster;
and the new master node performs data information synchronization operation on each slave node in the cluster.
6. An election apparatus for a master node in a cluster, performed by a computer device in the cluster as a node, comprising:
the message receiving module is used for sending message messages to all slave nodes by an original master node in the cluster and receiving message reply messages fed back by all the slave nodes relative to the message messages, wherein the original master node is determined by adopting a given consistency protocol algorithm in advance;
the election and execution module is used for updating the own cluster optional period number based on each target message reply message when the original master node receives at least one target message reply message with the expired optional period, and initiating the election and executing the election operation in the consistency protocol algorithm;
The election and execution module comprises:
an optional number extracting unit, configured to extract a cluster optional number carried in the reply message of the target message;
an period number determining unit, configured to determine a maximum cluster period number plus 1 as a cluster period number of itself; wherein, the maximum cluster period number is a maximum node period number in a target message reply message with expired period, which is fed back by each slave node in the cluster;
the information recovery unit is used for asynchronously recovering the data information of the abnormal slave nodes feeding back the reply message of each target message when the original master node is elected to be a new master node;
and the information synchronization unit is used for performing data information synchronization operation on the original master node and other slave nodes by the new master node when the original master node is not elected to be the new master node.
7. A computer device, characterized by, as a node in a cluster, comprising:
one or more of the processors of the present invention,
storage means for storing one or more programs,
when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the method of electing a master node in a cluster according to any one of claims 1-5.
8. A computer readable storage medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements a method of electing a master node in a cluster according to any of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111260095.7A CN113965578B (en) | 2021-10-28 | 2021-10-28 | Election method, device, equipment and storage medium of master node in cluster |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111260095.7A CN113965578B (en) | 2021-10-28 | 2021-10-28 | Election method, device, equipment and storage medium of master node in cluster |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113965578A CN113965578A (en) | 2022-01-21 |
| CN113965578B true CN113965578B (en) | 2024-01-02 |
Family
ID=79467843
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111260095.7A Active CN113965578B (en) | 2021-10-28 | 2021-10-28 | Election method, device, equipment and storage medium of master node in cluster |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113965578B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114448769B (en) * | 2022-04-02 | 2022-07-01 | 支付宝(杭州)信息技术有限公司 | Node election voting method and device based on consensus system |
| CN114844799A (en) * | 2022-05-27 | 2022-08-02 | 深信服科技股份有限公司 | Cluster management method and device, host equipment and readable storage medium |
| CN115086262B (en) * | 2022-06-20 | 2023-09-26 | 深圳证券通信有限公司 | Heterogeneous instant messaging method and related device |
| CN116932278A (en) * | 2023-06-21 | 2023-10-24 | 天云融创数据科技（北京）有限公司 | Database disaster recovery method, device and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1320217A1 (en) * | 2001-12-14 | 2003-06-18 | Hewlett-Packard Company, A Delaware Corporation | Method, system and computer program for monitoring objects in an IT network |
| US7478400B1 (en) * | 2003-12-31 | 2009-01-13 | Symantec Operating Corporation | Efficient distributed transaction protocol for a distributed file sharing system |
| WO2018207954A1 (en) * | 2017-05-10 | 2018-11-15 | 이철성 | Method for management marketing by multi-level differential voting election, and system therefor |
| CN109450711A (en) * | 2018-12-21 | 2019-03-08 | 广州华多网络科技有限公司 | The choosing method of host node, device, system and storage medium in distributed system |
| CN110417882A (en) * | 2019-07-22 | 2019-11-05 | 卓尔智联(武汉)研究院有限公司 | The determination method, apparatus and storage medium of host node |
| CN112261135A (en) * | 2020-10-22 | 2021-01-22 | 腾讯科技（深圳）有限公司 | Node election method, system, device and equipment based on consistency protocol |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080281938A1 (en) * | 2007-05-09 | 2008-11-13 | Oracle International Corporation | Selecting a master node in a multi-node computer system |
-
2021
- 2021-10-28 CN CN202111260095.7A patent/CN113965578B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1320217A1 (en) * | 2001-12-14 | 2003-06-18 | Hewlett-Packard Company, A Delaware Corporation | Method, system and computer program for monitoring objects in an IT network |
| US7478400B1 (en) * | 2003-12-31 | 2009-01-13 | Symantec Operating Corporation | Efficient distributed transaction protocol for a distributed file sharing system |
| WO2018207954A1 (en) * | 2017-05-10 | 2018-11-15 | 이철성 | Method for management marketing by multi-level differential voting election, and system therefor |
| CN109450711A (en) * | 2018-12-21 | 2019-03-08 | 广州华多网络科技有限公司 | The choosing method of host node, device, system and storage medium in distributed system |
| CN110417882A (en) * | 2019-07-22 | 2019-11-05 | 卓尔智联(武汉)研究院有限公司 | The determination method, apparatus and storage medium of host node |
| CN112261135A (en) * | 2020-10-22 | 2021-01-22 | 腾讯科技（深圳）有限公司 | Node election method, system, device and equipment based on consistency protocol |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113965578A (en) | 2022-01-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113965578B (en) | Election method, device, equipment and storage medium of master node in cluster | |
| US10833919B2 (en) | Node device operation method, work status switching apparatus, node device, and medium | |
| CN111258822B (en) | Data processing method, server, and computer-readable storage medium | |
| US7856502B2 (en) | Cheap paxos | |
| US6941327B2 (en) | Apparatus and method for database synchronization in a duplex system | |
| EP2434729A2 (en) | Method for providing access to data items from a distributed storage system | |
| US20090240974A1 (en) | Data replication method | |
| US20210320977A1 (en) | Method and apparatus for implementing data consistency, server, and terminal | |
| CN111130879B (en) | PBFT algorithm-based cluster exception recovery method | |
| CN110855793A (en) | Distributed system consensus method | |
| CN112506702B (en) | Disaster recovery method, device, equipment and storage medium for data center | |
| CN101908980A (en) | Network management upgrading method and system | |
| US11200123B2 (en) | Consensus process recovery method and related node | |
| CN111752488B (en) | Management method and device of storage cluster, management node and storage medium | |
| US20120324279A1 (en) | Method and Apparatus of Backing up Subversion Repository | |
| CN114936253A (en) | Block chain consensus method and device, electronic equipment and storage medium | |
| CN110351122B (en) | Disaster recovery method, device, system and electronic equipment | |
| WO2023151443A1 (en) | Synchronizing main database and standby database | |
| CN116466894A (en) | Data migration method and device, storage medium and electronic equipment | |
| CN116232893A (en) | Consensus method and device of distributed system, electronic equipment and storage medium | |
| CN113297134B (en) | Data processing system, data processing method and device, and electronic device | |
| CN113890817A (en) | Communication optimization method and device | |
| CN114363350A (en) | Service management system and method | |
| CN115277379B (en) | Distributed lock disaster recovery processing method and device, electronic equipment and storage medium | |
| CN116991623B (en) | Block chain node exception recovery method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |