• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.10
• /
• pp.499-506
• /
• 2005

The growth of networks increase the importance of electronic commerces. Since the fair exchange protocol is an important part of electronic commerces, a number of researches have been done in relation to the fair exchange protocol. As the contract signing protocol is a part of fair exchange protocol, many protocols have been proposed, but most of them were focused on two-party protocol. Only a few were on the multi-party contract signing protocol. So far the optimistic multi-party contract signing protocol presented by Baum-Waidner has the least number of rounds in asynchronous network[4]. But, the lower bound on the number of rounds required by any optimistic multi-party contract signing protocol has been not known. In this paper, we present a tight lower bound on the number of rounds for optimistic multi-party contract signing protocol.

• 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 the Korea Society for Simulation
• /
• v.5 no.1
• /
• pp.81-90
• /
• 1996

In this paper, we propose a new events ordering mechanism for the optimistic distributed simulation of DEVS models. To simulate DEVS models in a distributed environment, a synchronization protocol is required for correct simulation. Time Warp is the most well-known optimistic synchronization protocol for distributed simulation. However, employing the Time Warp protocol in distributed simulation of DEVS models incurs events ordering problem due to the semantic difference between Time Warp and DEVS, Thus, to resolve such semantic difference, we devise the time-and-priority-stamp and $\varepsilon$ -delay schemes. The proposed schemes can order simultaneous events correctly in Time Warp-based distributed simulation of DEVS models.Time Warp and DEVS, Thus, to resolve such semantic difference, we devise the time-and-priority-stamp and $\varepsilon$ -delay schemes. The proposed schemes can order simultaneous events correctly in Time Warp-based distributed simulation of DEVS models.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.633-639
• /
• 2004

The performance of optimistic concurrency control schemes which are generally used for Mobile computing is very sensitive to the transaction abort rate. Even if the abort probability can be reduced by back-shifting the timestamp from the time of requesting a commit, some transactions continuously perform unnecessary operations after the transactions accessed write-write conflicting data. In this paper, we propose an optimistic protocol that can abort the transactions during the execution phase by using the write notification approach. The proposed protocol enhances the performance of the optimistic concurrency control by reducing the unnecessary operations. In addition, we present a simulation study that compares our schemes with the timestamp based certification scheme. This study shows that our scheme outperforms the timestamp based certification scheme.

• Journal of Internet Computing and Services
• /
• v.7 no.4
• /
• pp.79-90
• /
• 2006

Data broadcasting is an efficient method for disseminating data, and is widely accepted in the database applications of mobile computing environments because of its asymmetric communication bandwidth between a server and mobile clients. This requires new types of concurrency control mechanism to support mobile transactions executed in the mobile clients, which have low-bandwidths toward the server. In this paper, we propose an OCC/DTA (Optimistic Concurrency Control with Dynamic Time-stamp Adjustment) protocol that can be efficiently adapted to mobile computing environments. The protocol reduces communication overhead by using client-side validation procedure and enhances transaction throughput by adjusting serialization order without violating transaction semantics. We show that the proposed protocol satisfies data consistency requirements, and simulate that this protocol can improve the performance of mobile transactions in data broadcasting environments.

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

• Journal of Internet Computing and Services
• /
• v.6 no.5
• /
• pp.177-185
• /
• 2005

Caching in mobile computing environments Is an important technique that will reduce the effects such as limitation of bandwidth, restriction of resources and frequent disconnection. To reduce limitation and disconnection problems in mobile computing, a new form of caching system have been proposed based on a broadcast approach. This paper proposes a broadcast based cache protocol and examines the behaviors of the proposed scheme and well known schemes such as multiversion based scheme and Certification Reports. By a detailed simulation, we show some characteristics of different approaches to detect and resolve conflicts. We also show proposed scheme out performs other schemes with a low space and operation overhead.

• 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.27 no.1
• /
• pp.42-52
• /
• 2000

In many real time applications that the system maintains sensitive information to be shared by multiple users with different security levels, security is another important requirement. A secure real time database system must satisfy not only logical data consistency but also timing constrains and security requirements associated with transactions. Even though an optimistic concurrency control method outperforms locking based method in firm real time database systems, where late transactions are immediately discarded, most existing secure real time concurrency control methods are based on locking. In this paper, we propose a new optimistic concurrency control protocol for secure real time database systems, and compare the performance characteristics of our protocol with locking based method while varying workloads. The result shoes that our proposed O.C.C protocol has good performance in case of many data conflict.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.439-446
• /
• 2003

A crucial limitation in environments where data is broadcast to very large client populations is the low bandwidth available for clients to communicate with servers. Many advanced applications are developed in mobile computing environments, but conventional concurrency controls are not suitable because of the low bandwidth of wireless network. In this paper, we propose a new optimistic concurrency control protocol for mobile transactions. In this protocol, mobile read-only transactions can be completed locally at the clients without additional communication, only mobile update transactions are sent to the server for global validation. Our protocol reduces unnecessary aborts occurred in the previous study using only conflict information. In addition to, our algorithm can detect and resolve non-serializable execution using by data table maintained in a server.