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

In this paper, we present a scheduling method for real-time mobile transaction manager in mobile computing environment. The proposed method checks whether a transaction is executable or not. It is able to by considering not only the deadline of real-time data in mobile hosts. And then, it schedules the real-time mobile transactions by making optimal execution window based on the priority queue, while considering transaction value and deadline. Disconnection with mobile hosts is monitored in selecting the transaction for execution. Using the proposed method reduces the number of restarting times after transaction aborts which is caused by the violation of the validity constraints of real-time data. And in has merits of maximizing the sum of values of real-time mobile transactions which meet the deadline. The performance evaluation demonstrates that the number of committed real-time transactions within the deadline is improved by 20%. This method can be used in real-time mobile transaction manager is such environments as cellular communications, emergency medicine information system and so on.

• Journal of KIISE:Software and Applications
• /
• v.26 no.9
• /
• pp.1073-1084
• /
• 1999

이동 컴퓨팅 환경에서 이동 호스트는 제한된 대역폭을 효율적으로 사용하고 이동 트랜잭션의 응답 시간을 향상시키기 위하여 캐쉬를 이용한다. 그리고 이동 호스트에 캐슁된 데이타가 이동 지구국에서 갱신되면 이동 호스트의 캐쉬 일관성을 유지하기 위하여 이동 지구국은 무효화 메시지를 방송한다. 그러나 이동 지구국에서 주기적으로 무효화 메시지를 방송하는 방법은 이동 트랜잭션의 빠른 처리를 위하여 이동 지구국으로부터 데이타를 즉시 캐슁하는 경우에 이동 트랜잭션의 직렬가능한 수행을 보장할 수 없는 경우가 발생한다. 본 연구에서는 캐슁된 데이타를 이용하여 이동 트랜잭션을 수행하는 경우에 록을 이용하여 이동 트랜잭션의 직렬가능한 수행을 보장하는 UCL-MT 방법과 록 관리 방법을 제안한다. 제안하는 UCL-MT 방법은 이동 트랜잭션을 완료하기 이전에 이동 트랜잭션이 접근한 데이타 정보를 이용하여 지구국에서 사이클을 탐지함으로써 이동 트랜잭션의 직렬가능한 수행을 보장한다. 또한 제안하는 록 관리 방법은 이용할 수 있는 대역폭의 크기에 따른 무효화 메시지 내용의 변화에 유연하게 적용될 수 있다. Abstract In mobile computing environments, a mobile host caches the data to use the narrow bandwidth efficiently and improve the response time of a mobile transaction. If the cached data in mobile host is updated at a mobile support station, the mobile support station broadcasts an invalidation message for maintaining the cache consistency of a mobile host. But when a mobile transaction accesses the data which is not in cache, if a mobile host caches the data immediately from a mobile support station for processing a mobile transaction rapidly, the method that a mobile support station broadcasts an invalidation message periodically, happens to the case that can not guarantee the serializable execution of a mobile transaction. In this paper, we propose the UCL-MT method and lock management method, as a mobile transaction is executed using cached data. Since, using the data a mobile transaction accessed, the UCL-MT method detects a cycle in a mobile support station before the completion of the mobile transaction, it guarantees the serializable execution of the mobile transaction. Also, proposing lock management method can be adapted flexibly at the change of invalidation message content, according to the available bandwidth.

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

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.175-181
• /
• 2006

AMobile-supported spatial database systems have been introduced with development of mobile computing technology, they offer an advantage that we can access the data wherever we are. However, the studies on database system in traditional distributed environments must be reconsidered again, because of characteristics of mobile database system such as mobility and instability of wireless network. A new transaction model should be required for considering the characteristics, since especially a mobile computing environment is location-dependent, compared with the location transparency in a distributed computing environment. In other aspect, normally mobile host may be moving not in all space, but in some limited path. That is, a host is moving along the roads or the geographical features adjacent to the roads. The transaction processing should be considered not on the spatial coordinate but on the geographical features. In this paper, the feature based transaction processing model is proposed to process location-dependent transaction efficiently.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.783-798
• /
• 2004

An e-business client application in ubiquitous mobile computing environment may become disconnected from the enterprise server due to broken communication connections caused by the limitation of mobile computing environments(limited battery life of the mobile device, low bandwidth communication, incomplete wireless communication infrastructure, etc). It Is even Possible that mobile client application Intentionally operates in disconnected mode to reduce communication cost and the power consumption of the mobile device. We use “data hoarding” as a means of providing local autonomy to allow transactions to be processed and committed on the mobile host despite of disconnection. The key problem to this approach is the synchronization problem that serialize potentially conflicting updates from disconnected clients on master objects of the server database. In this paper, we present a new transaction synchronizing method that splits a transaction into a set of independent component transactions and give the synchronization priority on each component taking the possibility of use and conflicts in the server into consideration. Synchronization is performed component by component based un synchronization priority. After the Preferred component of a no bile transaction succeeds in synchronization with the server, the mobile transaction can pre-commit at server. A pre-committed transaction's updated value is made visible at server before the final commit of the transaction. The synchronization of the component with low synchronization priority can be delayed in adaption to wireless bandwidth and computing resources. As a result, the availability of important data updated by mobile client is increased and it can maximize the utilization of the limited wireless bandwidth and computing resources.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.21-30
• /
• 2005

In mobile computing environments, a mobile host caches the data to use the narrow bandwidth efficiently and improve the response time. A server periodically broadcasts the update data for maintaining the cache consistency of a mobile host. However, a method for maintaining cache consistency using periodic invalidation report has a problem that defers the commit decision of a mobile transaction to guarantee its serializable execution. In this paper, we propose CCM-AD method that guarantees the serializable execution of a mobile transaction even in the case that it is executed using cached data. As CCM-AD method guarantees the serializable execution of mobile transactions by using the intersection between the data broadcast to mobile host and the data updated at server. Then the CCM-AD method can reduce the delay of commitment decision of a mobile transaction. Also our method can reduce the size of invalidation report.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.241-243
• /
• 2001

이동 컴퓨팅 환경이 급속하게 발전하면서 GIS 분야에서도 이동 클라이언트를 이용한 다양한 서비스에 대한 연구가 진행되고 있다. 특히, 이동 클라이언트를 이용한 공간 데이터 변경의 경우에 동시성 제어를 수행해야 하는데 기존 클라이언트-서버 환경에서 사용되는 잠금 기법은 잠금 획득을 위한 긴 대기시간 때문에 적합하지 않다. 본 논문에서는 이동 컴퓨팅 환경에서의 공간 데이터 변경을 위한 3-계층 구조를 제시하며 이 구조에서의 대리 트랜잭션 모델을 정의한다. 또한, 이동클라이언트의 공간 데이터 변경 트랜잭션의 동시성 제어를 위해 전통적인 낙관 기법을 확정하여 공간 데이터에 적합한 확인 기법을 제시하며 동시성 제어에서 트랜잭션 직렬화 보장의 예를 보인다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.1511-1514
• /
• 2003

본 논문에서는 모바일 데이터베이스 시스템에서 동시성제어의 정도를 높이고자 새로운 프로토콜을 제안한다. 트랜잭션의 동시성제어를 하는데 있어서 다중적인 접근으로부터 문제시되는 데이터 일관성을 보장하고, 대역폭이 낮은 모바일 환경 속에서 일어날 수 있는 잦은 접속 단절과 잦은 이동에 대한 트랜잭션 처리의 효율을 높이고자 한다. 2PL(two-phase locking)로부터 확장된 프로토콜인 XAL(extended altruistic locking)모델의 연장으로서 양방향(Bi-directional) 기부연산에 따른 트랜잭션의 처리와 트랜잭션을 판독전용과 판독 및 갱신용 트랜잭션의 두 가지로 분류함으로서 이동 컴퓨터 환경에서 단기 트랜잭션의 처리성능의 정도를 높이고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.202-204
• /
• 2001

무선이동 단말기가 발전함에 따라 GPS등의 측량 장치를 이용하여 현장에서 무선이동 단말기의 공간 데이터를 수정한 후에 수정된 공간 데이터를 무선 네트워크를 통하여 즉시 GIS 서버에 반영할 수 있게 되었다. 기존의 비관적 기법 기반의 트랜잭션 모델을 이용하는 경우에 잠금 충돌이 발생하면 충돌하는 모바일 트랜잭션들이 오랜 기간 동안 온라인 상태로 대기하는 문제가 있다. 또한 낙관적 기법 기반의 트랜잭션 모델을 이용할 경우에 변경 충돌(conflict)이 발생하면 현장에서 수행했던 모든 수정 작업을 취소하고 새로 공간 데이터 수정 작업을 재수행해야 하는 문제가 있다. 이 논문에서는 낙관적 기법에 기반한 모바일 트랜잭션 모델을 제시한다. 이 모델은 영역 잠금을 이용하여 트랜잭션 시작시 변경 의도를 표시한다. 그리고 완료 작업 수행시에 잠금을 이용하여 변경 충돌 검사를 한다. 변경 충돌이 발생하면 변경 충돌 해소를 위하여 해당 트랜잭션을 대기시키고 충돌이 발생한 부분에 대하여 사용자가 재수정 할 수 있도록 한다.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.325-334
• /
• 2003

In stateless server, if an asynchronous cache invalidation scheme attempts to support local processing of read-only transaction in mobile client/sever database systems, a critical problem may occur ; the asynchronous invalidation reports provide no guarantees of waiting time for mobile transactions requesting commit. To solve this problem, the server in our algorithm broadcasts two kind of messages, asynchronous invalidation report to reduce transaction latency and periodic guide message to avoid the uncertainty of waiting time for the next invalidation report. The asynchronous invalidation report has its own sequence number and the periodic guide message has the sequence number of the most recently broadcast asynchronous invalidation report. A mobile client checks its cache validity by using the sequence numbers of these messages.