16 search results - page 1 / 4 » Tight Bounds for Wavelength Assignment on Trees of Rings |
IPPS
2005
IEEE
13 years 10 months ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
INFOCOM
2000
IEEE
13 years 9 months ago
2000
IEEE
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...
WDAG
2007
Springer
13 years 10 months ago
2007
Springer
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
NETWORKING
2010
13 years 6 months ago
2010
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
PCI
2005
Springer
13 years 10 months ago
2005
Springer
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...