• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.409-411
• /
• 2018

기존에 게임 업계에서는 데이터베이스 관리를 위해 중앙에 집중된 서버 관리 시스템을 사용해 왔다. 때문에 계정 도용 등의 부정사용이나 관리 상의 사고 등에 취약한 모습을 보여 왔다. 현재는 사고 발생한 경우 주로 서버 전체를 복구하는 등의 조치를 위하여 문제를 보완해 왔는데, 백업 과정에서 문제가 발생하면 복구 불가능한 손실이 발생할 수밖에 없다. 이에 본 연구에서는 앞서 말한 사고로 인해 데이터가 손실되더라도, 손실된 데이터를 복구할 방법으로 블록체인 기술을 활용해보고자 하였다. 블록체인 기술을 활용하여 게임 시스템 속 데이터베이스의 일부를 분산 저장하는 방법을 실험해 봄으로서 앞서 제기한 문제들을 해결해 보고자 한다.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.91-102
• /
• 2006

We analyze the performance of MAC-layer Reed-Solomon error recovery in the cdma2000 1xEV-DO Broadcast and Multicast Services (BCMCSs) environment, with respect to the size of the ECB (Error Control Block) and the air-channel condition, and establish the relationship between ECB size, error recovery capacity and service latency. From this we propose an adaptive error recovery scheme which adjusts the size of the ECB to reflect the environment of the mobile nodes so as to meet the required service quality (target bit error-rate), while reducing the latency of real-time applications. Extensive simulation results show the effectiveness of our approach compared to the current static scheme. Proposed adaptive schemes achieves near optimal solution with respect to service latency while satisfying the required service quality.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.5
• /
• pp.87-94
• /
• 2008

In this paper, we present a directional error concealment technique to compensate a lost block. Generally, the strong edge of an image has the large amounts of the variance because of its large coefficients in the wavelet domain. For estimating edge direction of a lost block, a $X^2$ hypothesis-testing problem is applied using the variance of wavelet coefficients. The lost block is interpolated according to the estimated edge direction. The pixels for interpolation is obtained from the edge direction. The proposed method outperforms the previous methods in objective and subjective qualities.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.251-255
• /
• 2008

In most file systems, if a file is deleted, only the metadata of the file is deleted or modified and the file's data is still stored on the physical media. Some users require that deleted files no longer be accessible. This requirement is more important in embedded systems that employ flash memory as a storage medium. In this paper, we propose a secure deletion method for NAND flash file system and apply the method to YAFFS. Our method uses encryption to delete files and forces all keys of a specific file to be stored in the same block. Therefore, only one erase operation is required to securely delete a file. Our simulation results show that the amortized number of block erases is smaller than the simple encryption method. Even though we apply our method only to the YAFFS, our method can be easily applied to other NAND flash file systems.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.199-201
• /
• 2004

모바일 장치에서 많이 사용되는 플래시 메모리는 작고, 저전력을 사용하며 내구성을 지니는 비휘발성 저장장치이다. 플래시 메모리의 읽기 속도는 램과 비슷하며, 대용량화 되어가고 있지만 쓰기 속도가 램에 비해 느리고, 블록에 대한 쓰기가 제한되어 있다. 현재의 디스크 기반의 DBMS 와는 달리 플래시 메모리용 저장장치를 설계함에 있어 트랜잭션 실패시의 회복기법이 같은 블록에 다시 쓰기가 불가능한 플래시 메모리의 특성을 고려하는 것이 중요하다. 본 연구에서 LFS에 Shadow Paging을 응용하여 플래시 메모리의 블록에 대한 쓰기 횟수를 줄이고 플래시 메모리의 특성에 맞추어 트랜잭션 실패시 효율적인 데이터 복구를 가능하게 하는 회복기법을 제안한다.

• 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 the Korea Society of Computer and Information
• /
• v.26 no.4
• /
• pp.75-84
• /
• 2021

In this paper, we introduce InfoDID, a robust user information management service based on DID that manages user information reliably. Since blockchain technology provides an environment in which data can be handled transparently on a decentralized basis, various services using blockchain are currently being developed As the importance of user's personal information has recently emerged, the DID technology is receiving attention. The technology allows a user to control his or her information through decentralized identifiers, and various information management services are being tried based on the technology. Using blockchain-based DID technology, InfoDID reliably controls personal information requested frequently, helping users to provide their information to other services more conveniently. In addition, to support service continuity, InfoDID uses BR2K technique that provides robust execution of blockchain application services, so that even partial service failures can be systematically recovered. To facilitate this operation, we present a replication status monitoring tool that can continuously check the replication states of blockchain application services running in association with the BR2K technique such as InfoDID.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.275-277
• /
• 2000

분산 데이터베이스 시스템에서 데이터의 일치성을 유지하기 위해 원자성 완료 규약을 수행한다. 2PC 규약은 규약 수행시 조정자의 고장으로 인하여 참여자들이 블록킹이 될 수 있다. 참여자들이 블록킹되는 것은 자신들의 자원을 풀지 못하고 조정자가 고장에서 복구될 때까지 기다려야 한다. 블록킹을 해결하기 위해 제안된 방법은 3PC(Three Phase Commit Protocol)규약이 대표적이다. 이 규약은 블록킹은 해결하지만 2PC(Two Phase Commit) 규약보다 많은 메시기 교환과 로그 기록을 하게 되고 따라서 규약을 수행하는 데 걸리는 시간이 증가된다. 본 논문에서는 2PC 규약의 변형으로 블록킹을 해결할 수 있는 기법을 제안하므로써 기존의 3PC 규약보다 수행시간을 향상시킨다. 제안하는 완료규약의 특징은 새로운 조정자를 규약 전에 미리 선출하여 조정자 고장 발생시 종료규약을 수행하게 함으로써 블록킹을 해결하였다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.11
• /
• pp.1-6
• /
• 2019

Multicast is an efficient method for real-time transmission in many multimedia applications. It is important to recover lost packets and to manage multicast groups according to the network status in order to improve the reliability of multicast transmissions. In this paper, we propose a method that can efficiently recover lost packets in a large multicast group. In the proposed method, we create a recovery cluster (RC) using a multicast domain (MD) for recovery of lost packets. In the conventional methods, clusters send a request message for lost packets to the senders in order to recover the packets lost from many multicast applications. This increases packet delay time and overhead because of the feedback messages and retransmitted packets. In the proposed method, we improve these problems using the RC, which consists of many MDs (which have overlay multicast senders), and many cluster heads (CHs). We divide the message into blocks, and divide each block into many segments for packet recovery using the CHs. When packet loss occurs, all CHs share the segment information and recover the lost segments at the same time. Simulation results show that the proposed method could improve the packet recovery ratio by about 50% compared to the conventional methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.612-622
• /
• 2002

In this paper, we review temporal error concealment for video transport over unreliable networks, and a new approach for the recovery of lost or erroneous motion vection(MV)s by classifying the movements of neighboring blocks by their homogeneity is proposed. MVs of the neighboring blocks are classified according to the direction of MVs and a representative value for each class is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in many cases than existing methods.