Design, protocol and routing algorithms for survivable all-optical networks.

by Hui Chi Chun Ronald.Thesis submitted in: December 1998.Thesis (M.Phil.)--Chinese University of Hong Kong, 1999.Includes bibliographical references (leaves 62-66).Abstract also in Chinese.Chapter Chapter 1. --- Introduction --- p.1Chapter Chapter 2. --- AON Architecture --- p.7Chapter 2.1 --- WCC Dimension Reduction Node Architecture --- p.10Chapter 2.2 --- Restoration of a Survivable AON --- p.13Chapter Chapter 3. --- Network Dimensioning Problem --- p.15Chapter 3.1 --- Problem Setting --- p.16Chapter 3.2 --- Two Solution Approaches --- p.16Chapter 3.2.1 --- Minimum Variance Algorithm (MVA) --- p.17Chapter 3.2.2 --- Minimum Variance Subroutine (MVS) --- p.19Chapter 3.3 --- Shortest Path Algorithm (SPA) --- p.21Chapter 3.4 --- An Illustrative Example --- p.22Chapter 3.5 --- Performance Comparisons --- p.26Chapter Chapter 4. --- Network Management for AON Restoration --- p.31Chapter 4.1 --- Surveillance Network --- p.31Chapter 4.2 --- Signaling Network --- p.32Chapter 4.3 --- Network Management System --- p.32Chapter 4.4 --- CCS7 Adaptation for Supporting AON Restoration --- p.34Chapter Chapter 5. --- Complete Restoration Algorithm for AON --- p.40Chapter 5.1 --- Link-Based Restoration Algorithm --- p.43Chapter 5.2 --- Source-Based Restoration Algorithm --- p.44Chapter 5.3 --- Case Studies --- p.45Chapter 5.3.1 --- Case I and II --- p.45Chapter 5.3.2 --- Case III --- p.50Chapter 5.4 --- Completely Restorable Network planning --- p.52Chapter 5.5 --- A Summary on Problem Formulations --- p.55Chapter Chapter 6. --- Conclusion --- p.57Reference --- p.6

Topology control for wireless networks with highly-directional antennas

In order to steer antenna beams towards one another for communication, wireless nodes with highly-directional antennas must track the channel state of their neighbors. To keep this overhead manageable, each node must limit the number of neighbors that it tracks. The subset of neighbors that each node chooses to track constitutes a network topology over which traffic can be routed. We consider this topology design problem, taking into account channel modeling, transmission scheduling, and traffic demand. We formulate the optimal topology design problem, with the objective of maximizing the scaling of traffic demand, and propose a distributed method, where each node rapidly builds a segment of the topology around itself by forming connections with its nearest neighbors in discretized angular regions. The method has low complexity and message passing overhead. The resulting topologies are shown to have desirable structural properties and approach the optimal solution in high path loss environments.National Science Foundation (U.S.) (Grant CNS-1524317)National Science Foundation (U.S.) (Grant CNS-1116209)National Science Foundation (U.S.) (Grant AST-1547331)United States. Air Force (Contract FA8721-05-C-0002

Virtual topology design for optical WDM networks

Master'sMASTER OF ENGINEERIN

Survivability stategies in all optical networks.

Thesis (M.Sc.Eng.)-University of KwaZulu-Natal, 2006.Thesis (M.Sc.)-University of KwaZulu-Natal, 2006.Recent advances in fiber optics technology have enabled extremely high-speed transport of different forms of data, on multiple wavelengths of an optical fiber, using Dense Wavelength Division Multiplexing (DWDM). It has now become possible to deploy high-speed, multi-service networks using DWDM technology. As the amount of traffic carried has increased, any single failure can be catastrophic. Survivability becomes indispensable in such networks. Therefore, it is imperative to design networks that can quickly and efficiently recover from failures. Most research to date in survivable optical network design and operation focuses on single link failures, however, the occurrence of multiple-link failures are not uncommon in networks today. Multi-link failure scenarios can arise out of two common situations. First, an arbitrary link may fail in the network, and before that link can be repaired, another link fails, thus creating a multi-link failure sequence. Secondly, it might happen in practice that two distinct physical links may be routed via the same common duct or physical channel. A failure at that shared physical location creates a logical multiple-link failure. In this dissertation, we conduct an intensive study of mechanisms for achieving survivability in optical networks. From the many mechanisms presented in the literature the focus of this work was on protection as a mechanism of survivability. In particular four protection schemes were simulated and their results analyzed to ascertain which protection scheme achieves the best survivability in terms of number of wavelengths recovered for a specific failure scenario. A model network was chosen and the protection schemes were evaluated for both single and multiple link and node failures. As an indicator of the performance of these protection schemes over a period of time average service availability and average loss in traffic for each protection scheme was also simulated. Further simulations were conducted to observe the percentage link and node utilization of each scheme hence allowing us to determine the strain each protection scheme places on network resources when traffic in the network increases. Finally based on these simulation results, recommendations of which protection scheme and under what failure conditions they should be used are made.Recent advances in fiber optics technology have enabled extremely high-speed transpor

WDM optical network: Efficient techniques for fault-tolerant logic topology design

The rapid increase of bandwidth intensive applications has created an unprecedented demand for bandwidth on the Internet. With recent advances in optical technologies, especially the development of wavelength division multiplexing (WDM) techniques, the amount of raw bandwidth available on the fibre links has increased by several orders of magnitude. Due to the large volume of traffic these optical networks carry, there is one very important issue---design of robust networks that can survive faults. Two common mechanisms to protect against the network failure: one is protection and another is restoration. My research focuses on studying the efficient techniques for fault-tolerant logical topology design for the WDM optical network. In my research, the goal is to determine a topology that accommodates the entire traffic flow and provides protection against any single fiber failure. I solve the problem by formulating the logical topology design problem as a MILP optimization problem, which generates the optimum logical topology and the optimum traffic routing scheme. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2004 .S54. Source: Masters Abstracts International, Volume: 43-01, page: 0244. Adviser: Arunita Jaekel. Thesis (M.Sc.)--University of Windsor (Canada), 2004

Optical flow switched networks

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.Includes bibliographical references (p. 253-279).In the four decades since optical fiber was introduced as a communications medium, optical networking has revolutionized the telecommunications landscape. It has enabled the Internet as we know it today, and is central to the realization of Network-Centric Warfare in the defense world. Sustained exponential growth in communications bandwidth demand, however, is requiring that the nexus of innovation in optical networking continue, in order to ensure cost-effective communications in the future. In this thesis, we present Optical Flow Switching (OFS) as a key enabler of scalable future optical networks. The general idea behind OFS-agile, end-to-end, all-optical connections-is decades old, if not as old as the field of optical networking itself. However, owing to the absence of an application for it, OFS remained an underdeveloped idea-bereft of how it could be implemented, how well it would perform, and how much it would cost relative to other architectures. The contributions of this thesis are in providing partial answers to these three broad questions. With respect to implementation, we address the physical layer design of OFS in the metro-area and access, and develop sensible scheduling algorithms for OFS communication. Our performance study comprises a comparative capacity analysis for the wide-area, as well as an analytical approximation of the throughput-delay tradeoff offered by OFS for inter-MAN communication. Lastly, with regard to the economics of OFS, we employ an approximate capital expenditure model, which enables a throughput-cost comparison of OFS with other prominent candidate architectures. Our conclusions point to the fact that OFS offers significant advantage over other architectures in economic scalability.(cont.) In particular, for sufficiently heavy traffic, OFS handles large transactions at far lower cost than other optical network architectures. In light of the increasing importance of large transactions in both commercial and defense networks, we conclude that OFS may be crucial to the future viability of optical networking.by Guy E. Weichenberg.Ph.D

High capacity photonic integrated switching circuits

As the demand for high-capacity data transfer keeps increasing in high performance computing and in a broader range of system area networking environments; reconfiguring the strained networks at ever faster speeds with larger volumes of traffic has become a huge challenge. Formidable bottlenecks appear at the physical layer of these switched interconnects due to its energy consumption and footprint. The energy consumption of the highly sophisticated but increasingly unwieldy electronic switching systems is growing rapidly with line rate, and their designs are already being constrained by heat and power management issues. The routing of multi-Terabit/second data using optical techniques has been targeted by leading international industrial and academic research labs. So far the work has relied largely on discrete components which are bulky and incurconsiderable networking complexity. The integration of the most promising architectures is required in a way which fully leverages the advantages of photonic technologies. Photonic integration technologies offer the promise of low power consumption and reduced footprint. In particular, photonic integrated semiconductor optical amplifier (SOA) gate-based circuits have received much attention as a potential solution. SOA gates exhibit multi-terahertz bandwidths and can be switched from a high-gain state to a high-loss state within a nanosecond using low-voltage electronics. In addition, in contrast to the electronic switching systems, their energy consumption does not rise with line rate. This dissertation will discuss, through the use of different kind of materials and integration technologies, that photonic integrated SOA-based optoelectronic switches can be scalable in either connectivity or data capacity and are poised to become a key technology for very high-speed applications. In Chapter 2, the optical switching background with the drawbacks of optical switches using electronic cores is discussed. The current optical technologies for switching are reviewed with special attention given to the SOA-based switches. Chapter 3 discusses the first demonstrations using quantum dot (QD) material to develop scalable and compact switching matrices operating in the 1.55µm telecommunication window. In Chapter 4, the capacity limitations of scalable quantum well (QW) SOA-based multistage switches is assessed through experimental studies for the first time. In Chapter 5 theoretical analysis on the dependence of data integrity as ultrahigh line-rate and number of monolithically integrated SOA-stages increases is discussed. Chapter 6 presents some designs for the next generation of large scale photonic integrated interconnects. A 16x16 switch architecture is described from its blocking properties to the new miniaturized elements proposed. Finally, Chapter 7 presents several recommendations for future work, along with some concluding remark

Resource allocation and performance analysis problems in optical networks

Optical networks pose a rich variety of new design and performance analysis problems. Typically, the static design problems belong to the field of combinatorial optimisation, whereas decision-making and performance analysis problems are best treated using appropriate stochastic models. This dissertation focuses on certain issues in resource allocation and performance evaluation of backbone wavelength-routed (WR) networks and metropolitan area optical burst switching (OBS) networks. The first two parts of the thesis consider heuristic algorithms for the static routing and wavelength assignment (RWA) and logical topology design (LTD) problems that arise in the context of WR networks. In a static RWA problem, one is asked to establish a given set of lightpaths (or light trees) in an optical WR network with given constraints, where the objective often is to minimise the number of wavelength channels required. In LTD problem, the number of wavelength channels is given and one is asked to decide on the set of lightpaths so that, for instance, the mean sojourn time of packets travelling at the logical layer is minimised. In the thesis, several heuristic algorithms for both the RWA and LTD problems are described and numerical results are presented. The third part of the thesis studies the dynamic control problem where connection requests, i.e. lightpath requests, arrive according to a certain traffic pattern and the task is to establish one lightpath at a time in the WR optical network so that the expected revenue is maximised or the expected cost is minimised. Typically, the goal of optimisation is to minimise some infinite time horizon cost function, such as the blocking probability. In this thesis, the dynamic RWA problem is studied in the framework of Markov decision processes (MDP). An algorithmic approach is proposed by which any given heuristic algorithm can be improved by applying the so-called first policy iteration (FPI) step of the MDP theory. Relative costs of states needed in FPI are estimated by on-the-fly simulations. The computational burden of the approach is alleviated by introducing the importance sampling (IS) technique with FPI, for which an adaptive algorithm is proposed for adjusting the optimal IS parameters at the same time as data are collected for the decision-making analysis. The last part of the thesis considers OBS networks, which represent an intermediate step towards full optical packet switching networks. In OBS networks, the data are transferred using optical bursts consisting of several IP packets going to the same destination. On the route of the burst, temporary reservations are made only for the time during which the burst is transmitted. This thesis focuses on fairness issues in OBS networks. It is demonstrated that fairness can be improved by using fibre delay lines together with Just-Enough-Time protocol (JET). Furthermore, by choosing the routes in an appropriate way one can also reach a satisfactory level of fairness and, at the same time, lower the overall blocking probability. Possible scheduling policies for metropolitan area OBS ring networks are also studied.reviewe

Recent Trends in Communication Networks

In recent years there has been many developments in communication technology. This has greatly enhanced the computing power of small handheld resource-constrained mobile devices. Different generations of communication technology have evolved. This had led to new research for communication of large volumes of data in different transmission media and the design of different communication protocols. Another direction of research concerns the secure and error-free communication between the sender and receiver despite the risk of the presence of an eavesdropper. For the communication requirement of a huge amount of multimedia streaming data, a lot of research has been carried out in the design of proper overlay networks. The book addresses new research techniques that have evolved to handle these challenges