Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10850Full metadata record
| DC Field | Value | Language |
|---|---|---|
| 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 | 2015-11-24T17:00:59Z | - |
| dc.date.available | 2015-11-24T17:00:59Z | - |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10850 | - |
| dc.rights | Default Licence | - |
| dc.subject | routing and path coloring | en |
| dc.subject | wavelength assignment | en |
| dc.subject | wdm networks | en |
| dc.subject | optical networking | en |
| dc.subject | ring networks | en |
| dc.subject | number | en |
| dc.subject | multigraphs | en |
| dc.subject | complexity | en |
| dc.subject | graphs | en |
| dc.title | Routing and wavelength assignment in generalized WDM tree networks of bounded degree | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2005 | - |
| 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. | en |
| heal.journalName | Advances in Informatics, Proceedings | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| nomikos-2005-Routing and wavelength assignment in generalized WDM tree networks of bounded degree.pdf | 239.53 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
