Phase Commit Protocol Research Articles

A Proposed Combinatorial System Design for Ubiquitous Transaction Processing Systems

As computing paradigm shift from a computing paradigm involving one-computer-many people to that involving one-person-one computer and eventually to the one involving one-person-many computers, the need for effective transaction management model for this advancement has also increased. This is because, new transaction management challenges are introduced. These challenges include increased mobile user bank, hybrid of mobile devices and transaction processing architecture related issues. This paper presents a Combinatorial System Design of Transaction Processing Elements for Ubiquitous Computing with the aim of justifying the choice of deploying Mobile-3PC Protocol on Three-tier transaction processing system architecture as the appropriate combinatorial system design for ubiquitous transaction processing systems. To achieve this aim, existing transaction processing systems are critically analysed and Compared against standards that influence transaction processing throughput and response time positively. A systematic analytical approach is used in analyzing the organizational structure of two-tier and three-tier system architectures. Subsequently, 2 Phase Commit and 3 Phase Commit communication protocols are analyzed and deployed on the three-tier system architecture to ascertain which one of the combinational transaction processing system design support ubiquitous computing effectively. The study shows that the Mobile-3 Phase Commit Protocol on Three-Tier system architecture displayed proactive management skill to curb process failures. This signifies higher transaction throughput. The inherent load balancing capability of the three-tier system architecture also shows support for improved response time. It is therefore recommended that the Mobile-3PC Protocol-on-Three-Tier system architecture be adopted as the combinatorial system design for ubiquitous transaction processing systems.

A Model Application of Two Phase Commit Protocol in Wireless DTN

A Model Application of Two Phase Commit Protocol in Wireless DTN

An Efficient Scheme for Facilitating Secure Data Sharing in Decentralized Disruption Tolerant Networks

Wireless Sensor Nodes in military situations, for example, a war zone or an unfriendly locale are liable to experience the ill effects of discontinuous system network. Objective: To design an efficient data recovery scheme for Decentralized DTNs in military environments, based on CP-ABE methodology, making Security the utmost prioritized characteristic. Analysis: Latest Innovations in Disruption Tolerant Networks (DTN) are getting to be effective arrangements, that permit mobile devices carried by military personnel to correspond with one another and access the classified data or to command effectively by manipulating the independent-autonomous repository nodes. Out of these, the most difficult issues in the situation are the authorization strategies and those approaches' improvisation for secure data recovery. Methodology: Cipher text Policy-Attribute Based Encryption (CP-ABE) is a promising cryptographic technique to address the access authority issues. The issue of applying CP-ABE in decentralized DTNs presents a few security and protection challenges like attribute revoke, key security, and regulation of attributes issued from distinct authorities. So, we implement CP-ABE along with 2PC (Two Phase Commit) protocol and where numerous key authorities deal with their attributes autonomously to overcome the above mentioned challenges. Findings/Improvements: We implement the proposed System as a stand-alone application in Eclipse IDE. We've been successful in implementing this system to achieve the security requirements we've been discussing at length in the paper and we've demonstrated how to recover the data in very hostile military environments in an efficient and a secured manner.

Novel Backfilling Technique with Deadlock Avoidance and Migration for Grid workflow Scheduling

The objective of this research is to develop a task scheduling algorithm for grid services with improved resource utilization, fault tolerance capability and to avoid deadlocks. The algorithm simulated using GridSim toolkit, which is used to measure the effectiveness of scheduling and related algorithms in grid environments with reduced complexity than the real implementation. Two advanced methods, Two Phase Commit Protocol with novel back filling Technique (TPCNBF) and Two Phase Commit Protocol with novel back filling technique and task migration (TPCNBFM) were developed to schedule the tasks. The backfilling technique is used to improve resource utilization and fault tolerance in job scheduling. Two phase commit protocol prevents deadlocks in task scheduling. Fault tolerance in task scheduling is improved by task migration to protect tasks from any resource failure. TPCNBF and TPCNBFM methods give higher performance improvement than the current method called Cost Driven Work Flow Scheduling (CDWFS). In this method, the scheduling is based on deadline and the resource status. The experimental results showed that the TPCNBF and TPCNBFM have less makespan, cost, high success rate and throughput. The new algorithm can be used to schedule computing intensive tasks in grid services like Astronomy, high energy physics with deadlock avoidance, fault tolerance and improved resource utilization.

Highly Available Hadoop Name Node Architecture-Using Replicas of Name Node with Time Synchronization among Replicas

Hadoop is a Java software framework that supports data - intensive distributed applications and is developed under open source license. It enables applications to work with thousands of nodes and petabytes of data. The two major pieces of Hadoop are HDFS and MapReduce. HDFS works with two types of hardware machines, the DataNode (Slave machine) which is the machine on which application's data is stored and the NameNode (Master machine) which store the metadata of file system. Where NameNode is the only single machine for storing metadata of file system and is the Single Point of Failure (SPOF) for the HDFS. SPOF of NameNode machine affects the overall availability of Hadoop. When NameNode goes down the entire system become offine and cannot do any operation until NameNode gets restart. If the NameNode machine fails, the system needs to be re-started manually, making the system less available. This paper proposes a highly available architecture and its working principle for the HDFS NameNode against its SPOF utilizing well-known 2-Phase Commit (2PC) Protocol and election by bully with Time synchronization mechanism. Keywords - Hadoop, HDFS, Two Phase Commit Protocol, Berkeley algorithm for time synchronization, Name node.

Comparison Study of Commit Protocols for Mobile Environment

This paper presents a study of protocols to commit the transactions distributed over several mobile and fixed units and provides the method to handle mobility at the application layer. It describes the solutions to defeat the dilemma related to principle implementation of the Two Phase Commit (2PC) protocol which is essential to ensure the consistent commitment of distributed transactions. The paper surveys different approaches proposed for mobile transaction and outline how the conventional commitment are revisited in order to fit the needs of mobile environment. This approach deals with the frequency disconnections and the movement of mobile devices. This paper also proposes Single Phase Reliable Timeout Based Commit (SPRTBC) protocol that preserves the 2PC principle and it lessens the impact of unreliable wireless communications.

An Extended Three Phase Commit Protocol for Concurrency Control in Distributed Systems

One of the important issues of distributed system is to improve Concurrency control , I observed that Concurrency Control is very difficult task for distributed systems because of absence of global clock and lack of shared memory. To improve the concurrency control problems in my work, a new modified version of three phase commit protocol is introduced that works for the sake of concurrency control in distributed systems. The basis of this protocol is the division of all the sites into two groups depending upon the number of queries generated and importance of the queries at these sites. The sites where more queries are generated are considered as primary sites and those having less, are considered as secondary sites. The Primary sites are given more importance while deciding whether to commit or abort a transaction. In this a modified version of three phase commit protocol is praposed that ensures if a transaction is originated from a primary site then it is bound to commit provided all other primary sites vote to commit, no matter whether secondary sites commit or not and there the advantages and disadvantages of this new version is considered. It is to be mentioned that this protocol works only for transactions that accesses a single database object. Instances of such transactions could be debiting or crediting a bank account as in this only a single database object such as a personal bank account is accessed.

The Two-Phase Commitment Protocol in an Extended π-Calculus

We examine extensions to the π-calculus for representing basic elements of distributed systems. In spite of its expressiveness for encoding various programming constructs, some of the phenomena inherent in distributed systems are hard to model in the π-calculus. We consider message loss, sites, timers, site failure and persistence as extensions to the calculus and examine their descriptive power, taking the Two Phase Commit Protocol (2PCP), a basic instance of an atomic commitment protocol, as a testbed. Our extensions enable us to represent the 2PCP under various failure assumptions, as well as to reason about the essential properties of the protocol.