Dynamic routing algorithms in all-optical networks

In this paper, we consider dynamic routing in all-optical networks without wavelength converters which are very expensive and always not effective. We propose two new heuristic algorithms to manage optical routing based on link-state and reduce blocking probability of request arriving in the network. The first one uses a technique similar to "fixed paths least congested" (FPLC) routing by analyzing the first k links on each path whereas the second is based on an estimation of the link-congestion in the network. Both algorithms achieve good performance, for different types of network topologies, when compared to existing methods like FPLC, LLR, and FPLC-k.