• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.2
• /
• pp.155-161
• /
• 2019

Currently, numerous companies and institutes provide services using the Internet, and establish and operate Information Systems to manage them efficiently and reliably. The Information System implies the possibility of losing the ability to provide normal services due to a disaster or disability. It is preparing for this by utilizing a disaster recovery system. However, existing disaster recovery systems cannot perform normal recovery if files for system recovery are corrupted. In this paper, we proposed a system that can verify the integrity of the system recovery file and proceed with recovery by utilizing hyper-ledger fabric blockchain. The PBFT consensus algorithm is used to generate the blocks and is performed by the leader node of the blockchain network. In the event of failure, verify the integrity of the recovery file by comparing the hash value of the recovery file with the hash value in the blockchain and proceed with recovery. For the evaluation of proposed techniques, a comparative analysis was conducted based on four items: existing system recovery techniques and data consistency, able to data retention, recovery file integrity, and using the proposed technique, the amount of traffic generated was analyzed to determine whether it was actually applicable.

• The KIPS Transactions:PartC
• /
• v.12C no.5 s.101
• /
• pp.733-740
• /
• 2005

In this paper, we propose an approach to transport layer mobility support leveraging the SCTP extension dubbed dynamic address reconfiguration in IPv6 networks. Timing issues related to the end-to-end address management, and a novel error recovery mechanism associated with a handover are discussed. The proposed error recovery mechanism is analyzed and compared to that of the plain SCTP to show that it reduces the handover latency and error recovery time.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.267-268
• /
• 2008

TD-SCDMA is considered as an innovative Chinese 3G technology adopted by the ITU for the IMT-2000 family. TD-SCDMA combines TDMA and CDMA components to provide more efficient use of radio resources. According to the traffic volume and activity level, the operation mode of a mobile terminal can change from one state to other states. This paper focuses on the problem of recovery delay from inactive states, and proposes a resource management algorithm, which holds some resources for rapid recovery of service after the service determines to release the dedicated resources.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.7
• /
• pp.720-727
• /
• 2009

This paper proposes a new integrated navigation system for a mobile robot in indoor environments. This system consists of five frameworks which are classified by function. This architecture can make the navigation system scalable and flexible. The robot can recover from exceptional situations, such as environmental changes, failure of entering the narrow path, and path occupation by moving objects, using the exception recovery framework. The environmental change can be dealt with using the probabilistic approach, and the problems with the narrow path and path occupation are solved using the ray casting algorithm and the Bayesian update rule. The proposed navigation system was successfully applied to several robots and operated in various environments. Experimental results showed good performance in that the exception recovery framework significantly increased the success rate of navigation. The system architecture proposed in this paper can reduce the time for developing robot applications through its reusability and changeability.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.11a
• /
• pp.51-53
• /
• 2015

In this paper, we propose an efficient sparse signal recovery algorithm referred to as the matching pursuit with a tree pruning (TMP). Two key ingredients of TMP are the pre-selection to put a restriction on columns of the sensing matrix to be investigated and the tree pruning to eliminate unpromising paths from the search tree. In our analysis, we show that the sparse signal is accurately reconstructed when the sensing matrix satisfies the restricted isometry property. In our simulations, we confirm that TMP is effective in recovering sparse signals and outperforms conventional sparse recovery algorithms.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.3196-3198
• /
• 1999

In this paper, we are proposed ATM AAL 1 source clock recovery methods for CBR service. The proposed method compute the difference between network clock level and the reference level by inspecting the variation of a buffer. Also it is the service clock recovery method that control local clock using the look-up table defined clock dividing rate of the difference in advance. It can be applicable to both SDH network and PDH network which has no common reference clock between its ends, it has an important mean in view of the internetworking between existing networks for the integrated service chased by B_ISDN.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.6
• /
• pp.1043-1048
• /
• 2011

In this paper, a newsynchronization technique applied to burst-mode communication is proposed. A synchronization technique is to estimate carrier frequency and phase offsets in a noisy channel environment. A fundamental problem for estimating the parameters(carrier phase and frequency offsets) in burst-mode transmission is that the ways of pursuing estimation accuracy and transmission efficiency are always trade-off. To solve this problem, a new carrier recovery technique is proposed to improve the transmission efficiency with reliable performance especially at low S/N. In the proposed technique, the synchronization parameters are first estimated based on a data-aided feed-forward estimation scheme. Then, a phase tracker using decision-directed DPLL estimates the phase offset for the data portion of the burst data. From simulation results, it shows fast synchronization with shorter preamble maintaining reasonable BER performance at low S/N.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.2
• /
• pp.172-183
• /
• 1994

In the multidatabase systems(MDBS), local autonomy and global consistency are important issues. Global consistency could be maintained by a global concurrency control algorithm and a global recovery algorithm. In this thesis, we propose a global concurrency control algorithm to ensure local autonomy and to guarantee global serializability, and a global recovery algorithm which is possible to recover the multudatabase from any failures. The proposed global concurrency control algorithm uses bottom-up approach, based on three-level transaction processing model. It can produce a local history that the execution order of subtransactions is identical to their serialization order by using dummy-operations in the server when an indirect conflict is caused between subtransactions due to local transactions. At the global module, it can efficiently validate global serializability of global transactions by checking global serializability only for the global transactions which conflict with each other.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.880-883
• /
• 2002

In this paper, we propose the synchronization recovery algorithm which is suitable to wireless multimedia of wireless channel situation which is being used OFDM signaling method. The basic of the suggested clock synchronization. restoration Algorithm is to getting the shock response of channel or getting the multipath strength profile through IFFT after the getting the frequency, response of deducted channel from channel deductor of receiver and to trace the location in the channel energy concentrated area of timing area. And it also analysis the start point of 64-QAM and 16-QAM if the sampling clock offset has the sample of $\pm$1-3, and we identified the occurance of performance deterioration when occures more than 2 samples of offset to compare with star point and BER performance in optimum sampling point result of BER performance checking, and we know that the recovery algorithm proposed algorithm also provide excellent synchronization characteries under frequency, selecting fading channel as result of simulation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.7
• /
• pp.767-777
• /
• 1999

인과적 메시지 로깅 기법은 정상프로세스를 역전(roll-back)시키거나 메시지의 저장을 위해 프로세스의 수행을 중단시키지 않는 장점을 지니고 있지만, 메시지의 크기가 지나치게 커진다는 단점을 지니고 있다. 본 논문에서는 인과적 메시지 로깅 기법의 이러한 문제점을 해결하기 위하여 로그 상속의 개념을 정의하고 로그 연혁을 이용하여 로그 비용, 특히 로그 크기 면에서 효율적인 로깅 기법을 제안한다. 또한 이 로깅 알고리즘을 이용하여 복구시 메시지의 수와 크기를 줄여 복구시간을 줄이는 효율적인 복구 알고리즘을 제안하고, 제안한 알고리즘이 메시지 로그 크기 면에서 효율적임을 증명한다. 또 제안한 알고리즘의 성능을 검증하기 위하여 두 가지 종류의 모의 실험을 수행하여 기존의 로깅 프로토콜과 메시지 크기 면에서의 성능을 비교한 결과를 제시하였다.Abstract Causal message logging has many good properties such as nonblocking message logging and no rollback propagation. However, it requires a large amount of information to be piggybacked on each message, which may incur severe performance degradation. This paper presents an efficient causal logging algorithm based on the new message log structure, LogOn, which represents the causal inter-process dependency relation with much smaller overhead compared to the existing algorithms. The proposed algorithm is efficient in the sense that it entails no additional information other than LogOn to be carried in each message, while other existing algorithms require extra information other than the message logs. This paper also presents an efficient recovery algorithm to solve the problem of a large amount of data exchanges during the recovery. To verify the performance of our algorithm, we give an analysis of the algorithm and perform two simulations and compare the log size with other causal logging protocols.