Wavelength assignment in route-fixed optical WDM ring by a branch-and-price algorithm
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee,Heesang | - |
dc.contributor.author | Kim, Yunbae | - |
dc.contributor.author | Noh, Seung J. | - |
dc.contributor.author | Hur, Sun | - |
dc.date.accessioned | 2021-06-24T00:37:47Z | - |
dc.date.available | 2021-06-24T00:37:47Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2005-04 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/46509 | - |
dc.description.abstract | This paper addresses the wavelength assignment problem (WAP) in optical wavelength division multiplexed (WDM) telecommunication networks. We show that, even though WAP on optical ring topology belongs to NP-hard, WAP can be exactly solvable in practical size optical WDM rings for current and future traffic demand. To accomplish this, we convert WAP to the vertex coloring problem of the related graph and choose a special integer programming formulation for the vertex coloring problem. We develop a branch-and-price algorithm for the problem and carry out the performance comparison of the suggested algorithm with a well-known heuristics. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.title | Wavelength assignment in route-fixed optical WDM ring by a branch-and-price algorithm | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Hur, Sun | - |
dc.identifier.doi | 10.1007/978-3-540-31956-6_24 | - |
dc.identifier.scopusid | 2-s2.0-24644469173 | - |
dc.identifier.wosid | 000229070600024 | - |
dc.identifier.bibliographicCitation | NETWORKING - ICN 2005, PT 1, v.3420, pp.194 - 203 | - |
dc.relation.isPartOf | NETWORKING - ICN 2005, PT 1 | - |
dc.citation.title | NETWORKING - ICN 2005, PT 1 | - |
dc.citation.volume | 3420 | - |
dc.citation.startPage | 194 | - |
dc.citation.endPage | 203 | - |
dc.type.rims | ART | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | CIRCULAR ARCS | - |
dc.identifier.url | https://link.springer.com/chapter/10.1007/978-3-540-31956-6_24 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.