Large Scale Network-Centric Distributed Systems

24

Routing and Wavelength Assignment in Optical Networks

Yan Li, Sanjay Ranka, and Sartaj Sahni

Contents

24.1 Introduction

24.2 Scheduling in Full-Wavelength Conversion Network

24.2.1 Problem Definition

24.2.2 Routing Algorithms

24.2.2.1 Modified Switch Path First Algorithm (MSPF)

24.2.2.2 Modified Switch Window First Algorithm (MSWF)

24.2.3 Wavelength Assignment Algorithms

24.2.4 Performance Evaluation

24.2.5 Experiments

24.2.5.1 Simulation Environment

24.2.5.2 Evaluated Algorithms

24.2.5.3 Results and Observations

24.2.6 Conclusions

24.3 Scheduling in Sparse Wavelength Conversion Network

24.3.1 Problem Description

24.3.2 Extended Network Model

24.3.3 Routing and Wavelength Assignment Algorithms

24.3.3.1 Extended Bellman-Ford Algorithm for SparseWavelength Conversion

24.3.3.2 k-Alternative Path Algorithm

24.3.3.3 Breaking the Ties in Path Selection

24.3.3.4 Wavelength Assignment

24.3.4 Experimental Evaluation

24.3.4.1 Experimental Framework

24.3.4.2 Slack Tie-Breaking Scheme

24.3.4.3 Blocking Probability

24.3.4.4 Requests' Average Start Time

24.3.4.5 Scheduling Overhead

24.3.4.6 Algorithm Switching Strategy

24.3.5 Conclusions

Acknowledgment

References

24.1 Introduction

Dedicated connections are needed to effectively support a variety of geographically distributed application tasks. Many high-speed networks that provide dedicated connections are based on optical interconnects and optical switches. For these networks, the bandwidth along a given link can be decomposed into multiple ...