Timeout-Based Message Ordering Protocol for a Lightweight Software Implementation of TMR Systems

摘要

Replicated processing with majority voting is a well known method for achieving reliability and availability. Triple Modular Redundant (TMR) processing is the most commonly used version of that method. Replicated processing requires that the replicas reach agreement on the order in which input requests are to be processed. Almost all synchronous and deterministic ordering protocols published in the literature are time-based in the sense that they require replicas' clocks to be kept synchronised within some known bound. We present a protocol for TMR systems that is based on timeouts and does not require clocks to be kept in bounded synchronism. Our design efforts focus on keeping the ordering delays small, without unnecessary increase in message overhead. Consequently, we are able to show that no symmetric protocol that works only with unsynchronised clocks, can provide a smaller worst-case delay. We also demonstrate, through analysis and experiments, that our protocol is faster than a time-based one of identical message complexity in certain situations which can prevail in many application settings.