Complexity analysis and performance evaluation of a two-step scheduler for modular optical packet switches

In this paper we evaluate the complexity and the performance of two different schedulers for high-speed optical switches with a large number of ports. We compare the classical approach with a two-step scheduling framework recently proposed for multi-card optical switches in which firstly transmitters on each card are assigned a different wavelength, then for every wavelength a maximal matching is found among all cards.