• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.545-558
• /
• 2003

It is expected that per-user customized services are widely used in next generation Personal Communication Network. The ultimate goal for personalized service is the Virtual home Environment (VHE) providing ´same-look-and-feel´ services for the subscriber wherever he roams to. To provide personalized services for each call, per-user service profiles are frequently referenced, so efficient service profile management is essentially required. To realized the VHE, typically two schemes, can be employed; One is Intelligent Network based service control and the other is a full replication scheme that always replicates profile in user´s current zone. The first scheme is referred as Central scheme and th second scheme is the modified replication scheme of IMT-2000, we refer to as Follow-Me Replication Unconditional (FMRU). Since the Central scheme only depends on the service cal rate and the FMRU is merely dependent on the movement rate, it is apparent that FMRU scheme outperforms the Central scheme if the call to mobility ratio (CMR) is large, and vice versa. In this paper, we propose a new service profile replication schemes, Adaptive Follow-Me Replication (AFMR) that determine replication automatically according to the user´s CMR. We compared the performance of the AFMR with the non-adaptive Follow-Me Replication unconditional on Demand (FMRUD) scheme. Performance results indicate that as the CMR of a user changes AFMR adapts well compared to the existing schemes.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.215-221
• /
• 2003

It is expected that per-user customized services are widely used in next generation Personal Communication Network. To provide personalized services for each call, per-user service profiles are frequently referenced and signaling traffic is considerably large. Since the service calls are requested from the places where user stays, we can expect that the traffic is localized. In this paper, we propose a new service profile replication scheme, named Follow-Me Replication with local Anchor (FMRA). By replicating user's service profile in a user-specific location area, local anchor of each region, the signaling traffic for call and mobility can be distributed to local network. We compared the performance of the FMRA with two typical schemes: Intelligent Network-based !Central scheme and IMT-2000 based full replication scheme, as we refer it to Follow-Me Replication Unconditional (FMRU). Performance results indicate that FMRA lies between Central and FMRU schemes according to call to mobility ratio, and we identified the efficient ranges of CMR for FMRA depending on the various network parameters.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.37-44
• /
• 2009

Recently, as the quality of multimedia data gets higher, multimedia servers require larger storage capacity and higher I/O bandwidth. In these large scale multimedia servers, the load-unbalance problem among disks due to the difference in access frequencies to multimedia objects according to their popularities significantly affects the system performance. To address this problem, many data replication schemes have been proposed. In this paper, we propose a novel data migration/replication scheme to provide better storage efficiency and performance than the dynamic data replication scheme which is typical data replication scheme employed in multimedia servers. This scheme can reduce the additional storage space required for replication, which is a major defect of replication schemes, by decreasing the number of copies per object. The scheme can also increase the number of concurrent users by increasing the caching effect due to the reduced lengths of the intervals among requests for each object.

• Journal of Information Processing Systems
• /
• v.10 no.4
• /
• pp.628-645
• /
• 2014

In past few years, distributed hash table (DHT)-based P2P systems have been proven to be a promising way to manage decentralized index information and provide efficient lookup services. However, the skewness of users' preferences regarding keywords contained in a multi-keyword query causes a query load imbalance that combines both routing and response load. This imbalance means long file retrieval latency that negatively influences the overall system performance. Although index replication has a great potential for alleviating this problem, existing schemes did not explicitly address it or incurred high cost. To overcome this issue, we propose, in this paper, an integrated solution that consists of three replication schemes to alleviate query load imbalance while minimizing the cost. The first scheme is an active index replication that is used in order to decrease routing load in the system and to distribute response load of an index among peers that store replicas of the index. The second scheme is a proactive pointer replication that places location information of each index to a predetermined number of peers for reducing maintenance cost between the index and its replicas. The third scheme is a passive index replication that guarantees the maximum query load of peers. The result of simulations indicates that the proposed schemes can help alleviate the query load imbalance of peers. Moreover, it was found by comparison that our schemes are more cost-effective on placing replicas than PCache and EAD.

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

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.1-10
• /
• 2006

For efficient searching in unstructured peer-to-peer systems, random walk was proposed and several replication methods have been studied to compensate for the random walk's low query success rate. This paper proposes an efficient replication scheme that improves the accuracy and speed of queries and reduces the cost by minimizing the number of replicas and by utilizing caches. In this scheme, hub nodes store only content's caches, and one of their neighbors stores the replica. By determining hubs with only limited and local information, we can adaptively generate caches and replicas in dynamic peer-to-peer networks.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.2
• /
• pp.210-217
• /
• 2004

In this study, a new process, named as nano replication printing(nRP) process, is developed for printing any figure in the range of several micrometers by using voxel matrix scanning scheme. In this newly developed process, a femto-second laser is scanned on a photosensitive monomer resin in order to induce polymerization of the liquid resin according to a voxel matrix which is transformed from bitmap format file. After the polymerization, a droplet of ethanol is dropt to remove the unnecessary remaining liquid resin and then the polymerized figures with nano-scaled precision are only remaining on the glass plate. By the nRP process, any figure file of bitmap format could be reproduced as nano-scaled precision replication in the range of several micrometers. Also, nano/micro-scaled patterns for an extremely wide range of applications would become a technologically feasible reality. Some of figures with nano-scaled precision were printed in scaled replication as examples to prove the usefulness of this study.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.5
• /
• pp.2449-2456
• /
• 2013

The column-oriented database storage is a very advanced model for large-volume data analysis systems because of its superior I/O performance. Traditional data storages exploit row-oriented storage where the attributes of a record are placed contiguously in hard disk for fast write operations. However, for search-mostly datawarehouse systems, column-oriented storage has become a more proper model because of its superior read performance. Recently, solid state drive using MLC flash memory is largely recognized as the preferred storage media for high-speed data analysis systems. In this paper, we introduce fast column-oriented data storage model and then propose a new storage management scheme using a cross compressed replication for the high-speed column-oriented datawarehouse system. Our storage management scheme which is based on two MLC SSD achieves superior performance and reliability by the cross replication of the uncompressed segment and the compressed segment under high workloads of CPU and I/O. Based on the results of the performance evaluation, we conclude that our storage management scheme outperforms the traditional scheme in the respect of update throughput and response time of the column segments.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.2
• /
• pp.367-374
• /
• 2017

This paper discusses management problems of Hadoop distributed node, which is a platform for big data processing, and proposes a novel technique for enabling flexible node management of Hadoop Distributed File System. Hadoop cannot configure Hadoop cluster dynamically because it judges temporarily unavailable nodes as a failure. Delayed block replication scheme proposed in this paper delays the removal of unavailable node as much as possible so as to be easily rejoined. Experimental results show that the proposed scheme increases flexibility of node management with little impact on distributed processing performance when the cluster size changes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.8
• /
• pp.1535-1543
• /
• 2007

Recently, there are many researches for P2P network. P2P network technologies are a good solution about making a wide spread distributed computing in the internet environment. The recent algorithms developed by several research groups for the lookup problem present a simple and general interface, a distributed hash table (DHT). In this paper, we also introduce new schemes that enhance the available rate of an object in the MagicSquare network. Replication scheme is to replicate an object with many replicas and save them to several nodes. Fragmentation scheme is to divide an object into several fragments and save them to several nodes. Replicated Fragmentation scheme is to mix replication scheme and fragmentation scheme. We will show result of simulation for our the proposed scheme.