Ancestral dynamic voting algorithm for mutual exclusion in partitioned distributed systems
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 al...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Publishing Corporation
2013
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/28819/ http://psasir.upm.edu.my/id/eprint/28819/1/Ancestral%20dynamic%20voting%20algorithm%20for%20mutual%20exclusion%20in%20partitioned%20distributed%20systems.pdf |
| _version_ | 1848846221776519168 |
|---|---|
| author | Zarafshan, Faraneh Karimi, Abbas Al-Haddad, Syed Abdul Rahman Saripan, M. Iqbal Subramaniam, Shamala |
| author_facet | Zarafshan, Faraneh Karimi, Abbas Al-Haddad, Syed Abdul Rahman Saripan, M. Iqbal Subramaniam, Shamala |
| author_sort | Zarafshan, Faraneh |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T08:59:16Z |
| format | Article |
| id | upm-28819 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T08:59:16Z |
| publishDate | 2013 |
| publisher | Hindawi Publishing Corporation |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-288192015-11-17T01:26:17Z http://psasir.upm.edu.my/id/eprint/28819/ Ancestral dynamic voting algorithm for mutual exclusion in partitioned distributed systems Zarafshan, Faraneh Karimi, Abbas Al-Haddad, Syed Abdul Rahman Saripan, M. Iqbal Subramaniam, Shamala 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. Hindawi Publishing Corporation 2013 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/28819/1/Ancestral%20dynamic%20voting%20algorithm%20for%20mutual%20exclusion%20in%20partitioned%20distributed%20systems.pdf Zarafshan, Faraneh and Karimi, Abbas and Al-Haddad, Syed Abdul Rahman and Saripan, M. Iqbal and Subramaniam, Shamala (2013) Ancestral dynamic voting algorithm for mutual exclusion in partitioned distributed systems. International Journal of Distributed Sensor Networks, 2013. art. no. 120308. pp. 1-15. ISSN 1550-1329; ESSN: 1550-1477 http://www.hindawi.com/journals/ijdsn/2013/120308/ 10.1155/2013/120308 |
| spellingShingle | Zarafshan, Faraneh Karimi, Abbas Al-Haddad, Syed Abdul Rahman Saripan, M. Iqbal Subramaniam, Shamala Ancestral dynamic voting algorithm for mutual exclusion in partitioned distributed systems |
| title | Ancestral dynamic voting algorithm for mutual exclusion in partitioned distributed systems |
| title_full | Ancestral dynamic voting algorithm for mutual exclusion in partitioned distributed systems |
| title_fullStr | Ancestral dynamic voting algorithm for mutual exclusion in partitioned distributed systems |
| title_full_unstemmed | Ancestral dynamic voting algorithm for mutual exclusion in partitioned distributed systems |
| title_short | Ancestral dynamic voting algorithm for mutual exclusion in partitioned distributed systems |
| title_sort | ancestral dynamic voting algorithm for mutual exclusion in partitioned distributed systems |
| url | http://psasir.upm.edu.my/id/eprint/28819/ http://psasir.upm.edu.my/id/eprint/28819/ http://psasir.upm.edu.my/id/eprint/28819/ http://psasir.upm.edu.my/id/eprint/28819/1/Ancestral%20dynamic%20voting%20algorithm%20for%20mutual%20exclusion%20in%20partitioned%20distributed%20systems.pdf |