Efficient Fault Tolerant Algorithms for Internet Distributed Systems

In the current era, Internet is the fastest growing technology. It is a global network of distributed systems that interconnects with each other to share various resources and computation. The complexity of the distributed systems is rapidly increasing, which leads to an increased susceptibility of failure to the participating computers such as clients and servers and their interconnections. Therefore, the main challenge is to address such failures and develop efficient algorithms to tolerate such failures. In this paper, four fault tolerant algorithms, namely server-based fault tolerant (SFT), client-based fault tolerant (CFT), client-server fault tolerant (CSFT) and connection fault tolerant (CoFT) are proposed to deal with the above challenge. The proposed algorithms are evaluated in terms of number of failures (NOF), load factor (LF) and load standard deviation (LSD) and compared with an existing algorithm. The comparison results show the superior performance of the proposed algorithms.