• Title/Summary/Keyword: Fast Restoration

Search Result 139, Processing Time 0.034 seconds

Enhanced p-Cycles for WDM Optical Network with Limited Wavelength Converters (제한된 광 파장변환 기능을 가지는 WDM망을 고려한 개선된 p-Cycle 기법)

  • Shin, Sang-Heon;Shin, Hae-Joon;Kim, Young-Tak
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3B
    • /
    • pp.200-208
    • /
    • 2003
  • In this paper, we propose an enhanced p-cycles (preconfigured protection cycles) scheme for fast restoration in WDM (Wavelength Division Multiplexing) optical mesh network with limited wavelength conversion for fast restoration. We enhanced the p-cycles to accommodate uni-directional connections to be used in uni-directional multicasting or asymmetric broadband multimedia communications with bi-directional connectivity. We applied it to WDM network with limited wavelength conversion and analyzed the result. The analysis results show that the enhanced p-cycle algorithm provides better performance in WDM optical networks with limited wavelength converter.

THE FAST TRUNCATED LAGRANGE METHOD FOR IMAGE DEBLURRING WITH ANTIREFLECTIVE BOUNDARY CONDITIONS

  • Oh, SeYoung;Kwon, SunJoo
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.31 no.1
    • /
    • pp.137-149
    • /
    • 2018
  • In this paper, under the assumption of the symmetry point spread function, antireflective boundary conditions(AR-BCs) are considered in connection with the fast truncated Lagrange(FTL) method. The FTL method is proposed as an image restoration method for large-scale ill-conditioned BTTB(block Toeplitz with Toeplitz block) and BTHHTB(block Toeplitz-plus-Hankel matrix with Toeplitz-plus-Hankel blocks) linear systems([13, 17]). The implementation and efficiency of the FTL method in the AR-BCs are further illustrated. Especially, by employing the AR-BCs, both the continuity of the image and the continuity of its normal derivative are preserved at the boundary. A reconstructed image with less artifacts at the boundary is obtained as a result.

Management and Control Scheme for Next Generation Packet-Optical Transport Network (차세대 패킷광 통합망 관리 및 제어기술 연구)

  • Kang, Hyun-Joong;Kim, Hyun-Cheol
    • Convergence Security Journal
    • /
    • v.12 no.1
    • /
    • pp.35-42
    • /
    • 2012
  • Increase of data traffic and the advent of new real-time services require to change from the traditional TDM-based (Time Division Multiplexing) networks to the optical networks that soft and dynamic configuration. Voice and lease line services are main service area of the traditional TDM-based networks. This optical network became main infrastructure that offer many channel that can convey data, video, and voice. To provide high resilience against failures, Packet-optical networks must have an ability to maintain an acceptable level of service during network failures. Fast and resource optimized lightpath restoration strategies are urgent requirements for the near future Packet-optical networks with a Generalized Multi-Protocol Label Switching(GMPLS) control plane. The goal of this paper is to provide packet-optical network with a hierarchical multi-layer recovery in order to fast and coordinated restoration in packet-optical network/GMPLS, focusing on new implementation information. The proposed schemes do not need an extension of optical network signaling (routing) protocols for support.

A Study on MPLS OAM Functions for Fast LSP Restoration on MPLS Network (MPLS 망에서의 신속한 LSP 복구를 위한 MPLS OAM 기능 연구)

  • 신해준;임은혁;장재준;김영탁
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.7C
    • /
    • pp.677-684
    • /
    • 2002
  • Today's Internet does not have efficient traffic engineering mechanism to support QoS for the explosive increasing internet traffic such as various multimedia traffic. This functional shortage degrades prominently the quality of service, and makes it difficult to provide multi-media service and real-time service. Various technologies are under developed to solve these problems. IETF (Internet Engineering Task Force) developed the MPLS (Multi-Protocol Label Switching) technology that provides a good capabilities of traffic engineering and is independent layer 2 protocol, so MPLS is expected to be used in the Internet backbone network$\^$[1][2]/. The faults occurring in high-speed network such as MPLS, may cause massive data loss and degrade quality of service. So fast network restoration function is essential requirement. Because MPLS is independent to layer 2 protocol, the fault detection and reporting mechanism for restoration should also be independent to layer 2 protocol. In this paper, we present the experimental results of the MPLS OAM function for the performance monitoring and fault detection 'll'&'ll' notification, localization in MPLS network, based on the OPNET network simulator

PC Cluster Based Parallel Genetic Algorithm-Tabu Search for Service Restoration of Distribution Systems (PC 클러스터 기반 병렬 유전 알고리즘-타부 탐색을 이용한 배전계통 고장 복구)

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.54 no.8
    • /
    • pp.375-387
    • /
    • 2005
  • This paper presents an application of parallel Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution systems. The main objective of service restoration of distribution systems is, when a fault or overload occurs, to restore as much load as possible by transferring the do-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints, which is a combinatorial optimization problem. This problem has many constraints with many local minima to solve the optimal switch position. This paper develops parallel GA-TS algorithm for service restoration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solutions of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper $10\%$ of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC cluster system consists of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the validity of the proposed method, proposed algorithm has been tested with a practical distribution system in Korea. From the simulation results, we can find that the proposed algorithm is efficient for the distribution system service restoration in terms of the solution quality, speedup, efficiency and computation time.

Restoration effects influenced by plant species and landscape context in Young-il region, Southeast Korea: Structural and compositional assessment on restored forest

  • Cho, Yong-Chan;Kim, Kyung-Soon;Pi, Jung-Hun;Lee, Chang-Seok
    • Journal of Ecology and Environment
    • /
    • v.39 no.1
    • /
    • pp.1-10
    • /
    • 2016
  • Despite it has been mentioned that the successful restoration in landscape level was achieved in the Young-il soil erosion control project, quantitative evaluation of restored plant communities (Alnus firma as introduced species and Pinus thunbergii as native species) was hardly founded. Light availability, litter and woody debris cover, and forest structure and composition were determined for 500 m2 band-quadrat in three forest types. Abiotic factors of Q. serrata stands, as reference forest, and A. firma stands were similar but not for P. thunbergii stands. There were no significant difference on mean stem density (stems ha-1, H = 3.6, p = 0.162), and the mean basal area of each stand had marginal significance (m2 ha-1, H = 5.7, p = 0.058) among stands as total basal area was higher with the order of A. firma (21.4 m2 ha-1), P. thunbergii (19.8 m2 ha-1) and Q. serrata (16.2 m2 ha-1). Restoration of vegetation structure was more effective in fast-growing and N-fixing A. firma, as introduced species plantation. However, result of MRPP, NMS ordination and ISPAN for herbaceous layer, not for tree and shrub species composition, indicated that restoration of ground vegetation was likely influenced highly from local environment. Propagule availability from landscape context such as connectedness to natural vegetation and management practices in restored isolated stands are available explanations for restoration effects and gaps between restored plantations and secondary oak forest.

Schemes to Overcome ATM VC Switch Failures using Backup Virtual Paths (예비 가상 경로를 이용한 ATM VC 교환기 고장 우회 방법)

  • Yoo, Young-Hwan;Ahn, Sang-Hyun;Kim, Chong-Sang
    • Journal of KIISE:Information Networking
    • /
    • v.27 no.2
    • /
    • pp.187-196
    • /
    • 2000
  • Failures in ATM networks can occur at virtual path (VP) links, virtual path switches, and virtual channel (VC) switches. Restoration schemes have been proposed for VP link and VP switch failures, however, none for VC switch failures. In general, VC switches are used for edge nodes in protection domains. Since even only one VC switch failure can cause a critical problem, new restoration schemes for VC switch failures are highly required. Restoration schemes at the VP level proposed so far can be categorized into those using the flooding algorithm and those using the backup virtual path (BVP) concept. Even though the latter cannot handle unpredictable failures, it has some advantages such as fast restoration and low spare capacity requirement. In this paper, we propose new restoration schemes using a new type of BVPs to handle VC switch failures. The simulation results show that the proposed schemes can restore virtual connection failures due to VC switch failures without degrading restorability for VP failures.

  • PDF

Performance Evaluation of Service-Aware Optical Transport System

  • Youn, Ji-Wook;Yu, Jea-Hoon;Yoo, Tae-Whan
    • ETRI Journal
    • /
    • v.32 no.2
    • /
    • pp.241-247
    • /
    • 2010
  • We propose and experimentally demonstrate a service-aware optical transport system. The proposed service-aware optical transport system makes a flow based on service type and priority of traffic. The generated flow is mapped to a corresponding sub-${\lambda}$ for transport over an optical network. Using sub-${\lambda}$ provided by the centralized control plane, we could effectively provide quality-of-service guaranteed Ethernet service and best-effort service simultaneously in a single link. The committed information rate (CIR) traffic and best-effort traffic are assigned to different sub-${\lambda}s$. The bandwidth of the CIR traffic is guaranteed without being affected by violation traffic because the bandwidth is managed per each sub-${\lambda}$. The failure detection time and restoration time from a link failure is measured to be about 60 ${\mu}s$ and 22 ms, respectively, in the ring network. The measured restoration time is much smaller than the 50 ms industry requirement for real-time services. The fast restoration time allows the proposed service-aware optical transport system to offer high availability and reliability which is a requirement for transport networks.

A Restoration Schemes using Source Routing based on Topology DB on ATM Network (ATM망에서 토폴로지 DB기반 소스라우팅을 이용한 장애복구 방안)

  • 김형철;곽윤식;이대영
    • 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).

  • PDF

Adaptive Image Restoration Using Local Characteristics of Degradation (국부 훼손특성을 이용한 적응적 영상복원)

  • 김태선;이태홍
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.4
    • /
    • pp.365-371
    • /
    • 2000
  • To restore image degraded by out-of-focus blur and additive noise, an iterative restoration is used. Acceleration parameter is usually applied equally to all over the image without considering the local characteristics of degraded images. As a result, the conventional methods are not effective in restoring severely degraded edge region and shows slow convergence rate. To solve this problem we propose an adaptive iterative restoration according to local degradation, in which the acceleration parameter has low value in flat region that is less degraded and high value in edge region that is more degraded. Through experiments, we verified that the proposed method showed better results with fast convergence rate, showed Visually better image in edge region and lower MSE than the conventional methods.

  • PDF