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%~7.49% throughput comparing with the optimal solution. This improvement increases the circuit flexibility effectively and ultimately leads to 5.43%~79.63% and 30.45%~81.17% reduction in average and 95th95th percentile flow completion time.

中文翻译：

---

光数据中心网络的快速电路调度方案


我们提出了一种快速电路调度算法，能够支持具有微秒级切换延迟的光切换。通过同时计算所有光开关的最大加权匹配，该调度算法释放了时间复杂度对光开关数量的线性依赖性。此外，通过用排序和迭代代替递归和指针操作，该算法可以很容易地由硬件加速。仿真结果表明，在大规模网络中，快速电路调度的运行速度比大多数现有调度算法快一到两个数量级，而与最优方案相比，吞吐量仅损失4.08%~7.49%。这一改进有效地提高了电路灵活性，最终使平均和第 95% 的流程完成时间减少了 5.43%~79.63% 和 30.45%~81.17%。