Wavelength assignment in route-fixed optical WDM ring by a branch-and-price algorithm
- Authors
- Lee,Heesang; Kim, Yunbae; Noh, Seung J.; Hur, Sun
- Issue Date
- Apr-2005
- Publisher
- SPRINGER-VERLAG BERLIN
- Citation
- NETWORKING - ICN 2005, PT 1, v.3420, pp.194 - 203
- Indexed
- SCIE
SCOPUS
- Journal Title
- NETWORKING - ICN 2005, PT 1
- Volume
- 3420
- Start Page
- 194
- End Page
- 203
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/46509
- DOI
- 10.1007/978-3-540-31956-6_24
- ISSN
- 0302-9743
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > DEPARTMENT OF INDUSTRIAL & MANAGEMENT ENGINEERING > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.