Routing and wavelength assignment in generalized WDM tree networks of bounded degree

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Ioannidis, S en
dc.contributor.author Nomikos, C en
dc.contributor.author Pagourtzis, A en
dc.contributor.author Zachos, S en
dc.date.accessioned 2014-03-01T02:43:31Z
dc.date.available 2014-03-01T02:43:31Z
dc.date.issued 2005 en
dc.identifier.issn 0302-9743 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/31446
dc.subject Optical networking en
dc.subject Routing and path coloring en
dc.subject Wavelength assignment en
dc.subject WDM networks en
dc.subject.classification Computer Science, Theory & Methods en
dc.subject.other Optical networking en
dc.subject.other Routing and path coloring en
dc.subject.other Wavelength assignment en
dc.subject.other WDM networks en
dc.subject.other Algorithms en
dc.subject.other Local area networks en
dc.subject.other Optical communication en
dc.subject.other Polynomials en
dc.subject.other Problem solving en
dc.subject.other Topology en
dc.subject.other Trees (mathematics) en
dc.subject.other Wavelength division multiplexing en
dc.title Routing and wavelength assignment in generalized WDM tree networks of bounded degree en
heal.type conferenceItem en
heal.identifier.primary 10.1007/11573036_6 en
heal.identifier.secondary http://dx.doi.org/10.1007/11573036_6 en
heal.language English en
heal.publicationDate 2005 en
heal.abstract 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. © Springer-Verlag Berlin Heidelberg 2005. en
heal.publisher SPRINGER-VERLAG BERLIN en
heal.journalName Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) en
dc.identifier.doi 10.1007/11573036_6 en
dc.identifier.isi ISI:000233675500006 en
dc.identifier.volume 3746 LNCS en
dc.identifier.spage 57 en
dc.identifier.epage 67 en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record