• Title/Summary/Keyword: path failure

Search Result 352, Processing Time 0.046 seconds

Analysis of the Bandwidth Consumed by Restoration Paths for Service Guarantee in the Protection Switching Scheme (보호 스위칭에 의한 경로 설정에 있어서 서비스 보장을 위한 복구 경로의 소비 대역 분석)

  • Lee, Hwang-Kyu;Hong, Sug-Won
    • The KIPS Transactions:PartC
    • /
    • v.10C no.2
    • /
    • pp.155-162
    • /
    • 2003
  • Fast restoration time and service guarantee are the important goals to achieve the network reliability. In the protection switching scheme, one way to guarantee service fro an application session if a network happens to fail is to establish the restoration path that amounts to the same bandwidth of the working path of the session at the same time. When we setup the restoration path, we can reduce the bandwidth consumption by the restoration path if the path can share the bandwidth required by the other paths. This paper explains the methods how to determine the shared bandwidth of the restoration path in the protection switching scheme, given the maximum bandwidth assigned to a link along the working path. We point out that such sharing algorithm can not reduce the bandwidth consumption by the restoration paths in some cases, which contradict the general conception. We explain why this can happen, and show the simulation results in real network topologies to prove our arguments. We explain the reason of the failure of the sharing effect by the simple sharing algorithm. Finally we propose the way of how we can overcome the failure of the sharing effect, using the complete sharing algorithm based on the link database and showing the results.

Study on the influence of structural and ground motion uncertainties on the failure mechanism of transmission towers

  • Zhaoyang Fu;Li Tian;Xianchao Luo;Haiyang Pan;Juncai Liu;Chuncheng Liu
    • Earthquakes and Structures
    • /
    • v.26 no.4
    • /
    • pp.311-326
    • /
    • 2024
  • Transmission tower structures are particularly susceptible to damage and even collapse under strong seismic ground motions. Conventional seismic analyses of transmission towers are usually performed by considering only ground motion uncertainty while ignoring structural uncertainty; consequently, the performance evaluation and failure prediction may be inaccurate. In this context, the present study numerically investigates the seismic responses and failure mechanism of transmission towers by considering multiple sources of uncertainty. To this end, an existing transmission tower is chosen, and the corresponding three-dimensional finite element model is created in ABAQUS software. Sensitivity analysis is carried out to identify the relative importance of the uncertain parameters in the seismic responses of transmission towers. The numerical results indicate that the impacts of the structural damping ratio, elastic modulus and yield strength on the seismic responses of the transmission tower are relatively large. Subsequently, a set of 20 uncertainty models are established based on random samples of various parameter combinations generated by the Latin hypercube sampling (LHS) method. An uncertainty analysis is performed for these uncertainty models to clarify the impacts of uncertain structural factors on the seismic responses and failure mechanism (ultimate bearing capacity and failure path). The numerical results show that structural uncertainty has a significant influence on the seismic responses and failure mechanism of transmission towers; different possible failure paths exist for the uncertainty models, whereas only one exists for the deterministic model, and the ultimate bearing capacity of transmission towers is more sensitive to the variation in material parameters than that in geometrical parameters. This research is expected to provide an in-depth understanding of the influence of structural uncertainty on the seismic demand assessment of transmission towers.

Faster Detouring for Data Plane Failures in Software Defined Networks (SDN에서 데이터 평면 장애를 해결하는 빠른 우회 기법)

  • Thorat, Pankaj;Yeom, Sanggil;Choo, Hyunseung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2016.04a
    • /
    • pp.124-126
    • /
    • 2016
  • Successful deployment of the Software Defined Network (SDN) depends on its ability to cope up with network failures. There are various types of failures that may occur in an SDN. The most common are switch and link failures. It is necessary to recover the network from failures for a continuous service availability. But for the real-time services fast recovery from the failure is required to minimize the service disruption time. In the proposed work, we focused on minimizing the recovery time after the failure is detected. Once the failure is detected, the controller involvement is needed to dynamically reroute the failure disrupted flows from the failed component to an alternate path. The aim of the proposed scheme is to provide a traffic management scheme which can react to the dynamic network events by rapidly modifying the forwarding behavior of the switches for faster in-band network adaptability. The proposed scheme (1) Considers the shared data and control path delay (2) Optimally utilize the network resources (3) Eliminates the need of constant monitoring overhead at the controller which results into faster detouring and ultimately rapid recovery.

Packet Lossless Fast Rerouting Scheme without Buffer Delay Problem in MPLS Networks (MPLS망에서 버퍼지연 문제가 발생하지 않는 무손실 Fast Rerouting 기법)

  • 신상헌;신해준;김영탁
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.2
    • /
    • pp.233-241
    • /
    • 2004
  • In this paper, we propose a packet-lossless fast rerouting scheme at a link/node fault in MPLS (Multiprotocol Label Switching) network with minimized accumulated buffer delay problem at ingress node. The proposed scheme uses a predefined, alternative LSP (Label Switched Path) In order to restore user traffic. We propose two restoration approaches. In the first approach, an alternative LSP is initially allocated with more bandwidth than the protected working LSP during the failure recovery phase. After the failure recovery, the excessively allocated bandwidth of the alternative LSP is readjusted to the bandwidth of the working LSP. In the second approach, we reduce the length of protected working LSP by using segment-based restoration. The proposed approaches have merits of (ⅰ) no buffer delay problem after failure recovery at ingress node, and (ⅱ) the smaller required buffer size at the ingress node than the previous approach.

On-Line Monitoring of Microscopic Fracture Behavior of Concrete Using Acoustic Emission (음향방출을 이용한 콘크리트 부재의 미시적 파괴특성의 On-Line Monitoring)

  • 이준현;이진경;장일영;윤동진
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 1998.04b
    • /
    • pp.677-682
    • /
    • 1998
  • Concrete is an inhomogeneous material consisting of larger aggregates and sand embedded in a cement paste matrix. In this study, an acoustic emission technique has been used to clarify the microscope failure mechanisms of concrete under three point bending test. AE source location has also been done to monitor the activities of internal damage and the progress of microscopic failure path during the loading. The relationship between AE characteristic and microscopic and microscopic failure mechanism is discussed.

  • PDF

Bayesian reliability prediction under event tree (Event tree하에서 베이지안 기법을 이용한 신뢰도 예측)

  • 박철순;전치혁;양희중;장수영
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1993.10a
    • /
    • pp.24-30
    • /
    • 1993
  • When modeling a complex system we use an event tree to analyze propagation of failure. An event tree cannot represent the statistical interrelationships among parameters, but it can be represented as a statistically identical influence diagram so that parameter updating can be easily performed. After updating parameters we can calculate posterior distribution of the failure rate for each path. But exact distribution requires considerably complex numerical integration. We propose an approximation method to calculate the posterior and derive the predictive distribution of the time to next failure. Finally we introduce the system which implements our methodology.

  • PDF

GLSP setup algorithm based on a GMPLS (GMPLS 기반의 GLSP 경로 설정 알고리즘)

  • Kim, Kyoung-Mok;Oh, Young-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.11 s.353
    • /
    • pp.192-199
    • /
    • 2006
  • Establishment of bandwidth and effective traffic processing are required to treat various traffics according to a rapid increase in Internet traffic. A path setup algorithm was introduced to support backbone franc processing but the failure probability is increasing according to fixed operation in nodes. In other words, fixed maximum permitted time can be raised failure probability. So as to solve this problem, this paper introduces variable path setup time algorithm which support channel service of excessive traffic that is generated from not allowed channel. We proposed GLSP(Generalized Label Switch Path) setup algorithm that use variable path setup time parameters. This algorithm can improve path setup probabilities of backbone network that is composed of fixed way.

An Enhanced Rerouting Function using the Failure Information in a VANET Unicasting Routing (VANET 유니캐스팅 라우팅에서 실패 정보를 이용한 경로 재탐색 기능의 강화)

  • Lee, Won Yeoul;Lee, Wan-Jik
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.2
    • /
    • pp.191-199
    • /
    • 2014
  • The unicasting routing technology of VANET is very important for user convenience. Unicasting packets must be forwarded to the appropriate path in order to arrive to the destination. However, there are so many problems because the vehicle nodes have limited information related to the routing decision. In particular, packet delivery failure will be occurred by selecting the path already failed again. We call this problem as 'Failed Path Re-Selection Problem'. In this paper, we propose an enhanced rerouting function of VANET Routing. The proposed rerouting function uses the failed path information when rerouting function executed. For this rerouting function, failed path information will be stored in the packet whenever the routing fail occurred. By the comparison with the performance of legacy VANET routing function, the superiority of the proposed method can be seen.

A Routing Protocol with Fast-Recovery of Failures Using Backup Paths on MANETs (MANET에서 백업경로를 이용한 빠른 경로복구 능력을 가진 라우팅 프로토콜)

  • Thai, Ahn Tran;Kim, Myung-Kyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.7
    • /
    • pp.1541-1548
    • /
    • 2012
  • This paper proposes a new multipath-based routing protocol on MANETs with Fast-Recovery of failures. The proposed protocol establishes the primary and secondary paths between a source and a destination considering the end-to-end packet reception reliability of routes. The primary path is used to transmit messages, and the secondary path is used to recover the path when detecting failures on the primary path. If a node detects a link failure during message transmission, it can recover the path locally by switching from the primary to the secondary path. By allowing the intermediate nodes to recover locally the route failure, the proposed protocol can reduce the number of packet loss and the amount of control packets for setting up new paths. The simulation result using QualNet simulator shows that the proposed protocol was about 10-20% higher than other protocols in terms of end-to-end message delivery ratio and the fault recovery time in case of link fault was about 3 times faster than the other protocols.

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.