Protocol for groups of pseudo-active replicated objects

Distributed applications are realized by the cooperation of multiple objects based on client-server style communication. Server objects are replicated on multiple computers to achieve fault tolerance. In active replication, all the replicated server objects (replicas) receive the same requests in the same order from the client objects, invoke the same operations (methods) and send back responses. These replicas might be placed on different kinds of computers with different processing speeds. In addition, these computers might be connected to different networks, i.e. replicas might be distributed in a WAN. To apply active replication to such a heterogeneous environment, this paper proposes a pseudo-active replication where a client object receives only the first response from the replicas. In order to reduce the recovery time due to the difference in processing speeds among the replicas, two techniques are introduced. One is to detect the fastest replica and the other is for the slower replicas to catch up with the fastest one; requests for identity and idempotent operations (methods) are not invoiced in the slower replicas. Furthermore, in order to reduce the response time for requests from client objects, requests for compatible operations (methods) are invoiced in different order in the replicas. The order is decided based on the round-trip time between client objects and replicas for supporting WAN environments. These are realized by piggybacking some additional information with the control messages for the ordering protocol, i.e. no additional message is required in the proposed protocol