703 research outputs found
Practical issues for the implementation of survivability and recovery techniques in optical networks
A segmentation method for shared protection in WDM networks
Shared link and shared path protections have been recognized as preferred schemes to protect traffic flows against network failures. In recent years, another method referred to as Shared Segment Protection has been studied as an alternative solution for protection. This method is more flexible and efficient in terms of capacity utilization and restoration time. However, to our best knowledge, this method has mostly been studied in dynamic provisioning scenarios in which searching for restoration paths is dynamically performed after a failure has occurred. In this paper, based on the path segmentation idea, we propose a method to generate good candidate routes for traffic demands in static provisioning. These candidates are used as input parameters of an Integer Linear Programming (ILP) model for shared backup protection. Numerical results show that the capacity efficiency resulting from these candidates is much better than the best known Shared Backup Path Protection (SBPP) schemes. In addition, although the restoration time of our scheme is a little bit longer than those implementing link protection, it is still faster than path protection schemes
Survivable mesh-network design & optimization to support multiple QoP service classes
Every second, vast amounts of data are transferred over communication systems around the world, and as a result, the demands on optical infrastructures are extending beyond the traditional, ring-based architecture. The range of content and services available from the Internet is increasing, and network operations are constantly under pressure to expand their optical networks in order to keep pace with the ever increasing demand for higher speed and more reliable links
Combinatorial optimization in networks with Shared Risk Link Groups
International audienceThe notion of Shared Risk Link Groups (SRLG) captures survivability issues when a set of links of a network may fail simultaneously. The theory of survivable network design relies on basic combinatorial objects that are rather easy to compute in the classical graph models: shortest paths, minimum cuts, or pairs of disjoint paths. In the SRLG context, the optimization criterion for these objects is no longer the number of edges they use, but the number of SRLGs involved. Unfortunately, computing these combinatorial objects is NP-hard and hard to approximate with this objective in general. Nevertheless some objects can be computed in polynomial time when the SRLGs satisfy certain structural properties of locality which correspond to practical ones, namely the star property (all links affected by a given SRLG are incident to a unique node) and the span 1 property (the links affected by a given SRLG form a connected component of the network). The star property is defined in a multi-colored model where a link can be affected by several SRLGs while the span property is defined only in a mono-colored model where a link can be affected by at most one SRLG. In this paper, we extend these notions to characterize new cases in which these optimization problems can be solved in polynomial time. We also investigate the computational impact of the transformation from the multi-colored model to the mono-colored one. Experimental results are presented to validate the proposed algorithms and principles
Sub-graph based Multicast Protection in WDM Networks: A Multi/Many-Objective Evolutionary Algorithms approaches
In this paper is addressed the multicast routing-and-protection, and wavelength assignment (MRPWA) problem which is critical for the success of applications point-multipoint in WDM networks. Basically, it is proposed the design of the primary and protection multicast routes, where the resources protection are based on sub-graph protection strategy subject to the quality requirements of the QoP protection: dedicated (1 + 1), shared (M: N) and better effort (without protection). In this way, NSGA-II and NSGA-III, evolutionary algorithms, are applied to MRPWA considering multi- and many-objectives optimization context, respectively. The evolutionary algorithms optimize simultaneously: (i) the total number of links used, (ii) the number of wavelength converters, (iii) the number of splitter nodes, and (iv) the number of destinations served-and-protected. Considering Hyper-volume measure, the experimental tests on a set of instances indicate that the protection approach based on sub-graph proves to be promising in comparison to the dualtree protection strategy. On the other hand, the evolutionary technique oriented to many-objectives (NSGA-III) is more convenient than the oriented towards multi-objectives (NSGA-II) in the study problem.XIII Workshop Arquitectura, Redes (WARSO)Red de Universidades con Carreras en Informática (RedUNCI
Sub-graph based Multicast Protection in WDM Networks: A Multi/Many-Objective Evolutionary Algorithms approaches
In this paper is addressed the multicast routing-and-protection, and wavelength assignment (MRPWA) problem which is critical for the success of applications point-multipoint in WDM networks. Basically, it is proposed the design of the primary and protection multicast routes, where the resources protection are based on sub-graph protection strategy subject to the quality requirements of the QoP protection: dedicated (1 + 1), shared (M: N) and better effort (without protection). In this way, NSGA-II and NSGA-III, evolutionary algorithms, are applied to MRPWA considering multi- and many-objectives optimization context, respectively. The evolutionary algorithms optimize simultaneously: (i) the total number of links used, (ii) the number of wavelength converters, (iii) the number of splitter nodes, and (iv) the number of destinations served-and-protected. Considering Hyper-volume measure, the experimental tests on a set of instances indicate that the protection approach based on sub-graph proves to be promising in comparison to the dualtree protection strategy. On the other hand, the evolutionary technique oriented to many-objectives (NSGA-III) is more convenient than the oriented towards multi-objectives (NSGA-II) in the study problem.XIII Workshop Arquitectura, Redes (WARSO)Red de Universidades con Carreras en Informática (RedUNCI
Security-Aware RWA for Dynamic Traffic Using Path Protection In WDM Networks
Security and attack management have become the prime concern for the network operators due to high data transfer rates and vulnerabilities associated with transparency in WDM networks. In the recent years, there is a substantial increase in perception to develop suitable mechanisms for subduing the adverse effects of malicious attacks such as high power jamming and tapping attacks.In transparent optical networks (TONs) traffic is carried over the optical fibers in the form of signals called lightpaths, creating a virtual topology over the physical interconnections of an optical fiber. This allows an exchange of an enormous amount of data at a very high speed. A fault or an attack on the network can lead to data tampering and data loss. Unlike faults, malicious attacks may not be localized and we cannot handle them with the standard fault-tolerance mechanisms in WDM networks. The Routing and Wavelength Assignment (RWA) problem assigns appropriate routes and wavelengths to all associated lightpaths in the network. Most the researchers considered the static traffic model, where the network requests (i.e. lightpaths to be established) are known in advance and last over long durations. In this thesis, we are solving the security-aware problem for dynamic requests by using protection strategy known as dedicated path protection (DPP). In the dynamic model, lightpaths are generated on-demand, and RWA must be performed based on available resources that are not being used by ongoing lightpaths. We propose an Integer linear programming (ILP) formulation to maximize requests satisfaction and reducing the disruption in the network due to malicious attacks (In-band and out-band)
Recommended from our members
Towards Scalable Cost-Effective Service and Survivability Provisioning in Ultra High Speed Networks
Optical transport networks based on wavelength division multiplexing (WDM) are considered to be the most appropriate choice for future Internet backbone. On the other hand, future DOE networks are expected to have the ability to dynamically provision on-demand survivable services to suit the needs of various high performance scientific applications and remote collaboration. Since a failure in aWDMnetwork such as a cable cut may result in a tremendous amount of data loss, efficient protection of data transport in WDM networks is therefore essential. As the backbone network is moving towards GMPLS/WDM optical networks, the unique requirement to support DOE’s science mission results in challenging issues that are not directly addressed by existing networking techniques and methodologies. The objectives of this project were to develop cost effective protection and restoration mechanisms based on dedicated path, shared path, preconfigured cycle (p-cycle), and so on, to deal with single failure, dual failure, and shared risk link group (SRLG) failure, under different traffic and resource requirement models; to devise efficient service provisioning algorithms that deal with application specific network resource requirements for both unicast and multicast; to study various aspects of traffic grooming in WDM ring and mesh networks to derive cost effective solutions while meeting application resource and QoS requirements; to design various diverse routing and multi-constrained routing algorithms, considering different traffic models and failure models, for protection and restoration, as well as for service provisioning; to propose and study new optical burst switched architectures and mechanisms for effectively supporting dynamic services; and to integrate research with graduate and undergraduate education. All objectives have been successfully met. This report summarizes the major accomplishments of this project. The impact of the project manifests in many aspects: First, the project addressed many essential problems that arisen in current and future WDM optical networks, and provided a host of innovative solutions though there was no invention or patent filing. This project resulted in more than 2 dozens publications in major journals and conferences (including papers in IEEE Transactions and journals, as well as a book chapter). Our publications have been cited by many peer researchers. In particular, one of our conference papers was nominated for the best paper award of IEEE/Create-Net Broadnets (International Conference on Broadband Communications, Networks, and Systems) 2006. Second, the results and solutions of this project were well received by DOE Labs where presentations were given by the PI. We hope to continue the collaboration with DOE Labs in the future. Third, the project was the first to propose and extensively study multicast traffic grooming, new traffic models such as sliding scheduled traffic model and scheduled traffic model. Our research has sparkled a flurry of recent studies and publications by the research community in these areas. Fourth, the project has benefited a diverse population of students by motivating, engaging, enhancing their learning and skills. The project has been conducted in a manner conducive to the training of students both at graduate and undergraduate levels. As a result, one Ph.D., Dr. Abdur Billah, was graduated. Another Ph.D. student, Tianjian Li, will graduate in January 2007. In addition, four MS students were graduated. One undergraduate student, Jeffrey Alan Shininger, completed his university honors project. Fifth, thanks to the support of this ECPI project, the PI has obtained additional funding from the National Science Foundation, the Air Force Research Lab, and other sources. A few other proposals are pending. Finally, this project has also significantly impacted the curricula and resulted in the enhancement of courses at the graduate and undergraduate levels, therefore strengthening the bond between research and education
Resilient network design: Challenges and future directions
This paper highlights the complexity and challenges of providing reliable services in the evolving communications infrastructure. The hurdles in providing end-to-end availability guarantees are discussed and research problems identified. Avenues for overcoming some of the challenges examined are presented. This includes the use of a highly available network spine embedded in a physical network together with efficient crosslayer mapping to offer survivability and differentiation of traffic into classes of resilience. © 2013 Springer Science+Business Media New York
Designing Survivable Wavelength Division Multiplexing (WDM) Mesh Networks
This thesis focuses on the survivable routing problem in WDM mesh networks where the objective is to minimize the total number of wavelengths used for establishing working and protection paths in the WDM networks. The past studies for survivable routing suffers from the scalability problem when the number of nodes/links or connection requests grow in the network. In this thesis, a novel path based shared protection framework namely Inter-Group Shared protection (I-GSP) is proposed where the traffic matrix can be divided into multiple protection groups (PGs) based on specific grouping policy. Optimization is performed on these PGs such that sharing of protection wavelengths is considered not only inside a PG, but between the PGs. Simulation results show that I-GSP based integer linear programming model, namely, ILP-II solves the networks in a reasonable amount of time for which a regular integer linear programming formulation, namely, ILP-I becomes computationally intractable. For most of the cases the gap between the optimal solution and the ILP-II ranges between (2-16)%. The proposed ILP-II model yields a scalable solution for the capacity planning in the survivable optical networks based on the proposed I-GSP protection architecture
- …