A New Eager Replication Approach Using a Non-Blocking Protocol Over a Decentralized P2P Architecture

Eager replication of distributed databases over a decentralized Peer-to-Peer (P2P) network is often likely to generate unreliability because participants can be or cannot be available. Moreover, the conflict between transactions initiated by different peers to modify the same data is probable. These problems are responsible of perpetual transaction abortion. Thus, a new Four-Phase-Commit (4PC) protocol that allows transaction commitment with available peers and recovering unavailable peers when they become available again has been designed using the nested transactions and the distributed voting technique. After implementing the new algorithm with C#, experiments made it possible to analyse the performance which revealed that the new algorithm is efficient because in one second it can replicate a considerable number of records, such as when an important volume of data can be queued for subsequent recovery of the concerned slave peers when they become available again.