Building TMR-Based Reliable Servers Despite Bounded Input Lifetimes

Abstract

This paper is on the construction of a server subsystem in a client While a client can fail by crashing and at least two server processes behave correctly, the third server process can behave in an arbitrary way. Moreover, the communication between clients and server processes is assumed reliable and the network can deliver the same client input to any two server processes within a known bounded time (D). There is also a known bound on the communication delay between every pair of correct server processes (d). In order to cope with client crash and server process failure, it is assumed that if a client input is deposited in the local memory of a server process at time t, then it is systematically discarded from this local memory at time t + if it still remains unordered (this bound additionally manages process' memory requirements).The problem addressed in the paper is new and consists of designing protocols that allow the correct server processes to order client inputs identically despite the combined effect of the bound , the behavior of the Byzantine server process, and the client crash failures. The paper presents two results. It first introduces an ordering protocol that works 8 > D + 3d. Then it shows that there is no ordering protocol when < D.