99 search results - page 7 / 20 » Comparison of Routing and Wavelength Assignment Algorithms i... |
146
click to vote
STACS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
137
click to vote
INFORMATICALT
2010
15 years 3 months ago
2010
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
159
click to vote
ICOIN
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...