• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.743-743
• /
• 2006

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

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.2
• /
• pp.10-16
• /
• 2016

For higher reliability against a link failure of a control network in railway vehicles, a recovery mechanism is needed. We introduce a problem that, when a link failure occurs in a ring-topology control network, a node may experience a significant increase of transmission delay depending on its relative position within the network. We then propose two mechanisms to solve this problem: (1) differentiating and prioritizing node traffic in forwarding; and (2) switching some nodes to a backup bus-topology network. Our simulation study shows that, while the first mechanism achieves a limited gain by only compensating queuing delay, the second one gets a sufficient gain which is impacted by the number of nodes switched to the bus network.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.2
• /
• pp.93-101
• /
• 2004

This paper is intended to assess a dynamic system reliability. Bayesian networks, however, have difficulties in their application for assessing the system reliability especially when the system consists of dependent components and the probability of failure of each component varies over time. Hence, we suggest a method for resolving the difficulties by considering a hoist system composed of two wires. Firstly, we explain the method of calculating the failure probability of the system components. Secondly, we show how to calculate the failure probability of the system for two cases that failure probability of each wire is constant and varying in time, respectively. finally, based on the calculated failure probability of the system, we infer the probability that two interesting events occur.

• Korean Journal of Construction Engineering and Management
• /
• v.19 no.3
• /
• pp.33-42
• /
• 2018

In the aftermath of an earthquake, seismic-damaged infrastructure systems loss estimation is the first step for the disaster response. However, lifeline systems' ability to supply service can be volatile by external factors such as disturbances of nearby facilities, and not by own physical issue. Thus, this research develops the bayesian model for probabilistic inference on common-cause and cascading failure of seismic-damaged lifeline systems. In addition, the authors present network robustness estimation metrics in the context of failure propagation. In order to quantify the functional loss and observe the effect of the mitigation plan, power and water supply system in Daegu-Gyeongbuk in South Korea is selected as case network. The simulation results show that reduction of cascading failure probability allows withstanding the external disruptions from a perspective of the robustness improvement. This research enhances the comprehensive understanding of how a single failure propagates to whole lifeline system performance and affected region after an earthquake.

• The KIPS Transactions:PartA
• /
• v.16A no.1
• /
• pp.17-26
• /
• 2009

Large-scale wireless sensor network are expected to play an increasingly important role for the data collection in harmful area. However, the physical fragility of sensor node makes reliable routing in harmful area a challenging problem. Since several sensor nodes in harmful area could be damaged all at once, the network should have the availability to recover routing from node failures in large area. Many routing protocols take accounts of failure recovery of single node but it is very hard these protocols to recover routing from large scale failures. In this paper, we propose a routing protocol, which we refer to as LSFA, to recover network fast from failures in large area. LSFA detects the failure by counting the packet loss from parent node and in case of failure detection LSFAdecreases the routing interval to notify the failure to the neighbor nodes. Our experimental results indicate clearly that LSFA could recover large area failures fast with less packets than previous protocols.

• Journal of Communications and Networks
• /
• v.14 no.4
• /
• pp.451-460
• /
• 2012

Natural disasters often lead to regional failures that can cause network nodes and links co-located in a large geographical area to fail. Novel approaches are required to assess the network vulnerability under such regional failures. In this paper, we investigate the vulnerability of networks by considering the geometric properties of regional failures and network nodes. To evaluate the criticality of node locations and determine the critical areas in a network, we propose the concept of ${\alpha}$-critical-distance with a given failure impact ratio ${\alpha}$, and we formulate two optimization problems based on the concept. By analyzing the geometric properties of the problems, we show that although finding critical nodes or links in a pure graph is a NP-complete problem, the problem of finding critical areas has polynomial time complexity. We propose two algorithms to deal with these problems and analyze their time complexities. Using real city-level Internet topology data, we conducted experiments to compute the ${\alpha}$-critical-distances for different networks. The computational results demonstrate the differences in vulnerability of different networks. The results also indicate that the critical area of a network can be estimated by limiting failure centers on the locations of network nodes. Additionally, we find that with the same impact ratio ${\alpha}$, the topologies examined have larger ${\alpha}$-critical-distances when the network performance is measured using the giant component size instead of the other two metrics. Similar results are obtained when the network performance is measured using the average two terminal reliability and the network efficiency, although computation of the former entails less time complexity than that of the latter.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4023-4043
• /
• 2016

Network virtualization has been regarded as a core attribute of the Future Internet. In a network virtualization environment (NVE), multiple heterogeneous virtual networks can coexist on a shared substrate network. Thus, a substrate network failure may affect multiple virtual networks. In this case, it is increasingly critical to provide survivability for the virtual networks against the substrate network failures. Previous research focused on mechanisms that ensure the resilience of the virtual network. However, the resource efficiency is still important to make the mapping scheme practical. In this paper, we study the survivable virtual network embedding mechanisms against substrate link and node failure from the perspective of improving the resource efficiency. For substrate link survivability, we propose a load-balancing and re-configuration strategy to improve the acceptance ratio and bandwidth utilization ratio. For substrate node survivability, we develop a minimum cost heuristic based on a divided network model and a backup resource cost model, which can both satisfy the location constraints of virtual node and increase the sharing degree of the backup resources. Simulations are conducted to evaluate the performance of the solutions. The proposed load balancing and re-configuration strategy for substrate link survivability outperforms other approaches in terms of acceptance ratio and bandwidth utilization ratio. And the proposed minimum cost heuristic for substrate node survivability gets a good performance in term of acceptance ratio.

• Journal of Korean Society of Water and Wastewater
• /
• v.23 no.3
• /
• pp.295-303
• /
• 2009

In the present study, a reliability analysis calculating the probability of system failure has been performed using cut set and results of numerical analysis for unsteady flow in pipe. Especially, the probability of system failure has been evaluated regarding the effect of valve closure which is a really important activity in operation of piping system. In spite of small amount of demand, it was found that fast valve closure can generate high probability of system failure. Furthermore, it was confirmed that surge tank can reduce the unsteady effects and probability of system failure in water distribution system. From the results, it was found that the unsteady flow has a significant effect on the probability of system failure Furthermore, it was able to find which pipe or cut set has high probability of system failure. So it could be used to determine which pipe or cut set has a priority of repair and replacement. Therefore, reliability analysis regarding unsteady flow has to be performed for the planning, designing, maintenance, and operation of piping system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.714-727
• /
• 2015

The hierarchical structure in networks is widely applied in many practical scenarios especially in some emergency cases. In this paper, we focus on a tree network with and without packet loss where one source sends data to n destinations, through m relay nodes employing random linear network coding (RLNC) over a Galois field in parallel transmission systems. We derive closed-form probability expressions of successful decoding at a destination node and at all destination nodes in this multicast scenario. For the convenience of computing, we also propose an upper bound for the failure probability. We then investigate the impact of the major parameters, i.e., the size of finite fields, the number of internal nodes, the number of sink nodes and the channel failure probability, on the decoding performance with simulation results. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized. When failure decoding probabilities are given, the operation is simple and its complexity is low in a small finite field.