A fast scheduling algorithm for all-optical shared-buffer packet switches

All-optical shared-buffer packet switches have been studied intensively in literature and many scheduling algorithms have been proposed. However, these algorithms either suffer from not being able to make resource reservation, or require high time-complexity to compute scheduling assignment for packets. In this paper, we propose a fast scheduling algorithm for all-optical shared-buffer packet switches. In our algorithm, packet scheduling is first formulated as a tree-searching problem. By breaking down the search tree into multiple smaller subsets and assigning each subset to a secondary processor, solutions can be obtained in a much shorter duration since the secondary processors are working in parallel. For instance, a scheduling assignment can be calculated for a packet in 55 ns with 8 processors, and in 25 ns with 64 processors, assuming a processor clock rate of 200 MHz. We show that our algorithm can achieve a loss rate of ~10
^-7
even at load 0.9 for a 32times32 switch.