• Journal of the Korean Data and Information Science Society
• /
• 제20권6호
• /
• pp.1177-1190
• /
• 2009

In this paper, we propose a fuzzy proxy cache scheme for caching web documents in mobile base stations. In this scheme, a mobile cache model is used to facilitate data caching and data replication. Using the proposed cache scheme, the individual proxy in the base station makes cache decisions based solely on its local knowledge of the global cache state so that the entire wireless proxy cache system can be effectively managed without centralized control. To improve the performance of proxy caching, the proposed cache scheme predicts the direction of movement of mobile hosts, and uses various cache methods for neighboring proxy servers according to the fuzzy-logic-based control rules based on the membership degree of the mobile host. The performance of our cache scheme is evaluated analytically in terms of average response delay and average energy cost, and is compared with that of other mobile cache schemes.

• 정보기술과데이타베이스저널
• /
• 제3권2호
• /
• pp.3-24
• /
• 1996

In this paper a data replicator scheme with a distributed join architecture is suggested with its cost functions and the performance results. The contribution of this scheme is not only minimizing the number of base relation locks in distributed database tables but also reducing the remote transmission amount remarkably, which will be able to embellish the distributed databse system practical. The differential files that are derived from the active log of the DBMS are mainly forcing the scheme to reduce the number of base relation locks. The amount of transportation between relevant sites could be curtailed by the tuple reduction procedures. Then we prescribe an algorithm of data replicator with its cost function and show the performance results compared with the semi-join scheme in their distributed environments.

• 정보처리학회논문지D
• /
• 제13D권7호
• /
• pp.901-908
• /
• 2006

모바일 환경 및 무선 통신 기술이 발달함에 따라 시간과 장소에 제약받지 않고, 이동 시스템 간의 데이터 전송이 가능하게 되었다. 현재 이동 시스템 간의 데이터 통신은 모바일 환경의 고정 서버와 이동 클라이언트 사이에서 소량의 데이터 송수신 및 데이터 동기화 기법을 중심으로 연구되고 있다. 그러나 전장 상황과 같은 환경에서는 두 개 이상의 서버가 상호 독립적으로 이동하며, 상대 시스템과의 정보 공유 및 데이터 동기화를 수행하여야 한다. 이 논문은 모바일 환경에서 상호 독립적으로 이동하는 시스템 간의 데이터 동기화기법을 제안한다. 제안하는 동기화 기법은 제한된 대역폭을 고려한 서버 간의 데이터 전파 경로의 최적화 방법과 통신 단절로 인한 미전송 데이터의 처리 방안을 제시한다 아울러 대용량 서버 간의 전송 데이터 축소를 위하여 정보의 중요도 및 공유 필요성을 고려한 데이터 정제 기법을 제시한다. 제안하는 동기화 기법은 실세계 운용환경에 적용하였고, 대용량 데이터 갱신 전파 후의 데이터 일치의 정확성을 검증하였다. 아울러 서버 확장에 따른 전파 지연 시간을 고려하였을 때 제안된 기법이 허용 오차 내에 정상적으로 동기화가 이루어짐을 확인하였다.

• Journal of Computing Science and Engineering
• /
• 제11권3호
• /
• pp.92-99
• /
• 2017

Memcached, commonly used to speed up the data access in big-data and Internet-web applications, is a system software of the distributed-cache mechanism. But it is subject to the severe challenge of the loss of recently uncommitted updates in the case where the Memcached servers crash due to some reason. Although the replica scheme and the disk-log-based replay mechanism have been proposed to overcome this problem, they generate either the overhead of the replica synchronization or the persistent-storage overhead that is caused by flushing related logs. This paper proposes a scheme of backing up the write requests (i.e., set and add) on the Memcached client side, to reduce the overhead resulting from the making of disk-log records or performing the replica consistency. If the Memcached server fails, a timestamp-based recovery mechanism is then introduced to replay the write requests (buffered by relevant clients), for regaining the lost-data updates on the rebooted Memcached server, thereby meeting the data-consistency requirement. More importantly, compared with the mechanism of logging the write requests to the persistent storage of the master server and the server-replication scheme, the newly proposed approach of backing up the logs on the client side can greatly decrease the time overhead by up to 116.8% when processing the write workloads.