• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.523-532
• /
• 2001

An atomic commitment protocol ensures that distributed transcations terminate consistently at participating sites. An atomic commitment protocol is said to be non-blocking if it permits transaction termination to proceed at correct participants despite of failure in the coordinator site and communication. It is well known that the famous two phase commit(2PC) is a blocking protocol, whereas the three phase commit(3PC) protocol is a non-blocking. In this paper, we propose a non-blocking two phase commit(NB-2PC) protocol reducing the blocking problem than propose non-blocking protocols. The NB-2PC protocol can be obtained through modifications of the 2PC protocol. After receiving Prepare message from coordinator in the NB-2PC protocol, participants respond to the coordinator and several participants in voting phase. While participants wait for decision message from the coordinator, the blocking occurs due to the failure of the coordinator site, participants elect new coordinator among several participants receive response message. Despite of the coordinator site failures, participants consult new coordinator and follow termination protocols and achieve non-blocking property. We propose a basic structure of NB-2PC protocol and termination protocol and new coordinator election protocol. The NB-2PC protocol has non-blocking property and reduces processing time of commit protocol than the 3PC protocol. Also, through simulation experiments, we propose the NB-2PC protocol exhibits better performance of processing time of commit protocol than 3PC protocol.

• Proceedings of the CALSEC Conference
• /
• 2005.03a
• /
• pp.261-266
• /
• 2005

Web services provide an effective means to carry out coordinated transactions between multiple, independent business parties. While there are several specific protocols currently being discussed to address the coordination of web services-enabled business transactions, we consider the tentative hold protocol (THP) that allows the placement of tentative holds on business resources prior to actual transactions in order to provide increased flexibility in coordination. In this paper, we present a formal coordination framework for applying THP in conjunction with 2PC to the problem in which service providers independently manage resources and clients seek to acquire the resources from multiple providers as a single atomic transaction. The proposed framework facilitates the performance optimization of THP through effective parameterization with the notion of overhold size and hold duration. The simulation results show that the proposed adaptive approach yields a significant improvement over other non-adaptive policies.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.950-959
• /
• 2010

The Election paradigm can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems and it was proved by temporal logic. This solution is based on the Group Membership Detection algorithm.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.289-296
• /
• 2001

The Election protocol can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile computing environment. Mobile systems are more prone to failures than conventional distributed system. Solving election in such an environment requires from a set of mobile hosts to choose a mobile host or a fixed host based on the their priority despite failures of both mobile computing and/or fixed hosts. In this paper, we describe a solution to the election problem from mobile computing systems. This solution is based on the Garcia Molina\\`s Bully algorithm.

• The Journal of the Korea Contents Association
• /
• v.8 no.12
• /
• pp.53-62
• /
• 2008

The Election paradigm can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile ad hoc computing environment. Mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems. This solution is based on the Group Membership Detection algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.7
• /
• pp.4554-4561
• /
• 2014

In recent years, several paradigms have been identified to simplify the design of fault-tolerant distributed applications in a conventional static system. Leader Election is among the most noticeable, particularly because it is closely related to group communication, which provides a powerful basis for implementing active replications among other uses. On the other hand, despite its usefulness, to our knowledge, no study has focused on this problem in a mobile computing environment. The aim of this paper was to propose an algorithm for the leader election protocol in a fixed station based wireless networks environment. The election algorithm is much more efficient than other election algorithms in terms of the fault tolerance.