Sciweavers

Share
16 search results - page 1 / 4
» Tight Bounds for Wavelength Assignment on Trees of Rings
Sort
View
IPPS
2005
IEEE
10 years 8 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: 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...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
INFOCOM
2000
IEEE
10 years 7 months ago
Wavelength Assignment in WDM Rings to Minimize SONET ADMs
— 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...
Liwu Liu, Xiang-Yang Li, Peng-Jun Wan, Ophir Fried...
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
10 years 8 months ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
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...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
NETWORKING
2010
10 years 4 months ago
Cost Bounds of Multicast Light-Trees in WDM Networks
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...
Fen Zhou, Miklós Molnár, Bernard Cou...
PCI
2005
Springer
10 years 8 months ago
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree
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...
Stratis Ioannidis, Christos Nomikos, Aris Pagourtz...
books