Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10769Full metadata record
| DC Field | Value | Language |
|---|---|---|
| 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:27Z | - |
| dc.date.available | 2015-11-24T17:00:27Z | - |
| dc.identifier.issn | 1389-1286 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10769 | - |
| dc.rights | Default Licence | - |
| dc.subject | maximum path coloring | en |
| dc.subject | all-optical rings | en |
| dc.subject | wavelength assignment | en |
| dc.subject | approximation algorithms | en |
| dc.subject | directed fiber trees | en |
| dc.subject | networks | en |
| dc.subject | graphs | en |
| dc.subject | algorithms | en |
| dc.title | Satisfying a maximum number of pre-routed requests in all-optical rings | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | Doi 10.1016/S1389-1286(02)00448-6 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2003 | - |
| heal.abstract | We address the problem of maximizing the number of satisfied requests in all-optical networks that use wavelength division multiplexing. We consider the case where requests are pre-routed and formulate it as the maximum path coloring problem. We study the problem for rings and present a (2/3)-approximation algorithm. Along the way we develop a fast matching technique for a special class of bipartite graphs. By using this technique we achieve an 0(n + m log L) time complexity for our approximation algorithm, where n is the number of nodes, m is the number of requests and L is the maximum load of requests on a single link. (C) 2002 Elsevier Science B.V. All rights reserved. | en |
| heal.journalName | Computer Networks-the International Journal of Computer and Telecommunications Networking | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Nomikos-2003-Satisfying a maximum.pdf | 170.76 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
