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

dc.contributor.authorIoannidis, S.en
dc.contributor.authorNomikos, C.en
dc.contributor.authorPagourtzis, A.en
dc.contributor.authorZachos, S.en
dc.date.accessioned2015-11-24T17:00:59Z
dc.date.available2015-11-24T17:00:59Z
dc.identifier.issn0302-9743-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10850
dc.rightsDefault Licence-
dc.subjectrouting and path coloringen
dc.subjectwavelength assignmenten
dc.subjectwdm networksen
dc.subjectoptical networkingen
dc.subjectring networksen
dc.subjectnumberen
dc.subjectmultigraphsen
dc.subjectcomplexityen
dc.subjectgraphsen
dc.titleRouting and wavelength assignment in generalized WDM tree networks of bounded degreeen
heal.abstractThe 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.en
heal.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.journalNameAdvances in Informatics, Proceedingsen
heal.journalTypepeer reviewed-
heal.languageen-
heal.publicationDate2005-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.typejournalArticle-
heal.type.elΆρθρο Περιοδικούel
heal.type.enJournal articleen

Αρχεία

Φάκελος/Πακέτο αδειών

Προβολή: 1 - 1 of 1
Φόρτωση...
Μικρογραφία εικόνας
Ονομα:
license.txt
Μέγεθος:
1.74 KB
Μορφότυπο:
Item-specific license agreed upon to submission
Περιγραφή: