Dynamic wavelength allocation in all-optical ring networks

Abstract

We focus on wavelength allocation schemes for all-optical WDM ring networks. For an N node network we characterize the traffic by its load L/sub max/ (the maximum number of lightpaths that share a link) and do not assume knowledge of the arrival/departure processes. We prove that shortest path routing produces a routing which has at most twice the load of the optimal solution. We show that at least 0.5 L/sub max/ log/sub 2/N+L/sub max/ wavelengths are required by any algorithm in the worst case, and develop an algorithm which requires up to 3 L/sub max/ log/sub 2/N wavelengths. For the case when the load is high and blocking is necessary we present an improved algorithm.