Availability/Consistency Balancing Replication Model

Osrael, Johannes; Froihofer, Lorenz; Goeschka, Karl M.

doi:10.1109/ipdps.2007.370610

Cited by 1 publication

(1 citation statement)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the sender of a request, the failure of a site is not distinguishable from the failure of one or more links [47]. Normally only site failures are treated as network partitions until repair time [33,48]. The aim of analysing partially connected topology is to show how dynamic algorithms can tolerate link failures.…”

Section: Fresh-start Simulationmentioning

confidence: 99%

Ancestral Dynamic Voting Algorithm for Mutual Exclusion in Partitioned Distributed Systems

Zarafshan

Karimi

Al-Haddad

et al. 2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

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.

show abstract

Section: Fresh-start Simulationmentioning

confidence: 99%