• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.448-460
• /
• 2003

In this paper, we propose a network fault recovery algorithm based on a segment restoration scheme to reduce restoration time and restoration resource. The proposed segment restoration scheme is based on network partitioning which divides a large network into several small subnetworks. The restoration performance of the proposed segment restoration scheme depends on the size and the topology of subnetworks. Since most faults can be restored in a subnetwork, restoration time is reduced obviously. We compare and analyze restoration performance according to the size of subnetworks and restoration schemes. From simulation results, the proposed segment restoration scheme has the shortest restoration time compared with other restoration schemes. Especially the restoration performance of the proposed segment restoration scheme is better than the SLSP, which is also a segment-based restoration scheme, in terms of restoration time and required restoration resource capacity.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.497-504
• /
• 2002

This paper proposes fault diagnosis and correction algorithms using agent collaboration, and a management model for managing network configuration faults. This management model is composed of three processes-fault detection, fault diagnosis and fault correction. Each process, based on RBR, operates on using rules which are consisted in Rule-based Knowledge Database. Proposed algorithm selves the complex fault problem that a system could not work out by itself, using agent collaboration. And the algorithm does efficiently diagnose and correct network configuration faults in abnormal network states.

• The KIPS Transactions:PartA
• /
• v.16A no.1
• /
• pp.17-26
• /
• 2009

Large-scale wireless sensor network are expected to play an increasingly important role for the data collection in harmful area. However, the physical fragility of sensor node makes reliable routing in harmful area a challenging problem. Since several sensor nodes in harmful area could be damaged all at once, the network should have the availability to recover routing from node failures in large area. Many routing protocols take accounts of failure recovery of single node but it is very hard these protocols to recover routing from large scale failures. In this paper, we propose a routing protocol, which we refer to as LSFA, to recover network fast from failures in large area. LSFA detects the failure by counting the packet loss from parent node and in case of failure detection LSFAdecreases the routing interval to notify the failure to the neighbor nodes. Our experimental results indicate clearly that LSFA could recover large area failures fast with less packets than previous protocols.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.10 no.1
• /
• pp.83-93
• /
• 2006

This paper introduces rule-based reasoning (RBR) based self-recovery system for network fault in ubiquitous computing. This system is fault management system for fault recovery of rule-based for self-recovery in ubiquitous computing environment. We proposed rules of network fault recovery applied the system as a distinguished reason of network fault. And, in this paper, the network fault self-recovery system proved the rules that applied each situatpion through the simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.5
• /
• pp.53-61
• /
• 2004

This paper proposes two types of sub-network based on dynamic restoration schemes to improve survivability of GMPLS networks and analyzes characteristics of these two schemes. The first proposed scheme divides with a whole GMPLS network into several sub-networks, applies a mixture of both restoration and protection methods according to fault location. The other scheme divides a whole GMPLS network into primary and secondary sub-networks, applies a restoration method in each sub-network according to fault location. In our simulation, we evaluate the performances of network resource utilization, restoration success rate, and mean restoration time and conduct its comparative analysis with conventional schemes. The simulation results show that the efficiency of network resource utilization in the proposed schemes is increased as compared with conventional restoration schemes (l＋l, 1:1, 1:N) in case of single-failed link. By contrast, we found that the performances of restoration success rate and mean restoration time in case of multi-failed link is lower than conventional restoration schemes. However, the probability that multi-failed link is occurred is very low so that the problem in practical GMPLS network is negligible.

• Annual Conference of KIPS
• /
• 2003.11b
• /
• pp.1221-1224
• /
• 2003

본 논문은 RBR(Rule-Based Reasoning) 기법과 RBR 기법에 적용될 규칙에 대한 우선순위를 둠으로써 효율적인 네트워크 설정을 만드는 동시에 네트워크 장애 발생시 장애를 진단 검출복구하는 에이전트 시스템에 관한 연구이다. 논문에서 제시하는 시스템은 AS 내에서 동작하는 것을 원칙으로 하며 각 네트워크의 에이전트들은 우선 순위 장애 탐지 및 복구를 위해 우선 순위에 따라 규칙을 적용한다. 장애 발생시 진단 검출 복구를 위해 에이전트는 상호 협력하며 장애 검출 및 진단 도구로써 ping, traceroute 등을 이용한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1046-1054
• /
• 2002

In this paper, we propose a subnetwork-based segment restoration scheme to reduce the restoration time and restoration resources. And we compare and analyze the restoration performance according to the size of divided subnetworks. Segment restoration is based on network partitioning where a large network is divided into several small subnetworks and the end-to-end data path is divided into multiple segments according to the subnetworks. In segment restoration, the link/node failure is restored by segment instead of end-to-end path. Because most faults are restored within the subnetwork, the restoration performance can be improved. From the simulation analysis, we verified that the proposed segment restoration has advantage of restoration time and backup resource utilization.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.2
• /
• pp.108-115
• /
• 2001

SDH-based SHR networks are the reconfiguration process in case of failure and APS protocol used. In this study, addresses the maximum allowed recovery time in two fiber bidirectional networks. We analyse the APS protocol and derive the Processing time domains of each n order to cope with the maximum reconfiguration time of 50㎳, as specified in the ITU-T standard. We finally analyze the interleaved failures. One is the signal degrade then the signal failure, the other is the signal failure then the signal failure. Any case analysis is carried out. reconfiguration time can be guaranteed.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.6
• /
• pp.439-444
• /
• 2015

The Social infrastructure systems such as communication, transportation, power and water supply systems are now facing various types of threats including component failures, security attacks and natural disasters, etc. Whenever such undesirable events occur, it is crucial to recover the system as quickly as possible because the downtime of social infrastructure causes catastrophic consequences in the society. Especially when there is a network link-failure, we need an automatic link-recovery method. This means that customers are aware of network failures that can be recovered before you say that service. In this paper, we analysis the relation between Auto-recovery performance and cost.

• Annual Conference of KIPS
• /
• 2005.05a
• /
• pp.1549-1552
• /
• 2005

네트워크에 연결된 장치나 자원은 심각한 네트워크 단절로 인해 사용이 불가능할 수도 있다. 견고한 네트워크 연결성을 제공하기 위해 본 논문에서는 협력작업(teamwork)을 이용한 UPnP 환경에서의 자동화된 복구 방법을 제안한다. 제안한 복구 방법에서는 복구 가능한 제어 포인트(control point)들과 이와 연관된 복구 장치들이 팀을 이루어 제어 포인트에 장애(failure)가 발생하여도 다른팀 구성원이 장치들을 자동으로 연결하여 공통의 목표를 달성한다. 제안한 복구 방법이 효과적임을 실험을 통해 검증하였는데, 이 실험에서 복구 가능한 제어 포인트는 팀 내의 다른 제어 포인트에 장애가 발생하였을 경우에도 장치로부터의 이벤트를 성공적으로 처리하였다.