A Dynamic Fault Tolerant Algorithm Based on Active Replication

To the wide area network oriented distributed computing such as Web services,a slow service is equivalent to an unavailable service.It makes demands of effectively improving the performance without damaging availability to the replication algorithms.However,existing replication algorithms seldom address to improve the performance.Propose a new replication algorithm named RRR.Its main advantages are: Its response time is short because the response is returned by the fastest replica;It economizes the system resources;It is based on the active replication algorithm,but it avoids the redundant nested invocation problem.Finally prove the advantages by analyzing and experiments.