A Fast Circuit Scheduling Scheme for Optical Data Center Networks

We propose a fast circuit scheduling algorithm capable of supporting optical switch with microsecond-scale switching delays. By simultaneously calculating the max-weighted matching for all optical switches, this scheduling algorithm releases the linear dependence of the time complexity upon the number of optical switches. Further by replacing the recursion and pointer operations with sorting and iteration, this algorithm can be easily accelerated by the hardware. The simulation results show that in large-scale network the fast circuit scheduling runs one or two orders of magnitude faster than most of existing scheduling algorithms, while only losing 4.08%similar to 7.49% throughput comparing with the optimal solution. This improvement increases the circuit flexibility effectively and ultimately leads to 5.43%similar to 79.63% and 30.45%similar to 81.17% reduction in average and 95th percentile flow completion time.