Low-Latency Consensus with Weak-Leader Using Timestamp by Synchronized Clocks

Weak leader algorithms can improve the efficiency of reaching consensus by reducing the number of communications for distributed network services. However, they generate a large number of conflicts during operation, which can lead to expensive cross-region communications and make them difficult to adapt to WAN environments. So how to efficiently resolve conflicts becomes a key challenge. In this paper, we propose an approach applied to weak-leader algorithms, which effectively reduces the happens of conflicts and provides low-latency and high-throughput consensus in WAN systems, called the Low-Conflict Consensus method (LCC). Our proposed LCC uses timestamps generated by synchronized clocks to reduce conflicts. We present how LCC determines the delayed time in message processing and adopts some rules to sort the received messages. We validate and evaluate LCC through extensive experiments, which show that LCC can effectively reduce conflicts and the latency to achieve consensus.