• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.61-64
• /
• 2007

MPLS networks architectures have been prevailed as scalable approach to provide quality of service in the Internet. Many researches have been mainly focused on scalability and multi-path calculation scheme for failure restoration. However, the MPLS network have an scalability problem about traffic, and the existing failure restoration methods are wasted resources, and it has the problem that loss of a packet by a lot of delay occurs in too. Therefore in this paper, we propose a H-MPLS (Hierachical-Multiprotocol Label Switching)network for rapidly failure restorations and effective management of network extended. The proposed H-MPLS Network apply LSP multi-path routing algorithm and consists of several MPLS. After comparing the performance among the existing failure restoration methods with various network models, we use NS simulator in order to analyze the performance. Finally, we present an improvement scheme of the efficiency and scalability.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.655-664
• /
• 2002

The focus of quality-of-service routing has been on the routing of a single path satisfying specified QoS constraints. However upon failure of a node or link on the path, a new path (backup path) satisfying the constraints has to be established. This paper proposed the fault recovery QoS Rerouting algorithms to recovery the service of applications under fault environment of network. For this, we describes the generation method of PFC (Protection Fundamental Cycle) protecting all of network nodes and suggests path selection algorithms using minimization rerouting cost problem and analyzes the performances of these.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.701-712
• /
• 2012

The concept of $k$-shortest disjoint paths is considered important because the establishment of primary and backup forwarding paths exploiting shorter distance and faster propagation time is a dominant consideration for the design of a survivable backbone network. Therefore, we need to evaluate how well the concept of $k$-shortest disjoint paths is exploited for the design of a survivable ship backbone network considering the international standard related to ship backbone networks, the IEC61162-410 standard specifying how to manage redundant message transmissions among ship devices. Performance evaluations are conducted in terms of following objective goals: link capacity, hop and distance of primary and backup paths, even distribution of traffic flows, restoration time of backup forwarding paths, and physical network topology connectivity.

• Information and Communications Magazine
• /
• v.32 no.7
• /
• pp.9-16
• /
• 2015

본고에서는 Transport SDN의 고확장성과 네트워크 장애를 신속하게 복구하기 위한 고가용성을 제공하는 SDN 컨트롤러 구조와 데이터 플레인 장애 복구 기술 동향을 소개한다. SDN 컨트롤러 기술에 대해서는 최근 많은 관심을 받고 있는 오픈소스 프레임워크 기반의 SDN 컨트롤러를 중심으로 확장성 및 고가용성 기술 동향을 살펴본다. 그리고 데이터 플레인에서 노드 및 경로 장애 발생 시 신속하게 경로를 복구하기 위한 보호기술과 복구기술 동향을 소개한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.620-623
• /
• 2008

Home service networked system gets more its fault chances, which are fault by the external factors, network fault, home appliance fault, and so on. Moreover, user may want to pay no attention to a sequence of complex or nervous maintenance jobs for system fault management. Therefore, home management system needs the function of home service recovery for fault home device. For this, this paper manages to design home network control log, and proposes the method for securing the home device service continuity analyzing home device service log in the point of fault.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2744-2754
• /
• 1997

Recently, the Multi-Layer Restoration(MLR) algorithm was proposed by British Telecom(BT) to restore the network failures in Digital Cross-connect System(DCS) mesh survival network[1, 2]. This algorithm has multi restoration stage which is composed of the pre-planned and dynamic restoration. This algorithm is effective its ability in link or node failures. This reason is that it does not restore in the pre-planned rstoration stage but in dynamic restoration stage. In this paper, we propose the MLR with pre-planned Multi-Chooser(PMC) and successive restoration ratio algorithm. This proposed algorithm has a excellent performance for restortion time and ratio, spare channel availability and fast restoration from multiple link failure or node failure. This paper proposed the modeling and restoration algorithm, and analyzed the performance of the algorithm by simulation using OPNET(OPtimized Network Engineering Tools).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1421-1425
• /
• 1999

A restoration scheme is presented when a failure occurs at nodes or links on the ATM network. Each node on the network contains the same topology information for resources on the network by Exchanging NSE(Network State Element) which has the network state information through RCC(Routing Control Channel). We also propose a new establishing algorithm that set up a new alternate path reflecting the state of the network changed dynamically at the source node. In the result of applying our scheme, the rates of restoration can be improved and the number of messages decreased so that fast recovering could be possible by reducing traffics on the network by lowering the rates of the call-setup failure at the stage of CAC(Connection Admission Control).

• Smart Media Journal
• /
• v.5 no.1
• /
• pp.69-77
• /
• 2016

This paper proposes a software defined storaging method to converge the network virtualization technique and the RAID of distributed storage environment. The proposed method designs software based storage which it apply a flexible control and maintenance of storages. In addition, the method overcomes the restricted of physical storage capacity and cut costs of data recovery. The proposed failover recovery technique based on Software-Defined RAID has been tested the substantial verification and the performance using public AWS and Google Storage.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2497-2504
• /
• 2000

This paper is aimed at defining items of fault, and then constructing rules of fault diagnosis and recovery using INBANCA technology for the purpose of managing the weh server. The fault items of web server consist of the process fault, server overload, network interface fault, configuration and performance fault. Based on these items, the actual fault management is carried out fault referencing. In order to reference the fault, we have formulated the system-level fault diagnosis production rule and the service-level fault diagnosis rule, conjunction with translating management knowledge into active network. Also, adaptive recovery mechanism of web server is applied to defining recovery rule and constructing case library for case-based web server fault recovery. Finally, through the experiment, fault environment and applicability of each proposed production rule and recovering scheme are presented to verify justification of proposed diagnosis rules and recovery mechanism for fault management. An intelligent case-based fault management scheme proposed in this paper can minimize an effort of web master to remove fault incurred web administration and operation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10B
• /
• pp.841-848
• /
• 2004

In case of failure in the IP network services should be provided via a backup path which fully meets QoS requirements. In this regard, we in this paper suggest simple-PFC(5-PFC) to restore single link failure, iterative-PFC(i-PFC) for multiple link failures, and fault_node Avoidance-PFC(a-PFC) for failures of nodes such as routers. Taking the minimum cost rerouting problem into account, we compare and analyze performance of those three mechanisms carrying out Direct_destination Rerouting(DR).