Dual-failure Survivability for Multi Quality Data using Single p-cycle

Dual-failure scenarios are a real possibility in today’s optical networks and it is becoming more and more important foe carriers and network operators to consider them when designing their networks. p-Cycle is a recent approach in optical network protection. p-Cycle use preconnected cycles of spare capacity to restore affected working traffic. We propose new method and strategies to support multiple qualities of service classes in a static pcycle based network Design, using the same global set of resources as required to operate a network with only a single failure protected service class. A propose new method to provide dual failures survivability using p-cycle. A p-cycle is set up for each link. When link is failure, the system will on-line select the best route of pcycle to react. In single failure or dual failure, data does not divert randomly in route of p-cycle. Data packets are switched based on priority criteria it means that the higher priority packets go through shortest distance route of pcycle and lowest priority data packets go through longest distance route of p-cycle

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

Optimization of p-cycle protection schemes in optical networks

La survie des réseaux est un domaine d'étude technique très intéressant ainsi qu'une préoccupation critique dans la conception des réseaux. Compte tenu du fait que de plus en plus de données sont transportées à travers des réseaux de communication, une simple panne peut interrompre des millions d'utilisateurs et engendrer des millions de dollars de pertes de revenu. Les techniques de protection des réseaux consistent à fournir une capacité supplémentaire dans un réseau et à réacheminer les flux automatiquement autour de la panne en utilisant cette disponibilité de capacité. Cette thèse porte sur la conception de réseaux optiques intégrant des techniques de survie qui utilisent des schémas de protection basés sur les p-cycles. Plus précisément, les p-cycles de protection par chemin sont exploités dans le contexte de pannes sur les liens. Notre étude se concentre sur la mise en place de structures de protection par p-cycles, et ce, en supposant que les chemins d'opération pour l'ensemble des requêtes sont définis a priori. La majorité des travaux existants utilisent des heuristiques ou des méthodes de résolution ayant de la difficulté à résoudre des instances de grande taille. L'objectif de cette thèse est double. D'une part, nous proposons des modèles et des méthodes de résolution capables d'aborder des problèmes de plus grande taille que ceux déjà présentés dans la littérature. D'autre part, grâce aux nouveaux algorithmes, nous sommes en mesure de produire des solutions optimales ou quasi-optimales. Pour ce faire, nous nous appuyons sur la technique de génération de colonnes, celle-ci étant adéquate pour résoudre des problèmes de programmation linéaire de grande taille. Dans ce projet, la génération de colonnes est utilisée comme une façon intelligente d'énumérer implicitement des cycles prometteurs. Nous proposons d'abord des formulations pour le problème maître et le problème auxiliaire ainsi qu'un premier algorithme de génération de colonnes pour la conception de réseaux protegées par des p-cycles de la protection par chemin. L'algorithme obtient de meilleures solutions, dans un temps raisonnable, que celles obtenues par les méthodes existantes. Par la suite, une formulation plus compacte est proposée pour le problème auxiliaire. De plus, nous présentons une nouvelle méthode de décomposition hiérarchique qui apporte une grande amélioration de l'efficacité globale de l'algorithme. En ce qui concerne les solutions en nombres entiers, nous proposons deux méthodes heurisiques qui arrivent à trouver des bonnes solutions. Nous nous attardons aussi à une comparaison systématique entre les p-cycles et les schémas classiques de protection partagée. Nous effectuons donc une comparaison précise en utilisant des formulations unifiées et basées sur la génération de colonnes pour obtenir des résultats de bonne qualité. Par la suite, nous évaluons empiriquement les versions orientée et non-orientée des p-cycles pour la protection par lien ainsi que pour la protection par chemin, dans des scénarios de trafic asymétrique. Nous montrons quel est le coût de protection additionnel engendré lorsque des systèmes bidirectionnels sont employés dans de tels scénarios. Finalement, nous étudions une formulation de génération de colonnes pour la conception de réseaux avec des p-cycles en présence d'exigences de disponibilité et nous obtenons des premières bornes inférieures pour ce problème.Network survivability is a very interesting area of technical study and a critical concern in network design. As more and more data are carried over communication networks, a single outage can disrupt millions of users and result in millions of dollars of lost revenue. Survivability techniques involve providing some redundant capacity within the network and automatically rerouting traffic around the failure using this redundant capacity. This thesis concerns the design of survivable optical networks using p-cycle based schemes, more particularly, path-protecting p-cycles, in link failure scenarios. Our study focuses on the placement of p-cycle protection structures assuming that the working routes for the set of connection requests are defined a priori. Most existing work carried out on p-cycles concerns heuristic algorithms or methods suffering from critical lack of scalability. Thus, the objective of this thesis is twofold: on the one hand, to propose scalable models and solution methods enabling to approach larger problem instances and on the other hand, to produce optimal or near optimal solutions with mathematically proven optimality gaps. For this, we rely on the column generation technique which is suitable to solve large scale linear programming problems. Here, column generation is used as an intelligent way of implicitly enumerating promising cycles to be part of p-cycle designs. At first, we propose mathematical formulations for the master and the pricing problems as well as the first column generation algorithm for the design of survivable networks based on path-protecting p-cycles. The resulting algorithm obtains better solutions within reasonable running time in comparison with existing methods. Then, a much more compact formulation of the pricing problem is obtained. In addition, we also propose a new hierarchical decomposition method which greatly improves the efficiency of the whole algorithm and allows us to solve larger problem instances. As for integer solutions, two heuristic approaches are proposed to obtain good solutions. Next, we dedicate our attention to a systematic comparison of p-cycles and classical shared protection schemes. We perform an accurate comparison by using a unified column generation framework to find provably good results. Afterwards, our study concerns an empirical evaluation of directed and undirected link- and path-protecting p-cycles under asymmetric traffic scenarios. We show how much additional protection cost results from employing bidirectional systems in such scenarios. Finally, we investigate a column generation formulation for the design of p-cycle networks under availability requirements and obtain the first lower bounds for the problem

Availability Constrained Routing And Wavelength Assignment And Survivability In Optical Wdm Networks

Tez (Doktora) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2009Thesis (PhD) -- İstanbul Technical University, Institute of Science and Technology, 2009Bu çalışmada, optik ağlarda kullanılabilirlik kısıtı altında yol ve dalgaboyu atama konusu farklı sürdürülebilirlik politikaları altında çalışılmış ve elde edilen sonuçlar benzetim aracılığıyla doğrulanarak sunulmuştur. Öncelikle paylaşılan yol koruması altında sınırsız kaynak bulunması durumunda kullanılabilirlik kısıtı altında yol ve dalgaboyu atamaya yönelik planlama amaçlı bağlantı kurma yöntemleri sezgisel ve optimizasyona dayalı olarak önerilmiştir. Sonrasında bu teknikler kısıtlı kaynak altında ve farklılaştırılmış kullanılabilirlik düzeyi gereksinimleri ile gelen bağlantı isteklerinin olması koşulu altında çalışabilecek şekilde adapte edilmiş ve başarımları sınanmıştır. Önerilen tekniklerin literatürde yaygın olarak bilinen bağlantı kurma tekniklerinin başarımını bağlantı düşürme olasılığı ve bağlantı kullanılabilirliği açısından yükselttiği, bunun yanında yedek kaynak tüketim fazlasını da gözeterek kabul edilir bir düzeyde tuttuğu gözlenmiştir. Özellikle optimizasyon tabanlı bağlantı kurma tekniğinin, farklılaştırılmış bağlantı isteklerinin bulunduğu ortamda kaynak tüketimini de düşürdüğü gösterilmiştir. Son olarak da, segmanlı koruma için önceden önerilmiş bir kullanılabilirlik analizine rastlanamadığı için, paylaşılan segmanlı koruma için kullanılabilirlik analizi yöntemi önerilerek benzetim aracılığıyla doğrulanmıştır. Bu analiz kullanılarak da segmanlı koruma altında kullanılabilirliği gözeten yol ve dalgaboyu atama yöntemleri oluşturularak başarımları kaynak kısıtlı ve kaynakça zengin ortamlarda denenerek uygulanabilirlikleri belirlenmiştir.In this study, we have proposed availability aware routing and wavelength assignment schemes for optical networks under different survivability policies. The proposed techniques are evaluated by simulation. First, we have proposed heuristic and optimization driven connection provisioning schemes under shared backup path protection in resource plentiful environment. Then, the proposed schemes are modified to work in resource limited environment where connections arrive with differentiated availability requirements. The proposed techniques are compared to a conventional reliable connection provisioning algorithm. The simulation results show that the proposed techniques lead to lower connection blocking probability and better connection availability. Besides this, it is also shown that the proposed techniques also keep the resource overbuild due to protection in a feasible range. Moreover, the experimental results also show that the optimization driven technique leads to a decreased resource overbuild under resource limited environment for connection arrivals with differentiated availability requirements. The last part of this work deals with shared segment protection. Since there is no specific availability analysis method for shared segment protection, an availability analysis method for this protection scheme is proposed and validated by simulation. Based on this analysis, availability aware connection provisioning schemes are constructed, their performance is evaluated in resource plentiful and resource scarce environments, and the applicability of the schemes are determined in terms of environmental constraints.DoktoraPh

Efficient shared segment protection in optical networks

This thesis introduces a new shared segment protection scheme that ensures both node and link protection in an efficient manner in terms of cost. Although the segment protection scheme exhibits an interesting compromise between link and path protection schemes and attempts to encompass all their advantages, it has been much less explored than the other protection approaches. The proposed work investigates two different Shared Segment Protection (SSP) schemes: Basic Shared Segment Protection (BSSP) and a new segment protection, called Shared Segment Protection with segment Overlap (SSPO). For both BSSP and SSPO schemes, we propose two novel efficient and scalable ILP formulations, based on a column generation mathematical modeling. SSPO offers more advantages over BSSP as it ensures both node and link protections, in addition to shorter delays. It is not necessarily more expensive while BSSP ensures only link protection. Indeed, depending on the network topology and the traffic instances, it can be shown that neither of the two SSP schemes is dominant in terms of cost. The mathematical models have been solved using column generation techniques. Simulations have been conducted to validate the two segment protection models and to evaluate the performance of the two segment protection schemes under different traffic scenarios. In addition, we have estimated when an additional cost (and how much) is needed in order to ensure node protection

Crosslayer Survivability in Overlay-IP-WDM Networks

As the Internet moves towards a three-layer architecture consisting of overlay networks on top of the IP network layer on top of WDM-based physical networks, incorporating the interaction between and among network layers is crucial for efficient and effective implementation of survivability.This dissertation has four major foci as follows: First, a first-of-its-kind analysis of the impact of overlay network dependency on the lower layer network unveils that backhaul, a link loop that occurs at any two or more lower layers below the layer where traffic is present, could happen. This prompts our proposal of a crosslayer survivable mapping to highlight such challenges and to offer survivability in an efficient backhaul-free way. The results demonstrate that the impact of layer dependency is more severe than initially anticipated making it clear that independent single layer network design is inadequate to assure service guarantees and efficient capacity allocation. Second, a forbidden link matrix is proposed masking part of the network for use in situations where some physical links are reserved exclusively for a designated service, mainly for the context of providing multiple levels of differentiation on the network use and service guarantee. The masking effect is evaluated on metrics using practical approaches in a sample real-world network, showing that both efficiency and practicality can be achieved. Third, matrix-based optimization problem formulations of several crosslayer survivable mappings are presented; examples on the link availability mapping are particularly illustrated. Fourth, survivability strategies for two-layer backbone networks where traffic originates at each layer are investigated. Optimization-based formulations of performing recovery mechanisms at each layer for both layers of traffic are also presented. Numerical results indicate that, in such a wavelength-based optical network, implementing survivability of all traffic at the bottom layer can be a viable solution with significant advantages.This dissertation concludes by identifying a roadmap of potential future work for crosslayer survivability in layered network settings

Risk-based Survivable Network Design

Communication networks are part of the critical infrastructure upon which society and the economy depends; therefore it is crucial for communication networks to survive failures and physical attacks to provide critical services. Survivability techniques are deployed to ensure the functionality of communication networks in the face of failures. The basic approach for designing survivable networks is that given a survivability technique (e.g., link protection, or path protection) the network is designed to survive a set of predefined failures (e.g., all single-link failures) with minimum cost. However, a hidden assumption in this design approach is that the sufficient monetary funds are available to protect all predefined failures, which might not be the case in practice as network operators may have a limited budget for improving network survivability. To overcome this limitation, this dissertation proposed a new approach for designing survivable networks, namely; risk-based survivable network design, which integrates risk analysis techniques into an incremental network design procedure with budget constraints. In the risk-based design approach, the basic design problem considered is that given a working network and a fixed budget, how best to allocate the budget for deploying a survivability technique in different parts of the network based on the risk. The term risk measures two related quantities: the likelihood of failure or attack, and the amount of damage caused by the failure or attack. Various designs with different risk-based design objectives are considered, for example, minimizing the expected damage, minimizing the maximum damage, and minimizing a measure of the variability of damage that could occur in the network. In this dissertation, a design methodology for the proposed risk-based survivable network design approach is presented. The design problems are formulated as Integer Programming (InP) models; and in order to scale the solution of models, some greedy heuristic solution algorithms are developed. Numerical results and analysis illustrating different risk-based designs are presented