• Journal of Internet Technology
• /
• v.19 no.6
• /
• pp.1801-1810
• /
• 2018

In this study, an energy-aware data-replication is proposed to effectively support a mobile sink in a solar-powered wireless sensor network (WSN). By utilizing the redundant energy efficiently, the proposed scheme shares the gathered data among the cluster heads using a backbone network, in order to increase data-reliability. It also maintains a backup cluster head in each cluster to enhance topological resilience. The simulation result showed that, compared to conventional clustering techniques, the proposed scheme decreases the total amount of data loss from the mobile sink as well as saving its energy (by reducing its moving distance), while minimizing the unexpected blackout time of the sensor node.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.14-26
• /
• 2003

Moving objects' trajectories play an important role in indexing video data on their content and semantics for content-based video retrieval. In this paper, we propose new similar sub-trajectory retrieval schemes based on k-warping algorithm for efficient retrieval on moving objects' trajectories in video data. The proposed schemes are fixed-replication similar sub-trajectory retrieval(FRSR) and variable-replication similar sub-trajectory retrieval(VRSR). The former can replicate motions with a fixed number for all motions being composed of the trajectory. The latter can replicate motions with a variable number. Our schemes support multiple properties including direction, distance, and time interval as well as a single property of direction, which is mainly used for modeling moving objects' trajectories. Finally, we show from our experiment that our schemes outperform Li's scheme(no-warping) and Shan's scheme(infinite-warping) in terns of precision and recall measures.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.51-57
• /
• 2004

Mobile Internet allows users to request critical information and receive swift responses at any places, but mobile users could suffer from unreliable and ill-timed services due to the characteristics of wireless media, One way that reduces possibility of the unsatisfactory services is data replication. Data Replica1ion, however, inevitably induces the overhead of maintaining replica consistency which requires more expensive synchronization mechanism. We propose a new replicated data management scheme in distributed mobile environment, In order to alleviate negative impact of synchronization message overhead in fault-prone mobile Internet environment, we devise a new replication control scheme called proxy quorum consensus (PQC), PQC minimizes the message overhead by coordinating quorum access activities by means of proxy mediated voting (PMV) which exploits reliable proxy hosts instead of unreliable mobile hosts in voting process, We also propose a simulation model to show the performance of PQC. Based on the results of the performance evaluation, we conclude that PQC scheme outperforms the traditional schemes.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.10
• /
• pp.77-86
• /
• 2020

In this paper, we propose a technique for blockchain service replication and recovery using kubernetes(BR2K) that robustly executes blockchain services based on replication and supports systematic recovery in case of the service failure. Blockchain services are being developed and applied in various fields such as administration, finance, and medical systems based on the features of blockchain, such as decentralization, high security, and data integrity. In such areas where service continuity is important, it is necessary to provide robustness for execution of blockchain services, and a recovery plan for service failure is also required. To this end, BR2K provides an execution replication technique that systematically supports the sustainable execution of blockchain application services. Also, it introduces a robust container registry based on the blockchain service registry, systematically supporting the recovery of service failures by using it. In addition, Truffle, a blockchain service development framework, is extended to utilize the Kubernetes container management tool, and BR2K provides a technique for rapidly deploying blockchain services using the extended framwork.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.3-6
• /
• 2003

In this paper, we conduct a performance analysis for the composite scheme that is obtained by combining the data distribution and the data replication schemes usually used for the implementation of distributed directory service systems. The analysis results reveal that the composite model is a viable option to overcome the performance trade-off between the data distribution and the data replication model. In this paper, we present the performance model developed for the composite model by appling queuing modelling. Using the performance model, performance values for a variety of system execution environments are suggested which enable us to bring an efficient design for high performance distributed directories.

• Journal of Navigation and Port Research
• /
• v.26 no.4
• /
• pp.427-433
• /
• 2002

Since current HTML used on the internet is to use restricted tag, it is not easy to store information and extract data from information of document. XML defined newly tag and is easy to store information and extract data from information. So XML is easier to transact information rather than HTML. XML is suitable for enterprise's requirement needs data exchange between heterogeneous databases. This paper proposes web agent for data replication between heterogeneous DBMSs(Database Management System). Web agent system maneges database on the web and exchange data in heterogeneous database using XML. Then we designed and implemented for web agent of data replication between heterogeneous DBMSs.

• Proceedings of the Korea Database Society Conference
• /
• 1994.09a
• /
• pp.71-103
• /
• 1994

중복데이타 서버(replication server) 는 자주 사용되는 데이타의 부분 또는 전부를 뷰 형태로 여러 지역에 중복하여 저장함으로써 최종 사용자가 원하는 데이터에 빨리 접근할 수 있도록 해준다. 또한 기본 테이블의 변화된 내용을 주기적으로 뷰에 반영함으로써 데이타 동시성의 문제를 완화하며 통신량을 감소시킬 수 있다. 본 연구에서는 기본 테이블에 일어난 변화를 저장뷰(materialized view)에 반영시켜주기 위해 테이블 전체를 읽는 방식을 피하고 일정기간 동안 테이블에 일어난 변화가 기록된 로그(log)를 이용하는 디프런셜 갱신(differential update) 방법을 사용한다. 이 방법은 테이블의 잠금(locking) 을 피함으로 시스템의 성능을 향상시 킬 수 있다. 또한 갱신에 관련된 통신량을 최소화하기 위한 기법들을 제안한다. 위의 방법을 이용하여 분산 상황에서 조인 저장뷰(join materialized view)의 갱신을 효과적으로 지원해 주는 중복데이타 서버(replication server)의 구조에 관해 연구한다.

• Korean Journal of Child Studies
• /
• v.23 no.3
• /
• pp.123-137
• /
• 2002

This study investigated children's cognitions of physically impossible events by characteristics of the events. The 67 subjects were 3-, 5-, and 7-year old children from one day care center and one elementary school in Seoul. Children's responses to questions regarding the events were taped and transcribed. Cognition of the events was measured by recognition of impossibility, possibility of replication, and reasons for the possibility of replication of the events. Data were analyzed by ANOVA(repeated measures), and Pearson's correlation. Children's recognition of the impossibility of the events varied by type of task : Recognition of gravity tasks was different from irreversibility tasks, but there were no differences between recognition of irreversibility and gravity and between irreversibility and object permanence. The possibility of replication correlated significantly with reasons given by the children.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.53-62
• /
• 2011

With the steady growth of mobile technology and applications, demand for more storage in mobile devices has also increased. A lightweight block-level protocol, Internet Advanced Technology Attachment (iATA), has been developed to deliver a cost-effective storage network solution for mobile devices to obtain more storage. This paper seeks to contribute to designing and implementing Load Balancing (LB), Network Monitoring (NM) and Write Replication (WR) modules to improve the protocol's scalability and data availability. LB and NM modules are invoked to collect system resources states and current network status at each associate node (server machine). A dynamic weight factor is calculated based on the collected information and sent to a referral server. The referral server is responsible to analyze and allocate the most ideal node with the least weight to serve the client. With this approach, the client can avoid connecting to a heavily loaded node that may cause delays in subsequent in-band I/O operations. Write replication is applied to the remaining nodes through a WR module by utilizing the Unison file synchronization program. A client initially connected to node IP A for write operations will have no hindrances in executing the relevant read operations at node IP B in new connections. In the worst case scenario of a node crashing, data remain recoverable from other functioning nodes. We have conducted several benchmark tests and our results are evaluated and verified in a later section.

• The KIPS Transactions:PartA
• /
• v.13A no.3 s.100
• /
• pp.241-252
• /
• 2006

In cluster file systems, the availability of files has been supported by replicating entire files or generating parities on parity servers. However, those methods require very large temporal and spatial cost, and cannot handle massive failures situation on the file system. So we propose HA-PVFS, a cluster file system supporting high data availability adaptive to temporal locality. HA-PVFS restricts replication or parity generation to some important files, for that it employs an efficient algorithm to estimate file access patterns from limited information. Moreover, in order to minimize the performance degradation of the file system, it uses delayed update method and relay replication.