On IP over WDM burst-switched long haul and metropolitan area networks

The IP over Wavelength Division Multiplexing (WDM) network is a natural evolution ushered in by the phenomenal advances in networking technologies and technical breakthroughs in optical communications, fueled by the increasing demand in the reduction of operation costs and the network management complexity. The unprecedented bandwidth provisioning capability and the multi-service supportability of the WDM technology, in synergy with the data-oriented internetworking mechanisms, facilitates a common shared infrastructure for the Next Generation Internet (NGJ). While NGI targets to perform packet processing directly on the optical transport layer, a smooth evolution is critical to success. Intense research has been conducted to design the new generation optical networks that retain the advantages of packet-oriented transport prototypes while rendering elastic network resource utilization and graded levels of service. This dissertation is focused on the control architecture, enabling technologies, and performance analysis of the WDM burst-switched long haul and Metropolitan Area Networks (MANs). Theoretical analysis and simulation results are reported to demonstrate the system performance and efficiency of proposed algorithms. A novel transmission mechanism, namely, the Forward Resource Reservation (ERR) mechanism, is proposed to reduce the end-to-end delay for an Optical Burst Switching (OBS)-based IP over WDM system. The ERR scheme adopts a Linear Predictive Filter and an aggressive reservation strategy for data burst length prediction and resource reservation, respectively, and is extended to facilitate Quality of Service (QoS) differentiation at network edges. The ERR scheme improves the real-time communication services for applications with time constraints without deleterious system costs. The aggressive strategy for channel holding time reservations is proposed. Specifically, two algorithms, the success probability-driven (SPD) and the bandwidth usage-driven (BUD) ones, are proposed for resource reservations in the FRRenabled scheme. These algorithms render explicit control on the latency reduction improvement and bandwidth usage efficiency, respectively, both of which are important figures of performance metrics. The optimization issue for the FRR-enabled system is studied based on two disciplines - addressing the static and dynamic models targeting different desired objectives (in terms of algorithm efficiency and system performance), and developing a \u27\u27crank back\u27\u27 based signaling mechanism to provide bandwidth usage efficiency. The proposed mechanisms enable the network nodes to make intelligent usage of the bandwidth resources. In addition, a new control architecture with enhanced address resolution protocol (E-ARP), burst-based transmission, and hop-based wavelength allocation is proposed for Ethernet-supported IP over WDM MANs. It is verified, via theoretical analysis and simulation results, that the E-ARP significantly reduces the call setup latency and the transmission requirements associated with the address probing procedures; the burst-based transport mechanism improves the network throughput and resource utilization; and the hop-based wavelength allocation algorithm provides bandwidth multiplexing with fairness and high scalability. The enhancement of the Ethernet services, in tandem with the innovative mechanisms in the WDM domain, facilitates a flexible and efficient integration, thus making the new generation optical MAN optimized for the scalable, survivable, and IP-dominated network at gigabit speed possible

Fiber optic networks: fairness, access controls and prototyping

Fiber optic technologies enabling high-speed, high-capacity digital information transport have only been around for about 3 decades but in their short life have completely revolutionized global communications. To keep pace with the growing demand for digital communications and entertainment, fiber optic networks and technologies continue to grow and mature. As new applications in telecommunications, computer networking and entertainment emerge, reliability, scalability, and high Quality of Service (QoS) requirements are increasing the complexity of optical transport networks.;This dissertation is devoted to providing a discussion of existing and emerging technologies in modern optical communications networks. To this end, we first outline traditional telecommunication and data networks that enable high speed, long distance information transport. We examine various network architectures including mesh, ring and bus topologies of modern Local, Metropolitan and Wide area networks. We present some of the most successful technologies used in todays communications networks, outline their shortcomings and introduce promising new technologies to meet the demands of future transport networks.;The capacity of a single wavelength optical signal is 10 Gbps today and is likely to increase to over 100 Gbps as demonstrated in laboratory settings. In addition, Wavelength Division Multiplexing (WDM) techniques, able to support over 160 wavelengths on a single optical fiber, have effectively increased the capacity of a single optical fiber to well over 1 Tbps. However, user requirements are often of a sub-wavelength order. This mis-match between individual user requirements and single wavelength offerings necessitates bandwidth sharing mechanisms to efficiently multiplex multiple low rate streams on to high rate wavelength channels, called traffic grooming.;This dissertation examines traffic grooming in the context of circuit, packet, burst and trail switching paradigms. Of primary interest are the Media Access Control (MAC) protocols used to provide QoS and fairness in optical networks. We present a comprehensive discussion of the most recognized fairness models and MACs for ring and bus networks which lay the groundwork for the development of the Robust, Dynamic and Fair Network (RDFN) protocol for ring networks. The RDFN protocol is a novel solution to fairly share ring bandwidth for bursty asynchronous data traffic while providing bandwidth and delay guarantees for synchronous voice traffic.;We explain the light-trail (LT) architecture and technology introduced in [37] as a solution to providing high network resource utilization, seamless scalability and network transparency for metropolitan area networks. The goal of light-trails is to eliminate Optical Electronic Optical (O-E-O) conversion, minimize active switching, maximize wavelength utilization, and offer protocol and bit-rate transparency to address the growing demands placed on WDM networks. Light-trail technology is a physical layer architecture that combines commercially available optical components to allow multiple nodes along a lightpath to participate in time multiplexed communication without the need for burst or packet level switch reconfiguration. We present three medium access control protocols for light-trails that provide collision protection but do not consider fair network access. As an improvement to these light-trail MAC protocols we introduce the Token LT and light-trail Fair Access (LT-FA) MAC protocols and evaluate their performance. We illustrate how fairness is achieved and access delay guarantees are made to satisfy the bandwidth budget fairness model. The goal of light-trails and our access control solution is to combine commercially available components with emerging network technologies to provide a transparent, reliable and highly scalable communication network.;The second area of discussion in this dissertation deals with the rapid prototyping platform. We discuss how the reconfigurable rapid prototyping platform (RRPP) is being utilized to bridge the gap between academic research, education and industry. We provide details of the Real-time Radon transform and the Griffin parallel computing platform implemented using the RRPP. We discuss how the RRPP provides additional visibility to academic research initiatives and facilitates understanding of system level designs. As a proof of concept, we introduce the light-trail testbed developed at the High Speed Systems Engineering lab. We discuss how a light-trail test bed has been developed using the RRPP to provide additional insight on the real-world limitations of light-trail technology. We provide details on its operation and discuss the steps required to and decisions made to realize test-bed operation. Two applications are presented to illustrate the use of the LT-FA MAC in the test-bed and demonstrate streaming media over light-trails.;As a whole, this dissertation aims to provide a comprehensive discussion of current and future technologies and trends for optical communication networks. In addition, we provide media access control solutions for ring and bus networks to address fair resource sharing and access delay guarantees. The light-trail testbed demonstrates proof of concept and outlines system level design challenges for future optical networks

Dynamic wavelength routing in multifiber WDM networks

The research, development, and deployment of wavelength division multiplexing (WDM) technology are now evolving at a rapid pace to fulfill the increasing bandwidth requirement and deploy new network services. Routing and wavelength assignment algorithms play a key role in improving the performance of wavelength-routed all-optical networks. We study networks with dynamic wavelength routing and develop accurate analytical models for evaluating the blocking performance under dynamic input traffic in different topologies. Two dynamic routing algorithms are first developed and the performances of the algorithms in single-fiber WDM networks are studied using both analytical models and simulation. We also develop efficient algorithms to optimally place a given number of wavelength converters on a path of a network. Finally we consider the effect of multiple fibers on WDM networks without wavelength conversion. We develop analytical models for evaluating the blocking performance of multifiber networks with fixed-path routing, alternate-path routing, and fixed-path least-congestion routing algorithms. The number of fibers required to provide high performance in multifiber networks with different routing algorithms are also studied

Design And Analysis Of Effective Routing And Channel Scheduling For Wavelength Division Multiplexing Optical Networks

Optical networking, employing wavelength division multiplexing (WDM), is seen as the technology of the future for the Internet. This dissertation investigates several important problems affecting optical circuit switching (OCS) and optical burst switching (OBS) networks. Novel algorithms and new approaches to improve the performance of these networks through effective routing and channel scheduling are presented. Extensive simulations and analytical modeling have both been used to evaluate the effectiveness of the proposed algorithms in achieving lower blocking probability, better fairness as well as faster switching. The simulation tests were performed over a variety of optical network topologies including the ring and mesh topologies, the U.S. Long-Haul topology, the Abilene high-speed optical network used in Internet 2, the Toronto Metropolitan topology and the European Optical topology. Optical routing protocols previously published in the literature have largely ignored the noise and timing jitter accumulation caused by cascading several wavelength conversions along the lightpath of the data burst. This dissertation has identified and evaluated a new constraint, called the wavelength conversion cascading constraint. According to this constraint, the deployment of wavelength converters in future optical networks will be constrained by a bound on the number of wavelength conversions that a signal can go through when it is switched all-optically from the source to the destination. Extensive simulation results have conclusively demonstrated that the presence of this constraint causes significant performance deterioration in existing routing and wavelength assignment (RWA) algorithms. Higher blocking probability and/or worse fairness have been observed for existing RWA algorithms when the cascading constraint is not ignored. To counteract the negative side effect of the cascading constraint, two constraint-aware routing algorithms are proposed for OCS networks: the desirable greedy algorithm and the weighted adaptive algorithm. The two algorithms perform source routing using link connectivity and the global state information of each wavelength. Extensive comparative simulation results have illustrated that by limiting the negative cascading impact to the minimum extent practicable, the proposed approaches can dramatically decrease the blocking probability for a variety of optical network topologies. The dissertation has developed a suite of three fairness-improving adaptive routing algorithms in OBS networks. The adaptive routing schemes consider the transient link congestion at the moment when bursts arrive and use this information to reduce the overall burst loss probability. The proposed schemes also resolve the intrinsic unfairness defect of existing popular signaling protocols. The extensive simulation results have shown that the proposed schemes generally outperform the popular shortest path routing algorithm and the improvement could be substantial. A two-dimensional Markov chain analytical model has also been developed and used to analyze the burst loss probabilities for symmetrical ring networks. The accuracy of the model has been validated by simulation. Effective proactive routing and preemptive channel scheduling have also been proposed to address the conversion cascading constraint in OBS environments. The proactive routing adapts the fairness-improving adaptive routing mentioned earlier to the environment of cascaded wavelength conversions. On the other hand, the preemptive channel scheduling approach uses a dynamic priority for each burst based on the constraint threshold and the current number of performed wavelength conversions. Empirical results have proved that when the cascading constraint is present, both approaches would not only decrease the burst loss rates greatly, but also improve the transmission fairness among bursts with different hop counts to a large extent

Design and provisioning of WDM networks for traffic grooming

Wavelength Division Multiplexing (WDM) is the most viable technique for utilizing the enormous amounts of bandwidth inherently available in optical fibers. However, the bandwidth offered by a single wavelength in WDM networks is on the order of tens of Gigabits per second, while most of the applications\u27 bandwidth requirements are still subwavelength. Therefore, cost-effective design and provisioning of WDM networks require that traffic from different sessions share bandwidth of a single wavelength by employing electronic multiplexing at higher layers. This is known as traffic grooming. Optical networks supporting traffic grooming are usually designed in a way such that the cost of the higher layer equipment used to support a given traffic matrix is reduced. In this thesis, we propose a number of optimal and heuristic solutions for the design and provisioning of optical networks for traffic grooming with an objective of network cost reduction. In doing so, we address several practical issues. Specifically, we address the design and provisioning of WDM networks on unidirectional and bidirectional rings for arbitrary unicast traffic grooming, and on mesh topologies for arbitrary multipoint traffic grooming. In multipoint traffic grooming, we address both multicast and many-to-one traffic grooming problems. We provide a unified frame work for optimal and approximate network dimensioning and channel provisioning for the generic multicast traffic grooming problem, as well as some variants of the problem. For many-to-one traffic grooming we propose optimal as well as heuristic solutions. Optimal formulations which are inherently non-linear are mapped to an optimal linear formulation. In the heuristic solutions, we employ different problem specific search strategies to explore the solution space. We provide a number of experimental results to show the efficacy of our proposed techniques for the traffic grooming problem in WDM networks

Investigation of the tolerance of wavelength-routed optical networks to traffic load variations.

This thesis focuses on the performance of circuit-switched wavelength-routed optical network with unpredictable traffic pattern variations. This characteristic of optical networks is termed traffic forecast tolerance. First, the increasing volume and heterogeneous nature of data and voice traffic is discussed. The challenges in designing robust optical networks to handle unpredictable traffic statistics are described. Other work relating to the same research issues are discussed. A general methodology to quantify the traffic forecast tolerance of optical networks is presented. A traffic model is proposed to simulate dynamic, non-uniform loads, and used to test wavelength-routed optical networks considering numerous network topologies. The number of wavelengths required and the effect of the routing and wavelength allocation algorithm are investigated. A new method of quantifying the network tolerance is proposed, based on the calculation of the increase in the standard deviation of the blocking probabilities with increasing traffic load non-uniformity. The performance of different networks are calculated and compared. The relationship between physical features of the network topology and traffic forecast tolerance is investigated. A large number of randomly connected networks with different sizes were assessed. It is shown that the average lightpath length and the number of wavelengths required for full interconnection of the nodes in static operation both exhibit a strong correlation with the network tolerance, regardless of the degree of load non-uniformity. Finally, the impact of wavelength conversion on network tolerance is investigated. Wavelength conversion significantly increases the robustness of optical networks to unpredictable traffic variations. In particular, two sparse wavelength conversion schemes are compared and discussed: distributed wavelength conversion and localized wavelength conversion. It is found that the distributed wavelength conversion scheme outperforms localized wavelength conversion scheme, both with uniform loading and in terms of the network tolerance. The results described in this thesis can be used for the analysis and design of reliable WDM optical networks that are robust to future traffic demand variations

Wavelengths switching and allocation algorithms in multicast technology using m-arity tree networks topology

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University London.In this thesis, the m-arity tree networks have been investigated to derive equations for their nodes, links and required wavelengths. The relationship among all parameters such as leaves nodes, destinations, paths and wavelengths has been found. Three situations have been explored, firstly when just one server and the leaves nodes are destinations, secondly when just one server and all other nodes are destinations, thirdly when all nodes are sources and destinations in the same time. The investigation has included binary, ternary, quaternary and finalized by general equations for all m-arity tree networks. Moreover, a multicast technology is analysed in this thesis to transmit data carried by specific wavelengths to several clients. Wavelengths multicast switching is well examined to propose split-convert-split-convert (S-C-S-C) multicast switch which consists of light splitters and wavelengths converters. It has reduced group delay by 13% and 29% compared with split-convert (S-C) and split-convert-split (S-C-S) multicast switches respectively. The proposed switch has also increased the received signal power by a significant value which reaches 28% and 26.92% compared with S-C-S and S-C respectively. In addition, wavelengths allocation algorithms in multicast technology are proposed in this thesis using tree networks topology. Distributed scheme is adopted by placing wavelength assignment controller in all parents’ nodes. Two distributed algorithms proposed shortest wavelength assignment (SWA) and highest number of destinations with shortest wavelength assignment (HND-SWA) algorithms to increase the received signal power, decrease group delay and reduce dispersion. The performance of the SWA algorithm was almost better or same as HND-SWA related to the power, dispersion and group delay but they are always better than other two algorithms. The required numbers of wavelengths and their utilised converters have been examined and calculated for the researched algorithms. The HND-SWA has recorded the superior performance compared with other algorithms. It has reduced number of utilised wavelengths up to about 19% and minimized number of the used wavelengths converters up to about 29%. Finally, the centralised scheme is discussed and researched and proposed a centralised highest number of destinations (CHND) algorithm with static and dynamic scenarios to reduce network capacity decreasing (Cd) after each wavelengths allocation. The CDHND has reduced (Cd) by about 16.7% compared with the other algorithms