• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.05a
• /
• pp.29-32
• /
• 2023

양자 컴퓨터의 연산 성능이 알려지면서 기존 암호 시스템이 붕괴될 것이라 예상한다. 앞선 많은 연구들은 공격 대상 암호에 대해 양자회로로 구현하고 공격에 필요한 양자자원을 추정하였지만 암호를 공격하기 위해서는 대규모 양자컴퓨터의 동작을 요구한다. 뿐만 아니라 내결함성 양자 컴퓨터에서 유효한 결과를 얻기 위해서는 오류 정정이 필수적이며 오류 정정에도 양자 자원을 소비하며 결과적으로 더 큰 규모의 양자컴퓨터가 필요하고 크기가 커질수록 오류가 증가한다. 이러한 내결함성 대규모 양자회로에서 T 게이트를 구현하는 것이 다른 게이트를 구현하는 것 보다 어렵고 T-depth가 회로의 실행시간에 큰 영향을 미친다. 본 논문에서는 T-depth 최적화 도구 및 T-depth 감소 기법을 적용한 방식을 조사하였다.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2011.11a
• /
• pp.599-602
• /
• 2011

A propulsion controller for one-time flight vehicles should be designed robustly so that it can complete its missions even in case sensor failures. These vehicles improve their fault tolerance by back-up sensors prepared for the failure of major sensors, which raises the total cost. This paper presents the NARX model which substitutes vehicles' velocity sensors, and detects failure of sensor signals by using model based fault detection. The designed NARX model and fault detection algorithm were optimized and installed in TI's TMS320F2812 so that they were linked to HILS instruments in real-time. The designed propulsion controller made the vehicle to have better fault tolerance with fewer sensors and to complete its missions under a lot of complicated failure situations. The controller's applicability was finally confirmed by tests under the HILS environment.

• Journal of IKEEE
• /
• v.28 no.3
• /
• pp.458-464
• /
• 2024

This study proposes a fault-tolerant caching system to address the issue of caching content imbalance caused by the dynamic departure and participation of cache servers in a heterogeneous cache server network, and validates it in both real and virtual environments. With the increase of large-scale media content requiring various types and resolutions, the necessity of cache servers as key components to reduce response time to user requests and alleviate network load has been growing. In particular, research on heterogeneous cache server networks utilizing edge computing and low-power devices has been actively conducted recently. However, in such environments, the irregular departure and participation of cache servers can occur frequently, leading to content imbalance among the cache servers deployed in the network, which can degrade the performance of the cache server network. The fault-tolerant caching algorithm proposed in this study ensures stable service quality by maintaining balance among media contents even when cache servers depart. Experimental results confirmed that the proposed algorithm effectively maintains content distribution despite the departure of cache servers. Additionally, we built a network composed of seven heterogeneous cache servers to verify the practicality of the proposed caching system and demonstrated its performance and scalability through a large-scale cache server network in a virtual environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.2
• /
• pp.271-277
• /
• 2022

PBFT (Practical Byzantine Fault Tolerant) is a consensus algorithm that can achieve consensus by resolving unintentional and intentional faults in a distributed network environment and can guarantee high performance and absolute finality. However, as the size of the network increases, the network load also increases due to message broadcasting that repeatedly occurs during the consensus process. Due to the characteristics of the PBFT algorithm, it is suitable for small/private blockchain, but there is a limit to its application to large/public blockchain. Because PBFT affects the performance of blockchain networks, the industry should test whether PBFT is suitable for products and services, and academia needs a unified evaluation metric and technology for PBFT performance improvement research. In this paper, quantitative evaluation metrics and evaluation frameworks that can evaluate PBFT family consensus algorithms are studied. In addition, the throughput, latency, and fault tolerance of PBFT are evaluated using the proposed PBFT evaluation framework.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.334-336
• /
• 2021

허가형 블록체인 기반 데이터 공유 시스템은 분산 환경에서 신뢰 수준을 구축하고 일관된 메시지를 기록 및 공유함으로써 서비스의 상호 운용성을 가능하게 한다. 그러나 허가형 블록체인은 종종 탈중앙화, 보안 및 상호 운용성과 충돌한다. 이는 중앙 집중식 시스템으로 돌아가거나 데이터의 독점 및 남용 및 오용으로 이어질 수 있다. 따라서 CAP (Consistency, Availability, Partition tolerance)에 이론 검증에 따라 메시지 공유, 비잔틴 내결함성 및 메시지 일관성을 고려하고 적용해야 한다. 기존의 PBFT(Practical Byzantine Fault Tolerance) 합의 알고리즘는 노드의 증가시, 장애내성을 갖기위해 계산되어야 할 합의 처리시간이 증가하며, DPOS(Delegated Proof of Stake) 알고리즘은 보상, 리더 선출의 공정성 문제 등에 따라 허가형 블록체인에서의 적합한 방식이 연구되고 있다. 본 논문에서는 서비스의 상호 운용성과 과제에 대해 논의하고 허가된 블록체인의 합의 개선을 통한 데이터 공유 시스템을 제안한다.

• Journal of Advanced Navigation Technology
• /
• v.25 no.4
• /
• pp.273-279
• /
• 2021

A flight control computer(FLCC) applied to an unmanned aerial vehicle(UAV) is a safety-critical item, and which is designed in a multiple structure to increase the reliability of operation by securing fault tolerance. These FLCC of multiple structure should be designed so that each independent processing/control components can perform the same operation at the same time. And for this reason, a synchronization algorithm for synchronizing the operation between FLCCs should be included in an operational flight program. In this paper, we propose a software design method for synchronization between dual FLCCs applied to UAVs. The proposed synchronization method is designed to synchronize using only the minimum hardware resources to reduce a failure rate. In addition, the proposed synchronization method is designed to minimized synchronization errors due to a timer operation by designing in consideration of operation characteristics of the hardware timer used for the synchronization.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.22 no.3
• /
• pp.175-189
• /
• 2023

Fault detection and diagnosis (FDI) algorithms are actively being researched for ensuring the integrity and reliability of environment perception sensors in autonomous vehicles. In this paper, a fault detection algorithm based on a multi-sensor perception system composed of radar, camera, and lidar is proposed to guarantee the safety of an autonomous vehicle's perception system. The algorithm utilizes reference generation filters and residual generation filters based on finite impulse response (FIR) filter estimates. By analyzing the residuals generated from the filtered sensor observations and the estimated state errors of individual objects, the algorithm detects faults in the environment perception sensors. The proposed algorithm was evaluated by comparing its performance with a Kalman filter-based algorithm through numerical simulations in a virtual environment. This research could help to ensure the safety and reliability of autonomous vehicles and to enhance the integrity of their environment perception sensors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1515-1527
• /
• 2016

With the growth of big data, machine learning, and cloud computing, the importance of storage that can store large amounts of unstructured data is growing recently. So the commodity hardware based distributed file systems such as MAHA-FS, GlusterFS, and Ceph file system have received a lot of attention because of their scale-out and low-cost property. For the data fault tolerance, most of these file systems uses replication in the beginning. But as storage size is growing to tens or hundreds of petabytes, the low space efficiency of the replication has been considered as a problem. This paper applied erasure coding data fault tolerance policy to MAHA-FS for high space efficiency and introduces VDelta technique to solve data consistency problem. In this paper, we compares the performance of two file systems, MAHA-FS and GlusterFS. They have different IO processing architecture, the former is server centric and the latter is client centric architecture. We found the erasure coding performance of MAHA-FS is better than GlusterFS.

• Journal of Advanced Navigation Technology
• /
• v.20 no.4
• /
• pp.321-328
• /
• 2016

Typical MLC NAND flash devices are considered less reliable than SLC NAND flash devices. Although raw bit error rate (RBER) of MLC flash had been considered approximately 1000times or more higher than that of SLC flash, recent research conducted on Google's data center shows that it is much lower than such expectation. Based on the research, we devised In Drive Data Duplication (IDDD) scheme that efficiently exploit MLC flash's sufficient capacity to improve its data reliability without structural complexity increment using SSD intrinsic firmware layer, and showed the data reliability expectation of MLC flash could be significantly higher than that of SLC flash from measured and calculated error rates. Even though RBER of SLC flash was lower than that of MLC flash in 44 out of 48 cases we studied, applying IDDD scheme, RBER of MLC flash was became lower than that of SLC in all 48 cases and uncorrectable bit error rate (UBER) of MLC flash was became lower than that of SLC flash in 45 out of 48 cases.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.3
• /
• pp.29-45
• /
• 2017

Ad hoc sensor network is characterized by decentralized structure and ad hoc deployment. Sensor networks have all basic features of ad hoc network except different degrees such as lower mobility and more stringent energy requirements. Existing protocols provide different tradeoffs among some desirable characteristics such as fault tolerance, distributed computation, robustness, scalability and reliability. wireless protocols suggested so far are very limited, generally focusing on communication to a single base station or on aggregating sensor data. The main reason having such restrictions is due to maximum lifetime to maintain network activities. The network lifetime is an important design metric in ad hoc networks. Since every node does a router role, it is not possible for other nodes to communicate with each other if some nodes do not work due to energy lack. In this paper, we suggest an experimental ad-hoc on-demand distance vector routing protocol to optimize the communication of energy of the network nodes.The load distribution avoids the choice of exhausted nodes at the route selection phase, thus balances the use of energy among nodes and maximizing the network lifetime. In transmission control phase, there is a balance between the choice of a high transmission power that lead to increase in the range of signal transmission thus reducing the number of hops and lower power levels that reduces the interference on the expense of network connectivity.