Sciweavers

Share
PCI
2005
Springer

Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree

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 problem (RPC). Here we present a polynomial time algorithm that solves RPC exactly in generalized tree networks of bounded degree. This new topology is of practical interest since it models tree-like backbone networks connecting boundedsize LANs of any form. Tree-like backbone structure is very common in practice and bounded size LANs is a reasonable assumption, since LANs are by nature networks unable to sustain a large number of hosts.
Stratis Ioannidis, Christos Nomikos, Aris Pagourtz
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where PCI
Authors Stratis Ioannidis, Christos Nomikos, Aris Pagourtzis, Stathis Zachos
Comments (0)
books