Welcome to the InfoSci Platform
Reference Hub3
Efficient Fault Tolerant Algorithms for Internet Distributed Systems

Efficient Fault Tolerant Algorithms for Internet Distributed Systems

Swati Mishra, Sanjaya Kumar Panda
Copyright: © 2017 |Volume: 7 |Issue: 1 |Pages: 20
ISSN: 1947-9115|EISSN: 1947-9123|EISBN13: 9781522513353|DOI: 10.4018/IJKDB.2017010106
Cite Article Cite Article

MLA

Mishra, Swati, and Sanjaya Kumar Panda. "Efficient Fault Tolerant Algorithms for Internet Distributed Systems." IJKDB vol.7, no.1 2017: pp.71-90. http://doi.org/10.4018/IJKDB.2017010106

APA

Mishra, S. & Panda, S. K. (2017). Efficient Fault Tolerant Algorithms for Internet Distributed Systems. International Journal of Knowledge Discovery in Bioinformatics (IJKDB), 7(1), 71-90. http://doi.org/10.4018/IJKDB.2017010106

Chicago

Mishra, Swati, and Sanjaya Kumar Panda. "Efficient Fault Tolerant Algorithms for Internet Distributed Systems," International Journal of Knowledge Discovery in Bioinformatics (IJKDB) 7, no.1: 71-90. http://doi.org/10.4018/IJKDB.2017010106

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.