|
Introduction to Optical Networks |
|
|
1 | (15) |
|
What Is an Optical Network |
|
|
1 | (6) |
|
Important Advantages of WDM Optical Networks |
|
|
2 | (1) |
|
Key Terminology in WDM Optical Networks |
|
|
2 | (3) |
|
Data Communication in a WDM Optical Network |
|
|
5 | (2) |
|
Categorizations of WDM Networks |
|
|
7 | (2) |
|
Broadcasting Networks and Wavelength-Routed Networks |
|
|
7 | (1) |
|
Static and Dynamic Lightpath Allocation |
|
|
8 | (1) |
|
Single-hop and Multi-hop WDM Networks |
|
|
9 | (1) |
|
Important Problems in WDM Networks and Solution Approaches |
|
|
9 | (1) |
|
A Typical Problem in Multi-hop Wavelength-Routed Network Design |
|
|
10 | (3) |
|
|
13 | (2) |
|
Introduction to Optical Technology |
|
|
15 | (20) |
|
|
15 | (2) |
|
Optical Communication Fundamentals |
|
|
17 | (3) |
|
|
20 | (13) |
|
Optical Transmitters, Modulators, and Receivers |
|
|
20 | (1) |
|
|
21 | (2) |
|
Optical Filters and Switches |
|
|
23 | (1) |
|
Multiplexers, Demultiplexers, and Cross-connect Switches |
|
|
24 | (3) |
|
Add-Drop Multiplexers and Optical Line Terminals |
|
|
27 | (2) |
|
|
29 | (4) |
|
|
33 | (2) |
|
|
35 | (28) |
|
Broadcast-and-Select Networks |
|
|
35 | (3) |
|
Wavelength-Routed Networks |
|
|
38 | (8) |
|
Advantages of Second-Generation WDM Networks |
|
|
42 | (3) |
|
Single-hop and Multi-hop Networks |
|
|
45 | (1) |
|
Route and Wavelength Assignment Problem in WDM Networks |
|
|
46 | (2) |
|
Static and Dynamic Lightpath Allocation |
|
|
46 | (2) |
|
Wavelength-Convertible Networks |
|
|
48 | (8) |
|
|
56 | (7) |
|
Wavelength-Convertible Networks |
|
|
57 | (1) |
|
|
58 | (1) |
|
|
58 | (1) |
|
|
59 | (4) |
|
Route and Wavelength Assignment (RWA) I |
|
|
63 | (24) |
|
RWA as a Graph Coloring Problem |
|
|
63 | (4) |
|
Congestion and Its Relationship to Chromatic Number |
|
|
67 | (1) |
|
Greedy Heuristics for the RWA Problem |
|
|
68 | (3) |
|
A Greedy Heuristic for the RWA Problem |
|
|
68 | (2) |
|
An Improved Greedy Heuristic for the RWA Problem |
|
|
70 | (1) |
|
|
71 | (7) |
|
|
71 | (2) |
|
|
73 | (3) |
|
|
76 | (2) |
|
|
78 | (2) |
|
|
78 | (2) |
|
|
80 | (1) |
|
|
80 | (7) |
|
One-to-Many and All-to-All Communication |
|
|
81 | (1) |
|
|
82 | (1) |
|
|
83 | (4) |
|
Route and Wavelength Assignment (RWA) II |
|
|
87 | (36) |
|
Off-line Route and Wavelength Assignment |
|
|
88 | (7) |
|
Exact Solution of the RWA Problem in Networks with Full Wavelength Converters |
|
|
88 | (4) |
|
Exact Solution of the RWA Problem in Networks Without Wavelength Converters |
|
|
92 | (3) |
|
Route and Wavelength Assignment in a Bidirectional Ring |
|
|
95 | (3) |
|
A Heuristic for Route and Wavelength Assignment |
|
|
98 | (3) |
|
Dynamic Route and Wavelength Assignment |
|
|
101 | (14) |
|
Dynamic Routing Using a Central Agent |
|
|
104 | (3) |
|
Dynamic Routing Using a Distributed Algorithm |
|
|
107 | (8) |
|
|
115 | (8) |
|
Sparse Wavelength Conversion and RWA |
|
|
117 | (1) |
|
Limited Wavelength Conversion and RWA |
|
|
118 | (1) |
|
Placement of Wavelength Converters |
|
|
119 | (1) |
|
|
120 | (3) |
|
Logical Topology Design I |
|
|
123 | (14) |
|
A Scalable Topology Based on the de Bruijn Graph |
|
|
125 | (4) |
|
The Topology of the Network |
|
|
127 | (2) |
|
Addition of an End node to an Existing Network |
|
|
129 | (2) |
|
A Routing Scheme for This Topology |
|
|
131 | (3) |
|
|
134 | (3) |
|
Logical Topology Design II |
|
|
137 | (28) |
|
MILP-Based Solution of the Logical Topology Design and the Routing Problem |
|
|
139 | (4) |
|
A Heuristic for Determining the Logical Topology |
|
|
143 | (3) |
|
Routing in Wavelength-Routed Networks Viewed as an MCNF Problem |
|
|
146 | (1) |
|
Routing in Small- and Medium-Sized Networks |
|
|
147 | (2) |
|
Routing in Large Networks |
|
|
149 | (13) |
|
The Arc-Chain Representation |
|
|
150 | (1) |
|
An LP for the Routing Problem Using the Arc-Chain Representation |
|
|
151 | (3) |
|
Solving the LP Specified Using the Arc-Chain Representation |
|
|
154 | (8) |
|
|
162 | (3) |
|
Faults in Optical Networks |
|
|
165 | (48) |
|
|
169 | (4) |
|
Important Problems in Protection and Restoration |
|
|
173 | (3) |
|
Schemes for Handling Faults |
|
|
176 | (26) |
|
1:1 Path Protection in Wavelength-Convertible Networks Using Static Allocation |
|
|
177 | (2) |
|
Dynamic Wavelength Allocation with Wavelength Continuity Constraint |
|
|
179 | (6) |
|
Utilizing the Channels Used by Backup Paths When There Is No Fault in the Network |
|
|
185 | (3) |
|
1:N Protection Using Static Allocation with Wavelength Continuity Constraint |
|
|
188 | (11) |
|
Restoration in Networks That Support Dynamic Lightpath Allocation |
|
|
199 | (3) |
|
|
202 | (11) |
|
|
202 | (1) |
|
Link and Path Protection Schemes |
|
|
203 | (2) |
|
|
205 | (1) |
|
Attacks on All-Optical Networks |
|
|
206 | (1) |
|
Reducing the Overhead for Fault Tolerance |
|
|
206 | (2) |
|
|
208 | (2) |
|
|
210 | (1) |
|
|
210 | (3) |
|
|
213 | (32) |
|
|
219 | (10) |
|
|
219 | (4) |
|
|
223 | (4) |
|
A Heuristic for Static Traffic Grooming |
|
|
227 | (2) |
|
|
229 | (8) |
|
A Graph Model for a Network Supporting Dynamic Traffic Grooming |
|
|
230 | (5) |
|
Algorithms for Supporting Dynamic Traffic Grooming |
|
|
235 | (2) |
|
|
237 | (8) |
|
Books and Surveys on Traffic Grooming |
|
|
237 | (1) |
|
Traffic Grooming on Rings |
|
|
238 | (1) |
|
Traffic Grooming Strategies |
|
|
238 | (3) |
|
Fault-Tolerant Traffic Grooming |
|
|
241 | (4) |
Appendix 1: Linear Programming in a Nutshell |
|
245 | (4) |
Appendix 2: The de Bruijn Graph |
|
249 | (4) |
Appendix 3: Network Flow Programming |
|
253 | (8) |
References |
|
261 | (28) |
List of Symbols Used |
|
289 | (12) |
Index |
|
301 | |