• Title/Summary/Keyword: Protection/Restoration

Search Result 306, Processing Time 0.026 seconds

Sub-Network based Dynamic Restoration Schemes and Its Characteristics on GMPLS Network (GMPLS에서 Sub-Network을 이용한 동적 복구 방식 및 특성)

  • 권호진;이상화;김영부;한치문
    • 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.

Design and Management of Survivable Network: Concepts and Trends

  • Song, Myeong-Kyu
    • International Journal of Contents
    • /
    • v.5 no.2
    • /
    • pp.43-52
    • /
    • 2009
  • The article first presents a broad overview of the design and management for survivable network. We review the concept of network survivability, various protection and restoration schemes. Also we introduce design architectures of Quantitative model and a Survivable Ad hoc and Mesh Network Architecture. In the other side of study like these(traditional engineering approach), there is the concept of the survivable network systems based on an immune approach. There is one sample of the dynamic multi-routing algorithms in this paper.

Shared Protection of Lightpath with Guaranteed Switching Time over DWDM Networks

  • Chen Yen-Wen;Peng I-Hsuan
    • Journal of Communications and Networks
    • /
    • v.8 no.2
    • /
    • pp.228-233
    • /
    • 2006
  • Survivability is a very important requirement for the deployment of broadband networks because out of service links can affect volumes of traffic even if it is a very short time. And the data paths of broadband networks, which are critical for traffic engineering, are always necessary to be well protected. The procedure of protection or restoration for a path is initiated when failure is detected within the working path. In order to minimize the influence on transmission quality caused by the failure of links and to provide a definite time for the recovery from the failure, the protection switching time (PST) should be carefully considered in the path arrangement. Several researches have been devoted to construct the protection and restoration schemes of data paths over dense wavelength division multiplexing (DWDM) networks, however, there was rare research on the design of data paths with guaranteed protection switching time. In this paper, the PST-guaranteed scheme, which is based on the concept of short leap shared protection (SLSP), for the arrangement of data paths in DWDM networks is proposed. The proposed scheme provides an efficient procedure to determine a just-enough PST-guaranteed backup paths for a working path. In addition to selecting the PST-guaranteed path, the network cost is also considered in a heuristic manner. The experimental results demonstrate that the paths arranged by the proposed scheme can fully meet the desired PST and the required cost of the selected path is competitive with which of the shared path scheme.

Dynamic Survivable Routing for Shared Segment Protection

  • Tapolcai, Janos;Ho, Pin-Han
    • Journal of Communications and Networks
    • /
    • v.9 no.2
    • /
    • pp.198-209
    • /
    • 2007
  • This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

ATM Network Survivability Enhancement Scheme using Disjoint VP Groups (분리 VP 그룹을 이용한 ATM 망 생존도 향상 방안)

  • Lee, Gil-Heung;Choe, Yong-Hun;Park, Won-Seo;Lee, Jae-Yong;Lee, Sang-Bae
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.8
    • /
    • pp.949-956
    • /
    • 1999
  • 이 논문에서는 ATM (Asynchronous Transfer Mode) 방식의 초고속망의 장애 발생 시 이용자 연결의 QoS (Quality of Service)를 고려하여 복구할 수 있게 하는 보호 망 설계 방안을 제시한다. 제시한 설계 방안에 기초한 비용과 복구 특성을 분석과 모의 실험을 통해 알아본다. 제안하는 망에서의 복구는 분리 VP 그룹 (Disjoint Virtual Path Group, DVPG) 을 사용하는 상태 독립적 (State- independent) 방식으로 복구된다. ATM 망의 운용 및 보호 VP 할당과 용량 배정 문제를 정의하고 이를 바탕으로 최소의 비용을 갖는 VP 망을 설계한다. 망의 고장 시 기존 노드간의 VP 연결은 미리 할당된 링크 또는 노드 분리 보호 VP 경로를 따라 간단한 복구 알고리즘에 의해 빠르게 복구된다. QoS의 고려는 추가 비용을 필요로 하지만 정확한 이용자 연결의 복구를 실현하며, 분리 VP 그룹의 적용은 비용을 상승시키지만, 빠른 복구와 복수의 고장에 대처할 수 있는 방안이 된다.Abstract A cost evaluation of protection scheme for VP-based ATM network is presented here and its related characteristics are evaluated. The proposed and evaluated scheme is a state-independent restoration scheme using a disjoint path group. For fast and simple restoration of failed connections, link disjoint or node disjoint VP groups (DVPG) were utilized in this paper. A VP assignment and capacity planning problem is formulated. When failure occurs, the failed working VPs are switched to the protection VPs of disjoint path groups with a simple restoration scheme. And, cost evaluation and restoration characteristics are presented. The consideration of multiple QoS (Quality of Service) levels and disjoint path group protection scheme require additional network cost but acquire fit and fast restoration.

A Comparative Study on Revetment Techniques in a Restoration Stream (하천복원구간에서 호안공법의 비교 연구)

  • Kim, Sung-Bum;Seo, Young-Min;Jang, Kwang-Jin;Jee, Hong-Kee
    • 한국방재학회:학술대회논문집
    • /
    • 2007.02a
    • /
    • pp.612-615
    • /
    • 2007
  • The environmental damage caused by river-improvement and slope of incision cliff can dest habitations of animate nature and it takes long time for restoration. River system constructed with stability of flood control, fine biotope, harmony with surroundings should be need to protect and restore nature. Therefore, in this study, conduct comparative experiment in various methods which are stable hydraulically and develop vegetation on revetment of bank, stream bed protection and disaster prevention aspect.

  • PDF

A Protection Method with single-bonding system in EHV Underground Transmission Line (초고압 지중 케이블 시스템에 대한 편단접지시의 보호대책)

  • Kim, J.W.;Kang, D.H.;Park, K.R.;Kim, Y.B.
    • Proceedings of the KIEE Conference
    • /
    • 1998.07e
    • /
    • pp.1620-1622
    • /
    • 1998
  • The failure occurs in the system of the underground transmission line, the time of restoration is very long, the damage from stopping power supply is very serious and the cost of restoration is very great. because of these problems, the system and equipment must be protected from every electrical failure by installing protection unit. This study is summarized and compared the effects of configuration method of cable protection device with respect to surges in EHV (Extra High Voltage) underground transmission system.

  • PDF

Protection and restoration path calculation method in T-SDN (Transport SDN) based on multiple ring-mesh topology (다중링-메시 토폴로지 기반 T-SDN(Transport SDN)에서 보호·복구 경로 계산 방식)

  • Hyuncheol Kim
    • Convergence Security Journal
    • /
    • v.23 no.1
    • /
    • pp.3-8
    • /
    • 2023
  • Multi-domain optical transport networks are not fundamentally interoperable and require an integrated orchestration mechanism and path provision mechanism at the entire network level. In addition, ensuring network survivability is one of the important issues. MPLS-TP (Multi-Protocol Label Switching-Transport Profile) defines various protection/recovery methods as standards, but does not mention how to calculate and select protection/recovery paths. Therefore, an algorithm that minimizes protection/recovery collisions at the optical circuit packet integrated network level and calculates and sets a path that can be rapidly protected/recovered over the entire integrated network area is required. In this paper, we proposed an algorithm that calculates and sets up a path that can be rapidly protected and restored in a T-SDN network composed of multiple ring-mesh topology.

(A Network Fault Recovery Algorithm based on a Segment Automatic Restoration Scheme) (세그먼트 자동복구 기반의 네트워크 장애 복구 알고리즘)

  • Shin, Hae-Joon;Kim, Ryung-Min;Kim, Young-Tak
    • 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 development study on the power system operation and protection scheme in Myanmar (미얀마 전력계통 운영 및 보호시스템 구축 사업)

  • Kim, Jong-Hwa;Choi, Young-Sung;Han, Seong-Min;Lee, Duck-Jae
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.34-35
    • /
    • 2008
  • KEPCO conducted a third project in Myanmar regarding system operation and protection scheme. This paper deals with blackout reduction plan, reactive power compensation plan and system restoration procedures in operations parts. Moreover protection system improvement plan and standard protection schemes were suggested.

  • PDF