IDEAS home Printed from https://ideas.repec.org/a/igg/jcac00/v8y2018i3p60-77.html
   My bibliography  Save this article

An Efficient Data Replication Algorithm for Distributed Systems

Author

Listed:
  • Sanjaya Kumar Panda

    (Department of CSE and IT, Veer Surendra Sai University of Technology, Burla, India)

  • Saswati Naik

    (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.

Suggested Citation

  • Sanjaya Kumar Panda & Saswati Naik, 2018. "An Efficient Data Replication Algorithm for Distributed Systems," International Journal of Cloud Applications and Computing (IJCAC), IGI Global, vol. 8(3), pages 60-77, July.
    • Handle: RePEc:igg:jcac00:v:8:y:2018:i:3:p:60-77
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJCAC.2018070105
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jcac00:v:8:y:2018:i:3:p:60-77. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.