Skip to Main Content
The algorithms presented in this chapter assume that either wavelength conversion is available at all switches or not available at any switch. The algorithms assume that the wavelength sharing constraint needs to be satisfied. The Extended Bellman-Ford (EBF) algorithm is extended in the chapter in order to incorporate the wavelength sharing and wavelength continuity constraints. The authors propose modified versions of the algorithms in the Enlightened system for continuous time model. These algorithms are called Modified Switch Path First (MSPF) and Modified Switch Window First (MSWF). The chapter presents a new network model that can emulate the existing full-conversion algorithms when only a subset of nodes have a wavelength converter. The authors demonstrate the utility of this approach using the EBF and k-Alternative Path (k-Path) algorithms. The chapter evaluates the algorithms on three performances metrics: blocking probability, average start time and scheduling overhead.