• Title/Summary/Keyword: Link Protection

Search Result 149, Processing Time 0.027 seconds

An Improved Shared-Path Protection Algorithm for Double-Link Failures in Meshed WDM Optical Networks

  • Wang, Xingwei;Guo, Lei;Li, Lemin;Wei, Xuetao
    • Journal of Communications and Networks
    • /
    • v.10 no.3
    • /
    • pp.331-337
    • /
    • 2008
  • In this paper, we investigate survivability in wavelength division multiplexing (WDM) mesh networks and propose a new algorithm called improved shared-path protection (ISPP) to completely tolerate the double-link failures. Compared with previous algorithms for protecting double-link failures, i.e., shared-path protection (SPP) and shared-link protection (SLP), the advantage of ISPP is to allow primary paths and backup paths to share the mixed wavelength-links based on the proposed new rules in which some primary wavelength-links can be changed to mixed wavelength-links, which can be shared by primary paths and backup paths. In addition, some mixed wavelength-links also can be shared by different backup paths for saving resources. Simulation results show that ISPP algorithm performs better in resource utilization ratio and blocking probability than conventional SPP and SLP algorithms.

Study on Pedestrian Protection device in collision using Pneumatic cylinder and simple link mechanism (공압 실린더 및 단순 링크기구를 이용한 충돌 보행자 보호 장치에 관한 연구)

  • Noh, S.H.;Lee, D.R.
    • Journal of Power System Engineering
    • /
    • v.12 no.4
    • /
    • pp.64-71
    • /
    • 2008
  • This study is on pedestrian protection device using pneumatic cylinder and simple link mechanism when vehicle collide with pedestrian. This study ensured the safety space between engine and hood after it applies to simple link mechanism and pneumatic cylinder. It can absorb the damage which measure the specific device if vehicle collide with pedestrian. Combination of simple link mechanism and pneumatic cylinder was more superior than the present pedestrian protection device. Simple link mechanism could confirm superior height and survival probability than when only cylinder operated. It also ensured enough space between engine and hood. And if a cylinder is not working because of old cylinder, poor repair or damage of accident vertical cylinder would be difficult to execute because there exists the irregular space between engine and hood. If simple link mechanism operates with only one cylinder it could ensure the regular space because simple link mechanism set up at the middle of hood. So this device could confirm high safety for pedestrian.

  • PDF

A Report on Test Results of Fusible-Link Type Heat Responsive Links (Fusible Link Type 감열체 성능시험보고)

  • Gwon, O-Seung
    • Fire Protection Technology
    • /
    • s.10
    • /
    • pp.5-8
    • /
    • 1991
  • This report is explained about test results of heat responsive links for fire protection service, such as fire dampers and fire doors, automatic fire suppression systems and so forth. The testing program was progressed divided by two testing items, external appearance test and performance test. The object of this report is present the problem which appear from the analysis of test results.

  • PDF

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.

Advance Reservation Framework with Protection Management for Virtual Circuit Services (가상회선 서비스를 위해 보호 관리 기능을 갖는 사전 예약 프레임워크)

  • Lim, Huhnkuk;Lee, Kyungmin;Cha, Youngwook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.11
    • /
    • pp.902-910
    • /
    • 2013
  • The most representative research network in Korea, KREONET, has developed DynamicKL, an advance reservation based Network Service Agent (NSA) for user driven virtual circuit services. DynamicKL provides reservation, provisioning, release, termination, and inquiry web services for network resources by using an open standard network service interface (NSI), as well as web services for network resources by using a GUI interface. In addition, it has the RICE interface to support a protection management function per VC for virtual circuits and reservations. In this article, a protection management per VC for provisioned VCs and reservations is addressed in the DynamicKL framework, as a contribution to the VC protection management issue, which results in more manageable and reliable VC services compared to other advance reservation frameworks. An administrator can detect successful or unsuccessful VC protections in the event of a primary link failure and successful or unsuccessful VC retrievals after a primary link repair, by using RICE.

Energy-efficient Multicast Algorithm for Survivable WDM Networks

  • Pu, Xiaojuan;Kim, Young-Chon
    • Current Optics and Photonics
    • /
    • v.1 no.4
    • /
    • pp.315-324
    • /
    • 2017
  • In recent years, multicast services such as high-definition television (HDTV), video conferencing, interactive distance learning, and distributed games have increased exponentially, and wavelength-division multiplexing (WDM) networks are considered to be a promising technology due to their support for multicast applications. Multicast survivability in WDM networks has been the focus of extensive attention since a single-link failure in an optical network may result in a massive loss of data. But the improvement of network survivability increases energy consumption due to more resource allocation for protection. In this paper, an energy-efficient multicast algorithm (EEMA) is proposed to reduce energy consumption in WDM networks. Two cost functions are defined based on the link state to determine both working and protection paths for a multicast request in WDM networks. To increase the number of sleeping links, the link cost function of the working path aims to integrate new working path into the links with more working paths. Sleeping links indicate the links in sleep mode, which do not have any working path. To increase bandwidth utilization by sharing spare capacity, the cost function of the protection path is defined to use sleeping fibers for establishing new protection paths. Finally, the performance of the proposed algorithm is evaluated in terms of energy consumption, and also the blocking probability is evaluated under various traffic environments through OPNET. Simulation results show that our algorithm reduces energy consumption while maintaining the quality of service.

Efficient Protection/Restoration by Separation of Domains in Optical Networks (광 네트워크에서의 도메인 분리에 의향 효율적인 보호복구)

  • Yim Soon-Bin;An Hyun-Ki;Lee Tae-Jin
    • The KIPS Transactions:PartC
    • /
    • v.12C no.1 s.97
    • /
    • pp.77-82
    • /
    • 2005
  • Protection of user service becomes increasingly important since even very short interruption of service due to link or node failure will cause huge data loss and incur tremendous restoration cost in high speed network environment. Thus fast and efficient protection and restoration is one of the most important issues to be addressed. Protection methods have been proposed to provide efficiency and stability in optical networks. In this paper, an original network is separated into several domains using Hamiltonian cycle. and link protection is performed on the cycles of the domains. We have shown that protection path length can be decreased up to $57{\%}$ with marginal increase of backup capacity. Our proposed method can provide high-speed protection with marginal increase of protection capacity.

A Link Protection Scheme with a Backup Link Spanning Tree for Provider Backbone Bridged Networks and Implementation (프로바이더 백본 브리지 망을 위한 백업링크 스패닝트리 기반 링크장애 복구기능과 구현)

  • Nam, Wie-Jung;Lee, Hyun-Joo;Yoon, Chong-Ho;Hong, Won-Taek;Moon, Jeong-Hoon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.1
    • /
    • pp.58-68
    • /
    • 2010
  • In this paper, we propose an efficient link protection switching scheme for provider backbone bridge systems with a spanning tree for backup links exclusively, and evaluate its performance. The proposed scheme offers guaranteed QoS flows even when a link fault occurrs in the primary link by flooding the flows over the profiled spanning tree. The flooding mechanism over the spanning tree can also provide low latency and remove the loopback flows. We also derive the efficiency of bandwidth usage for the normal flows and the number of lost frames during the link restoration. For evaluating its feasibility, we implement a prototype of PBB-TE systems based on the Linux bridge codes, which can support both link protection switching capability with CCM and MAC-in-MAC encapsulation. A related protocol analyzer is also developed. One can see that the proposed scheme and the prototype can be useful for developing carrier class Ethernet systems based on PBB-TE.

Routing and Wavelength Assignment in Survivable WDM Networks without Wavelength Conversion

  • Lee, Tae-Han;Park, Sung-Soo;Lee, Kyung-Sik
    • Management Science and Financial Engineering
    • /
    • v.11 no.2
    • /
    • pp.85-103
    • /
    • 2005
  • In this paper, we consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it. Though the formulation has exponentially many variables, we solve the linear programming relaxation of it by using column generation technique. We devise a branch-and price algorithm to solve the column generation problem. After solving the linear programming relaxation, we apply a variable fixing procedure combined with the column generation to get an integral solution. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.

Improvement of Reliability in V5.2 Link Identification Procedure (V5.2 링크 식별 절차의 신뢰성 향상 방안)

  • 이충돈;김영화방효찬최승욱
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.249-252
    • /
    • 1998
  • ETSI(European Telecommunications Standards Institute) 300 34701, ITU-T(International Telecommunication Union) G.965 recommended PSTN, CONTROL, LINK CONTROL, BCC, PROTECTION protocols on V-Interfaces. But it is possible to occur misalignment between LE(Local Exchange) and AN(Access Network), especially in link identification procedure because there isn't any comment about V5.2 system management. In this paper we propose S/W guard timer to improve reliability in V5.2 link identification procedure in scope of Recommendation.

  • PDF