IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i11p120308.html
   My bibliography  Save this article

Ancestral Dynamic Voting Algorithm for Mutual Exclusion in Partitioned Distributed Systems

Author

Listed:
  • Faraneh Zarafshan
  • Abbas Karimi
  • S. A. R. Al-Haddad
  • M. Iqbal Saripan
  • Shamala Subramaniam

Abstract

Data replication is a known redundancy used in fault-tolerant distributed system. However, it has the problem of mutual exclusion of replicated data. Mutual exclusion becomes difficult when a distributed system is partitioned into two or more isolated groups of sites. In this study, a new dynamic algorithm is presented as a solution for mutual exclusion in partitioned distributed systems. The correctness of the algorithm is proven, and simulation is utilized for availability analysis. Simulations show that the new algorithm, ancestral dynamic voting algorithm, improves the availability and lifetime of service in faulty environments, regardless of the number of sites and topology of the system. This algorithm also prolongs the lifetime of service to mutual exclusion for full and partial topologies especially for the situations where there is no majority. Furthermore, it needs less number of messages transmitted. Finally, it is simple and easy to implement.

Suggested Citation

  • Faraneh Zarafshan & Abbas Karimi & S. A. R. Al-Haddad & M. Iqbal Saripan & Shamala Subramaniam, 2013. "Ancestral Dynamic Voting Algorithm for Mutual Exclusion in Partitioned Distributed Systems," International Journal of Distributed Sensor Networks, , vol. 9(11), pages 120308-1203, November.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:11:p:120308
    DOI: 10.1155/2013/120308
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/120308
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/120308?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:sae:intdis:v:9:y:2013:i:11:p:120308. 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: SAGE Publications (email available below). General contact details of provider: .

    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.