An efficient routing algorithm for all-optical networks with turn constraints

In all-optical networks, adjacent link constraints (known as turn constraints) can model existing restrictions in all-optical networks with limited wavelength converters and blocking optical switches. We present two different concrete implementations for a shortest path routing algorithm that accounts for link and turn constraints in all-optical networks. The efficiency of our new algorithm implementation is proven and analyzed via the simulation of sparse network topologies.