Dynamic Wavelength Allocation in Optical Networks

This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. The worst-case situation is considered where no blocking is allowed, and there are no assumptions on the tra c arrival and holding times. The tra c is characterized only by its load L, which is the maximum number of lightpaths that can be present on any link assuming no blocking. We start with networks without wavelength conversion, consider a static scenario and prove that the known algorithm which requires 2L ? 1 wavelengths is optimal. For a dynamic scenario we show that shortest path routing produces a routing which has at most twice the load of the optimal solution. We also show that at least 0:5L log2 N + L wavelengths are required by any algorithm for rings of N nodes and present an algorithm that uses at most L log2 N + L wavelengths for rings and 2(L ?1)log2 N for trees. For rings, the known First-Fit ...

• Type: Conference
• Year: 1997
• Where: PODC
• Authors: Ornan Ori Gerstel, Galen H. Sasaki, Shay Kutten, Rajiv Ramaswami
• Keywords: Algorithm, Distributed And Parallel Computing, Optical Wavelength Division, PODC 1997, Wavelength Conversion