Wavelength management in WDM rings to maximize the number of connections

  • Authors:

  • Ioannis Caragiannis

  • Affiliations:

  • Research Academic Computer Technology Institute & Department of Computer Engineering and Informatics, University of Patras, Rio, Greece

  • Venue:
  • STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneously served in a WDM optical network. In such networks, WDM technology can satisfy a set of connections by computing a route and assigning a wavelength to each connection so that no two connections routed through the same fiber are assigned the same wavelength. Each fiber supports a limited number of w wavelengths and in order to fully exploit the parallelism provided by the technology, one should select a set connections of maximum cardinality which can be satisfied using the available wavelengths. This is known as the maximum routing and path coloring problem (maxRPC). Our main contribution is a general analysis method for a class of iterative algorithms for a more general coloring problem. A lower bound on the benefit of such an algorithm in terms of the optimal benefit and the number of available wavelengths is given by a benefit-revealing linear program. We apply this method to maxRPC in both undirected and bidirected rings to obtain bounds on the approximability of several algorithms. Our results also apply to the problem maxPC where paths instead of connections are given as part of the input. We also study the profit version of maxPC in rings where each path has a profit and the objective is to satisfy a set of paths of maximum total profit.