An improved optimal semi-lightpath routing algorithm in large wavelength division multiplexing networks

We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semi-lightpaths. The problem is to find an optimal lightpath semi-lightpath in the network in terms of the cost of wavelength conversion and the cost of using the wavelengths on links. In this paper, given a constrained condition, we present an improved algorithm for this problem. The algorithm runs in time O(k²n+km+n log(n)), while the previous algorithms run in time O(k²n+kn²) or O(k²n+km+kn log(kn)).