Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree
verfasst von : Stratis Ioannidis, Christos Nomikos, Aris Pagourtzis, Stathis Zachos
Erschienen in: Advances in Informatics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 bounded-size 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.