Adaptive techniques for routing and wavelength assignment in all-optical WANs

This paper considers routing and wavelength assignment issues in wavelength-routed all-optical networks. We use a general approach in which all paths connecting a source-destination pair are taken as candidate paths and the network state information is incorporated into the routing process. We formulate the optimal routing problem as an integer linear programming problem and show that it is computationally intractable. We then present adaptive routing and wavelength assignment algorithms and evaluate their blocking performance. Computational complexity of these algorithms is also analyzed. Simulation results are compared with analytical predictions of the call blocking probability