• Title/Summary/Keyword: network recovery

Search Result 595, Processing Time 0.03 seconds

Influence of polymer coating on SFCL recovery under load

  • Gorbunova, D.A.;Kumarov, D.R.;Scherbakov, V.I.;Sim, Kideok;Hwang, Soon
    • Progress in Superconductivity and Cryogenics
    • /
    • v.21 no.4
    • /
    • pp.44-47
    • /
    • 2019
  • This paper is a study of recovery under load process of superconducting fault current limiter (SFCL). SFCL consists of five parallel-connected high-temperature superconductor (HTS) tapes additionally stabilized by stainless tape. Previously, HTS was heated by current pulse to simulate a short circuit in a power grid. During the cooling period, the current amplitude decreased to 23% or less of HTS critical current value, which is the simulation of network re-switching. When HTS with a polymer coating is cooled, temperature gradient on thermal insulation layer occurs, that prevents a boiling crisis and improves the heat sink into liquid nitrogen. Two samples are coated with a 30 ㎛ and 50 ㎛ polylactide (PLA) layers, reference sample has no polymer coating on it. Samples with a polymer coating show 3-5 times faster cooling than the reference one.

A System Recovery using Hyper-Ledger Fabric BlockChain (하이퍼레저 패브릭 블록체인을 활용한 시스템 복구 기법)

  • Bae, Su-Hwan;Cho, Sun-Ok;Shin, Yong-Tae
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.2
    • /
    • pp.155-161
    • /
    • 2019
  • Currently, numerous companies and institutes provide services using the Internet, and establish and operate Information Systems to manage them efficiently and reliably. The Information System implies the possibility of losing the ability to provide normal services due to a disaster or disability. It is preparing for this by utilizing a disaster recovery system. However, existing disaster recovery systems cannot perform normal recovery if files for system recovery are corrupted. In this paper, we proposed a system that can verify the integrity of the system recovery file and proceed with recovery by utilizing hyper-ledger fabric blockchain. The PBFT consensus algorithm is used to generate the blocks and is performed by the leader node of the blockchain network. In the event of failure, verify the integrity of the recovery file by comparing the hash value of the recovery file with the hash value in the blockchain and proceed with recovery. For the evaluation of proposed techniques, a comparative analysis was conducted based on four items: existing system recovery techniques and data consistency, able to data retention, recovery file integrity, and using the proposed technique, the amount of traffic generated was analyzed to determine whether it was actually applicable.

Network Intelligence based on Network State Information for Connected Vehicles Utilizing Fog Computing (Fog Computing을 적용한 Connected Vehicle 환경에서 상태 정보에 기반한 네트워크 지능화)

  • Park, Seongjin;Yoo, Younghwan
    • Journal of KIISE
    • /
    • v.43 no.12
    • /
    • pp.1420-1427
    • /
    • 2016
  • This paper proposes a method taking advantage of Fog computing and SDN in the connected vehicle environment which is having an unstable communication channel and a dynamic topology. For this purpose, the controller should understand the current state of the overall network by maintaining recent network topology, especially, the mobility information of mobile nodes. These are managed by the controller, and are important in unstable conditions in the mobile environment. The mobility levels are divided into 3 categories. We can efficiently exploit that information. By utilizing network state information, we suggest two outcomes. First, we reduce the control message overhead by adjusting the period of beacon messages. Second, we propose a recovery process to prepare the communication failure. We can efficiently recover connection failure through mobility information. Furthermore, we suggest a path recovery by decoupling the cloud level and the fog level in accordance with application data types. The simulation results show that the control message overhead and the connection failure time are decreased by approximately 55% and 5%, respectively in comparison to the existing method.

Fault/Attack Management Framework for Network Survivability in Next Generation Optical Internet Backbone (차세대 광 인터넷 백본망에서 망생존성을 위한 Fault/Attack Management 프레임워크)

  • 김성운;이준원
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.10
    • /
    • pp.67-78
    • /
    • 2003
  • As optical network technology advances and high bandwidth Internet is demanded for the exponential growth of internet traffic volumes, the Dense-Wavelength Division Multiplexing (DWDM) networks have been widely accepted as a promising approach to the Next Generation Optical Internet (NGOI) backbone networks for nation wide or global coverage. Important issues in the NGOI based on DWDM networks are the Routing and Wavelength Assignment(RWA) problem and survivability. Especially, fault/attack detection, localization and recovery schemes in All Optical Transport Network(AOTN) is one of the most important issues because a short service disruption in DWDM networks carrying extremely high data rates causes loss of vast traffic volumes. In this paper, we suggest a fault/attack management model for NGOI through analyzing fault/attack vulnerability of various optical backbone network devices and propose fault/attack recovery procedure considering Extended-LMP(Link Management Protocol) and RSVP-TE+(Resource Reservation Protocol-Traffic Engineering) as control protocols in IP/GMPLS over DWDM.

Tier-based Proactive Path Selection Mode for Wireless Mesh Networks

  • Fu-Quan, Zhang;Joe, In-Whee;Park, Yong-Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.5
    • /
    • pp.1303-1315
    • /
    • 2012
  • In the draft of the IEEE 802.11s standard, a tree topology is established by the proactive tree-building mode of the Hybrid Wireless Mesh Protocol (HWMP). It is used for cases in which the root station (e.g., gateway) is an end point of the majority of the data connections. In the tree topology, the root or central stations (e.g., parent stations) are connected to the other stations (e.g., leaves) that are one level lower than the central station. Such mesh stations are likely to suffer heavily from contention in bottleneck links when the network has a high traffic load. Moreover, the dependence of the network on such stations is a point of vulnerability. A failure of the central station (e.g., a crash or simply going into sleep mode to save energy) can cripple the whole network in the tree topology. This causes performance degradation for end-to-end transmissions. In a connected mesh topology where the stations having two or more radio links between them are connected in such a way that if a failure subsists in any of the links, the other link could provide the redundancy to the network. We propose a scheme to utilize this characteristic by organizing the network into concentric tiers around the root mesh station. The tier structure facilitates path recovery and congestion control. The resulting mode is referred to as Tier-based Proactive Path Selection Mode (TPPSM). The performance of TPPSM is compared with the proactive tree mode of HWMP. Simulation results show that TPPSM has better performance.

Authenticated Route Optimization Protocol for Network Mobility Support (네트워크 이동성 지원을 위한 인증된 경로 최적화 프로토콜)

  • Koo, Jung-Doo;Lee, Gi-Sung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.4
    • /
    • pp.781-787
    • /
    • 2007
  • Network Mobility (NEMO) basic support protocol doesn't execute the process of route optimization and has not presented the particular security mechanism in other blocks except hi-directional tunnel between Mobile Router (MR) and its Home Agent (HA). Therefore in this paper we process secure route optimization courses through authenticated binding update protocol between MR and its Correspondent Node (CN) and the protocol of the competency of mandate between MR and its Mobile Network Node (MNN); its block also uses an bi-directional tunnel as the block between MR and its HA. The address of each node are generated by the way of Cryptographically Generated Address (CGA) for proving the ownership of address. Finally we analyze the robustness of proposed protocol using security requirements of MIPv6 and existing attacks and the efficiency of this protocol using the connectivity recovery and end-to-end packet transmission delay time.

  • PDF

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

Optimal heat exchanger network synthesis through heuristics and system separation method (경험법칙과 계의 분리법을 통한 최적 열교환망 합성)

  • Lee, Hae-Pyeong;Ryu, Gyeong-Ok
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.1 no.2
    • /
    • pp.119-126
    • /
    • 1995
  • The purpose of this study is to develop the technique of energy recovery and energy saving by using the optimization of heat exchanger network synthesis. This article proposes a new method of determining the optimal target of a heat exchanger network synthesis problem of which data feature multiple pinch points. The system separation method we suggest here is to subdivide the original system into independent subsystems with one pinch point. The optimal cost target was evaluated and the original pinch rules at each subsystem were employed. The software developed in this study was applied to the Alko prosess, which is an alcohol production process, for the synthesis of heat exchanger network. It was possible to save about 15% of the total annual cost.

  • PDF

Transmission Pricing Methodology for Korean Wholesale Electricity Market (도매경쟁 전력시장에서의 송전요금 산정방식)

  • Lee, K.D.;Rhee, C.H.;Oh, T.K.;Park, B.Y.;Kim, Y.W.;Kim, Y.C.
    • Proceedings of the KIEE Conference
    • /
    • 2001.11b
    • /
    • pp.192-194
    • /
    • 2001
  • The Transmission network provides physical transport, network security, and connection services. The five principles of Transmission pricing are economic efficiency, cost recovery, efficient regulation, simplicity and transparency, non-discrimination. The Transmission Charges are made up of transmission connection charge and transmission charge of network. The Transmission Losses will be considered through Marginal Transmission Loss Factors in the market operation. The transmission loss rentals are used for the reduction of the annual revenue requirement of the transmission network for the purpose of derivation of transmission use of network charge.

  • PDF

Redundancy Path Routing Considering Associativity in Ad Hoc Networks (Ad Hoc Network에서 Associativity을 고려한 Redundancy 경로 라우팅)

  • 이학후;안순신
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10c
    • /
    • pp.199-201
    • /
    • 2003
  • Ad hoc network은 stationary infrastructure의 도움 없이 이동 노드들이 필요 시 network 형태을 구성하여 통신이 이루어지게 하는 network으로 ad hoc network 환경에 맞는 다양한 라우팅 프로토콜들이 개발되었고 크게는 table­driven, on­demand 방식으로 나눌 수 있는데 on­demand 방식의 AODV 프로토콜은 routing overhead가 적다는 장점이 있는 반면 single path로 data forwarding을 진행하여 중간노드의 이동에 의한 path가 broken되는 경우 local routing을 하거나 새로이 source­initialed route rediscovery을 수행하여 전송 delay 및 control traffic overhead 등을 높이는 결과를 발생 시켰다. 본 논문은 single path로 구성되는 AODV 프로토콜의 route failures시 문제점을 보완한 Associativity Based Redundancy path Routing(ABRR) 및 Alternate Redundancy path Routing(ARR) schemes을 제안한다. 첫째, ABRR은 main path상에 있는 각 노드들은 associativity based stable node 정보를 이용하여 path broken 이전에 local redundancy path을 구성하여 path broken시 local routing없이 route을 복구할 수 있게 하고 둘째, ARR은 source­initialed route discovery에 의해 alternate path을 구성하여 ABRR 그리고 local routing에 의해 main route recovery 실패 시 alternate path을 main path로 전환하여 control traffic overhead 및 전송 delay을 줄이게 한다.

  • PDF