Evaluation of an Efficient Ring-Based Total Order Protocol in a Fairness-Controlled Environment
Agbaeze Ejem, Cosmas Ifeanyi Nwakanma, Ejem Agwu Ejem, Juliet Nnenna Odii · Preprints.org · 2025
Server replication ensures crash tolerance by enforcing a total order of input requests across multiple servers. The Logical Clock and Ring (LCR) protocol, a ring-based lead-erless total order protocol, achieves high throughput by arranging processes in a logical ring with unidirectional message flow. However, LCR design assumption may not produce optimal latency under high message concurrency due to its use of vector clocks as vector timestamps for sequencing messages and a fixed "last" process for ordering concurrent messages. To improve latency, we propose using Lamport's logical clock as a message timestamp for sequencing messages and redefining the "last" process as the nearest process in the opposite direction of message flow, ensuring a unique last process for each message sender. Fairness is preserved using a modified fairness control algo-rithm from the Fixed Sequencer and Ring (FSR) protocol. Our evaluation shows that the proposed protocol offers latency improvement better than LCR across all considered configurations. Additionally, fairness among process replicas was maintained, evi-denced by an even distribution of message sending responsibilities, with each process contributing approximately equally to total message output.