Wavelength routing in optical networks of diameter two

We consider optical networks with routing by wavelength division multiplexing. We show that wavelength switching is unnecessary in routings where communication paths use at most two edges. We then exhibit routings in some explicit pseudo-random graphs, showing that they achieve optimal performance subject to constraints on the number of edges and the maximal degree. We also observe the relative inefficiency of planar networks.