Welcome to the InfoSci Platform
An Efficient Data Replication Algorithm for Distributed Systems

An Efficient Data Replication Algorithm for Distributed Systems

Sanjaya Kumar Panda, Saswati Naik
Copyright: © 2021 |Pages: 20
ISBN13: 9781799853398|ISBN10: 179985339X|EISBN13: 9781799853404
DOI: 10.4018/978-1-7998-5339-8.ch065
Cite Chapter Cite Chapter

MLA

Panda, Sanjaya Kumar, and Saswati Naik. "An Efficient Data Replication Algorithm for Distributed Systems." Research Anthology on Architectures, Frameworks, and Integration Strategies for Distributed and Cloud Computing, edited by Information Resources Management Association, IGI Global, 2021, pp. 1344-1363. https://doi.org/10.4018/978-1-7998-5339-8.ch065

APA

Panda, S. K. & Naik, S. (2021). An Efficient Data Replication Algorithm for Distributed Systems. In I. Management Association (Ed.), Research Anthology on Architectures, Frameworks, and Integration Strategies for Distributed and Cloud Computing (pp. 1344-1363). IGI Global. https://doi.org/10.4018/978-1-7998-5339-8.ch065

Chicago

Panda, Sanjaya Kumar, and Saswati Naik. "An Efficient Data Replication Algorithm for Distributed Systems." In Research Anthology on Architectures, Frameworks, and Integration Strategies for Distributed and Cloud Computing, edited by Information Resources Management Association, 1344-1363. Hershey, PA: IGI Global, 2021. https://doi.org/10.4018/978-1-7998-5339-8.ch065

Export Reference

Mendeley
Favorite

Abstract

This article describes how data replication plays an important role in distributed systems. It primarily focuses on the redundancy of data at two or more nodes, to achieve both fault tolerance and improved performance. Therefore, many researchers have proposed various data replication algorithms to manage the redundancy of data. However, they have not considered the faults that are associated with the nodes, such as permanent, transient and intermittent. Moreover, they have not incorporated any recovery approach to rejoin the failed nodes. Therefore, the authors propose a data replication algorithm, called dynamic vote-based data replication (DVDR). The main contribution of DVDR is to consider all types of faults and rejoin the failed nodes. DVDR is based on dynamic vote assignment among the connected nodes, and referred as passive and non-hierarchical one. The authors perform rigorous analysis of DVDR and compare with an existing dynamic vote assignment algorithm. The result shows the efficacy of the proposed algorithm.

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.