Wavelength converter assignment problem in all optical WDM networks

  • Authors:
  • Jungman Hong;Seungkil Lim;Wookey Lee

  • Affiliations:
  • Consulting Division, LG CNS, Seoul, Korea;Division of e-businessIT, Sungkyul University, Anyang, Korea;Division of Computer Science, Sungkyul University, Anyang, Korea

  • Venue:
  • KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper considers the problem of locating the wavelength converter in all optical Wavelength Division Multiplexing (WDM) network. The problem is formulated as an integer programming problem by using path variables. In order to solve the associated linear programming relaxation which has exponentially many variables, a polynomial time column generation procedure is exploited. Therewith, an LP-based branch-and-price algorithm is derived to obtain the optimal integer solution for the problem. Computational results show that the algorithm can solve practical size problems in a reasonable time.