Wavelength assignment in route-fixed optical WDM ring by a branch-and-price algorithm

Authors:
Heesang Lee;Yun Bae Kim;Seung J. Noh;Sun Hur
Affiliations:
Sungkyunkwan University, Suwon, Korea;Sungkyunkwan University, Suwon, Korea;Myoungji University, Seoul, Korea;Hanyang University, Ansan, Korea
Venue:
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Year:
2005

Citing 5
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
An efficient algorithm for finding a maximum weight 2-independent set on interval graphs

Information Processing Letters
Routing and wavelength assignment in all-optical networks

IEEE/ACM Transactions on Networking (TON)
Optical networks: a practical perspective

Optical networks: a practical perspective
New methods to color the vertices of a graph

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

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.