• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1073-1081
• /
• 2000

This paper proposes a new fault-tolerant technique for bitonic sorting networks which can be used for designing ATM switches based on Batcher-Banyan network. The main goal in this paper is to design a cost-effective fault-tolerant bitonic sorting network. In order to recover a fault, additional comparison elements and additional links are used. A Dynamic Redundant Bitonic Sorting (DRBS) network is based on the Dynamic Redundant network and can be constructed with several different variations. The proposed fault-tolerant sorting network offers high fault-tolerance; low time delays; maintenance of cell sequence; simple routing; and regularity and modularity.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.339-350
• /
• 2009

In wireless sensor networks, the limited battery resources of sensor nodes have a direct impact on network lifetime. To reduce unnecessary power consumption, it is often the case that only a minimum number of sensor nodes operate in active mode while the others are kept in sleep mode. In such a case, however, the network service can be easily unreliable if any active node is unable to perform its sensing or communication function because of an unexpected failure. Thus, for achieving reliable sensing, it is important to maintain the sensing level even when some sensor nodes fail. In this paper, we propose a new fault-tolerance scheme, called FCP(Fault-tolerant Coverage Preserving), that gives an efficient way to handle the degradation of the sensing level caused by sensor node failures. In the proposed FCP scheme, a set of backup nodes are pre-designated for each active node to be used to replace the active node in case of its failure. Experimental results show that the FCP scheme provides enhanced performance with reduced overhead in terms of sensing coverage preserving, the number of backup nodes and the amount of control messages. On the average, the percentage of coverage preserving is improved by 87.2% while the additional number of backup nodes and the additional amount of control messages are reduced by 57.6% and 99.5%, respectively, compared with previous fault-tolerance schemes.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.333-340
• /
• 2002

Embedding is a mapping an interconnection network G to another interconnection network H. If a network G can be embedded to another network H, algorithms developed on G can be simulated on H. In this paper, we first propose a method to embed between Hierarchical Cubic Network HCN(n, n) and Hierarchical Folded-hypercube Network HFN(n, n). HCN(n, n) and HFN(n, n) are graph topologies having desirable properties of hypercube while improving the network cost, defined as degree${\times}$diameter, of Hypercube. We prove that HCN(n, n) can be embedded into HFN(n, n) with dilation 3 and congestion 2, and the average dilation is less than 2. HFN(n, n) can be embedded into HCN(n, n) with dilation 0 (n), but the average dilation is less than 2. Finally, we analyze the fault tolerance of HCN(n, n) and prove that HCN(n, n) is maximally fault tolerant.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3458-3481
• /
• 2021

Existing methods for blind identification of linear block codes without a candidate set are mainly built on the Gauss elimination process. However, the fault tolerance will fall short when the intercepted bit error rate (BER) is too high. To address this issue, we apply the reverse algebra approach and propose a novel "two-step-screening" algorithm by solving the linear error equations on the binary Galois field, or GF(2). In the first step, a recursive matrix partition is implemented to solve the system linear error equations where the coefficient matrix is constructed by the full codewords which come from the intercepted noisy bitstream. This process is repeated to derive all those possible parity-checks. In the second step, a check matrix constructed by the intercepted codewords is applied to find the correct parity-checks out of all possible parity-checks solutions. This novel "two-step-screening" algorithm can be used in different codes like Hamming codes, BCH codes, LDPC codes, and quasi-cyclic LDPC codes. The simulation results have shown that it can highly improve the fault tolerance ability compared to the existing Gauss elimination process-based algorithms.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.550-552
• /
• 2001

최근에 네트워크 환경이 좋아지고 인터넷 사용이 급증함에 따라 이동 에이전트(Mobile Agent) 기술이 정보검색, 네트워크 관리 , 전자상거래, 병렬/분산처리 등의 분야에 널리 활용되고 있다. 이동 에이전트 시스템에서 전체 수행시간은 이동 에이전트의 코드 크기, 이동 에이전트의 데이터 크기 , 이동 에이전트의 전송 방법에 따라 좌우된다. 본 논문에서는 이동 에이전트 환경에 참여하는 모든 노드들에게 보다 빠르게 에이전트를 전송하는 방법들을 실험적으로 평가하고 에이전트 이동시 노드의 결함(Fault)이 발생할 때 그 해결방안을 연구한화. 에이전트 전송 및 결함 허용에 대한 성능평가는 IBM's Aglets Software Development Kit 환경을 이용하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.209-211
• /
• 1999

본 논문에서는 CORBA의 고장 감내(fault tolerance) 방식을 이용하여 교환기 시스템을 위한 객체 지향 실시간 운영체계상에서의 고장 감내 객체서비스 구현을 목표로 한다. 이를 위해 먼저 CORBA의 고장 감내 방식을 분석하고, 전자 교환기에 적합한 실시간 고장 감내 방식에 대하여 제안한다. 이 방식에서는 교환기내의 이중화 시스템을 이용하여 객체 단위에서 고장 감내 기능을 제공하게 된다.

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

• Smart Structures and Systems
• /
• v.30 no.5
• /
• pp.433-446
• /
• 2022

Despite efforts to reduce unexpected accidents at confined construction sites, choking accidents continue to occur. Because of the poorly ventilated atmosphere, particularly in long, confined underground spaces, workers are subject to dangerous working conditions despite the use of artificial ventilation. Moreover, the traditional monitoring methods of using portable gas detectors place safety inspectors in direct contact with hazardous conditions. In this study, a long-range (LoRa)-based wireless safety monitoring system that features the network organization, fault-tolerant, power management, and a graphical user interface (GUI) was developed for underground construction sites. The LoRa wireless data communication system was adopted to detect hazardous gases and oxygen deficiency within a confined underground space with adjustable communication range and low power consumption. Fault tolerance based on the mapping information of the entire wireless sensor network was particularly implemented to ensure the reliable operation of the monitoring system. Moreover, a sleep mode was implemented for the efficient power management. The GUI was also developed to control the entire safety-monitoring system and to manage the measured data. The developed safety-monitoring system was validated in an indoor testing and at two full-scale water pipeline construction sites.

• The KIPS Transactions:PartD
• /
• v.12D no.6 s.102
• /
• pp.875-880
• /
• 2005

Recently web services ale being used to provide environments of distributed computing. Web services provide reusable software component. So, one web service can be used by many users, and one user can use different web services. For reliable use of web services, in these cases, it is important to be fault-tolerance. Existing fault-tolerant methods in web services need a kind of client modification and cannot consider extensible factors like quality. This study suggests the system architecture and description language for the system which can improve some of these problems.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.2
• /
• pp.886-889
• /
• 2017

An active Fault Tolerant Model Predictive Control (FTMPC) using Fuzzy scheduler is developed. Fault tolerant Control (FTC) system stages are broadly classified into two namely Fault Detection and Isolation (FDI) and fault accommodation. Basically, the faults are identified by means of state estimation techniques. Then using the decision based approach it is isolated. This is usually performed using soft computing techniques. Fuzzy Decision Making (FDM) system classifies the faults. After identification and classification of the faults, the model is selected by using the information obtained from FDI. Then this model is fed into FTC in the form of MPC scheme by Takagi-Sugeno Fuzzy scheduler. The Fault tolerance is performed by switching the appropriate model for each identified faults. Thus by incorporating the fuzzy scheduled based FTC it becomes more efficient. The system will be thereafter able to detect the faults, isolate it and also able to accommodate the faults in the sensors and actuators of the Continuous Stirred Tank Reactor (CSTR) process while the conventional MPC does not have the ability to perform it.