Affiliation:
1. Department of CSE and IT, Veer Surendra Sai University of Technology, Burla, India
2. Sambalpur University Institute of Information Technology, Burla, India
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.
Reference31 articles.
1. Multi-Cloud Data Management using Shamir's Secret Sharing and Quantum Byzantine Agreement Schemes
2. A distributed minority and majority voting based redundancy scheme
3. A fault tolerance improved majority voter for TMR system architectures.;P.Balasubramanian;WSEAS Transactions on Circuits and Systems,2016
4. A network survivability approach to resist access point failure in IEEE 802.11 WLAN.;S.Bhoi;Second International Conference on Internet Computing and Information Communications,2012
5. Optimal binary vote assignment for replicated data
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献