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

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.2
• /
• pp.125-134
• /
• 2022

In this paper, we propose an extension method of the BR2K technique for enhancing the robustness of blockchain application services. The BR2K (Blockchain application, Replication & Recovery technique using Kubernetes) technique was recently developed to support the robustness of blockchain services through service replication and rapid restart. The proposed technique extends the existing BR2K technique to provide a state version, which is meta-information about the service state, and a method for safely managing it, and use the state version to determine the timing for service state recovery. Also, the technique provides systematic service state backup for service recovery and joining of new service nodes by utilizing the version information and the service registry which acts as a service recovery center in the BR2K technique. Based on this, it is possible to support new service nodes to join the replication service with consistency. As a result, new service nodes can be quickly added to the BR2K service in operation, enhancing the robustness of the BR2K service. In addition, the extended method is applied to the pilot blockchain application service and tested in a Kubernetes environment composed of virtual machines to confirm the validity of service replication consistency and rapid service recovery in the event of node failures.

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.193-196
• /
• 2003

그리드 환경에서 OGSA(Open Grid Service Architecture)는 분산된 서비스의 이용 편의를 위한 시스템 독립적인 인터페이스를 제공한다. 하지만 OGSA 에서 사용자가 작업 수행시 필요로 하는 QoS 와 서비스의 신뢰성을 보장하기 위해, 동일한 그리드 정보 제공자를 이용하는 여러 서비스간의 공유 자원에 대한 경쟁 문제를 해결해야 한다. 본 논문에서는 OCSA 에서 여러 서비스의 효율적인 자원 할당을 보장하는 다이나믹 Data Replication 관리를 위한 의사결정 알고리즘을 제안한다.

• Journal of Korean Society for Quality Management
• /
• v.34 no.2
• /
• pp.77-97
• /
• 2006

Internal marketing has been suggested as the approach for service organizations to be service-and customer-oriented; and the issues of internal service quality has been one of topics widely discussed in the internal marketing literature. While previous studies have attempted to develop the instrument assessing the internal service quality, ISQB(internal service Quality battery) developed by Kang et al.(2002), compared to other instruments have received some attention given its rigorous approach to measure the internal service quality. However, it has been noted that the validity of ISQB does not appear to be thoroughly examined while the reliability of the instrument seems to be secured. The current study attempts to readdress the psychometric properties of ISQB through the replication of the instrument. The empirical testing including confirmatory factor analysis and correlational analyses show that the instrument is reliable and valid in terms of its discriminant and nomological validity.

• The Journal of the Convergence on Culture Technology
• /
• v.10 no.1
• /
• pp.411-417
• /
• 2024

In the event of a disaster, it is essential to establish a disaster recovery plan and disaster recovery system to minimize disruption to major IT infrastructure and provide continuous business services. In the process of building a disaster recovery system, data replication is a key element of data recovery to provide uninterrupted and continuous business services in the event of a disaster. The data replication method can be determined depending on the system configuration environment and disaster recovery goal level. In this paper, we present a method for determining a data replication method suitable for the configuration environment and disaster recovery target level when building a disaster recovery system. In addition, the replication method decision procedure is applied to build a disaster recovery system and analyze the construction results. After establishing the disaster recovery system, a test was conducted to determine whether the service was transferred to the disaster recovery center in a disaster situation and normal service was provided, and the results were analyzed. As a result, it was possible to systematically select the optimal data replication method during the disaster recovery system construction phase. The established disaster recovery system has an RTO of 3.7 hours for service conversion to the disaster recovery center to provide continuous business services, and the disaster recovery level, which was Tier 2, has been improved to the target level within 4 hours of RTO and RPO=0.

• Korean Journal of Veterinary Service
• /
• v.25 no.3
• /
• pp.315-330
• /
• 2002

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.799-807
• /
• 2000

In this paper, object replication Client/server under distributed computing system is design and implementation. Today many end-users have a computer communication by using internet in the distributed system of client/server. If many users request services to a specific remote server, the server should have got a overhead for hat service processing, delayed the speed for replay, and bring a bottleneck in communication network. Therefore object replication method was proposed to solve this problems. The growth of internet works and distributed applications has increased the need for large scale replicated systems. However, existing replication protocols do not address scale and autonomy issues adequately. Further, current application protocol require consistency of different levels, and therefore should be the selection function of consistency in them, in order to have particular semantics of each level. In this paper, server overhead and bottleneck happening in remote procedure call be using server object replication. Therefore access transparency can be improved by sharing object duplicately. So it will Keep up with the consistency within the replicated objects.