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.

A New Non-Blocking Validation Protocol for Eager Replication of Databases over a Decentralized P2P Architecture

Replicating a database on a decentralized P2P network using the eager approach is a difficult problem, especially since participants (peers) are dynamic on such kinds of networks. A second defect is conflicting transactions executed concurrently by different peers to update the same data. These problems cause the perpetual abortions of transactions so that replicas remain always inconsistent. Thus, this article introduces a new Four-Phase-Commit (4PC) validation protocol that allows the completion of transactions with available peers and recovers unavailable ones when they re-join the network. Nested transactions and distributed voting technique were used to arrive at an algorithm that was implemented with C#. An experimentation scenario has made it possible to measure its performance and has finally revealed that the new algorithm is effective because in real-time it can replicate a large number of records; it can queue the records of the absent peers in order to distribute these updates to them when they become present again