Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10917Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nomikos, C. | en |
| dc.contributor.author | Pagourtzis, A. | en |
| dc.contributor.author | Potika, K. | en |
| dc.contributor.author | Zachos, S. | en |
| dc.date.accessioned | 2015-11-24T17:01:23Z | - |
| dc.date.available | 2015-11-24T17:01:23Z | - |
| dc.identifier.issn | 1389-1286 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10917 | - |
| dc.rights | Default Licence | - |
| dc.subject | graph theory | en |
| dc.subject | wavelength assignment | en |
| dc.subject | multifiber optical networks | en |
| dc.subject | optical networks | en |
| dc.subject | ring networks | en |
| dc.subject | tree | en |
| dc.title | Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | DOI 10.1016/j.comnet.2004.11.028 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2006 | - |
| heal.abstract | Motivated by the increasing importance of multifiber WDM networks we study a routing and wavelength assignment problem in such networks. In this problem the number of wavelengths per fiber is given and the goal is to minimize the cost of fiber links that need to be reserved in order to satisfy a set of communication requests; we introduce a generalized setting where network pricing is non-uniform, that is the cost of hiring a fiber may differ from link to link. We consider two variations: undirected, which corresponds to full-duplex communication, and directed, which corresponds to one-way communication. Moreover, for rings we also study the problem in the case of pre-determined routing. We present exact or constant-ratio approximation algorithms for all the above variations in chain, ring and spider networks. (c) 2005 Elsevier B.V. All rights reserved. | en |
| heal.journalName | Computer Networks | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Nomikos-2006-Routing and waveleng.pdf | 449.42 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
