Adaptive algorithm for routing in all-optical networks

In this paper, we study an adaptive algorithm for routing in an all-optical wavelength routed network where a lightpath is dynamically created in response to a request for communication and the WDM channels constituting the lightpath are reclaimed when the communication is over. We have proposed three possible distributed strategies to determine, if possible, a lightpath when there is a request for communication. Each of these strategies have their advantages and disadvantages in terms of the expected blocking probability and the set-up time. We consider the Kautz digraph as the network topology and study the performance of our distributed strategies through simulation.