99 search results - page 19 / 20 » Comparison of Routing and Wavelength Assignment Algorithms i... |
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—We consider the offline version of the routing and wavelength assignment (RWA) problem in transparent all-optical networks. In such networks and in the absence of regenerators, ...
VTC
2006
IEEE
13 years 11 months ago
2006
IEEE
— In order to avoid the large peak transmit power, resulting from the high transmission rates expected for future mobile communication systems, a wireless multi-hop virtual cellu...
ICC
2009
IEEE
13 years 2 months ago
2009
IEEE
Abstract--We design and implement a multicost impairmentaware routing and wavelength assignment algorithm for online traffic. In transparent optical networks the quality of a trans...
APPROX
2000
Springer
13 years 9 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
ALGORITHMICA
1999
13 years 4 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...