• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2103-2120
• /
• 2011

In this research, we consider the replication strategy for the applications of video streaming in wireless mesh networks (WMNs). In particular, we propose a closed-form of optimal replication densities for a set of frames of a video streaming by exploiting not only the skewed access probability of each frame but also the skewed loss probability and skewed encoding rate-distortion information. The simulation results demonstrate that our method improves the replication performance in terms of user-perceived quality (UPQ) which includes: 1) minimum average maximum reconstructed distortion for high peak signal-to-noise ratio (PSNR), 2) small reconstructed distortion fluctuation among frames for smooth playback, and 3) reasonable average maximum transmission distance for continuous playback. Furthermore, the proposed strategy consumes smaller storage capacity compared to other existing optimal replication strategies. More importantly, the effect of encoding rate is carefully investigated to show that high encoding rate does not always gain high performance of replication for video streaming.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.1-6
• /
• 2008

Data grid shares distributed large data via wide-band network. Such grid environment consumes much time for large data transmission. Because it is implemented on internet as physical network. Many replication strategies were proposed for solving this problem, but they are not optimal in real Data grid environments. Because they were proposed that based on logical topology without consideration of real internet architecture. Grid data access time is largely influenced by internet architecture as physical network of Data grid. In this paper, we propose a new data replication strategy RSIA(Replication Strategy based on Internet Architecture) based on internet architecture. The RSIA places replicas considering structural hierarchy in each element of internet, and avoid the performance bottlenecks to reduce system performance degradation when a data transfer. Through simulation, we show that the proposed RSIA data replication strategy improves the performance of Data Grid environment compared with previous strategies.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.2
• /
• pp.10-17
• /
• 2008

In this paper, we propose an efficient data replication strategy based on Peer-to-Peer which improves the performance of Data Grid system. The key idea of this replication strategy is to add the Peer-to-Peer concept for reducing data transmission restriction caused by hierarchical topology. And, it makes the nodes can store data replica to set a critical section at the storage of client level nodes. Therefore, it is possible to transmit the data replica between client level nodes and from client level nodes to upper data replication server. It is more effective to transmit data replica between client level nodes than transmitting data replica 1mm data server or data replication server with respect to minimize the transmission time. This results in improving the performance of Data Grid system. Through simulation, we show that the proposed data replication strategy based on Peer-to-Peer improves the performance of entire Data Grid environment compared to previous strategies.

• Journal of Information Processing Systems
• /
• v.8 no.2
• /
• pp.263-278
• /
• 2012

The data grid provides geographically distributed resources for large-scale applications. It generates a large set of data. The replication of this data in several sites of the grid is an effective solution for achieving good performance. In this paper we propose an approach of dynamic replication in a hierarchical grid that takes into account crash failures in the system. The replication decision is taken based on two parameters: the availability and popularity of the data. The administrator requires a minimum rate of availability for each piece of data according to its access history in previous periods, but this availability may increase if the demand is high on this data. We also proposed a strategy to keep the desired availability respected even in case of a failure or rarity (no-popularity) of the data. The simulation results show the effectiveness of our replication strategy in terms of response time, the unavailability of requests, and availability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5290-5304
• /
• 2016

With the growth of the massive amount of data, the failure probability of the cloud storage node is becoming more and more big. A single fault tolerance strategy, such as replication and erasure codes, has some unavoidable disadvantages, which can not meet the needs of the today's fault tolerance. Therefore, according to the file access frequency and size, an adaptive hybrid redundant fault tolerance strategy is proposed, which can dynamically change between the replication scheme and erasure codes scheme throughout the lifecycle. The experimental results show that the proposed scheme can not only save the storage space(reduced by 32% compared with replication), but also ensure the fast recovery of the node failures(increased by 42% compared with erasure codes).

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.12
• /
• pp.907-917
• /
• 2006

In this paper, we propose a strategy to improve fault-tolerance and scalability of replicated services in mobile agent systems by applying an appropriate passive replication protocol for each replicated service according to whether the service is deterministic or non-deterministic. For this purpose, two passive replication protocols, PRPNS and PRPDS, are designed for non-deterministic and deterministic services respectively. They both allow visiting mobile agents to be forwarded to and execute their tasks on any node performing a service agent, not necessarily the primary agent. Especially, in the protocol PRPDS, after a backup service agent has received each mobile agent request and obtained its delivery sequence number from the primary service agent, the backup is responsible for processing the request and coordinating with the other replica service agents. Therefore, our strategy using the two proposed protocols can promise high scalability of replicated services a large number of mobile agents attempt to access in mobile agent systems. Our simulation results show that the proposed strategy performs much better than the one using only the traditional passive replication protocol.

• Journal of Microbiology and Biotechnology
• /
• v.20 no.8
• /
• pp.1163-1178
• /
• 2010

Plasmids play important roles in horizontal gene transfer among Vibrionaceae, but surprisingly little is known about their replication and incompatibility systems. In this study, we successfully developed a bioinformatics-assisted strategy of experimental identification of seven Vibrio plasmid replicons. Comparative sequences analysis of the seven Vibrio plasmid replicons obtained in this study together with eight published Vibrionaceae plasmid sequences revealed replication-participating elements involved in the ColE1 mode of replication initiation and regulation. Like plasmid ColE1, these Vibrionaceae plasmids encode two RNA species (the primer RNA and the antisense RNA) for replication initiation and regulation, and as a result, the 15 Vibrionaceae plasmids were designated as ColE1-like Vibrionaceae (CLV) plasmids. Two subgroups were obtained for the 15 CLV plasmids, based on comparison of replicon organization and phylogenetic analysis of replication regions. Coexistence of CLV plasmids were demonstrated by direct sequencing analysis and Southern hybridization, strongly suggesting that the incompatibility of CLV plasmids is determined mainly by the RNA I species like the ColE1-like plasmids. Sequences resembling the conserved Xer recombination sites were also identified on the CLV plasmids, indicating that the CLV plasmids probably use the host site-specific recombination system for multimer resolution like that used by ColE1-like plasmids. All the results indicated that the 15 plasmids form a new ColE1-like group, providing a basis for the rapid characterization and classification of Vibrionaceae plasmids.

• Toxicological Research
• /
• v.34 no.4
• /
• pp.297-302
• /
• 2018

Cells are constantly exposed to endogenous and exogenous chemical and physical agents that damage their genome by forming DNA lesions. These lesions interfere with the normal functions of DNA such as transcription and replication, and need to be either repaired or tolerated. DNA lesions are accurately removed via various repair pathways. In contrast, tolerance mechanisms do not remove lesions but only allow replication to proceed despite the presence of unrepaired lesions. Cells possess two major tolerance strategies, namely translesion synthesis (TLS), which is an error-prone strategy and an accurate strategy based on homologous recombination (homology-dependent gap repair [HDGR]). Thus, the mutation frequency reflects the relative extent to which the two tolerance pathways operate in vivo. In the present paper, we review the present understanding of the mechanisms of TLS and HDGR and propose a novel and comprehensive view of the way both strategies interact and are regulated in vivo.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.265-275
• /
• 2002

A default server strategy is a very popular scheme for managing location and state information of mobile hosts in cellular networks. But the communication cost increases if the call requests are frequent and the distant between the default server and the client is long. Still more any connection to a mobile host cannot be established when the default server of the destination mobile host fails. These problems can be solved by replicating default server and by letting nearest replicated default server process the query request which is sent from a client. It is important to allocate replicated default servers efficiently in networks and determine the number of replicated default servers. In this paper, we suggest and evaluate a default server replication strategy to reduce communication costs and to improve service availabilities. Furthermore we propose and evaluate an optimized allocation algorithm and an optimal replication degree for replicating: dofault servers in nn grid networks and binary tree networks.

• The Journal of Information Technology and Database
• /
• v.6 no.2
• /
• pp.71-86
• /
• 1999

The performance of relational database is measured by the number of disk accesses necessary to transfer data from disk to main memory. The paper proposes to vertically partition relations into fragments and to allow attribute replication to reduce the number of disk accesses. To reduce the computational time, heuristic search method using genetic algorithm is used. Genetic algorithm used employs a rank-based-sharing fitness function and elitism. Desirable parameters of genetic algorithm are obtained through experiments and used to find the solutions. Solutions of attribute replication and attribute non-replication problems are compared. Optimal solutions obtained by branch and bound method and by heuristic solutions(genetic algorithm) are also discussed. The solution method proposed is able to solve large-sized problems within acceptable time limit and shows solutions near the optimal value.