In this dissertation, we study the problem of (i) routing and wavelength assignment, and (ii) traffic grooming for multicast traffic in Wavelength Division Multiplexing (WDM) based all-optical networks. We focus on the ‘static’ case where the set of multicast traffic requests is assumed to be known in advance. For the routing and wavelength assignment problem…
Contents
Introduction
1.1 Optical Networks: Concepts
1.1.1 All-Optical Networking
1.1.2 Routing and Wavelength Assignment
1.1.3 Traffic Grooming
1.1.4 Multicasting in All-Optical WDM Networks
1.2 Contributions
1.2.1 Multicast Wavelength Assignment in Bidirected Trees
1.2.2 Multicast Traffic Grooming in Unidirectional Rings
1.3 A Word on Notation
1.3.1 Basic Notation
1.3.2 Independence, Cliques, Matching, Coloring
1.3.3 Conflict Graphs
1.4 Modeling Multicasting in All-Optical Networks
1.4.1 Fiber Network and Multicast Traffic Requests
1.4.2 Routing and Wavelength Assignment
1.4.3 Traffic Grooming
1.5 Organization
2 Multicast Wavelength Assignment in Bidirected Trees
2.1 Model
2.2 Problem Statement
2.3 Related Work
3 Greedy Multicast Wavelength Assignment in Bidirected Trees
3.1 Greedy Wavelength Assignment
3.1.1 Edge Order
3.1.2 Wavelength Assignment Strategy
3.2 Approximation Analysis
3.2.1 Some Local Properties
3.2.2 Roadmap
3.2.3 Host Tree Edge Types
3.2.4 Type (i), (ii) and (iii) Edges
3.2.5 Type (iv) Edges
3.2.6 Approximation Ratio
3.3 Complexity Analysis
4 Subtree Based Multicast Wavelength Assignment in Bidirected Trees
4.1 Subtree Based Wavelength Assignment
4.2 Approximation Analysis
4.3 Complexity Analysis
5 NP Completeness Results forMulticastWavelength Assignment in Bidirected Trees
5.1 Motivation and Background
5.2 Bidirected Stars
5.3 Bidirected Paths
5.4 Bidirected Trees
6 Multicast Traffic Grooming in Unidirectional Rings
6.1 Model
6.2 Problem Statement
6.3 Related Work
7 Algorithms for Multicast Traffic Grooming in Unidirectional Rings
7.1 Minimizing Wavelengths
7.1.1 Relation to Vertex Coloring
7.1.2 NP Completeness
7.1.3 Approximation Algorithms
7.2 Minimizing ADMs: Bounds and Simple Schemes
7.2.1 Lower Bound
7.2.2 Worst Case
7.2.3 Random Traffic Grooming
7.2.4 Arc Coloring Based Traffic Grooming
7.3 Minimizing ADMs: A Heuristic
7.4 Complexity Analysis
7.4.1 Random Traffic Grooming
7.4.2 Arc Coloring Based Traffic Grooming
7.4.3 Iterative Improvement Based Traffic Grooming
7.5 Simulation Results
7.5.1 Circle Based Traffic Grooming
7.5.2 Results
7.5.3 Discussion
8 Conclusion and Future Work
Bibliography
Author: Rawat, Anuj
Source: University of Maryland
Download URL 2: Visit Now