A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We study the problem of routing and scheduling requests of limited durations in all-optical networks with restrictions on the number of available wavelengths on each link. The task is servicing the requests, assigning each of them a route from source to destination, a starting time and a wavelength with the goal of minimizing the overall time needed to serve all requests. We study the relationship between this problem and minimum path coloring and we show how to exploit known results on pathdoi:10.1016/j.jda.2004.04.008 fatcat:6eopeel6l5fhlb36bd2w2i3p3u