Home About us Contact
|
Home About us Contact | ||
|
|
||
Link Failure (link + failure)
Selected AbstractsMulti-scale system reliability analysis of lifeline networks under earthquake hazardsEARTHQUAKE ENGINEERING AND STRUCTURAL DYNAMICS, Issue 3 2010Junho Song Abstract Recent earthquake events evidenced that damage of structural components in a lifeline network may cause prolonged disruption of lifeline services, which eventually results in significant socio-economic losses in the affected area. Despite recent advances in network reliability analysis, the complexity of the problem and various uncertainties still make it a challenging task to evaluate the post-hazard performance and connectivity of lifeline networks efficiently and accurately. In order to overcome such challenges and take advantage of merits of multi-scale analysis, this paper develops a multi-scale system reliability analysis method by integrating a network decomposition approach with the matrix-based system reliability (MSR) method. In addition to facilitating system reliability analysis of large-size networks, the multi-scale approach enables optimizing the level of computational effort on subsystems; identifying the relative importance of components and subsystems at multiple scales; and providing a collaborative risk management framework. The MSR method is uniformly applied for system reliability analyses at both the lower-scale (for link failure) and the higher-scale (for system connectivity) to obtain the probability of general system events, various conditional probabilities, component importance measures, statistical correlation between subsystem failures and parameter sensitivities. The proposed multi-scale analysis method is demonstrated by its application to a gas distribution network in Shelby County of Tennessee. A parametric study is performed to determine the number of segments during the lower-scale MSR analysis of each pipeline based on the strength of the spatial correlation of seismic intensity. It is shown that the spatial correlation should be considered at both scales for accurate reliability evaluation. The proposed multi-scale analysis approach provides an effective framework of risk assessment and decision support for lifeline networks under earthquake hazards. Copyright © 2009 John Wiley & Sons, Ltd. [source] Survivable wavelength-routed optical network design using genetic algorithmsEUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 3 2008Y. S. Kavian The provision of acceptable service in the presence of failures and attacks is a major issue in the design of next generation dense wavelength division multiplexing (DWDM) networks. Survivability is provided by the establishment of spare lightpaths for each connection request to protect the working lightpaths. This paper presents a genetic algorithm (GA) solver for the routing and wavelength assignment problem with working and spare lightpaths to design survivable optical networks in the presence of a single link failure. Lightpaths are encoded into chromosomes made up of a fixed number of genes equal to the number of entries in the traffic demand matrix. Each gene represents one valid path and is thus coded as a variable length binary string. After crossover and mutation, each member of the population represents a set of valid but possibly incompatible paths and those that do not satisfy the problem constraints are discarded. The best paths are then found by use of a fitness function and these are assigned the minimum number of wavelengths according to the problem constraints. The proposed approach has been evaluated on dedicated path protection and shared path protection. Simulation results show that the GA method is efficient and able to design DWDM survivable real-world optical mesh networks. Copyright © 2007 John Wiley & Sons, Ltd. [source] An adaptive survivability admission control algorithm using backup path for high-speed networksINTERNATIONAL JOURNAL OF NETWORK MANAGEMENT, Issue 6 2003Chi-Chun Lo In this paper, we propose an adaptive survivability admission control algorithm using a backup path for high-speed networks. For each call request, the proposed algorithm selects a combination of working path and backup path. Two BP selection methods, min-cost and min-expectation, are suggested. Computational experiments indicate that the proposed algorithm significantly reduces the consumption of backup capacity while still maintaining 100% survivability upon a single link failure and near 80% survivability upon double link failures.,Copyright © 2003 John Wiley & Sons, Ltd. [source] Middleware extensions that trade consistency for availabilityCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 9 2009Mikael Asplund Abstract Replicated distributed object systems are deployed to provide timely and reliable services to actors at distributed locations. This paper treats applications in which data updates are dependent on satisfaction of integrity constraints over multiple objects. Network partitions, caused by occasional link failures, overload or attacks create problems in keeping both consistency and availability in such networks. We propose a means of achieving higher availability by providing partition-awareness in middleware. The general approach has been illustrated by implementing a number of CORBA extensions that trade consistency for availability during network partitions. This paper contains a thorough experimental evaluation that presents the gains and costs of our approach. The experiments clearly illustrate the benefit of our protocols in terms of significantly higher availability and the number of performed operations. Copyright © 2009 John Wiley & Sons, Ltd. [source] Comparison between objective and subjective measurements of quality of service over an Optical Wide Area networkEUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 3 2008Francesco Matera The introduction of intelligence for management and control of the quality of service (QoS) are key issues for the evolution of the next generation IP optical network based on Ethernet technology. A test bed of a core-access network was implemented to investigate such issues and in this paper, the authors report measurements concerning the QoS of multimedia services for different traffic conditions. The network was implemented with a differentiated service over Multi-Protocol Label Switch (MPLS) architecture; it consists of a real optical network based on core routers with optical Gigabit Ethernet (GBE) interfaces connected by means of long single mode fibres (about 50\,km), contained in an installed cable between Rome and Pomezia. The network is based on different access devices, but in this paper we only refer to an access based on Fibre To The building (FTTB) architecture. The QoS was investigated both in terms of network (or objective) tests that include packet loss, jitter, one way delay and throughput measurements and perceptive (or subjective) tests that conversely are based on the evaluation of user perception. The services under test mainly consisted of video streams that circulated in the network according to the switching operations based in the IP differentiated service over MPLS technique that allowed us to guarantee the QoS for some class of service, also in the presence of network overload. Particular attention was given to the correlation between objective and subjective measurements. Furthermore, in order to have a complete analysis about QoS of real networks, measurements were performed also in the presence of restoration operations for link failures; in particular we compare the results in the case of conventional IP network restoration with a procedure proposed by us and based on a link switching activated by the loss of signal command coming from the routers. Copyright © 2007 John Wiley & Sons, Ltd. [source] Partition-based algorithm for estimating transportation network reliability with dependent link failuresJOURNAL OF ADVANCED TRANSPORTATION, Issue 3 2008Agachai Sumalee Evaluating the reliability of a transportation network often involves an intensive simulation exercise to randomly generate and evaluate different possible network states. This paper proposes an algorithm to approximate the network reliability which minimizes the use of such simulation procedure. The algorithm will dissect and classify the network states into reliable, unreliable, and un-determined partitions. By postulating the monotone property of the reliability function, each reliable and/or unreliable state can be used to determine a number of other reliable and/or unreliable states without evaluating all of them with an equilibrium assignment procedure. The paper also proposes the cause-based failure framework for representing dependent link degradation probabilities. The algorithm and framework proposed are tested with a medium size test network to illustrate the performance of the algorithm. [source] | |||||||||||||