Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Introduction to algorithms
The complexity of finding two disjoint paths with min-max objective function
Discrete Applied Mathematics
Optical computer architectures: the application of optical concepts to next generation computers
Optical computer architectures: the application of optical concepts to next generation computers
Efficient routing in optical networks
Journal of the ACM (JACM)
Distributed computation on graphs: shortest path algorithms
Communications of the ACM
Improved Lightpath (Wavelength) Routing in Large WDM Networks
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
A differentiated optical services model for WDM networks
IEEE Communications Magazine
Multiwavelength lightwave networks for computer communication
IEEE Communications Magazine
Lightpath (wavelength) routing in large WDM networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpaths from a source to a destination, if they exist, such that they meet some specified optimization objective. Two versions of the problem are studied. One is to minimize the total cost of the K paths, and the other is to minimize the cost of the maximum cost one among the K paths. An efficient algorithm for the first version is proposed, which takes O(kK(kn+m+nlog(kn))) time and delivers an exact solution, where n, m, and k are the number of nodes, links and wavelengths in the network, respectively. The second version of the problem is shown to be NP-hard, instead an approximation algorithm is devised which delivers a solution within K times of the optimum, where K=2.