• Title/Summary/Keyword: segment protection

Search Result 54, Processing Time 0.032 seconds

A Study on an Application of the Protection for the Visual Segment of the Approach Procedure focused on Taean Airport (접근절차의 시계구간 보호 적용 연구 - 태안비행장을 중심으로 -)

  • Kim, Dohyun;Hong, Seung Beom
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.22 no.2
    • /
    • pp.9-15
    • /
    • 2014
  • 'Visual segment surface' means a surface that extends from the missed approach point of non precision approaches (or the decision altitude location for approaches with vertical guidance and precision approaches) to the threshold to facilitate the identification of and protection from obstacles in this visual segment of the approach. Validation is the necessary final quality assurance step in the procedure design process, prior to publication. The purpose of validation is the verification of all obstacle and navigation data, and assessment of flyability of the procedure. This paper shows how to apply the protection for the visual segment of the approach procedure, and the results of the validation for visual segment surface conducted at an airport.

Enhanced Dynamic Segment Protection in WDM Optical Networks under Reliability Constraints

  • Guo, Lei;Cao, Jin;Yu, Hongfang;Li, Lemin
    • ETRI Journal
    • /
    • v.28 no.1
    • /
    • pp.99-102
    • /
    • 2006
  • In this letter, we study the protection problem in wavelength division multiplexing (WDM) optical networks, and propose a novel dynamic heuristic algorithm called differentiated reliable segment protection (DRSP). Differing from previous work, DRSP can effectively avoid the trap problem and is able to find a feasible solution for each connection request. Therefore, DRSP outperforms the previous work. Simulation results have shown to be promising.

  • PDF

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.

A Novel Shared Segment Protection Algorithm for Multicast Sessions in Mesh WDM Networks

  • Lu, Cai;Luo, Hongbin;Wang, Sheng;Li, Lemin
    • ETRI Journal
    • /
    • v.28 no.3
    • /
    • pp.329-336
    • /
    • 2006
  • This paper investigates the problem of protecting multicast sessions in mesh wavelength-division multiplexing (WDM) networks against single link failures, for example, a fiber cut in optical networks. First, we study the two characteristics of multicast sessions in mesh WDM networks with sparse light splitter configuration. Traditionally, a multicast tree does not contain any circles, and the first characteristic is that a multicast tree has better performance if it contains some circles. Note that a multicast tree has several branches. If a path is added between the leave nodes on different branches, the segment between them on the multicast tree is protected. Based the two characteristics, the survivable multicast sessions routing problem is formulated into an Integer Linear Programming (ILP). Then, a heuristic algorithm, named the adaptive shared segment protection (ASSP) algorithm, is proposed for multicast sessions. The ASSP algorithm need not previously identify the segments for a multicast tree. The segments are determined during the algorithm process. Comparisons are made between the ASSP and two other reported schemes, link disjoint trees (LDT) and shared disjoint paths (SDP), in terms of blocking probability and resource cost on CERNET and USNET topologies. Simulations show that the ASSP algorithm has better performance than other existing schemes.

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

Change analysis with A.C of D.C electric railway (직류 전기철도의 교류화 분석)

  • Kim, Youn-Sik;Lee, Gi-Seung;Sim, Jae-Suk
    • Proceedings of the KSR Conference
    • /
    • 2008.11b
    • /
    • pp.151-156
    • /
    • 2008
  • The after 1974 capital region electric railroad is opened to traffic Koraill and Seoul metro adopt each other different power supply method and they operate and they are come. AC 25[kv] method voltage the insulation becomes larger standing distance highly, the case tunnel section which will introduce in the underground segment becomes on a large scale and the cost of construction increases to the city center and the underground segment adoption of DC method was many. To recent times with R-bar (Rigid-bar) introductions change of tunnel section the introduction of AC method came to be easy without in the underground segment. Operates sees in the electric protection where the Seoul metro and the Korail are different each other and, from the dead section segment the interior electric light to put out lights the passenger brings about inconveniently and the civil appeal which demands a power supply method unification occurs, within the company interchange electric railroad brazier safety improvement and maintenance expense curtailment etc. the flaw is original proposal, is a condition which finishes a feasibility study service about the power supply method fringe land. Interchange analysis of the DC electric railway it leads from the present paper and it compares under analyzing being it could be reflected to also the route which is in the process of actual using boil the strong point and a weak point of DC and AC method of the establishment route constructive at the time of and

  • PDF

Experimental evaluation of fire protection measures for the segment joint of an immersed tunnel (침매터널 세그먼트조인트의 내화 대책에 대한 실험적 평가)

  • Choi, Soon-Wook;Chang, Soo-Ho;Kim, Heung-Youl;Jo, Bong-Hyun
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.13 no.3
    • /
    • pp.177-197
    • /
    • 2011
  • In this study, a series of fire experiments under $HC_{inc}$ and ISO834 (duration of 4 hour) fire scenarios were carried out for three different types of fire protection measures for the segment joint to evaluate their applicabilities to an immersed tunnel. The experimental results revealed that an expansion joint installed to allow relative movements between concrete element ends in an segment joint is the most vulnerable to a severe fire. For the fire protection measure where the originally designed steel plates at an expansion joint arc replaced by fire-resistant boards, the experiments showed that they cannot achieve good fireproofing performance under both $HC_{inc}$ fire scenario and ISO834 (4 hour) fire scenarios since the installation of fire-resistant boards results in the reduction of the sprayed fire insulation thickness. On the other hand, the application of modified bent steel plates replacing the original steel plates was proved to be very successful in fireproofing of the expansion joint due to more sprayed materials filled in bent steel plate than in the original design concept as well as higher adhesion between the steel plate and the sprayed fire insulation layer.

Protection of a Multicast Connection Request in an Elastic Optical Network Using Shared Protection

  • BODJRE, Aka Hugues Felix;ADEPO, Joel;COULIBALY, Adama;BABRI, Michel
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.1
    • /
    • pp.119-124
    • /
    • 2021
  • Elastic Optical Networks (EONs) allow to solve the high demand for bandwidth due to the increase in the number of internet users and the explosion of multicast applications. To support multicast applications, network operator computes a tree-shaped path, which is a set of optical channels. Generally, the demand for bandwidth on an optical channel is enormous so that, if there is a single fiber failure, it could cause a serious interruption in data transmission and a huge loss of data. To avoid serious interruption in data transmission, the tree-shaped path of a multicast connection may be protected. Several works have been proposed methods to do this. But these works may cause the duplication of some resources after recovery due to a link failure. Therefore, this duplication can lead to inefficient use of network resources. Our work consists to propose a method of protection that eliminates the link that causes duplication so that, the final backup path structure after link failure is a tree. Evaluations and analyses have shown that our method uses less backup resources than methods for protection of a multicast connection.

Molecular Characterization of a Novel Putative Partitivirus Infecting Cytospora sacchari, a Plant Pathogenic Fungus

  • Peyambari, Mahtab;Habibi, Mina Koohi;Fotouhifar, Khalil-Berdi;Dizadji, Akbar;Roossinck, Marilyn J.
    • The Plant Pathology Journal
    • /
    • v.30 no.2
    • /
    • pp.151-158
    • /
    • 2014
  • Three double-stranded RNAs (dsRNAs), approximately 1.85, 1.65 and 1.27 kb in size, were detected in an isolate of Cytospora sacchari from Iran. Partial nucleotide sequence revealed a 1,284 bp segment containing one ORF that potentially encodes a 405 aa protein. This protein contains conserved motifs related to RNA dependent RNA polymerases (RdRp) that showed similarity to RdRps of partitiviruses. The results indicate that these dsRNAs represent a novel Partitivirus that we tentatively designate Cytospora sacchari partitivirus (CsPV). Treatment of the fungal strain by cyclohexamide and also hyphal tip culture had no effect on removing the putative virus. Phylogenetic analysis of putative RdRp of CsPV and other partitiviruses places CsPV as a member of the genus Partitivirus in the family Partitiviridae, and clustering with Aspergillus ochraceous virus 1.