Resource Allocation Schemes And Performance Evaluation Models For Wavelength Division Multiplexed Optical Networks

Wavelength division multiplexed (WDM) optical networks are rapidly becoming the technology of choice in network infrastructure and next-generation Internet architectures. WDM networks have the potential to provide unprecedented bandwidth, reduce processing cost, achieve protocol transparency, and enable efficient failure handling. This dissertation addresses the important issues of improving the performance and enhancing the reliability of WDM networks as well as modeling and evaluating the performance of these networks. Optical wavelength conversion is one of the emerging WDM enabling technologies that can significantly improve bandwidth utilization in optical networks. A new approach for the sparse placement of full wavelength converters based on the concept of the k-Dominating Set (k-DS) of a graph is presented. The k-DS approach is also extended to the case of limited conversion capability using three scalable and cost-effective switch designs: flexible node-sharing, strict node-sharing and static mapping. Compared to full search algorithms previously proposed in the literature, the K-DS approach has better blocking performance, has better time complexity and avoids the local minimum problem. The performance benefit of the K-DS approach is demonstrated by extensive simulation. Fiber delay line (FDL) is another emerging WDM technology that can be used to obtain limited optical buffering capability. A placement algorithm, k-WDS, for the sparse placement of FDLs at a set of selected nodes in Optical Burst Switching (OBS) networks is proposed. The algorithm can handle both uniform and non-uniform traffic patterns. Extensive performance tests have shown that k-WDS provides more efficient placement of optical fiber delay lines than the well-known approach of placing the resources at nodes with the highest experienced burst loss. Performance results that compare the benefit of using FDLs versus using optical wavelength converters (OWCs) are presented. A new algorithm, A-WDS, for the placement of an arbitrary numbers of FDLs and OWCs is introduced and is evaluated under different non-uniform traffic loads. This dissertation also introduces a new cost-effective optical switch design using FDL and a QoS-enhanced JET (just enough time) protocol suitable for optical burst switched WDM networks. The enhanced JET protocol allows classes of traffic to benefit from FDLs and OWCs while minimizing the end-to-end delay for high priority bursts. Performance evaluation models of WDM networks represent an important research area that has received increased attention. A new analytical model that captures link dependencies in all-optical WDM networks under uniform traffic is presented. The model enables the estimation of connection blocking probabilities more accurately than previously possible. The basic formula of the dependency between two links in this model reflects their degree of adjacency, the degree of connectivity of the nodes composing them and their carried traffic. The usefulness of the model is illustrated by applying it to the sparse wavelength converters placement problem in WDM networks. A lightpath containing converters is divided into smaller sub-paths such that each sub-path is a wavelength continuous path and the nodes shared between these sub-paths are full wavelength conversion capable. The blocking probability of the entire path is obtained by computing the blocking probabilities of the individual sub-paths. The analytical-based sparse placement algorithm is validated by comparing it with its simulation-based counterpart using a number of network topologies. Rapid recovery from failure and high levels of reliability are extremely important in WDM networks. A new Fault Tolerant Path Protection scheme, FTPP, for WDM mesh networks based on the alarming state of network nodes and links is introduced. The results of extensive simulation tests show that FTPP outperforms known path protection schemes in terms of loss of service ratio and network throughput. The simulation tests used a wide range of values for the load intensity, the failure arrival rate and the failure holding time. The FTPP scheme is next extended to the differentiated services model and its connection blocking performance is evaluated. Finally, a QoS-enhanced FTPP (QEFTPP) routing and path protection scheme in WDM networks is presented. QEFTPP uses preemption to minimize the connection blocking percentage for high priority traffic. Extensive simulation results have shown that QEFTPP achieves a clear QoS differentiation among the traffic classes and provides a good overall network performance

Architecture and sparse placement of limited-wavelength converters for optical networks

Equipping all nodes of a large optical network with full conversion capability is prohibitively costly. To improve performance at reduced cost, sparse converter placement algorithms are used to select a subset of nodes for full-conversion deployment. Further cost reduction can be obtained by deploying only limited conversion capability in the selected nodes. We present a limited wavelength converter placement algorithm based on the k-minimum dominating set (k-MDS) concept. We propose three different cost-effective optical switch designs using the technologically feasible nontunable optical multiplexers. These three switch designs are flexible node sharing, strict node sharing, and static mapping. Compared to the full search heuristic of O(N-3) complexity based on ranking nodes by blocking percentages, our algorithm not only has a better time complexity O(RN2), where R is the number of disjoint sets provided by k-MIDS, but also avoids the local minimum problem. The performance benefit of our algorithm is demonstrated by network simulation with the U.S Long Haul topology having 28 nodes (91 is 5) and the National Science Foundation (NSF) network having 16 nodes (91 is 4). Our simulation considers the case when the traffic is not uniformly distributed between node pairs in the network using a weighted placement approach, referred to as k-WMDS. From the optical network management point of view, our results also show that the limited conversion capability can achieve performance very close to that of the full conversion capability, while not only decreasing the optical switch cost but also enhancing its fault tolerance

RESOURCE ALLOCATION SCHEMES AND PERFORMANCE EVALUATION MODELS FOR WAVELENGTH DIVISION MULTIPLEXED OPTICAL NETWORKS

ii Wavelength division multiplexed (WDM) optical networks are rapidly becoming the technology of choice in network infrastructure and next-generation Internet architectures. WDM networks have the potential to provide unprecedented bandwidth, reduce processing cost, achieve protocol transparency, and enable efficient failure handling. This dissertation addresses the important issues of improving the performance and enhancing the reliability of WDM networks as well as modeling and evaluating the performance of these networks. Optical wavelength conversion is one of the emerging WDM enabling technologies that can significantly improve bandwidth utilization in optical networks. A new approach for the sparse placement of full wavelength converters based on the concept of the k-Dominating Set (k-DS) of a graph is presented. The k-DS approach is also extended to the case of limited conversion capability using three scalable and cost-effective switch designs: flexible node-sharing, strict node-sharing and static mapping. Compared to full search algorithms previously proposed in the literature, the K-DS approach has better blocking performance, has better time complexity an

Dependency-Based Analytical Model For Computing Connection Blocking Rates And Its Application In The Sparse Placement Of Optical Converters

In this paper, we present a new analytical model that captures link dependencies in all-optical wavelength-division multiplexing (WDM) networks under uniform traffic and enables the estimation of connection-blocking probabilities more accurately than previously possible. The basic formula of the dependency between two links in this model reflects their degree of adjacency, the degree of connectivity of the nodes composing them, and their carried traffic. Our validation tests have shown that the analytical dependency model gives accurate results and successfully captures the main dependency characteristics observed in the simulation measurements. The usefulness of the model is illustrated by showing how to use it in enhancing a simulation-based algorithm that we recently proposed for the sparse placement of full wavelength converters in WDM networks. To analytically handle the presence of wavelength converters, a lightpath containing converters is divided into smaller subpaths, such that each subpath is a wavelength-continuous path, and the nodes shared between these subpaths are full wavelength-conversion-capable. The blocking probability of the entire path is obtained by computing the probabilities in the individual subpaths. We validate the analytically-based sparse placement algorithm by comparing it with its simulation-based counterpart using a number of network topologies. © 2006 IEEE

Algorithm For Placement Of Limited Wavelength Conversion In Wdm Optical Networks

Equipping all nodes of a large optical network with full conversion capability is prohibitively costly. To improve performance at reduced cost, sparse converter placement algorithms are used to select a subset of nodes for full-conversion deployment. Further cost reduction can be obtained by deploying only limited conversion capability in the selected nodes. In this paper, we present a limited wavelength converters placement algorithm based on the k-Minimum Dominating Set (k-MDS) concept. We propose three different cost effective optical switch designs using the technologically feasible non-tunable optical multiplexers. These three switch designs are Flexible Node-Sharing, Strict Node-Sharing and Static Mapping. Compared to the full search heuristic of O(N 3) complexity based on ranking nodes by blocking percentages, our algorithm on one hand has a better time complexity O(ℛ.N 2) - ℛ is the number of disjoint sets provided by k-MDS; and on the other hand avoids the local minimum problem. The performance benefit of our algorithm is demonstrated by network simulation with the U.S Long Haul topology having 28 nodes (ℛ is 5). From the optical network management point of view, our results also show that the limited conversion capability can achieve performance very close to that of the full conversion capability; while not only decreasing the optical switch cost but also enhancing its fault tolerance

Alarm-Based Routing And Path Protection In Survivable Wavelength-Routed All-Optical Mesh Networks

We present what we believe to be a new fault-tolerant path-protection scheme, FTPP, for WDM mesh networks based on the alarming state of network nodes and links. Our extensive simulation results show that FTPP outperforms known path-protection schemes in terms of loss-of-service ratio and network throughput. The simulation tests used a wide range of values for the load intensity, the failure arrival rate, and the failure holding time. The effectiveness of our method has been demonstrated with the U.S. long-haul and the NSFNET topologies. We next extend the FTPP scheme to the differentiated services model and evaluate its connection blocking performance. We introduce a quality-of-service- (QoS-) enhanced FTPP (QEFTPP) routing and path-protection scheme in WDM networks. QEFTPP uses preemption to minimize the connection blocking percentage for high-priority traffic. Extensive simulation results show that QEFTPP can achieve a clear QoS differentiation among the traffic classes and at the same time provide good overall network performance. © 2005 Optical Society of America

Contention Resolution And Qos Provisioning Using Sparse Fiber Delay Lines In Wdm Networks

In this paper, we combine fiber delay lines (FDL) and optical wavelength conversion (OWC) as the solution for the burst contention problem in optical burst switching (OBS). We present a placement algorithm, k-WDS, for the sparse placement of FDLs at a set of selected nodes in the network. The algorithm can handle both uniform and non-uniform traffic patterns. Our extensive performance tests show that k-WDS provides more efficient placement of optical fiber delay lines than the well-known approach of placing the resources at nodes with the highest experienced burst loss. Performance results are also given to compare the benefit of using FDLs alone, OWCs alone, as well as a mixture of both FDLs and OWCs. A new algorithm, A-WDS, for the placement of an arbitrary numbers of FDLs and OWCs is presented and evaluated under different uniform and non-uniform traffic loads using network simulation of the NSFNET topology and randomly generated graphs. The paper is concluded by presenting the design of a cost-effective optical switch equipped with variable-delay FDL bank. Based on the switch design, a scheme to provide differentiated services for multiple classes of traffic is presented and evaluated. © Springer Science+Business Media, LLC 2007

Optimal Traffic Grooming In Wdm Mesh Networks Under Dynamic Traffic

We consider the sparse placement of grooming-nodes in WDM mesh networks under dynamic traffic. We formulate the problem as a weighted minimum dominating set of graphs; and compare our scheme, via simulation, to known heuristics. © 2003 Optical Society of America

Optimal Traffic Grooming In Wdm Mesh Networks Under Dynamic Traffic

We consider the sparse placement of grooming-nodes in WDM mesh networks under dynamic traffic. We formulate the problem as a weighted minimum dominating set of graphs; and compare our scheme, via simulation, to known heuristics. © 2003 Optical Society of America