Optimization method based on Gossip communication protocol and Raft election algorithm

Abstract

The invention discloses an optimization method based on a Gossip communication protocol and a Raft election algorithm. The method comprises: 1, globally defining; 2, defining the number of PING messages which are fixedly transmitted by a node per second; 3, changing the number of PING messages which are fixedly transmitted by the node per second, and receiving a selection mode of the node; 4, if a main node has a fault, by a node in a Redis cluster, judging that the main node is in a suspected offline state; 5, changing the number and a selection mode of Gossip messages in a Gossip unit; 6, by the node in the Redis cluster, judging that the main node is in an offline state; 7, by a secondary node, invoking a voting request to all nodes in the Redis cluster; 8, changing the voting mode; 9, ensuring that the secondary node is elected to be the main node; and 10, ensuring that the Redis cluster is successfully recovered. According to the optimization method based on the Gossip communication protocol and the Raft election algorithm, on the basis of not influencing throughput and time delay of the Redis cluster, the recovery time of the Redis cluster is shortened, and reliability and stability of the Redis cluster are improved.

Description

technical field [0001] The invention relates to the technical field of non-relational databases, in particular to an optimization method based on Gossip communication protocol and Raft election algorithm. Background technique [0002] The Redis cluster is a distributed cluster composed of N×(n+1) Redis server nodes. The server nodes are divided into N master nodes and N×n slave nodes. One master node corresponds to n slave nodes, and the master node is responsible for Processing slots and corresponding client operations, the slave node replicates the data of the backup master node. After the failure of the master node, the Redis cluster uses the Gossip communication protocol to judge that the failed master node is offline, and stops receiving client requests; then joins the corresponding failover process, and the corresponding slave nodes are obtained through the Raft election algorithm After receiving a support ticket from the master node, it will be promoted to the new m...

AI Technical Summary

Problems solved by technology

[0003] As a distributed cluster, stability and reliability are very important. However, after the failure of the master node of the current Redis cluster, the recovery time is unstable and takes a long time, and even cannot be successfully restored. With the increase of the number of failed master nodes , the recovery time of the Redis cluster increases rapidly; when the user performs a time-consuming operation, the Redis cluster will generate a wrong master-slave switch

Images