Get access

An experimental study of maximum profit wavelength assignment in WDM rings

Authors

  • Evangelos Bampas,

    Corresponding author
    1. Department of Computer Science, School of Electrical and Computer Engineering, National Technical University of Athens, Greece
    • Department of Computer Science, School of Electrical and Computer Engineering, National Technical University of Athens, Greece
    Search for more papers by this author
  • Aris Pagourtzis,

    1. Department of Computer Science, School of Electrical and Computer Engineering, National Technical University of Athens, Greece
    Search for more papers by this author
  • Katerina Potika

    1. Department of Computer Science, School of Electrical and Computer Engineering, National Technical University of Athens, Greece
    Search for more papers by this author

Abstract

We are interested in the problem of satisfying a maximum-profit subset of undirected communication requests in an optical ring that uses the Wavelength Division Multiplexing technology. We present four deterministic and purely combinatorial algorithms for this problem, and give theoretical guarantees for their worst-case approximation ratios. Two of these algorithms are novel, whereas the rest are adaptation of earlier approaches. An experimental evaluation of the algorithms in terms of attained profit and execution time reveals that the theoretically best algorithm performs only marginally better than one of the new algorithms, while at the same time being several orders of magnitude slower. Furthermore, an extremely fast greedy heuristic with nonconstant approximation ratio performs reasonably well and may be favored over the other algorithms whenever it is crucial to minimize execution time. © 2011 Wiley Periodicals, Inc. NETWORKS, 2011

Ancillary