• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1365-1374
• /
• 1996

To alleviate the blocking inherent in 2-phase commit protocol(2PC) that is widely used to ensure the atomicity of global transactions in distributed environments, an optimistic 2PC can be used. Under the optimistic 2PC, compensation transactions are introduced to ensure the atomicity of transactions, which may result in the violation of global serializability due to the properties of compensation, transactions. In this paper, we propose several valid management protocols for global transactions to ensure the global serializability through the analysis of transaction of state transitions. To determine the execution of one global transaction, the proposed protocols check the sates of other concurrent global transactions. According to the result, execution of the global transaction may be delayed to ensure the global serializability.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.1007-1014
• /
• 2003

It is important to integrate an enterprise application for automating of the business profess, which is responded by a flow of market environment. There are two categories of method that integrate enterprise applications. One is Synchronous Integration, and the other is Asynchronous Integration. EAI(Enterprise Application Integration) and Web service which of the asynchronous integration is focused in the automating method of the business process. After we construct the application integration for automating of the business process, we have to concern about managing of the business transaction. Many Organizations have proposed the process method of business transaction based on 2-phase commit protocol. But this method can′t supply the phase that classify the transaction by transaction weight. In this paper, we propose an efficient method of transaction process for business transactions, which is composed by ′Classify Phase′ that classify transactions. We called this model "3-Phase Commit Method Applied by Classify Phase", we design this model to manage an resource of enterprise efficiently. The proposed method is compared by the method based on 2-Phase commit that could be a problem of management the resource of enterprise, and the advantage of this method is certified to propose the solution of that problem.

• 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.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.259-268
• /
• 2004

For supporting Interoperability among heterogeneous data sources in different geographic information systems, it is required to use open API like OGIS OLE DB Proposed in OGC. The OLE/COM Implementation Specification of OGIS only provides interfaces to discover and access spatial data, but does not support interfaces for updating distributed spatial data. To solve this problem, we propose and add interfaces for updating spatial objects distributed over heterogeneous data sources and examining the consistency of spatial relationships between updated objects. We also devise a 2-phase commit protocol based on spatial relationships in order to guarantee the consistency of updated objects. To justify the update scheme using the proposed Interfaces and 2-phase commit prototype we design and implement a prototype system for updating distributed spatial objects.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.484-493
• /
• 2001

As real-time database systems are extended to the distributed computing environment, the need to apply the existing real-time concurrency control schemes to the distributed computing environment has been made. In this paper we propose an efficient concurrency control scheme for distributed real-time database system. Our proposed scheme guarantees a transaction to commit at its maximum, reduces the restart of a transaction that is on the prepared commit phase, and minimizes the time of the lock holding. This is because it raises the priority of the transaction that is on the prepared commit phase in the distributed real-time computing environment. In addition, it reduces the waiting time of a transaction that owns borrowed data and improves the performance of the system, as a result of lending the data that the transaction with the raised priority holds. We compare the proposed scheme with DO2PL_PA(Distributed Optimistic Two-Phase Locking) and MIRROR(Managing Isolation in Replicated Real-time Object Repositories) protocol in terms of the arrival rate of transactions, the size of transactions, the write probability of transactions, and the replication degree of data in a firm-deadline real-time database system based on two-phase commit protocol. It is shown through the performance evaluation that our scheme outperforms the existing schemes.

• The Journal of the Korea Contents Association
• /
• v.5 no.6
• /
• pp.49-56
• /
• 2005

To reduce server bottlenecks in client-server computing, each client may have its own cache for later reuse. The pessimistic approach for cache management protocol leads to unnecessary waits, because, it can not be commit a transaction until the transaction obtains all requested locks. In addition, optimistic approach tends to make needless aborts. This paper suggests an efficient optimistic protocol that overcomes such shortcomings. In this paper, we present a simulation-based analysis on the performance of our scheme with other well-known protocols. The analysis was executed under the Zipf workload which represents the popularity distribution on the Web. The simulation experiments show that our scheme performs as well as or better than other schemes with low overhead.

• 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:Databases
• /
• v.28 no.3
• /
• pp.458-467
• /
• 2001

Optimistic Two-Phase Locking(O2PL) performs as well as or better than the other approaches because it exploits client caching well and also has relatively lower network bandwidth requirements. However, O2PL leads to unnecessary waits, because, it can not be commit a transaction until the transaction obtains all requested locks. In addition, Optimistic Concurrency Control(OCC) tends to make needless aborts. This paper suggests an efficient optimistic cache consistency protocol that overcomes such shortcomings. Our scheme decides whether to commit or abort a transaction without wait and it adopts transaction re-ordering in order to minimize the abort rate. Our scheme needs only one version for each data item in spite of the re-ordering mechanism used. Finally, this paper presents a simulation-based analysis that shows superiority in performance of out scheme to O2PL and OCC.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.397-407
• /
• 2003

Transactions of updating spatial dta with mobile clients are log transactions because a user disconnected from a server surveys real features and updates them. In this environment, it is appropriate to exploit the optimistic approach based on the validation test in order to control the concurrency of transactions. On the contrary, the pessimistic concurrency control scheme makes transactions wait for a long time due to the lock. In this paper, we propose the surrogate transaction model and implement its manager for the S-S-M(Server-Surrogate PC-Mobile Client) structure which is appropriate for updating spatial data in mobile environments. In the S-S-M structure, the mobile client communicates with the server by the surrogate PC. We extend the validation condition in consideration of spatial relationships between spatial objects in this model. We also present the commit protocol where the user of a surrogate PC adjusts objects of the conflicted surrogate transaction to minimize costs for the abortion of the transaction.

• ETRI Journal
• /
• v.20 no.3
• /
• pp.251-271
• /
• 1998

It is well known that if usage parameter control/network parameter control (UPC/NPC) functions are used together with a cell loss priority control scheme in ATM networks, the measurement phasing problem can occur. This makes it difficult for a network provider to define and commit the cell loss ratio as a QoS parameter. To solve the problem, we propose a new UPC/NPC algorithm. By using the proposed UPC/NPC algorithm, we can define the cell loss ratios for CLP = 0 and CLP = 0+1 cell streams without the measurement phasing problem under any conditions. We analyzed the performance of the proposed UPC/NPC algorithm. Using a discrete time model for the UPC/NPC architecture with a discrete-time semi-Markov process (DSMP) input model, we obtained the cell discarding probabilities of CLP = 0 and CLP = 0+1 cells streams and showed that more CLP = 0 cells are accepted compared to what was proposed in ITU-T.