Design of protocols in Timed CSP for highly reliable and available client-server system

In a distributed environment, a client-server model is often used because of its ease of implementation. The reliability of the server on the model determines the reliability of the whole system. By making a backup server, the tolerance of server failure can be improved. This method, however, has a long recovery time because a recovery operation includes generally detecting failure, switching to the backup server, starting the server process, and re-executing services executed at failure. Thus, the method cannot be introduced to application areas that have time constraints. The authors aim to implement the highly reliable and available client-server system which is able to recover failures in a very short time. In order to shorten recovery time, process level replication is employed. A server process has more than one copies on different hosts. Copies keep the same status as the original process. Thus, they can replace the original process very quickly when a failure occurs. Several protocols, such as updating the status of copies and recovering from failures, must be specified in order to implement the proposed system. In this paper, protocols for updating copies and recovering from failures are described formally in Timed CSP, which is a process algebraic language, for defining them precisely