A Clustering Algorithm in Two-Phase Commit Protocol for Optimizing Distributed Transaction Failure?

The Two-Phase Commit Protocol (2PC) is a distributed algorithm used in computer networks and distributed database systems. It is used when a simultaneous data update should be applied within a distributed database. In this protocol, one node acts as the coordinator, which is also called master and all the other nodes in the network are called participants or slaves. The important issue in transaction management is that if a database was in a consistent state prior to the initiation of a transaction, then the database should return to a consistent state after the transaction is completed. This should be done irrespective of the fact that transactions were successfully executed simultaneously or there were failures during execution. To optimize failure in distributed transactions, a clustering algorithm is simulated in Two Phase Commit(2PC) protocol to demonstrate how coordinator and site failure is minimized while maintaining atomicity and consistency property of transactions. This paper compares the performance of the transaction clustering algorithm with the current 2PC protocol. The Possible failure cases are identified and created to show how it responds to different failure scenarios and recovery. The simulation algorithm was developed using Jcreator with mySQL acting as a back end data manager, the Bitronix transaction manager which is a simple but complete implementation of Java applications whose goal is to provide a fully working transaction manager that has useful error reporting and logging methods which makes it easier to know when an error occurs. Results obtained indicated that by using the proposed algorithm, transaction failures associated with 2PC can be reduced.