Survivable design in WDM mesh networks

This dissertation addresses several important survivable design issues in WDM mesh networks;Shared backup path protection has been shown to be efficient in terms of capacity utilization, due to the sharing of backup capacity. However, sharing of backup capacity also complicates the restoration process, and leads to slow recovery. The p-cycle scheme is the most efficient ring-type protection method in terms of capacity utilization. Recently, the concept of pre-cross-connected protection was proposed to increase the recovery speed of shared path protection. We overview these protection methods. The recovery time of these schemes are compared analytically. We formulate integer programming optimization problems for three protection methods in static traffic scenario, considering wavelength continuity constraint;We develop a p-cycle based scheme to deal with dynamic traffic in WDM networks. We use a two-step approach. In first step, we find a set of p-cycles to cover the network and reserve enough capacity in p-cycles. In second step, we route the requests as they randomly arrive one by one. We propose two routing algorithms. Compared to the shared path protection, the p-cycle based design has the advantage of fast recovery, less control signaling, less dynamic state information to be maintained. To evaluate the blocking performance of proposed method, we compare it with shared backup path protection by extensive simulations;We propose a path-based protection method for two-link failures in mesh optical networks. We identify the scenarios where the backup paths can share their wavelengths without violating 100% restoration guarantee (backup multiplexing). We use integer linear programming to optimize the total capacity requirement for both dedicated- and shared-path protection schemes;The recently proposed light trail architecture offers a promising candidate for carrying IP centric traffic over optical networks. The survivable design is a critical part of the integral process of network design and operation. We propose and compare two protection schemes. The survivable light trail design problem using connection based protection model is solved using a two-step approach. (Abstract shortened by UMI.

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

Advanced flight control system study

The architecture, requirements, and system elements of an ultrareliable, advanced flight control system are described. The basic criteria are functional reliability of 10 to the minus 10 power/hour of flight and only 6 month scheduled maintenance. A distributed system architecture is described, including a multiplexed communication system, reliable bus controller, the use of skewed sensor arrays, and actuator interfaces. Test bed and flight evaluation program are proposed

Segment Routing: a Comprehensive Survey of Research Activities, Standardization Efforts and Implementation Results

Fixed and mobile telecom operators, enterprise network operators and cloud providers strive to face the challenging demands coming from the evolution of IP networks (e.g. huge bandwidth requirements, integration of billions of devices and millions of services in the cloud). Proposed in the early 2010s, Segment Routing (SR) architecture helps face these challenging demands, and it is currently being adopted and deployed. SR architecture is based on the concept of source routing and has interesting scalability properties, as it dramatically reduces the amount of state information to be configured in the core nodes to support complex services. SR architecture was first implemented with the MPLS dataplane and then, quite recently, with the IPv6 dataplane (SRv6). IPv6 SR architecture (SRv6) has been extended from the simple steering of packets across nodes to a general network programming approach, making it very suitable for use cases such as Service Function Chaining and Network Function Virtualization. In this paper we present a tutorial and a comprehensive survey on SR technology, analyzing standardization efforts, patents, research activities and implementation results. We start with an introduction on the motivations for Segment Routing and an overview of its evolution and standardization. Then, we provide a tutorial on Segment Routing technology, with a focus on the novel SRv6 solution. We discuss the standardization efforts and the patents providing details on the most important documents and mentioning other ongoing activities. We then thoroughly analyze research activities according to a taxonomy. We have identified 8 main categories during our analysis of the current state of play: Monitoring, Traffic Engineering, Failure Recovery, Centrally Controlled Architectures, Path Encoding, Network Programming, Performance Evaluation and Miscellaneous...Comment: SUBMITTED TO IEEE COMMUNICATIONS SURVEYS & TUTORIAL

Biologically dominated engineered coastal breakwaters

Coastal land loss in Louisiana is occurring at astounding rates. New technologies for shoreline protection are needed that incorporate traditional engineering designs with natural systems (e.g., oyster reefs). Under optimal environmental conditions eastern Oysters (Crassotrea virginica) can biologically dominate artificial concrete reef structures used as coastal breakwaters within the intertidal zone. These reefs can also serve as oyster broodstock sanctuaries providing a nexus to the public oyster grounds benefiting the aquaculture industry. The use of biologically dominated, engineered breakwaters may provide a viable solution to coastal restoration and shoreline protection challenges. Biologically dominated coastal breakwaters can be integrated into coastal zone management strategies to preserve coastal resources by offering compatible uses across multiple disciplines. An experimental study was conducted at Rockefeller Wildlife Refuge monitoring material strength, sediment accretion, and oyster biometrics on high-relief, three-dimensional artificial reefs using concrete scaffoldings for growth substrates. Spat plate data on these reefs indicated the spring spatfall exceeded 10,000 spat/m^2 in some locations. Oyster shell height measurements of 50 cm were recorded after six months growth, with oyster counts exceeding 500 per m^2 on the artificial concrete modular breakwater reefs. Alternate concrete substrates (i.e., vitrified expanded clay) showed optimal strength and weight when compared to traditional higher density aggregates, weighing less than 50% by volume with no statistically significant difference in ASTM 39 standards for compressive strength (3,328 lbs with P\u3c.001). Biologically dominated concrete structures showed a significant increase in ASTM 78 standards for flexural strength over time from an initial 28-day curing load of 100 lbs to loads of 479 lbs in six months and 1,344 lbs in two years. Pilot scale breakwater emplacements dominated by biological growth accumulated nearly 4 m3 of sediment over four years. Heavy and light density reef emplacements installed for less than one year accreted 1.6 and 0.37 m3 of sediment, respectively, relative to baseline cross-shore transects with no breakwater emplacements

Effect of different surface treatments and multimode adhesive application on the Weibull characteristics, wettability, surface topography and adhesion to CAD/CAM lithium disilicate ceramic

This paper aims to evaluate the effect of different surface treatments on surface topography, wettability, and shear bond strength of resin cement to glass ceramic. Methodology: For SBS test, 32 blocks (7x7x2 mm) of lithium disilicate were obtained and randomly divided into eight groups (four blocks per group) according to each surface treatment (HF 20 s, 60 s, 120 s + silanization/S or Scotch Bond Universal/ SBU) and the Monobond Etch & Prime - MEP application followed or not by SBU. On each treated surface ceramic block, up to four dual-curing resin cement cylinders were prepared and light-cured for 40s (N=120/n=15). The specimens were thermocycled (10,000 cycles, 5-55°C, 30 s) and the SBS test (50KgF, 0.5 mm/min) was performed. Furthermore, failure analysis, wettability, AFM, and SEM were carried out. SBS data (MPa) were analyzed using Student's t-test, two-way ANOVA, Tukey's test (5%) and Weibull's analysis. Results: For HF experimental groups, two-way ANOVA presented the factors “etching time” and “bonding agent” as significant (p<0.05). After silane application, the HF groups presented similar bond strength. SBU application compromised the SBS, except for 120s etching time (HF120sS: 23.39ᵃ±6.48 MPa; HF120sSBU: 18.76ᵃ±8.81MPa). For MEP groups, SBU application did not significantly affect the results (p=0.41). The MEP group presented the highest Weibull modulus (4.08A) and they were statistically different exclusively from the HF20sSBU (0.58B). Conclusion: The HF 20s, 60s, 120 s followed by silane, promoted similar resin-bond strength to ceramic and the SBU application after HF or MEP did not increase the SBS

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

Multifrequency Aperture-Synthesizing Microwave Radiometer System (MFASMR). Volume 1

Background material and a systems analysis of a multifrequency aperture - synthesizing microwave radiometer system is presented. It was found that the system does not exhibit high performance because much of the available thermal power is not used in the construction of the image and because the image that can be formed has a resolution of only ten lines. An analysis of image reconstruction is given. The system is compared with conventional aperture synthesis systems

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