关键词: 分布式计算, 共识算法, 低延迟, Paxos

Abstract: As one of the most important basic problems in distributed computing, the consensus problem is widely used in the fields of state machine replication, atomic broadcast, leader election and so on. The algorithm for solving the consensus problem usually has the problems of single leader performance bottlenecks, response latency affected by command conflicts. In response to these problems, a low-latency consensus algorithm MEPaxos (modified Egalitarian Paxos) is proposed in asynchronous distributed systems under non-Byzantine failures. First, the method of calculating the system average latency is proposed. Then, a timeout mechanism is introduced to improve the two-phase commit algorithm. Later, based on the system average latency calculation result, an improved two-phase commit algorithm is used to automatically select an algorithm mode with a smaller average latency. Finally, this algorithm is compared with the current consensus algorithm experimentally on Amazon EC2 (elastic compute cloud) platform. The results show that the system latency performance has been improved using the MEPaxos algorithm.

Key words: distributed computing, consensus algorithm, low latency, Paxos