ABSTRACT
The problem of routing and wavelength assignment is one of the key issues in all-optical mesh networks, and which has been proved to be a NP-hard problem. Most of the existing algorithms to solve the problem are greed-based. Although the greedy idea can get the shortest light-path for the current connection request, it would also worsen the performance of the whole network for a long term. In this paper, we introduce a foresighted measure into greed-based algorithms. The measure can make the algorithms steer by links with few idle wavelengths, and these bypassed links would be left to the connection requests which have to use them. Simulation results show that the foresighted measure can obviously reduce the blocking rate of the whole network, just by a little expense of average end-to-end delay.
