Abstract

In this paper, we address the issue of efficiently allocating wavelengths to communication requests in wavelength division multiplexing (WDM) optical networks. We present a simple greedy algorithm and study its performance on directed binary fiber trees. We prove that our algorithm guarrantees a 5=3-approximation for wavelengths assignment in binary tree shaped WDM optical networks. We also prove that no greedy algorithm can go below the ratio of 5=3, even for the case of leaf--to--leaf communication. 1 Introduction Optics is emerging as a key technology in state-of-the-art communication networks. A single optical wavelength supports rates of gigabits-per-second (which in turn support multiple channels of voice, data, and video [5,10]. Multiple laser beams that are propagated over the same fiber on distinct optical wavelengths can increase this capacity much further; this is achieved through WDM (Wavelength Division Multiplexing). The model we use for the underlying fiber network is a...

Citations