A LIGHTWEIGHT PASSIVE REPLICATION PROTOCOL FOR DETERMINISTIC SERVERS
This paper presents a lightweight passive replication protocol for deterministic servers in message-passing distributed systems. The protocol allows any server, not necessarily the primary, to take responsibility for processing its received client request and coordinating with the other replica servers after obtaining the delivery sequence number of the request from the primary. Thanks to this feature, the protocol with conventional load balancing techniques can avoid extreme load conditions on the primary. Therefore, the protocol promises better scalability of deterministic and replicated services compared with traditional protocols. Simulation results indicate that the proposed protocol can reduce 22.4% ~ 52.3% of the average response time of a client request.