• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.07a
• /
• pp.33-36
• /
• 2016

발사통제시스템의 주요 구성장치인 카운트다운 타임 생성 시스템은 카운트다운 신호를 생성하여 타 시스템에 제공하는 임무를 수행한다. 발사 관련 주요 장비들은 카운트다운 타임 생성 장치로부터 수신한 카운트다운 타임 정보에 따라 기능 수행을 하므로 안정적인 카운트다운 타임의 제공이 필수적이다. 따라서 카운트다운 타임 생성 시스템은 신뢰성과 고장 감내성을 보장하기 위한 설계가 요구된다. 이를 위해서는 시스템의 신뢰성을 보장하기 위한 방안으로 구성 장치들을 이중화하고 고장을 실시간 감시하여 고장 발생시 Active 장치에서 Standby 장치로의 절체 운용에 대한 설계가 필요하다. 본 논문에서는 카운트다운 타임 생성 장치의 이중화 설계에 따른 실시간 고장 감지 및 절체 운용 방법과 기능 시험 결과에 대하여 기술하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.19-26
• /
• 2004

In this paper, we investigate the longest fault-free paths joining every pair of vertices in a double loop network with faulty vertices and/or edges, and show that a bipartite double loop network G(mn；1, m) is strongly hamiltonian-laceable when the number of faulty elements is two or less. G(mn；1, m) is bipartite if and only if m is odd and n is even.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.9
• /
• pp.46-53
• /
• 2007

The link-fault recovery in the normal Ethernet bridged networks has relied on the Spanning Tree Protocol(STP) or Rapid STP. However, STP can not offer fast error recovery which is needed real-time services such as aircraft. In this paper, we compare automatic protection switching(APS) providing fault-tolerant function in the BcN back bone system with Avionic Full Duplex Switched Ethernet(AFDX) which is recently equipped in the A380 for Airbone Databuses. Also, we propose a link-bypass scheme for improving fault-tolerant performance of the AFDX by connecting switches and bypass fault section when a fault is originated on the link. For comparing and verifying the performance of proposed scheme, we simulated Ethernet, AFDX, APS and proposed AFDX with link-bypass scheme using NS-2. The proposed AFDX with link-bypass scheme can be applied to aircrafts, BcN backbone networks and industrial automatic networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.1-7
• /
• 2010

In this paper, a high-performance fault-tolerant switching network using a deflection self-routing was proposed. From an abstract algebraic analysis of the topological properties of the Delta network, which is a baseline switching network, we derive the Multidimensional Ring-Delta network: a multipath switching network using a deflection self-routing algorithm. All of the links including already existing links of the Delta network are used to provide the alternate paths detouring faulty/congested links. We ran a simulation analysis under the traffic loads having the non-uniform address distributions that are usual in Internet. The throughput of $1024\;{\times}\;1024$ switching network proposed is better than that of the 2D ring-Banyan network by 13.3 %, when the input traffic load is 1.0 and the hot ratio is 0.9. The reliability of $64\;{\times}\;64$ switching network proposed is better than that of the 2D ring-Banyan network by 46.6%.

• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.256-261
• /
• 2007

2-Dimensional Ring-banyan network is a high-performance fault-tolerant switching network using a deflection self-routing. The throughput of the switching network is better than that of Cyclic Banyan network under non-uniform traffic. In this paper, we present an analytic reliability analysis of the fault-tolerant switching network. We present the Mean-Time-to-Failure that is calculated by using probabilistic model. This model also takes into account a hardware complexity. In case of $16\;{\times}\;16$ size, the presented switching network is 1.275 times more reliable than Hui's switching network. And it is 1.510 times more reliable than Hui's network in case of $64\;{\times}\;64$ size.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.563-564
• /
• 2017

The core of the cloud computing technology is the data center in that the networking technology is important. Cloud data centers are comprised of tens or even hundreds of thousands of physical servers, so networking technology is required for high-speed data transfer. These networking technologies also require scalability, fault tolerance, and agility. For these requirements, many multi-path based schemes have been proposed. However, it was mainly used for load balancing of traffic and select a path randomly. In this paper, a scheme that can construct a multipath using software defined networking technology and transmit the traffic in parallel by using the multipath to achieve a fast transmission speed, solve the scalability problem and fault tolerance is proposed.

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.335-346
• /
• 2004

In this paper, we present a high-performance fault-tolerant switching networks using a deflection self-routing scheme, and present fault-diagnosis method for the network. We use the facts: 1) Each stage of the Banyan network is arrayed as the sequences of a Cyclic group of SEs. 2) There is the homomorphism between adjacent stages from a view of self-routing, so that all of each Cyclic group is the subgroup of the Cyclic group in the next stage, and there are factor groups due to such subgroup and homomorphism. We provide high-performance fault-tolerant switching networks of which the all links including augmented links are used as the alternate links detouring faulty links. We also present the fault diagnosis scheme for the proposed switching network that provide multiple paths for each input-output pair.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.440-441
• /
• 2010

IT 분야는 최근 고도의 신뢰성을 요구하는 국방, 의료, 건설, 자동차, 선박, 항공의 다양한 분야와 융복합화가 이루어지고 있다. 본 논문은 고장 감내 기법을 적용하여 신뢰성 있는 임베디드 시스템을 구축하기 위한 고장 처리 프로세스의 구현에 대해 기술한다. 임베디드 시스템은 자원의 제약으로 인하여 기존의 자원 중복에 의한 결함 허용 기법을 적용하기 어렵다. 제안하는 고장 처리 프로세스는 하드웨어 또는 소프트웨어 중복 없이 시스템의 최악의 상황에서 동작하며 다양한 결함 허용 기법을 적용할 수 있도록 기본 동작 환경을 제공한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.86-94
• /
• 2004

In this paper, we show that $ G(2^m, 4), m{\geq}3$with at most m-2 faulty elements has a fault-free cycle of length 1 for every ${\leq}1{\leq}2^m-f_v$ is the number of faulty vertices. To achieve our purpose, we define a graph G to be k-fault hypohamiltonian-connected if for any set F of faulty elements, G- F has a fault-free path joining every pair of fault-free vertices whose length is shorter than a hamiltonian path by one, and then show that$ G(2^m, 4), m{\geq}3$ is m-3-fault hypohamiltonian-connected.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1133-1141
• /
• 2009

In this paper, we present a distributed fault-tolerant topology control protocol that configure a wireless sensor network to achieve k-connectivity and (k+1)-coverage. One fundamental issue in sensor networks is to maintain both sensing coverage and network connectivity in order to support different applications and environments, while some least active nodes are on duty. Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. Although the protocols for resolving such a problem while maintaining sensing coverage were proposed, they requires accurate location information to check the coverage, and most of active sensors in the constructed topology maintain 2k-connectivity when they keep k-coverage. We propose the fault-tolerant topology control protocol that is based on the theorem that k-connectivity implies (k+1)-coverage when the sensing range is at two times the transmission range. The proposed distributed algorithm does not need accurate location information, the complexity is O(1). We demonstrate the capability of the proposed protocol to provide guaranteed connectivity and coverage, through both geometric analysis and extensive simulation.