Priority based dynamic lightpath allocation in WDM networks.

Internet development generates new bandwidth requirement every day. Optical networks employing WDM (wavelength division multiplexing) technology can provide high capacity, low error rate and low delay. They are considered to be future backbone networks. Since WDM networks usually operate in a high speed, network failure (such as fiber cut), even for a short term, can cause huge data lost. So design robust WDM network to survive faults is a crucial issue in WDM networks. This thesis introduces a new and efficient MILP (Mixed Integer Linear Programming) formulation to solve dynamic lightpath allocation problem in survivable WDM networks, using both shared and dedicated path protection. The formulation defines multiple levels of service to further improve resource utilization. Dijkstra\u27s shortest path algorithm is used to pre-compute up to 3 alternative routes between any node pair, so as to limit the lightpath routing problem within up to 3 routes instead of whole network-wide. This way can shorten the solution time of MILP formulation; make it acceptable for practical size network. Extensive experiments carried out on a number of networks show this new MILP formulation can improve performance and is feasible for real-life network. Source: Masters Abstracts International, Volume: 43-01, page: 0249. Adviser: Arunita Jaekel. Thesis (M.Sc.)--University of Windsor (Canada), 2004

Protection and restoration algorithms for WDM optical networks

Currently, Wavelength Division Multiplexing (WDM) optical networks play a major role in supporting the outbreak in demand for high bandwidth networks driven by the Internet. It can be a catastrophe to millions of users if a single optical fiber is somehow cut off from the network, and there is no protection in the design of the logical topology for a restorative mechanism. Many protection and restoration algorithms are needed to prevent, reroute, and/or reconfigure the network from damages in such a situation. In the past few years, many works dealing with these issues have been reported. Those algorithms can be implemented in many ways with several different objective functions such as a minimization of protection path lengths, a minimization of restoration times, a maximization of restored bandwidths, etc. This thesis investigates, analyzes and compares the algorithms that are mainly aimed to guarantee or maximize the amount of remaining bandwidth still working over a damaged network. The parameters considered in this thesis are the routing computation and implementation mechanism, routing characteristics, recovering computation timing, network capacity assignment, and implementing layer. Performance analysis in terms of the restoration efficiency, the hop length, the percentage of bandwidth guaranteed, the network capacity utilization, and the blocking probability is conducted and evaluated

A Shared Backup Path Protection Scheme for Optical Mesh Networks

We propose a new heuristic ILP model for share backup path protection (SBPP) scheme of mesh networks, which used the sets of disjoint-joint primary-backup path candidates of using path-pair candidates. The solution of the model is near optimal and provides all the routing details of demands as well as the sharing information between backup paths, and also simplifies the wavelength assignment problem if the wavelength continuity is a consideration. The new entities are introduced into this model that allow to control the resource utilization as well as congestion level of the network for optimization purposes and the pre-processing of data offers more control in properties of the path candidate

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

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

Heuristic for the design of fault tolerant logical topology.

Wavelength division multiplexing (WDM) in optical fiber networks is widely viewed as the savior for its potential to satisfy the huge bandwidth requirement of network users. Optical cross connect (OCX) in WDM network facilitates the switching of signal on any wavelength from any input port to any output port. As a result, it is possible to establish ligthpaths between any pair of nodes. The set of lightpaths established over fiber links defines logical topology. In our thesis, we proposed a heuristic approach for the design of fault tolerant logical topology. Our design approach generalizes the design protection concept and enforces wavelength continuity constraint in a multi-hop optical network. In our work, we first designed logical topology for fault free state of the network. We, then, added additional lightpaths for each single link failure scenario. Numerical results clearly show that our approach outperforms Shared path protection and Dedicated path protection. Our simulation result shows that our approach is feasible for large networks. (Abstract shortened by UMI.) Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .S24. Source: Masters Abstracts International, Volume: 44-03, page: 1413. Thesis (M.Sc.)--University of Windsor (Canada), 2005

Dynamic bandwidth management with service differentiation over ethernet passive optical networks

Ethernet passive optical networks (EPONs) address the first mile of the communication infrastructure between the service provider central offices and the customer sites. As a low-cost, high speed technology, EPONs are deemed as the solution to the bottleneck problem of the broadband access network. A major feature of EPONs is the utility of a shared upstream channel among the end users. Only a single optical network unit (GNU) may transmit during a timeslot to avoid data collisions. In order to provide diverse quality of service (QoS), the bandwidth management of the upstream channel is essential for the successful implementation of EPONs, and thus, an efficient medium access control is required to facilitate statistical multiplexing among local traffics. This dissertation addresses the upstream bandwidth allocation over EPONs. An efficient mechanism, i.e., limited sharing with traffic prediction (LSTP), has been proposed to arbitrate the upstream bandwidth among ONUs. The MultiPoint Control Protocol (MPCP) messages, which are stipulated by the IEEE 802.3ah Ethernet in the First Mile (EFM) Task Force, are adopted by LSTP to facilitate the dynamic bandwidth negotiation between an GNU and the OLT. The bandwidth requirement of an ONU includes the already enqueued frames and the predicted incoming frames during the waiting time. The OLT arbitrates the bandwidth assignment based on the queue status report from an GNU, the traffic prediction, and the agreed service contract. With respect to the performance evaluation, theoretical analysis on the frame loss, the frame delay, and the queue length has been conducted. The quantitative results demonstrate that 1) the innovative LSTP mechanism dynamically allocates the upstream bandwidth among multiple ONUs; 2) the traffic predictor at the OLT delivers satisfactory prediction for the bursty self-similar traffic, and thereby, contributing to the reduction of frame loss, frame delay, and queue length; and 3) the bandwidth arbitration at the OLT effectively restricts the aggressive bandwidth competition among ONUs by adopting the service level agreement (SLA) parameter as the upper bound. Aside from analysis, the LSTP mechanism has been substantiated by experimental simulations. In order to differentiate the service provisioning among diverse users, LSTP is further enhanced with the support of dynamic bandwidth negotiation based on multiple queues. The incoming traffics are first classified into three classes, and then enqueued into the corresponding queues. A traffic predictor is dedicated to one class of traffic from an GNU. Service differentiation among classes are provided by the combination of queuing and scheduling at the GNU side. At the OLT side, the bandwidth allocation for each class of traffic is based on the reported queue status and the traffic prediction, and is upper-bounded by the SLA parameter. Experimental simulations have justified the feasibility of providing service differentiation over the broadband EPONs

Integrated mechanisms for QoS and restoration in mesh transport networks

Survivable networks have the capability to survive from the events of network components failures. The resilience mechanisms in these networks protect and restore the impaired communication paths by using spare capacity. On the other hand, Quality of Service (QoS) mechanisms focus on network capabilities that provide the facilities to differentiate network traffic and offer different levels of service to each class of traffic. Traditionally the survivability algorithms were applied at the physical (optical) layer, whereas the QoS mechanisms mainly applied at packet-forwarding level. Recent technological breakthroughs can now facilitate novel forwarding techniques for optical data bursts that make it possible to capture packets at the optical layer. A major challenge in the transfer of these ultrahigh-speed data bursts is to allocate resources according to QoS specifications and to provide spare capacity required to address link failures

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

A Hybrid p-Cycle Search Algorithm for Protection in WDM Mesh Networks

p-Cycle is a type of shared link protection for survivable wavelength-division multiplexing (WDM) mesh networks. p-Cycle not only retains ring-like restoration speeds, but also achieves capacity efficiency in mesh networks. However, finding the optimal set of p-cycles to protect all traffic demands within a reasonable response time is difficult. This is particularity true with dense meshes or large networks, because the number of candidates is huge. Generally, p-cycles are determined by using either Integer Linear Programming (ILP) or specifically designed heuristic algorithms. However, both methods need a set of efficient candidate cycles to tradeoff between the computational time and the optimality of solutions. For this reason, constructing an efficient set of candidate p-cycles is crucial and imperative. In this paper, we propose the Span-weighted Cycle Searching (SCS) algorithm to generate and select an adequate number of p-cycles to minimize the spare capacity, while achieving 100% restorability, within low computational complexity