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

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.77-82
• /
• 2005

Protection of user service becomes increasingly important since even very short interruption of service due to link or node failure will cause huge data loss and incur tremendous restoration cost in high speed network environment. Thus fast and efficient protection and restoration is one of the most important issues to be addressed. Protection methods have been proposed to provide efficiency and stability in optical networks. In this paper, an original network is separated into several domains using Hamiltonian cycle. and link protection is performed on the cycles of the domains. We have shown that protection path length can be decreased up to $57{\%}$ with marginal increase of backup capacity. Our proposed method can provide high-speed protection with marginal increase of protection capacity.

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

• Journal of KIISE:Information Networking
• /
• v.37 no.1
• /
• pp.35-41
• /
• 2010

Since the ad-hoc network allow nodes to communicate each other without infrastructure system and predefined configuration, it comes into the spotlight that is suitable to ubiquitous society. In ad-hoc network, route recovery mechanism is considered important. Normally route recovery is needed to solve the link failure problem because there is no route maintaining system like a router in ad-hoc networks. In this paper we propose BS-AODV(Bidirectional Searching-AODV) route recovery method. The proposed method is a local repair method that can be applied in all of the network area. Unlike a limited local repair method in AODV. the proposed method adopts the bidirectional searching method where the upstream/downstream nodes can send the route maintenance messages. Restricting the flooding of route request messages, the proposed scheme attempts to minimize the costs of local repair, the performance of the proposed scheme is evaluated through the simulations. In two scenarios which variate the node numbers and node speed, the comparison among the proposed scheme, AODV and AOMDV is shown in terms of the control traffic and data delivery ratio.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.119-122
• /
• 2007

무선 센서 네트워크에서 이동하는 물체 추적 실패시 이를 복구하기 위하여 많은 센서들의 에너지를 소비하기 때문에 이동 물체 추적 복구는 전체 센서 네트워크의 생명주기 연장에 중요한 요소이다. 본 논문에서는 물체의 이동정보를 고려한 동적 클러스터링 환경에서 이동물체의 추적 실패시 이동물체를 효율적으로 재 탐지할 수 있는 이동물체 추적 복구 기법을 제안함으로써 이동하는 물체추적 실패후 재 탐지에 성공하는 복구율을 증가시켜서 센서 노드의 에너지 소모를 최소화 하여 전체 센서 네트워크의 생명주기를 연장시키고자 한다. 시뮬레이션 결과가 증명하는 바와 같이 제안한 방식은 보다 높은 복구율을 달성하였다.

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

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

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

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9A
• /
• pp.844-851
• /
• 2010

Recently, AODV routing protocol which one of the table driven method for the purpose data transmission between nodes has been broadly used in mobile wireless sensor networks. An existing AODV has a little overhead of routing packets because of keeping the routing table for activity route and re-routes to recovery the routes in route discontinuation. However that has faults in that excesses useless of the network bandwidth to recovery the route and takes a lone time to recovery the route. This paper proposes an efficient route recovery method for AODV based on wireless sensor networks in connection breaks. The proposed method. The propose method controls the number of RREQ message considering the energy's node and distance between nodes to restrict the flooding range of RREQ message while expanding the range of local repair. In test results, the proposed method are compared to existing method, the number of drops decrease 15.43% and the delay time for re-route decrease 0.20sec.